{"meta":{"page":1,"per_page":50,"max_per_page":100,"total":9,"total_is_capped":false,"direct_labels_cover":0,"predictions_cover":9,"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":"9ce087a5bf2c","filters":{"venue":"AKCE International Journal of Graphs and Combinatorics"}},"results":[{"id":"W2189028915","doi":"10.1080/09728600.2007.12088828","title":"Energy of a set of vertices in a Graph","year":2007,"lang":"en","type":"article","venue":"AKCE International Journal of Graphs and Combinatorics","topic":"Graph theory and applications","field":"Mathematics","cited_by":14,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Women's College Hospital","funders":"","keywords":"Mathematics; Combinatorics; Vertex (graph theory); Incidence matrix; Eigenvalues and eigenvectors; Diagonal; Graph energy; Graph; Diagonal matrix; Discrete mathematics; Graph power; Physics; Geometry; Line graph; Quantum mechanics","authors":[{"name":"B. D. Acharya","is_ca":false},{"name":"S. B. Rao","is_ca":false},{"name":"P. Sumathi","is_ca":true},{"name":"V. Swaminathan","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.02262815510995592,"gpt":0.3114747062233684,"spread":0.2888465511134125,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005071104,0.0004090238,0.0006376295,0.001647,0.0006088736,0.001636198,0.000891365,0.0007970534,0.003486488],"category_scores_gemma":[0.002152248,0.0002603651,0.0004097063,0.001410908,0.001427231,0.002227728,0.001102185,0.0004907426,0.0002973653],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0006368992,"about_ca_system_score_gemma":0.0002436286,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0003648943,"about_ca_topic_score_gemma":0.0004179978,"domain_scores_codex":[0.9995298,0.0000854881,0.00003383776,0.0001256511,0.0001456651,0.00007945648],"domain_scores_gemma":[0.999079,0.0004718162,0.0001199057,0.0001218256,0.00008871494,0.0001186725],"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.0002018599,0.00005919543,0.008194965,0.0003046372,0.0001537957,0.0004484133,0.0007215593,0.09435811,0.02511755,0.8401526,0.001579765,0.02870759],"study_design_scores_gemma":[0.00001726002,0.00009142887,0.006459043,0.00006589432,0.00005629305,0.0007512859,0.0006018248,0.1823173,0.005918839,0.7962782,0.007403257,0.00003927985],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.7196782,0.0006751597,0.256508,0.0009504875,0.00008162521,0.00005050218,0.0009198069,0.0001285853,0.02100767],"genre_scores_gemma":[0.965551,0.0004327329,0.02648888,0.0001029034,0.00007722792,0.00009054504,0.0003904407,0.00006210435,0.006804132],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.003486488,"threshold_uncertainty_score":0.01166344,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2346390550","doi":"10.1080/09728600.2005.12088800","title":"Eternally Secure Sets, Independence Sets and Cliques","year":2005,"lang":"en","type":"article","venue":"AKCE International Journal of Graphs and Combinatorics","topic":"Graph Labeling and Dimension Problems","field":"Computer Science","cited_by":14,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Victoria","funders":"","keywords":"Independence number; Mathematics; Combinatorics; Independence (probability theory); Conjecture; Clique number; Discrete mathematics; Counterexample; Complement (music); Chromatic scale; Graph; Statistics","authors":[{"name":"William F. Klostermeyer","is_ca":false},{"name":"Gary MacGillivray","is_ca":true},{"name":"S. Arumugam","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.008757905566550069,"gpt":0.2544217706820318,"spread":0.2456638651154817,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00199942,0.0004958107,0.000543021,0.00164009,0.002705198,0.002173342,0.0009669476,0.001140211,0.004770466],"category_scores_gemma":[0.007999789,0.0005701953,0.00078134,0.001581612,0.00597619,0.006057051,0.003433461,0.003216682,0.00042288],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001585576,"about_ca_system_score_gemma":0.0007139617,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001585083,"about_ca_topic_score_gemma":0.002016065,"domain_scores_codex":[0.9985664,0.0003456339,0.00008352592,0.0003402546,0.0003624041,0.0003018058],"domain_scores_gemma":[0.9832292,0.01093761,0.001761623,0.002257371,0.0006689057,0.001145198],"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.0001952189,0.00007010629,0.002484625,0.00004342637,0.00001772071,0.00007958256,0.0003065372,0.004807093,0.001475275,0.9816496,0.001721402,0.007149529],"study_design_scores_gemma":[0.00005833933,0.00002772954,0.001681468,0.00002386932,0.00001707849,0.0002188127,0.0001364983,0.01165662,0.002089089,0.9789569,0.00510631,0.00002729156],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.7446888,0.001292528,0.1446827,0.00586929,0.0001744494,0.00009046371,0.0009499825,0.0002751975,0.1019766],"genre_scores_gemma":[0.9809348,0.0004080762,0.01369929,0.0002416128,0.0001189831,0.0000579539,0.000329282,0.00002079126,0.004189214],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.004770466,"threshold_uncertainty_score":0.01595879,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2911081932","doi":"","title":"The odd harmonious labeling of dumbbell and generalized prism graphs","year":2013,"lang":"en","type":"article","venue":"AKCE International Journal of Graphs and Combinatorics","topic":"Graph Labeling and Dimension Problems","field":"Computer Science","cited_by":9,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Toronto Metropolitan University","funders":"","keywords":"Dumbbell; Mathematics; Prism; Combinatorics; Pure mathematics; Physics; Biology; Optics","authors":[{"name":"Gusti A. Saputri","is_ca":false},{"name":"Kiki Ariyanti","is_ca":true},{"name":"Dalibor Fronček","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.008012686591782872,"gpt":0.2180343067474423,"spread":0.2100216201556594,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005485417,0.0004409197,0.0007319396,0.0009347773,0.002061357,0.002624746,0.0016439,0.00135444,0.008248509],"category_scores_gemma":[0.002623938,0.0006516367,0.0007016219,0.001419308,0.001821284,0.003349659,0.001963305,0.001947092,0.0007804151],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001247501,"about_ca_system_score_gemma":0.0009723828,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.003045296,"about_ca_topic_score_gemma":0.003552697,"domain_scores_codex":[0.9993741,0.0001842516,0.00002451314,0.0001547555,0.0001044311,0.0001579031],"domain_scores_gemma":[0.9984701,0.0005427987,0.0002374714,0.0003346055,0.0001491637,0.0002658422],"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.0001108483,0.0000301227,0.0004941446,0.00006334505,0.000008999647,0.0001040061,0.0002951376,0.004779247,0.001723298,0.9785554,0.002295729,0.01153968],"study_design_scores_gemma":[0.00002816344,0.00002131611,0.0003834603,0.00001997525,0.00001401382,0.0001191003,0.000259704,0.01893418,0.001112542,0.9738622,0.005228603,0.00001677745],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.6673356,0.0005103761,0.2223998,0.001660331,0.0002390811,0.0001107412,0.0007535673,0.0005562124,0.1064343],"genre_scores_gemma":[0.9036834,0.0004327329,0.07424238,0.0005404868,0.000090952,0.00009918329,0.0007276195,0.0002594404,0.01992384],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.008248509,"threshold_uncertainty_score":0.02759403,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2189617332","doi":"10.1080/09728600.2005.12088791","title":"Extremal Self-Dual Codes over Z6, Z8 and Z10","year":2005,"lang":"en","type":"article","venue":"AKCE International Journal of Graphs and Combinatorics","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Victoria","funders":"","keywords":"Mathematics; Unimodular matrix; Combinatorics; Circulant matrix; Euclidean geometry; Dual (grammatical number); Construct (python library); Euclidean distance; Discrete mathematics; Computer science; Geometry","authors":[{"name":"T. Aaron Gulliver","is_ca":true},{"name":"Masaaki Harada","is_ca":false},{"name":"Mariko Hagita","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.006310433316867672,"gpt":0.231799907692627,"spread":0.2254894743757593,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005010066,0.0004346456,0.000355253,0.0009693437,0.0007584637,0.001254529,0.000619219,0.0003625145,0.002979418],"category_scores_gemma":[0.002933839,0.0002264318,0.0002588481,0.0004997908,0.001009413,0.001736187,0.001174103,0.001012208,0.0005634199],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0006307118,"about_ca_system_score_gemma":0.0003887494,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0002385988,"about_ca_topic_score_gemma":0.0005701978,"domain_scores_codex":[0.9994761,0.00006921239,0.00003324263,0.00009447473,0.0001657756,0.000161204],"domain_scores_gemma":[0.9977472,0.0008363025,0.0006354759,0.0002298321,0.0002516223,0.0002994516],"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.0008221408,0.0000874907,0.005853492,0.0002388419,0.0000439865,0.0003518629,0.0002770644,0.02073899,0.03905925,0.8836986,0.001253034,0.04757522],"study_design_scores_gemma":[0.00008682381,0.0004884648,0.005277266,0.0001471948,0.00007778963,0.001861781,0.0005317893,0.08811001,0.124503,0.7624549,0.01631401,0.0001468685],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.8878733,0.0006819232,0.0923995,0.0002576831,0.00006902086,0.0000305958,0.0002878701,0.0001065274,0.01829361],"genre_scores_gemma":[0.9757776,0.0003245437,0.02035067,0.00004182698,0.0000408051,0.00002714141,0.0001975338,0.00003855645,0.003201311],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.002979418,"threshold_uncertainty_score":0.009967208,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W3048214410","doi":"10.1016/j.akcej.2019.12.016","title":"The <i>k</i>-conversion number of regular graphs","year":2020,"lang":"en","type":"article","venue":"AKCE International Journal of Graphs and Combinatorics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Victoria","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Combinatorics; Mathematics; Maximal independent set; Vertex (graph theory); Dominating set; Upper and lower bounds; Set (abstract data type); Discrete mathematics; Graph; Chordal graph; 1-planar graph; Computer science","authors":[{"name":"Christina M. Mynhardt","is_ca":true},{"name":"Jane Wodlinger","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01333744342552978,"gpt":0.275077607849234,"spread":0.2617401644237042,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007771645,0.0004743367,0.0005350765,0.001154762,0.001096025,0.002244148,0.001501749,0.000713405,0.00490636],"category_scores_gemma":[0.005615583,0.0005003604,0.0005157465,0.001025873,0.002036863,0.002563486,0.001264298,0.001732864,0.0004862844],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001911064,"about_ca_system_score_gemma":0.0008216195,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001235123,"about_ca_topic_score_gemma":0.001300479,"domain_scores_codex":[0.998975,0.0001576087,0.00006385121,0.000285717,0.0002613719,0.0002564612],"domain_scores_gemma":[0.9940942,0.003250996,0.0006146239,0.001011218,0.0003423306,0.0006867351],"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.0008520338,0.0003098804,0.01209635,0.0005503539,0.00007879107,0.0005055979,0.001026984,0.1019364,0.0386035,0.7583439,0.0102405,0.07545571],"study_design_scores_gemma":[0.0001253947,0.0002636846,0.01005595,0.0001557783,0.0000934069,0.001442715,0.0004313016,0.2940868,0.04442857,0.6290331,0.01977614,0.0001071554],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.8196622,0.0007969688,0.1018537,0.001333053,0.00006728147,0.0001605102,0.001026029,0.0009625034,0.0741377],"genre_scores_gemma":[0.9676762,0.0003443923,0.02556265,0.0001576411,0.00003919897,0.0001336702,0.0005730074,0.0001123111,0.005401005],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.00490636,"threshold_uncertainty_score":0.01641339,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2209026667","doi":"10.1016/j.akcej.2015.06.006","title":"On k-edge-magic labelings of maximal outerplanar graphs","year":2015,"lang":"en","type":"article","venue":"AKCE International Journal of Graphs and Combinatorics","topic":"Graph Labeling and Dimension Problems","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Manitoba","funders":"","keywords":"Combinatorics; Mathematics; Vertex (graph theory); Edge-graceful labeling; Conjecture; Discrete mathematics; Graph; 1-planar graph; Chordal graph; Graph power; Line graph","authors":[{"name":"Gee-Choon Lau","is_ca":false},{"name":"‎Saeid Alikhani","is_ca":false},{"name":"Sin-Min Lee","is_ca":false},{"name":"William L. Kocay","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.0180418052582178,"gpt":0.2503031048051269,"spread":0.2322612995469091,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004565197,0.0004300155,0.0004051906,0.001247283,0.001274558,0.001397089,0.0005876152,0.0006226181,0.003360786],"category_scores_gemma":[0.002700255,0.0004403889,0.0004587393,0.001428064,0.001927224,0.002341977,0.001266885,0.0007602275,0.0003742342],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001004192,"about_ca_system_score_gemma":0.0004619175,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001462857,"about_ca_topic_score_gemma":0.00170401,"domain_scores_codex":[0.9994265,0.0001239411,0.00004143018,0.0001561069,0.000096885,0.0001551505],"domain_scores_gemma":[0.9973755,0.001278111,0.000639469,0.0002717308,0.000167064,0.0002682258],"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.000476656,0.00007674995,0.007629174,0.0002292104,0.00002956799,0.0005055654,0.001449644,0.02659983,0.01584468,0.8975907,0.003958386,0.04560992],"study_design_scores_gemma":[0.00006140125,0.0001060275,0.004768378,0.00007083509,0.00003381564,0.0008505405,0.0007103083,0.04399918,0.006794795,0.93043,0.01213019,0.0000446225],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.898969,0.000444583,0.07247417,0.0005352558,0.00003576847,0.00005081902,0.0006091903,0.0002916881,0.02658956],"genre_scores_gemma":[0.9596896,0.000403741,0.03550017,0.0001508042,0.00006272698,0.00005547374,0.0007368316,0.00007523778,0.00332555],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.003360786,"threshold_uncertainty_score":0.01124293,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2971833028","doi":"","title":"DNA graph characterization for line digraph of dicycle with one chord","year":2013,"lang":"en","type":"article","venue":"AKCE International Journal of Graphs and Combinatorics","topic":"DNA and Biological Computing","field":"Biochemistry, Genetics and Molecular Biology","cited_by":1,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Toronto Metropolitan University","funders":"","keywords":"Digraph; Combinatorics; Chord (peer-to-peer); Mathematics; DNA; Graph; Genetics; Biology; Computer science","authors":[{"name":"Inne","is_ca":false},{"name":"Kiki Ariyanti","is_ca":true},{"name":"Denny Riama Silaban","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.008891721651368301,"gpt":0.225862193784432,"spread":0.2169704721330636,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00008985645,0.0003947052,0.0003757401,0.002075414,0.001151057,0.001007789,0.0007566596,0.0005848637,0.006338892],"category_scores_gemma":[0.00106723,0.0002508842,0.0003319156,0.001618946,0.000461673,0.001042779,0.0005351168,0.0004115347,0.0007148553],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0009442744,"about_ca_system_score_gemma":0.0005966901,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.003733893,"about_ca_topic_score_gemma":0.002708738,"domain_scores_codex":[0.9996573,0.00002420172,0.00002026148,0.000166618,0.00006086046,0.00007078254],"domain_scores_gemma":[0.9992066,0.0002234894,0.00013843,0.00008344352,0.0001929173,0.0001551174],"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.001380812,0.0003731598,0.03615432,0.001223028,0.000117655,0.00411166,0.002385118,0.06127919,0.2170285,0.5122938,0.01396066,0.1496922],"study_design_scores_gemma":[0.0001843463,0.000838387,0.02499462,0.0002923685,0.0001993031,0.005188571,0.003373342,0.3918059,0.09081559,0.4050259,0.07705221,0.0002294743],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.7573705,0.0004337258,0.1984083,0.0003644238,0.0001069666,0.0002500897,0.003261961,0.0007992509,0.03900472],"genre_scores_gemma":[0.9560001,0.0002276902,0.03025533,0.0001345848,0.00003571098,0.00011897,0.002737662,0.00007074841,0.0104193],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.006338892,"threshold_uncertainty_score":0.02120572,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2533883187","doi":"","title":"Vertex-Disjoint Cycles Containing Specified Vertices in a Graph","year":2006,"lang":"en","type":"article","venue":"AKCE International Journal of Graphs and Combinatorics","topic":"Graph theory and applications","field":"Mathematics","cited_by":1,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Toronto Metropolitan University","funders":"","keywords":"Combinatorics; Mathematics; Vertex (graph theory); Disjoint sets; Graph; Neighbourhood (mathematics); Discrete mathematics","authors":[{"name":"Yoshimi Egawa","is_ca":false},{"name":"Ryota Matsubara","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.02307857277518729,"gpt":0.2918039444927991,"spread":0.2687253717176118,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004118228,0.0008548993,0.0007571872,0.002186059,0.003266041,0.00301226,0.001881238,0.002092001,0.006521934],"category_scores_gemma":[0.003559152,0.0009052503,0.0007790672,0.002907207,0.001284861,0.002563444,0.002108011,0.0008842541,0.001188324],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001058671,"about_ca_system_score_gemma":0.001645733,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.003898515,"about_ca_topic_score_gemma":0.006482754,"domain_scores_codex":[0.9992347,0.0001352058,0.00008399662,0.0001978524,0.0001571403,0.0001911977],"domain_scores_gemma":[0.9967299,0.001293289,0.0005530059,0.0003920386,0.0005259453,0.0005059431],"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.001673753,0.0005101691,0.01211961,0.0008558587,0.0002438777,0.00604458,0.003954235,0.02600021,0.05816077,0.8137555,0.009025688,0.06765575],"study_design_scores_gemma":[0.0003238238,0.0003112087,0.004633659,0.0003952116,0.0004777807,0.002083497,0.002803112,0.08990858,0.07471003,0.778468,0.04572183,0.000163286],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.8135563,0.0004730238,0.1399748,0.0006789828,0.0001933173,0.0006937077,0.002140887,0.0008381585,0.04145071],"genre_scores_gemma":[0.8670881,0.0003944294,0.1101544,0.000328816,0.00003554347,0.0007302028,0.002710984,0.000254315,0.01830304],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.006521934,"threshold_uncertainty_score":0.02181804,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2188816457","doi":"10.1080/09728600.2004.12088789","title":"Altitude of 4-Regular Circulants","year":2004,"lang":"en","type":"article","venue":"AKCE International Journal of Graphs and Combinatorics","topic":"Hermeneutics and Narrative Identity","field":"Arts and Humanities","cited_by":1,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Toronto","funders":"","keywords":"Combinatorics; Mathematics; Altitude (triangle); Bipartite graph; Bounded function; Graph; Enhanced Data Rates for GSM Evolution; Discrete mathematics; Geometry; Mathematical analysis; Computer science","authors":[{"name":"T.C. Clark","is_ca":true},{"name":"B. Falvai","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01528177607583044,"gpt":0.2353961644552233,"spread":0.2201143883793928,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002109607,0.000189378,0.000234764,0.001033934,0.001081405,0.0009891391,0.0003314353,0.0003065104,0.004962737],"category_scores_gemma":[0.001849079,0.000222843,0.0002222182,0.0005349297,0.0008981439,0.0006711256,0.0007594523,0.0004225731,0.0006126967],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0006594477,"about_ca_system_score_gemma":0.0002902477,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001959927,"about_ca_topic_score_gemma":0.00225139,"domain_scores_codex":[0.9996474,0.00004898773,0.00001750343,0.00006007497,0.00008947142,0.0001365197],"domain_scores_gemma":[0.9986894,0.000416942,0.0003154106,0.0001305033,0.000195903,0.0002519315],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","study_design_scores_codex":[0.0008446029,0.0001199984,0.03431772,0.0004213587,0.00008742773,0.002472479,0.004526712,0.0222229,0.09557288,0.7320637,0.005959578,0.1013906],"study_design_scores_gemma":[0.0001243818,0.0003634253,0.07007549,0.0001558896,0.000127172,0.004792987,0.003960481,0.07329641,0.07415102,0.6768065,0.09596878,0.0001774777],"study_design_candidate":"not_applicable","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9411842,0.0003232906,0.01603714,0.0001678775,0.00003333026,0.00002469587,0.0003459871,0.0002063869,0.04167711],"genre_scores_gemma":[0.9891263,0.0001255057,0.005830446,0.00002234478,0.0000191856,0.00001071681,0.0002027017,0.0000325225,0.004630195],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.004962737,"threshold_uncertainty_score":0.01660204,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null}]}