{"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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006910587,0.00007053342,0.0001974661,0.0004521546,0.00001543212,0.000007269922,0.0002634755,0.00004692235,0.000007415264],"category_scores_gemma":[0.00009366277,0.0000615052,0.0001069591,0.0003285063,0.00008341539,0.00009998706,0.00003247608,0.0001008145,6.620981e-8],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001152798,"about_ca_system_score_gemma":0.00002189687,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00002457062,"about_ca_topic_score_gemma":0.00002015699,"domain_scores_codex":[0.9989353,0.00002916381,0.0005846526,0.00006100655,0.0003071154,0.00008274995],"domain_scores_gemma":[0.9984959,0.0004450943,0.0005229521,0.00008272834,0.0004077915,0.00004554297],"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.0000972247,0.0002571633,0.01637929,0.00001798666,0.0000786477,0.00001182206,0.0003468155,0.000001016362,0.001057974,0.9801819,0.00007431899,0.001495832],"study_design_scores_gemma":[0.0006575619,0.000145426,0.005857225,0.00008705099,0.00002546799,0.00003927459,0.0003751112,0.00001368619,0.006640827,0.985788,0.0003169914,0.00005335995],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.996622,0.0002955808,0.002018154,0.0001178408,0.0001953747,0.00002719147,0.000005854736,0.00000290465,0.0007151028],"genre_scores_gemma":[0.9991256,0.0003342507,0.0004815556,0.00002270174,0.00001243276,9.613198e-7,8.134082e-7,0.000005561527,0.00001614031],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.01052207,"threshold_uncertainty_score":0.2508109,"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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000564976,0.0001344276,0.0001717049,0.0002876979,0.00008357612,0.0002749684,0.0006800027,0.00008517637,0.000004146875],"category_scores_gemma":[0.00005009325,0.0001128818,0.00007449099,0.0001719054,0.00006483956,0.0007583516,0.000215907,0.0003267284,0.000001930835],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002392925,"about_ca_system_score_gemma":0.00006092025,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001467526,"about_ca_topic_score_gemma":0.000004904971,"domain_scores_codex":[0.998518,0.00004999479,0.0004035414,0.0001926048,0.0006823166,0.0001535708],"domain_scores_gemma":[0.9985669,0.00009581362,0.0003289161,0.0001362365,0.0007102022,0.0001618773],"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.00002866692,0.0001618837,0.02487297,0.000009209424,0.0001140599,0.0001273891,0.0006626656,0.00002853595,0.0002916181,0.9282936,0.001470063,0.04393937],"study_design_scores_gemma":[0.001289942,0.0004390861,0.01095925,0.0001431912,0.00002005507,0.001421417,0.00004788189,0.004704438,0.0007353595,0.9747837,0.005207886,0.0002478377],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9865221,0.003075585,0.003963192,0.004822967,0.001157027,0.00004610262,0.000002989939,0.00003822838,0.0003717839],"genre_scores_gemma":[0.9902289,0.002184163,0.006699356,0.0008173141,0.00001546172,8.929489e-7,6.524374e-7,0.000006552293,0.00004670308],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.04649009,"threshold_uncertainty_score":0.4603187,"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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005641236,0.0001210033,0.0001869619,0.000223228,0.0001607689,0.0002671615,0.0007020233,0.00005399027,0.000002135583],"category_scores_gemma":[0.00007128656,0.00008142347,0.0000985416,0.0002561456,0.0001301874,0.0003666586,0.0001864369,0.0002020369,0.000001047039],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001036779,"about_ca_system_score_gemma":0.00003965136,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00007775352,"about_ca_topic_score_gemma":0.000001250811,"domain_scores_codex":[0.9985855,0.00006451846,0.0005184849,0.0001471417,0.0005253311,0.0001590787],"domain_scores_gemma":[0.9981872,0.0002224424,0.0004750639,0.0001715677,0.0008256558,0.0001179992],"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.00001873702,0.0001009704,0.006864993,0.000007296791,0.0001523219,0.00001520451,0.0003101912,0.00001009637,0.002949769,0.9706818,0.001504573,0.01738402],"study_design_scores_gemma":[0.001088256,0.000217601,0.003687159,0.00005509883,0.00001767585,0.0001675101,0.00005091488,0.002958236,0.001353512,0.9892332,0.001054253,0.0001166048],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9870647,0.00634519,0.001901866,0.002914131,0.001531957,0.00008493054,7.81196e-7,0.00001792845,0.0001385416],"genre_scores_gemma":[0.9901231,0.00545978,0.004103962,0.0002232166,0.000006745222,0.000002821351,3.924354e-7,0.000006880643,0.00007312577],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.01855136,"threshold_uncertainty_score":0.3320352,"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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004274684,0.0001201199,0.0001539707,0.0002923962,0.00009346063,0.000247688,0.0005021357,0.00005112974,0.00001100085],"category_scores_gemma":[0.00002563776,0.0001043605,0.0001001995,0.0002077367,0.00006337447,0.0006863123,0.0001754205,0.0001997831,0.000001229531],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002311025,"about_ca_system_score_gemma":0.00003308263,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000003029121,"about_ca_topic_score_gemma":0.000001977646,"domain_scores_codex":[0.9989291,0.00004951158,0.0002919085,0.0001535649,0.0004387315,0.0001371944],"domain_scores_gemma":[0.999114,0.0001540089,0.0002159568,0.0001155983,0.0002790522,0.0001213375],"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.00003183348,0.0001815785,0.01295965,0.000003914927,0.0001202018,0.00005434077,0.0004689029,0.000003853228,0.0001850758,0.9647627,0.0005997789,0.02062818],"study_design_scores_gemma":[0.002354744,0.0007073951,0.03673481,0.00008898012,0.00005592178,0.001435636,0.0001112074,0.003627419,0.0008411092,0.9194807,0.03417837,0.0003837484],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9855039,0.00134083,0.009701179,0.001425461,0.001061608,0.0000355619,0.000002408963,0.00004278428,0.0008862528],"genre_scores_gemma":[0.9949226,0.0008469209,0.003749337,0.0003382069,0.0001003687,8.126123e-7,3.993664e-7,0.000005489281,0.00003580284],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.04528203,"threshold_uncertainty_score":0.4255696,"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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005072589,0.0000942502,0.0001548728,0.0001058358,0.0001089008,0.0001002478,0.001534872,0.00003836065,0.0000050733],"category_scores_gemma":[0.0001518171,0.0000666044,0.0001488816,0.0004762476,0.0001666495,0.0004617874,0.0002930552,0.0002575961,0.000002422038],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001693067,"about_ca_system_score_gemma":0.00004655249,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000002489889,"about_ca_topic_score_gemma":1.729954e-7,"domain_scores_codex":[0.9984456,0.00009008809,0.000369761,0.0001342175,0.0008178183,0.0001425104],"domain_scores_gemma":[0.9981463,0.0003163521,0.0003622488,0.0001688639,0.0008644905,0.0001417379],"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.00008320979,0.00004451524,0.009979792,0.000006518029,0.00008449687,0.00004197624,0.0002171524,0.00000595859,0.0004079626,0.982585,0.0008289846,0.005714422],"study_design_scores_gemma":[0.0007845544,0.0002697321,0.001659387,0.00002816077,0.00000886513,0.0001299811,0.0001304455,0.0008480226,0.003507994,0.983988,0.008553584,0.00009123864],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9257882,0.002064441,0.05434156,0.01365816,0.002471568,0.0001500853,0.000005388339,0.00003773284,0.001482891],"genre_scores_gemma":[0.9967528,0.001661402,0.00126061,0.0002597582,0.00002236928,8.22964e-7,3.400396e-7,0.000006195385,0.00003567644],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.07096465,"threshold_uncertainty_score":0.2852199,"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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000704157,0.0001475823,0.0002517814,0.0005724928,0.00004057892,0.0001057893,0.000918527,0.00006845697,0.000002791671],"category_scores_gemma":[0.0001401309,0.0001207031,0.0001391963,0.0003876315,0.00008645351,0.0003580071,0.0001416801,0.0002432824,0.000004476673],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002673419,"about_ca_system_score_gemma":0.00009326205,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00002341597,"about_ca_topic_score_gemma":7.672438e-7,"domain_scores_codex":[0.9981576,0.00005528255,0.0005445341,0.0001837346,0.0008978657,0.0001609389],"domain_scores_gemma":[0.9975796,0.0001330856,0.0005079034,0.0002012344,0.001365742,0.0002124145],"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.00006517502,0.0002585756,0.005648431,0.000005940216,0.00009064891,0.00007879775,0.0003275116,0.00005825047,0.0001530347,0.9880099,0.00305502,0.002248661],"study_design_scores_gemma":[0.001545321,0.0009722167,0.0008086877,0.00009641079,0.00001734282,0.0002147573,0.0000560681,0.001188677,0.0006856269,0.9933707,0.0009061793,0.0001380789],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9873874,0.001224895,0.004553257,0.001934771,0.003660227,0.00005785254,0.000005073843,0.00003281036,0.0011437],"genre_scores_gemma":[0.9967281,0.0002587491,0.002505813,0.0004279099,0.000008844102,6.73492e-7,0.000001319209,0.000008009756,0.00006059423],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.009340675,"threshold_uncertainty_score":0.4922128,"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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001210723,0.00008183356,0.0001345434,0.00008522537,0.00003167244,0.00002881055,0.0001786872,0.00006208745,0.000004114524],"category_scores_gemma":[0.0000443776,0.00005861456,0.00008647746,0.00008512738,0.00005841829,0.00001393786,0.00003988218,0.00005910062,1.394413e-7],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000003737702,"about_ca_system_score_gemma":0.0000168983,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000004762317,"about_ca_topic_score_gemma":8.427418e-7,"domain_scores_codex":[0.9993756,0.00001683252,0.0002611174,0.0001006012,0.000157577,0.00008822601],"domain_scores_gemma":[0.9988711,0.00002443766,0.0003071455,0.00005886216,0.0006859928,0.00005245286],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"bench_or_experimental","study_design_gemma":"observational","study_design_scores_codex":[0.0004491984,0.0005302558,0.06208595,0.00003025564,0.0004124417,0.000003146766,0.00003948819,0.000008710348,0.8942083,0.0113356,0.0001458784,0.03075081],"study_design_scores_gemma":[0.006378985,0.01310741,0.4351512,0.0003118431,0.000162897,0.000173374,0.0001817629,0.0003045346,0.4199033,0.1138963,0.009754775,0.0006736208],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9921786,0.0001631881,0.006985529,0.0002773163,0.0002153405,0.00009275503,0.000009580668,0.000002672127,0.00007500355],"genre_scores_gemma":[0.9988142,0.0004624458,0.0004306081,0.0001246913,0.00007956173,0.000004058771,0.00004363965,0.000006522097,0.00003431518],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.4743049,"threshold_uncertainty_score":0.2390232,"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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004441092,0.0001173452,0.0002142061,0.0003649523,0.00006094951,0.00007135118,0.0002959502,0.00005481227,0.00001550695],"category_scores_gemma":[0.00009715889,0.0001037777,0.0001206403,0.0002426087,0.00007404457,0.000201738,0.0000415486,0.0002108822,0.000001216951],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00003443041,"about_ca_system_score_gemma":0.00002422883,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00003639218,"about_ca_topic_score_gemma":0.00003227955,"domain_scores_codex":[0.9988288,0.0000498039,0.0005358655,0.0001135529,0.0003360375,0.000135938],"domain_scores_gemma":[0.9988603,0.0003940901,0.0003346334,0.0000976511,0.0002584907,0.00005483477],"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.00009702209,0.0003035723,0.02322103,0.000007366105,0.00004807504,0.00004577096,0.0001605874,0.000005517046,0.0002623013,0.9748664,0.0003829408,0.0005993768],"study_design_scores_gemma":[0.001040184,0.0001076427,0.02940234,0.00008389283,0.0000252825,0.00008331155,0.0003706855,0.00004691106,0.0004446023,0.9676986,0.0005891048,0.000107407],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9959825,0.0003637965,0.0003622104,0.0005149892,0.0004351832,0.00006639059,0.000004097697,0.00001438265,0.002256468],"genre_scores_gemma":[0.9991316,0.0002241443,0.0004933914,0.00005691011,0.00003593256,0.000004765408,0.000002062679,0.00001096713,0.00004017949],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.007167806,"threshold_uncertainty_score":0.4231933,"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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001760649,0.00006939431,0.0001465413,0.0001653611,0.0000631237,0.00007283594,0.000205991,0.00002335324,0.00008307719],"category_scores_gemma":[0.00002759747,0.00005767092,0.00009544678,0.00003295255,0.000127635,0.0001970173,0.00003246305,0.0001004926,0.000001803853],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002971202,"about_ca_system_score_gemma":0.00004329059,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00009113827,"about_ca_topic_score_gemma":0.00008240681,"domain_scores_codex":[0.9991872,0.00001502053,0.0003056646,0.00005918526,0.0003595065,0.0000733698],"domain_scores_gemma":[0.998904,0.00002316981,0.0002672999,0.00005144927,0.0007022375,0.00005182678],"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.00001858936,0.0001944034,0.005877466,0.000007892741,0.0001474194,0.00003537243,0.001127941,0.000008517568,0.0003093777,0.9913814,0.0002549514,0.0006366565],"study_design_scores_gemma":[0.001646207,0.0003771815,0.01549148,0.0001149924,0.00004474682,0.00006729154,0.0006208795,0.000008363169,0.001462012,0.9571463,0.02289093,0.000129544],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9945968,0.0003556327,0.00003915466,0.0004390942,0.001539808,0.00002760862,0.000009399154,0.000003816707,0.002988628],"genre_scores_gemma":[0.9992099,0.0004431935,0.000020833,0.00007827597,0.00008927104,4.239552e-7,0.000001284363,0.000005375853,0.0001514791],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.03423504,"threshold_uncertainty_score":0.2351752,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null}]}