{"meta":{"query_hash":"9ce087a5bf2c","filters":{"venue":"AKCE International Journal of Graphs and Combinatorics"},"cohort_total":9,"direct_labels_cover":0,"predictions_cover":9,"exported":9,"export_cap":100000,"truncated":false,"label_status":"direct model label, unvalidated","prediction_status":"machine_predicted_unvalidated (Codex and Gemma teacher distillation)","score_status":"score_only:v0-immature-baseline","snapshot":{"source":"OpenAlex, pinned release, all 482 partitions","release":"2026-06-24","frame_built":"2026-07-12"},"permalink":"https://metacan.xera.ac/q/9ce087a5bf2c","api":"https://metacan.xera.ac/api/v1/cohort?venue=AKCE+International+Journal+of+Graphs+and+Combinatorics"},"results":[{"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Combinatorics; Mathematics; Altitude (triangle); Bipartite graph; Bounded function; Graph; Enhanced Data Rates for GSM Evolution; Discrete mathematics; Geometry; Mathematical analysis; Computer science","score_opus":0.015281776075830445,"score_gpt":0.2353961644552233,"score_spread":0.22011438837939284,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2188816457","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.94118416,0.00032329065,0.016037136,0.0001678775,0.000033330256,0.000024695873,0.0003459871,0.00020638693,0.041677114],"genre_scores_gemma":[0.9891263,0.00012550568,0.005830446,0.000022344777,0.000019185602,0.000010716806,0.0002027017,0.000032522497,0.0046301954],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9996474,0.000048987735,0.000017503435,0.000060074974,0.00008947142,0.00013651965],"domain_scores_gemma":[0.99868935,0.00041694197,0.00031541058,0.0001305033,0.00019590302,0.0002519315],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00021096069,0.000189378,0.00023476395,0.0010339342,0.0010814045,0.0009891391,0.00033143532,0.00030651037,0.004962737],"category_scores_gemma":[0.0018490789,0.00022284302,0.00022221816,0.0005349297,0.00089814386,0.0006711256,0.0007594523,0.00042257312,0.00061269675],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0008446029,0.000119998374,0.034317717,0.00042135868,0.00008742773,0.0024724791,0.0045267115,0.022222897,0.09557288,0.7320637,0.005959578,0.101390585],"study_design_scores_gemma":[0.0001243818,0.00036342532,0.07007549,0.00015588956,0.00012717198,0.004792987,0.0039604814,0.07329641,0.07415102,0.6768065,0.095968775,0.00017747766],"about_ca_topic_score_codex":0.0019599267,"about_ca_topic_score_gemma":0.00225139,"teacher_disagreement_score":0.004962737,"about_ca_system_score_codex":0.00065944775,"about_ca_system_score_gemma":0.00029024773,"threshold_uncertainty_score":0.01660204},"labels":[],"label_agreement":null},{"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.02262815510995592,"score_gpt":0.3114747062233684,"score_spread":0.2888465511134125,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2189028915","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.71967816,0.0006751597,0.256508,0.0009504875,0.000081625214,0.00005050218,0.0009198069,0.0001285853,0.021007674],"genre_scores_gemma":[0.96555096,0.00043273292,0.026488876,0.000102903374,0.00007722792,0.00009054504,0.00039044066,0.00006210435,0.006804132],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99952984,0.0000854881,0.000033837765,0.0001256511,0.00014566514,0.00007945648],"domain_scores_gemma":[0.999079,0.0004718162,0.000119905686,0.000121825644,0.00008871494,0.000118672506],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005071104,0.00040902378,0.00063762954,0.0016470004,0.0006088736,0.0016361978,0.000891365,0.0007970534,0.0034864878],"category_scores_gemma":[0.0021522483,0.0002603651,0.0004097063,0.001410908,0.0014272314,0.002227728,0.0011021848,0.00049074256,0.00029736533],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00020185986,0.00005919543,0.008194965,0.00030463716,0.00015379569,0.00044841325,0.00072155934,0.09435811,0.025117548,0.8401526,0.0015797653,0.02870759],"study_design_scores_gemma":[0.000017260018,0.00009142887,0.006459043,0.000065894325,0.000056293055,0.0007512859,0.00060182484,0.18231735,0.005918839,0.79627824,0.007403257,0.00003927985],"about_ca_topic_score_codex":0.0003648943,"about_ca_topic_score_gemma":0.0004179978,"teacher_disagreement_score":0.0034864878,"about_ca_system_score_codex":0.0006368992,"about_ca_system_score_gemma":0.00024362857,"threshold_uncertainty_score":0.011663437},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.006310433316867672,"score_gpt":0.23179990769262696,"score_spread":0.22548947437575928,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2189617332","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8878733,0.00068192324,0.0923995,0.00025768313,0.00006902086,0.0000305958,0.00028787012,0.0001065274,0.018293608],"genre_scores_gemma":[0.9757776,0.00032454368,0.02035067,0.000041826977,0.0000408051,0.000027141412,0.0001975338,0.000038556453,0.0032013115],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99947613,0.000069212394,0.000033242628,0.00009447473,0.0001657756,0.00016120396],"domain_scores_gemma":[0.99774724,0.00083630247,0.00063547585,0.00022983213,0.0002516223,0.0002994516],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005010066,0.00043464563,0.00035525297,0.0009693437,0.0007584637,0.0012545295,0.000619219,0.00036251455,0.0029794176],"category_scores_gemma":[0.0029338386,0.00022643177,0.0002588481,0.0004997908,0.0010094128,0.0017361871,0.0011741029,0.0010122079,0.00056341995],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00082214084,0.0000874907,0.0058534923,0.00023884194,0.000043986496,0.00035186292,0.0002770644,0.02073899,0.03905925,0.8836986,0.0012530342,0.047575217],"study_design_scores_gemma":[0.000086823806,0.0004884648,0.0052772663,0.00014719479,0.00007778963,0.0018617805,0.00053178926,0.088110015,0.12450303,0.76245487,0.016314015,0.0001468685],"about_ca_topic_score_codex":0.0002385988,"about_ca_topic_score_gemma":0.00057019776,"teacher_disagreement_score":0.0029794176,"about_ca_system_score_codex":0.00063071185,"about_ca_system_score_gemma":0.00038874944,"threshold_uncertainty_score":0.009967208},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Manitoba","funders":"","keywords":"Combinatorics; Mathematics; Vertex (graph theory); Edge-graceful labeling; Conjecture; Discrete mathematics; Graph; 1-planar graph; Chordal graph; Graph power; Line graph","score_opus":0.018041805258217802,"score_gpt":0.2503031048051269,"score_spread":0.2322612995469091,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2209026667","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.898969,0.000444583,0.07247417,0.00053525576,0.00003576847,0.000050819017,0.00060919026,0.00029168813,0.02658956],"genre_scores_gemma":[0.95968956,0.00040374097,0.035500165,0.00015080419,0.00006272698,0.00005547374,0.00073683163,0.00007523778,0.0033255501],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9994265,0.00012394106,0.000041430183,0.00015610691,0.000096885,0.00015515051],"domain_scores_gemma":[0.9973755,0.0012781107,0.00063946896,0.0002717308,0.00016706398,0.00026822585],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00045651972,0.00043001547,0.00040519063,0.0012472834,0.0012745576,0.0013970895,0.0005876152,0.0006226181,0.003360786],"category_scores_gemma":[0.0027002553,0.00044038895,0.0004587393,0.0014280643,0.0019272235,0.0023419766,0.0012668847,0.0007602275,0.0003742342],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00047665605,0.00007674995,0.007629174,0.00022921042,0.000029567991,0.0005055654,0.0014496444,0.026599826,0.015844677,0.8975907,0.003958386,0.045609925],"study_design_scores_gemma":[0.00006140125,0.00010602752,0.0047683776,0.00007083509,0.000033815635,0.00085054047,0.0007103083,0.04399918,0.006794795,0.93043,0.012130187,0.000044622502],"about_ca_topic_score_codex":0.0014628571,"about_ca_topic_score_gemma":0.0017040102,"teacher_disagreement_score":0.003360786,"about_ca_system_score_codex":0.0010041924,"about_ca_system_score_gemma":0.00046191752,"threshold_uncertainty_score":0.011242926},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.008757905566550069,"score_gpt":0.2544217706820318,"score_spread":0.24566386511548174,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2346390550","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7446888,0.0012925282,0.14468268,0.0058692903,0.00017444938,0.00009046371,0.0009499825,0.0002751975,0.10197658],"genre_scores_gemma":[0.9809348,0.00040807624,0.013699295,0.00024161281,0.00011898312,0.000057953905,0.000329282,0.000020791264,0.004189214],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99856645,0.00034563395,0.00008352592,0.00034025463,0.00036240407,0.00030180585],"domain_scores_gemma":[0.9832292,0.010937606,0.0017616233,0.0022573713,0.0006689057,0.0011451985],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0019994199,0.0004958107,0.000543021,0.0016400901,0.0027051985,0.002173342,0.00096694764,0.0011402115,0.0047704657],"category_scores_gemma":[0.007999789,0.0005701953,0.00078134,0.0015816122,0.00597619,0.0060570515,0.0034334606,0.0032166815,0.00042288],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00019521889,0.00007010629,0.002484625,0.000043426367,0.00001772071,0.00007958256,0.00030653717,0.0048070927,0.0014752755,0.9816496,0.0017214023,0.007149529],"study_design_scores_gemma":[0.00005833933,0.000027729538,0.001681468,0.00002386932,0.000017078493,0.00021881267,0.0001364983,0.011656623,0.0020890895,0.9789569,0.00510631,0.000027291564],"about_ca_topic_score_codex":0.0015850827,"about_ca_topic_score_gemma":0.0020160654,"teacher_disagreement_score":0.0047704657,"about_ca_system_score_codex":0.0015855756,"about_ca_system_score_gemma":0.00071396166,"threshold_uncertainty_score":0.015958786},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Toronto Metropolitan University","funders":"","keywords":"Combinatorics; Mathematics; Vertex (graph theory); Disjoint sets; Graph; Neighbourhood (mathematics); Discrete mathematics","score_opus":0.023078572775187288,"score_gpt":0.2918039444927991,"score_spread":0.26872537171761185,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2533883187","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.81355625,0.00047302383,0.13997485,0.0006789828,0.00019331735,0.00069370767,0.0021408873,0.0008381585,0.041450705],"genre_scores_gemma":[0.86708814,0.00039442943,0.110154435,0.000328816,0.000035543468,0.00073020277,0.0027109839,0.000254315,0.018303037],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9992347,0.00013520582,0.000083996616,0.0001978524,0.00015714034,0.00019119775],"domain_scores_gemma":[0.99672985,0.0012932889,0.0005530059,0.00039203858,0.00052594533,0.00050594314],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00041182278,0.0008548993,0.0007571872,0.002186059,0.003266041,0.0030122602,0.0018812383,0.002092001,0.006521934],"category_scores_gemma":[0.0035591521,0.00090525026,0.0007790672,0.0029072075,0.0012848605,0.0025634435,0.002108011,0.00088425406,0.0011883236],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0016737527,0.0005101691,0.012119606,0.0008558587,0.00024387772,0.00604458,0.0039542345,0.026000211,0.058160774,0.81375545,0.009025688,0.06765575],"study_design_scores_gemma":[0.00032382383,0.0003112087,0.004633659,0.00039521157,0.00047778068,0.0020834967,0.0028031124,0.08990858,0.07471003,0.778468,0.045721825,0.00016328602],"about_ca_topic_score_codex":0.003898515,"about_ca_topic_score_gemma":0.0064827544,"teacher_disagreement_score":0.006521934,"about_ca_system_score_codex":0.0010586714,"about_ca_system_score_gemma":0.0016457333,"threshold_uncertainty_score":0.021818042},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Toronto Metropolitan University","funders":"","keywords":"Dumbbell; Mathematics; Prism; Combinatorics; Pure mathematics; Physics; Biology; Optics","score_opus":0.008012686591782872,"score_gpt":0.21803430674744229,"score_spread":0.21002162015565942,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2911081932","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6673356,0.00051037606,0.22239979,0.0016603312,0.00023908108,0.00011074117,0.00075356726,0.0005562124,0.10643434],"genre_scores_gemma":[0.90368336,0.0004327329,0.07424238,0.0005404868,0.000090952,0.000099183286,0.0007276195,0.00025944036,0.019923842],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9993741,0.00018425159,0.000024513143,0.0001547555,0.00010443108,0.00015790306],"domain_scores_gemma":[0.9984701,0.00054279866,0.00023747141,0.00033460552,0.00014916368,0.00026584225],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005485417,0.0004409197,0.00073193957,0.00093477726,0.002061357,0.0026247457,0.0016439,0.0013544396,0.008248509],"category_scores_gemma":[0.002623938,0.00065163674,0.00070162193,0.0014193085,0.0018212844,0.003349659,0.0019633053,0.0019470925,0.0007804151],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000110848254,0.0000301227,0.0004941446,0.00006334505,0.000008999647,0.00010400605,0.0002951376,0.0047792466,0.0017232981,0.97855544,0.0022957288,0.011539676],"study_design_scores_gemma":[0.000028163442,0.000021316111,0.00038346028,0.000019975252,0.000014013819,0.00011910031,0.00025970396,0.018934183,0.0011125422,0.9738622,0.005228603,0.000016777449],"about_ca_topic_score_codex":0.003045296,"about_ca_topic_score_gemma":0.0035526967,"teacher_disagreement_score":0.008248509,"about_ca_system_score_codex":0.0012475009,"about_ca_system_score_gemma":0.0009723828,"threshold_uncertainty_score":0.02759403},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Toronto Metropolitan University","funders":"","keywords":"Digraph; Combinatorics; Chord (peer-to-peer); Mathematics; DNA; Graph; Genetics; Biology; Computer science","score_opus":0.008891721651368301,"score_gpt":0.22586219378443195,"score_spread":0.21697047213306364,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2971833028","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.75737053,0.00043372583,0.1984083,0.0003644238,0.00010696658,0.0002500897,0.0032619606,0.0007992509,0.03900472],"genre_scores_gemma":[0.9560001,0.00022769017,0.030255333,0.00013458481,0.00003571098,0.00011896997,0.0027376618,0.000070748414,0.010419303],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9996573,0.000024201716,0.000020261481,0.000166618,0.000060860457,0.00007078254],"domain_scores_gemma":[0.9992066,0.00022348943,0.00013843004,0.00008344352,0.00019291733,0.00015511739],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00008985645,0.00039470522,0.00037574008,0.002075414,0.0011510574,0.0010077889,0.0007566596,0.00058486365,0.0063388916],"category_scores_gemma":[0.0010672305,0.00025088424,0.00033191562,0.0016189457,0.000461673,0.0010427788,0.0005351168,0.0004115347,0.00071485527],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0013808119,0.00037315983,0.036154322,0.0012230278,0.00011765501,0.0041116597,0.0023851183,0.061279185,0.21702851,0.51229376,0.013960664,0.14969216],"study_design_scores_gemma":[0.00018434631,0.000838387,0.024994621,0.00029236847,0.00019930307,0.0051885713,0.003373342,0.39180592,0.09081559,0.40502587,0.077052206,0.00022947435],"about_ca_topic_score_codex":0.0037338927,"about_ca_topic_score_gemma":0.0027087375,"teacher_disagreement_score":0.0063388916,"about_ca_system_score_codex":0.0009442744,"about_ca_system_score_gemma":0.0005966901,"threshold_uncertainty_score":0.021205723},"labels":[],"label_agreement":null},{"id":"W3048214410","doi":"10.1016/j.akcej.2019.12.016","title":"The <i>k</i>-conversion number of regular graphs","year":2020,"lang":"en","type":"article","venue":"AKCE International Journal of Graphs and Combinatorics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Combinatorics; Mathematics; Maximal independent set; Vertex (graph theory); Dominating set; Upper and lower bounds; Set (abstract data type); Discrete mathematics; Graph; Chordal graph; 1-planar graph; Computer science","score_opus":0.013337443425529777,"score_gpt":0.275077607849234,"score_spread":0.26174016442370424,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3048214410","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.81966215,0.00079696876,0.101853736,0.0013330533,0.00006728147,0.00016051019,0.0010260287,0.00096250337,0.0741377],"genre_scores_gemma":[0.9676762,0.00034439235,0.02556265,0.00015764106,0.000039198974,0.00013367015,0.0005730074,0.000112311056,0.0054010046],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99897504,0.00015760867,0.000063851214,0.00028571705,0.00026137187,0.0002564612],"domain_scores_gemma":[0.9940942,0.0032509963,0.00061462395,0.001011218,0.0003423306,0.00068673515],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007771645,0.0004743367,0.0005350765,0.0011547618,0.0010960251,0.0022441477,0.0015017486,0.00071340497,0.00490636],"category_scores_gemma":[0.0056155827,0.00050036045,0.0005157465,0.0010258729,0.002036863,0.002563486,0.0012642985,0.0017328637,0.00048628438],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00085203385,0.0003098804,0.012096355,0.0005503539,0.00007879107,0.0005055979,0.0010269842,0.10193643,0.0386035,0.7583439,0.010240497,0.07545571],"study_design_scores_gemma":[0.00012539471,0.00026368457,0.01005595,0.00015577834,0.000093406896,0.0014427147,0.00043130157,0.2940868,0.044428572,0.6290331,0.019776138,0.000107155385],"about_ca_topic_score_codex":0.001235123,"about_ca_topic_score_gemma":0.0013004787,"teacher_disagreement_score":0.00490636,"about_ca_system_score_codex":0.0019110644,"about_ca_system_score_gemma":0.0008216195,"threshold_uncertainty_score":0.01641339},"labels":[],"label_agreement":null}]}