{"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.99459684,0.0003556327,0.00003915466,0.00043909423,0.0015398079,0.00002760862,0.000009399154,0.000003816707,0.0029886276],"genre_scores_gemma":[0.9992099,0.0004431935,0.000020833004,0.00007827597,0.000089271045,4.239552e-7,0.000001284363,0.000005375853,0.00015147908],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99918723,0.000015020526,0.00030566455,0.00005918526,0.00035950652,0.0000733698],"domain_scores_gemma":[0.998904,0.000023169814,0.00026729988,0.000051449268,0.0007022375,0.000051826777],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001760649,0.00006939431,0.00014654128,0.00016536111,0.0000631237,0.00007283594,0.00020599102,0.000023353241,0.00008307719],"category_scores_gemma":[0.000027597467,0.000057670924,0.00009544678,0.00003295255,0.00012763504,0.00019701735,0.000032463045,0.000100492594,0.0000018038535],"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.000018589359,0.0001944034,0.0058774664,0.000007892741,0.00014741944,0.00003537243,0.0011279408,0.000008517568,0.00030937768,0.9913814,0.00025495145,0.00063665654],"study_design_scores_gemma":[0.0016462072,0.00037718145,0.015491481,0.0001149924,0.00004474682,0.00006729154,0.00062087947,0.000008363169,0.0014620122,0.95714635,0.02289093,0.00012954405],"about_ca_topic_score_codex":0.00009113827,"about_ca_topic_score_gemma":0.00008240681,"teacher_disagreement_score":0.03423504,"about_ca_system_score_codex":0.000029712022,"about_ca_system_score_gemma":0.00004329059,"threshold_uncertainty_score":0.2351752},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.99662197,0.00029558083,0.0020181541,0.00011784085,0.00019537467,0.000027191467,0.000005854736,0.0000029046498,0.00071510277],"genre_scores_gemma":[0.9991256,0.00033425074,0.00048155562,0.000022701737,0.000012432759,9.613198e-7,8.134082e-7,0.000005561527,0.000016140308],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9989353,0.000029163806,0.00058465265,0.000061006554,0.00030711538,0.00008274995],"domain_scores_gemma":[0.9984959,0.00044509425,0.0005229521,0.000082728344,0.0004077915,0.00004554297],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006910587,0.00007053342,0.00019746611,0.00045215464,0.000015432117,0.0000072699218,0.0002634755,0.00004692235,0.0000074152645],"category_scores_gemma":[0.00009366277,0.000061505205,0.00010695909,0.00032850634,0.00008341539,0.00009998706,0.000032476084,0.00010081455,6.6209815e-8],"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.0000972247,0.00025716325,0.016379295,0.00001798666,0.0000786477,0.000011822064,0.0003468155,0.0000010163616,0.0010579742,0.98018193,0.00007431899,0.0014958325],"study_design_scores_gemma":[0.0006575619,0.00014542603,0.0058572246,0.00008705099,0.00002546799,0.00003927459,0.0003751112,0.00001368619,0.006640827,0.98578805,0.00031699144,0.000053359945],"about_ca_topic_score_codex":0.000024570623,"about_ca_topic_score_gemma":0.000020156993,"teacher_disagreement_score":0.01052207,"about_ca_system_score_codex":0.000011527982,"about_ca_system_score_gemma":0.000021896874,"threshold_uncertainty_score":0.25081092},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9855039,0.0013408302,0.009701179,0.0014254613,0.0010616083,0.000035561898,0.0000024089627,0.00004278428,0.0008862528],"genre_scores_gemma":[0.99492264,0.0008469209,0.0037493373,0.0003382069,0.00010036874,8.126123e-7,3.9936643e-7,0.0000054892807,0.000035802845],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9989291,0.000049511582,0.00029190845,0.00015356486,0.00043873148,0.00013719435],"domain_scores_gemma":[0.99911404,0.00015400887,0.00021595678,0.00011559829,0.00027905224,0.00012133746],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00042746845,0.00012011986,0.00015397067,0.0002923962,0.00009346063,0.00024768803,0.00050213566,0.000051129744,0.000011000853],"category_scores_gemma":[0.000025637763,0.000104360464,0.000100199475,0.00020773672,0.00006337447,0.0006863123,0.00017542053,0.00019978311,0.0000012295313],"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.000031833475,0.00018157854,0.01295965,0.0000039149268,0.00012020184,0.00005434077,0.00046890293,0.0000038532276,0.0001850758,0.9647627,0.0005997789,0.020628178],"study_design_scores_gemma":[0.002354744,0.00070739514,0.036734812,0.00008898012,0.00005592178,0.0014356362,0.00011120737,0.0036274192,0.0008411092,0.9194807,0.034178365,0.0003837484],"about_ca_topic_score_codex":0.0000030291205,"about_ca_topic_score_gemma":0.0000019776464,"teacher_disagreement_score":0.04528203,"about_ca_system_score_codex":0.00002311025,"about_ca_system_score_gemma":0.000033082633,"threshold_uncertainty_score":0.42556962},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9873874,0.0012248948,0.0045532575,0.0019347711,0.0036602272,0.00005785254,0.0000050738427,0.00003281036,0.0011437003],"genre_scores_gemma":[0.99672806,0.00025874906,0.0025058133,0.0004279099,0.000008844102,6.7349197e-7,0.000001319209,0.000008009756,0.000060594226],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9981576,0.000055282548,0.00054453406,0.00018373462,0.0008978657,0.00016093894],"domain_scores_gemma":[0.99757963,0.00013308565,0.0005079034,0.00020123442,0.001365742,0.00021241447],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00070415705,0.0001475823,0.0002517814,0.0005724928,0.00004057892,0.000105789346,0.000918527,0.000068456975,0.0000027916712],"category_scores_gemma":[0.00014013094,0.00012070305,0.00013919632,0.0003876315,0.00008645351,0.00035800712,0.00014168005,0.00024328241,0.0000044766725],"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.000065175016,0.00025857557,0.005648431,0.0000059402164,0.000090648915,0.00007879775,0.0003275116,0.000058250465,0.00015303469,0.9880099,0.0030550205,0.002248661],"study_design_scores_gemma":[0.0015453212,0.0009722167,0.0008086877,0.00009641079,0.000017342823,0.00021475727,0.000056068104,0.0011886774,0.0006856269,0.99337065,0.00090617925,0.00013807892],"about_ca_topic_score_codex":0.000023415972,"about_ca_topic_score_gemma":7.672438e-7,"teacher_disagreement_score":0.009340675,"about_ca_system_score_codex":0.000026734186,"about_ca_system_score_gemma":0.000093262046,"threshold_uncertainty_score":0.49221277},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.98652214,0.0030755845,0.0039631925,0.0048229666,0.0011570272,0.000046102617,0.0000029899386,0.000038228383,0.0003717839],"genre_scores_gemma":[0.9902289,0.0021841633,0.006699356,0.0008173141,0.000015461721,8.9294895e-7,6.524374e-7,0.0000065522927,0.000046703077],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.998518,0.00004999479,0.00040354137,0.00019260484,0.0006823166,0.00015357081],"domain_scores_gemma":[0.9985669,0.00009581362,0.00032891607,0.00013623647,0.0007102022,0.00016187731],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00056497596,0.00013442761,0.00017170486,0.00028769794,0.000083576124,0.00027496836,0.00068000273,0.00008517637,0.0000041468747],"category_scores_gemma":[0.00005009325,0.000112881826,0.00007449099,0.0001719054,0.00006483956,0.0007583516,0.00021590698,0.0003267284,0.0000019308354],"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.000028666922,0.00016188365,0.024872968,0.000009209424,0.00011405993,0.0001273891,0.0006626656,0.000028535947,0.00029161808,0.9282936,0.001470063,0.043939367],"study_design_scores_gemma":[0.0012899421,0.0004390861,0.010959247,0.0001431912,0.000020055066,0.0014214172,0.000047881887,0.004704438,0.0007353595,0.97478366,0.0052078855,0.00024783766],"about_ca_topic_score_codex":0.000014675259,"about_ca_topic_score_gemma":0.0000049049713,"teacher_disagreement_score":0.046490088,"about_ca_system_score_codex":0.000023929246,"about_ca_system_score_gemma":0.000060920254,"threshold_uncertainty_score":0.4603187},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.99598247,0.00036379645,0.0003622104,0.0005149892,0.00043518323,0.00006639059,0.000004097697,0.000014382653,0.0022564677],"genre_scores_gemma":[0.9991316,0.0002241443,0.0004933914,0.00005691011,0.00003593256,0.0000047654075,0.0000020626785,0.000010967128,0.00004017949],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9988288,0.0000498039,0.0005358655,0.0001135529,0.0003360375,0.00013593798],"domain_scores_gemma":[0.9988603,0.00039409014,0.00033463343,0.0000976511,0.0002584907,0.00005483477],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004441092,0.00011734517,0.00021420608,0.00036495226,0.000060949507,0.000071351176,0.0002959502,0.000054812273,0.000015506952],"category_scores_gemma":[0.00009715889,0.00010377773,0.0001206403,0.00024260873,0.00007404457,0.00020173802,0.000041548603,0.00021088222,0.000001216951],"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.000097022086,0.00030357228,0.023221027,0.000007366105,0.000048075035,0.000045770965,0.00016058738,0.000005517046,0.0002623013,0.97486645,0.00038294084,0.0005993768],"study_design_scores_gemma":[0.0010401838,0.00010764269,0.02940234,0.00008389283,0.000025282505,0.00008331155,0.0003706855,0.000046911064,0.00044460225,0.96769863,0.00058910483,0.000107407024],"about_ca_topic_score_codex":0.000036392183,"about_ca_topic_score_gemma":0.000032279546,"teacher_disagreement_score":0.0071678064,"about_ca_system_score_codex":0.00003443041,"about_ca_system_score_gemma":0.000024228832,"threshold_uncertainty_score":0.4231933},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.98706466,0.0063451896,0.0019018659,0.0029141314,0.0015319573,0.00008493054,7.81196e-7,0.00001792845,0.00013854158],"genre_scores_gemma":[0.9901231,0.0054597803,0.004103962,0.00022321664,0.000006745222,0.0000028213512,3.924354e-7,0.0000068806435,0.00007312577],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99858546,0.00006451846,0.0005184849,0.00014714166,0.0005253311,0.00015907871],"domain_scores_gemma":[0.99818724,0.00022244244,0.00047506386,0.0001715677,0.0008256558,0.000117999196],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00056412356,0.000121003315,0.00018696193,0.00022322795,0.00016076895,0.00026716152,0.00070202333,0.00005399027,0.0000021355834],"category_scores_gemma":[0.00007128656,0.000081423466,0.000098541605,0.0002561456,0.00013018741,0.00036665864,0.0001864369,0.0002020369,0.0000010470394],"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.000018737019,0.00010097039,0.0068649934,0.0000072967914,0.00015232187,0.0000152045095,0.00031019124,0.000010096365,0.0029497691,0.97068185,0.0015045726,0.017384022],"study_design_scores_gemma":[0.0010882556,0.00021760102,0.003687159,0.000055098833,0.000017675846,0.00016751014,0.00005091488,0.0029582358,0.0013535118,0.9892332,0.0010542533,0.000116604766],"about_ca_topic_score_codex":0.000077753524,"about_ca_topic_score_gemma":0.000001250811,"teacher_disagreement_score":0.018551355,"about_ca_system_score_codex":0.000010367789,"about_ca_system_score_gemma":0.000039651357,"threshold_uncertainty_score":0.33203524},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9921786,0.0001631881,0.0069855293,0.00027731634,0.00021534051,0.00009275503,0.000009580668,0.000002672127,0.00007500355],"genre_scores_gemma":[0.99881417,0.00046244575,0.00043060805,0.00012469135,0.00007956173,0.000004058771,0.000043639655,0.0000065220966,0.000034315184],"study_design_codex":"bench_or_experimental","study_design_gemma":"observational","domain_scores_codex":[0.99937564,0.000016832519,0.0002611174,0.00010060122,0.00015757704,0.000088226014],"domain_scores_gemma":[0.9988711,0.000024437655,0.00030714553,0.000058862155,0.00068599277,0.000052452862],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00012107233,0.00008183356,0.00013454336,0.000085225365,0.000031672444,0.000028810555,0.00017868719,0.00006208745,0.000004114524],"category_scores_gemma":[0.000044377597,0.000058614558,0.000086477456,0.00008512738,0.00005841829,0.000013937863,0.000039882176,0.00005910062,1.3944133e-7],"study_design_candidate":"bench_or_experimental","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.00044919841,0.0005302558,0.062085945,0.000030255642,0.00041244173,0.0000031467664,0.000039488194,0.000008710348,0.89420825,0.0113355955,0.00014587838,0.030750813],"study_design_scores_gemma":[0.0063789855,0.013107412,0.43515116,0.00031184315,0.00016289698,0.00017337404,0.0001817629,0.00030453462,0.4199033,0.11389631,0.009754775,0.00067362085],"about_ca_topic_score_codex":0.0000047623166,"about_ca_topic_score_gemma":8.427418e-7,"teacher_disagreement_score":0.47430494,"about_ca_system_score_codex":0.0000037377024,"about_ca_system_score_gemma":0.000016898295,"threshold_uncertainty_score":0.23902322},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.92578816,0.002064441,0.05434156,0.0136581585,0.0024715683,0.00015008525,0.000005388339,0.000037732843,0.0014828906],"genre_scores_gemma":[0.9967528,0.001661402,0.0012606104,0.0002597582,0.000022369277,8.2296395e-7,3.4003963e-7,0.000006195385,0.000035676443],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99844563,0.00009008809,0.00036976102,0.00013421748,0.00081781833,0.0001425104],"domain_scores_gemma":[0.9981463,0.00031635215,0.00036224883,0.00016886395,0.0008644905,0.00014173792],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005072589,0.0000942502,0.00015487285,0.00010583575,0.00010890082,0.00010024779,0.0015348716,0.000038360653,0.0000050733],"category_scores_gemma":[0.00015181709,0.0000666044,0.00014888163,0.00047624763,0.00016664951,0.0004617874,0.0002930552,0.00025759608,0.0000024220376],"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.000083209794,0.000044515244,0.009979792,0.000006518029,0.000084496874,0.000041976236,0.00021715238,0.00000595859,0.00040796257,0.982585,0.0008289846,0.005714422],"study_design_scores_gemma":[0.0007845544,0.00026973212,0.0016593874,0.000028160766,0.0000088651295,0.00012998111,0.00013044552,0.0008480226,0.0035079943,0.98398805,0.008553584,0.00009123864],"about_ca_topic_score_codex":0.0000024898886,"about_ca_topic_score_gemma":1.7299543e-7,"teacher_disagreement_score":0.07096465,"about_ca_system_score_codex":0.000016930668,"about_ca_system_score_gemma":0.000046552486,"threshold_uncertainty_score":0.2852199},"labels":[],"label_agreement":null}]}