{"meta":{"query_hash":"faea0385ff28","filters":{"venue":"Discussiones Mathematicae Graph Theory"},"cohort_total":26,"direct_labels_cover":0,"predictions_cover":26,"exported":26,"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/faea0385ff28","api":"https://metacan.xera.ac/api/v1/cohort?venue=Discussiones+Mathematicae+Graph+Theory"},"results":[{"id":"W1967091137","doi":"10.7151/dmgt.1238","title":"On dominating the Cartesian product of a graph and K <sub>2</sub>","year":2004,"lang":"en","type":"article","venue":"Discussiones Mathematicae Graph Theory","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":62,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Saint Mary's University","funders":"","keywords":"Cartesian product; Mathematics; Combinatorics; Graph; Product (mathematics); Discrete mathematics; Geometry","score_opus":0.011147351217330617,"score_gpt":0.25500146980566574,"score_spread":0.2438541185883351,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1967091137","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.69528335,0.00046493806,0.29938623,0.002195603,0.00013273297,0.0009397835,0.000006775094,0.00017787372,0.0014126868],"genre_scores_gemma":[0.9921497,0.000044266795,0.0075182905,0.00009503424,0.000022273336,0.00010764893,0.0000011329616,0.00003093161,0.000030715863],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9973699,0.0004453538,0.00046381503,0.000598408,0.0006398494,0.00048266037],"domain_scores_gemma":[0.99698347,0.001085407,0.00025024774,0.001422899,0.00011060917,0.00014736221],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0023121892,0.0003036156,0.00038474728,0.00040192978,0.0004576701,0.000091529066,0.0011712522,0.00005873467,0.0000059218532],"category_scores_gemma":[0.0007077861,0.00015464617,0.00019887739,0.0011802401,0.0008343193,0.00037772334,0.0004114885,0.00032098044,0.000019083196],"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.00004693887,0.00019040641,0.000014959533,0.000120233235,0.000037584243,0.000008444802,0.0040423214,0.000064976855,0.020489894,0.9551023,0.0000123024465,0.01986963],"study_design_scores_gemma":[0.0004400244,0.00012558859,0.0004334575,0.00030465116,0.000016094476,0.000039012182,0.0007541831,0.00009770692,0.088523045,0.9090617,0.0000035049975,0.0002010679],"about_ca_topic_score_codex":0.0000010938785,"about_ca_topic_score_gemma":0.0000021140138,"teacher_disagreement_score":0.29686633,"about_ca_system_score_codex":0.000019457786,"about_ca_system_score_gemma":0.000050913557,"threshold_uncertainty_score":0.63062876},"labels":[],"label_agreement":null},{"id":"W1975584720","doi":"10.7151/dmgt.1727","title":"On the complexity of the 3-kernel problem in some classes of digraphs","year":2013,"lang":"en","type":"article","venue":"Discussiones Mathematicae Graph Theory","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":15,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Digraph; Mathematics; Combinatorics; Kernel (algebra); Vertex (graph theory); Discrete mathematics; Computational complexity theory; Graph; Algorithm","score_opus":0.035712373019534484,"score_gpt":0.27579385258276223,"score_spread":0.24008147956322776,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1975584720","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.91613,0.00031415027,0.058044903,0.01053798,0.00023273438,0.003668124,0.00002496215,0.00015735014,0.010889812],"genre_scores_gemma":[0.9949194,0.000016448688,0.004475475,0.0001370157,0.0000066564176,0.00020193006,6.158576e-7,0.000019723644,0.00022272082],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9968584,0.00096182973,0.000656863,0.00037039735,0.0007324488,0.0004200619],"domain_scores_gemma":[0.99561983,0.0019492448,0.00038301852,0.001843397,0.00012871272,0.00007577515],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017313409,0.00024912134,0.00042186357,0.00030854688,0.00018712894,0.00004986867,0.0028052044,0.000071683404,0.0001375339],"category_scores_gemma":[0.00047312505,0.00009933521,0.00031076896,0.0014597125,0.0020981089,0.00046448904,0.0007122588,0.00035114423,0.000035522266],"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.000019384755,0.00037226602,0.00036778048,0.00013053103,0.000027308777,5.543302e-7,0.0017124466,0.000028062514,0.0025369523,0.9936108,0.00011913422,0.0010747808],"study_design_scores_gemma":[0.0002177611,0.000059948165,0.008259601,0.00036957455,0.000005790626,0.0000028242262,0.00083254505,0.000707799,0.006558246,0.98284245,0.000006064395,0.00013738315],"about_ca_topic_score_codex":0.000010617717,"about_ca_topic_score_gemma":0.0000049423743,"teacher_disagreement_score":0.07878943,"about_ca_system_score_codex":0.000015837057,"about_ca_system_score_gemma":0.000047005204,"threshold_uncertainty_score":0.7730569},"labels":[],"label_agreement":null},{"id":"W1983282841","doi":"10.7151/dmgt.1154","title":"Heavy cycles in weighted graphs","year":2002,"lang":"en","type":"article","venue":"Discussiones Mathematicae Graph Theory","topic":"Graph theory and applications","field":"Mathematics","cited_by":32,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Social Sciences and Humanities Research Council; Natural Sciences and Engineering Research Council of Canada; Simon Fraser University","funders":"University of Twente","keywords":"Mathematics; Combinatorics; Discrete mathematics","score_opus":0.041062757443521954,"score_gpt":0.2893674404735425,"score_spread":0.24830468303002057,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1983282841","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.93712944,0.0006690373,0.006439975,0.0019039852,0.00023472836,0.0014232,0.000044277018,0.00077234674,0.051382996],"genre_scores_gemma":[0.9884852,0.00011228046,0.008291407,0.00014070437,0.000034661844,0.0004099362,0.0000092717155,0.000086936874,0.002429559],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9972265,0.00045143705,0.0008335394,0.0005247392,0.00038463395,0.000579181],"domain_scores_gemma":[0.9972855,0.0011331907,0.00023915456,0.0010969702,0.0000506371,0.00019455959],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.001275925,0.00041938995,0.00058575766,0.00060046255,0.00031713882,0.00005702257,0.00059127127,0.00018118837,0.0023553844],"category_scores_gemma":[0.00032016067,0.0002773395,0.0003632591,0.001245015,0.000378316,0.00023591095,0.00011289764,0.00034142745,0.0004032484],"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.00003206107,0.0011027276,0.0002572532,0.00015002638,0.000046178902,0.0000106882935,0.0027130442,4.534456e-7,0.0003444432,0.9905482,0.0017290303,0.0030658932],"study_design_scores_gemma":[0.00054439885,0.000029318293,0.0004273127,0.00026566905,0.000060490434,0.000026074085,0.0015863596,0.00021725045,0.00084017374,0.9951349,0.0004484725,0.00041961396],"about_ca_topic_score_codex":0.0000015421263,"about_ca_topic_score_gemma":0.000008299766,"teacher_disagreement_score":0.05135579,"about_ca_system_score_codex":0.000022394728,"about_ca_system_score_gemma":0.000007754203,"threshold_uncertainty_score":0.9999679},"labels":[],"label_agreement":null},{"id":"W1983747324","doi":"10.7151/dmgt.1252","title":"A clone-theoretic formulation of the Erdős-Faber-Lovász conjecture","year":2004,"lang":"en","type":"article","venue":"Discussiones Mathematicae Graph Theory","topic":"Limits and Structures in Graph Theory","field":"Mathematics","cited_by":8,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Royal Military College of Canada","funders":"","keywords":"Mathematics; Conjecture; Combinatorics; clone (Java method); Discrete mathematics; Genetics; Biology","score_opus":0.016729793635537005,"score_gpt":0.2728471466446489,"score_spread":0.25611735300911187,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1983747324","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.95948786,0.0002682283,0.027164483,0.000865057,0.0006950941,0.0013134254,0.000048601734,0.00022583941,0.009931397],"genre_scores_gemma":[0.9932812,0.000020691326,0.005853496,0.00015024384,0.00008099633,0.00005997489,0.000005577296,0.000087908455,0.0004599322],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9969685,0.00042340293,0.0009520178,0.00043277245,0.0007217349,0.0005015648],"domain_scores_gemma":[0.9965208,0.0010020926,0.00065037265,0.0015679811,0.00012306041,0.00013565895],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014267516,0.00048514453,0.00069236837,0.00022847706,0.0006495558,0.000038484846,0.00093636505,0.00027842273,0.00036572738],"category_scores_gemma":[0.0010942323,0.00022934357,0.00072649826,0.0006878299,0.0007910586,0.00018613749,0.00038337253,0.00040965524,0.000013653458],"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.00009539513,0.00023608659,0.00015499147,0.00049448723,0.00013030595,0.0000029398484,0.0077236006,0.000033365483,0.0011626919,0.98930556,0.000096035656,0.0005645328],"study_design_scores_gemma":[0.0010212293,0.00006943143,0.0009426672,0.00056597305,0.00024591322,0.000060266728,0.0012644564,0.00002007835,0.009967401,0.98542905,0.00005811623,0.00035540832],"about_ca_topic_score_codex":0.0000024400651,"about_ca_topic_score_gemma":0.0000041256944,"teacher_disagreement_score":0.033793304,"about_ca_system_score_codex":0.000050605042,"about_ca_system_score_gemma":0.00006984473,"threshold_uncertainty_score":0.9352359},"labels":[],"label_agreement":null},{"id":"W1992286690","doi":"10.7151/dmgt.1421","title":"The signed matchings in graphs","year":2008,"lang":"en","type":"article","venue":"Discussiones Mathematicae Graph Theory","topic":"Advanced Combinatorial Mathematics","field":"Mathematics","cited_by":6,"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":"Mathematics; Combinatorics; Discrete mathematics","score_opus":0.031046256511392575,"score_gpt":0.29270632798460944,"score_spread":0.26166007147321685,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1992286690","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.9077217,0.0007541294,0.059804674,0.0017239609,0.001446796,0.0028632802,0.000015074648,0.0011283892,0.024542011],"genre_scores_gemma":[0.9755394,0.00018267523,0.020387651,0.000096963944,0.0000751632,0.0004299976,0.0000035667447,0.00018052297,0.0031040728],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99616456,0.00052464,0.0012057838,0.0004919714,0.00080791634,0.0008051442],"domain_scores_gemma":[0.9923448,0.0054634893,0.00047382043,0.0014259127,0.000106618296,0.00018537103],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0023568165,0.00052566966,0.0007486311,0.00030199834,0.00095618766,0.00006397816,0.0010484604,0.00018132261,0.00010715578],"category_scores_gemma":[0.0027816463,0.00028156542,0.0003766096,0.00097457186,0.0006862875,0.00030739393,0.00027489846,0.0004906252,0.0001276763],"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.00008432994,0.0004373762,0.00009338404,0.00015734152,0.000048418522,0.000044147746,0.00528532,0.0000019738795,0.00030414283,0.99207413,0.0008061095,0.0006633505],"study_design_scores_gemma":[0.0007682023,0.00005133614,0.00016031005,0.00027120457,0.00003876708,0.00010554693,0.002601483,0.000064643136,0.00055589725,0.99470174,0.00024416312,0.00043672897],"about_ca_topic_score_codex":0.0000020990813,"about_ca_topic_score_gemma":0.000008098537,"teacher_disagreement_score":0.0678177,"about_ca_system_score_codex":0.00006628135,"about_ca_system_score_gemma":0.00006093688,"threshold_uncertainty_score":0.99996364},"labels":[],"label_agreement":null},{"id":"W2001998099","doi":"10.7151/dmgt.1377","title":"Couterexample to a conjecture on the structure of bipartite partionable graphs","year":2007,"lang":"en","type":"article","venue":"Discussiones Mathematicae Graph Theory","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"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":"Combinatorics; Mathematics; Bipartite graph; Cartesian product; Conjecture; Disjoint sets; Partition (number theory); Counterexample; Discrete mathematics; Vertex (graph theory); Graph; Edge-transitive graph; Graph power; Line graph","score_opus":0.021057523586209024,"score_gpt":0.28829805335352093,"score_spread":0.2672405297673119,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2001998099","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.33907267,0.00008768369,0.655762,0.00212484,0.00021027871,0.00095402455,0.000040027204,0.00018130562,0.0015671639],"genre_scores_gemma":[0.9871823,0.0000047061726,0.011817923,0.0005891005,0.000025958805,0.00002698641,0.000003778855,0.000029102446,0.00032010267],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99712384,0.00035593903,0.00053802936,0.0005217687,0.000806403,0.00065404555],"domain_scores_gemma":[0.9956585,0.0020302988,0.00021107345,0.00170291,0.00014724971,0.00024994463],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0023602326,0.00030417956,0.00036928532,0.00049388886,0.00035694975,0.0000813477,0.0017044599,0.0001002728,0.0002790161],"category_scores_gemma":[0.00054898503,0.00014828761,0.00022610952,0.0018516723,0.00035937264,0.00024170172,0.0003777152,0.00031706906,0.000071701186],"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.0000966792,0.00012317226,0.00009314116,0.000047518723,0.000046323068,0.0000066166026,0.0023232554,0.000083189996,0.014805355,0.97959197,0.0003986306,0.002384181],"study_design_scores_gemma":[0.00019122349,0.0001480584,0.00068095146,0.00012777935,0.00000993797,0.00001317062,0.0005856932,0.00009659906,0.053396374,0.94403934,0.00049808156,0.0002127644],"about_ca_topic_score_codex":0.0000016659801,"about_ca_topic_score_gemma":0.000007830316,"teacher_disagreement_score":0.6481097,"about_ca_system_score_codex":0.000020359388,"about_ca_system_score_gemma":0.00003707938,"threshold_uncertainty_score":0.6046993},"labels":[],"label_agreement":null},{"id":"W2033204100","doi":"10.7151/dmgt.1781","title":"Fractional aspects of the Erd\\H{o}s-Faber-Lov\\'asz Conjecture","year":2014,"lang":"en","type":"article","venue":"Discussiones Mathematicae Graph Theory","topic":"Limits and Structures in Graph Theory","field":"Mathematics","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":"Royal Military College of Canada","funders":"","keywords":"Mathematics; Combinatorics; Conjecture","score_opus":0.014632726829855083,"score_gpt":0.26535394602674345,"score_spread":0.2507212191968884,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2033204100","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.7478067,0.00038968588,0.05720258,0.0022517391,0.002870219,0.0017842569,0.00010476774,0.0005043521,0.18708569],"genre_scores_gemma":[0.99516773,0.000009550179,0.0029270453,0.0002649591,0.00019736636,0.000046495876,0.000004524863,0.00008032866,0.0013019942],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99666053,0.00080915476,0.0008107129,0.00044895583,0.00081481785,0.0004558248],"domain_scores_gemma":[0.994874,0.0026482448,0.00064549886,0.0015580893,0.00012797455,0.00014616337],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0017809493,0.0004598865,0.00070852315,0.00020287835,0.00067982945,0.00003815949,0.0009869606,0.00026024575,0.001073114],"category_scores_gemma":[0.0020084328,0.00021625236,0.000689583,0.0005164281,0.00081180135,0.00014702689,0.00038927025,0.00049421226,0.000024063187],"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.00006055313,0.00021569757,0.00021701188,0.00032639096,0.0001583348,0.0000012661776,0.0020977904,0.000007009234,0.00068603765,0.99395436,0.0011839587,0.0010915841],"study_design_scores_gemma":[0.00053580076,0.00005576376,0.0018998763,0.00030973804,0.00018371864,0.000053744512,0.0006794285,0.00006873265,0.0040930524,0.99067247,0.0011109503,0.00033674343],"about_ca_topic_score_codex":0.0000015337653,"about_ca_topic_score_gemma":0.000004240823,"teacher_disagreement_score":0.24736102,"about_ca_system_score_codex":0.000024329926,"about_ca_system_score_gemma":0.000049147322,"threshold_uncertainty_score":0.99984},"labels":[],"label_agreement":null},{"id":"W2033972173","doi":"10.7151/dmgt.1205","title":"On maximal finite antichains in the homomorphism order of directed graphs","year":2003,"lang":"en","type":"article","venue":"Discussiones Mathematicae Graph Theory","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":11,"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 Regina","funders":"","keywords":"Homomorphism; Mathematics; Combinatorics; Algebra homomorphism; Tree (set theory); Discrete mathematics; Order (exchange); Dual (grammatical number)","score_opus":0.019116565520654952,"score_gpt":0.2735449358042366,"score_spread":0.2544283702835817,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2033972173","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.26926565,0.00043299454,0.69995886,0.0011892006,0.00034056272,0.0016478063,0.000024446212,0.0003925875,0.026747884],"genre_scores_gemma":[0.98444283,0.00003765203,0.014895543,0.00022069168,0.000005597584,0.00011829735,0.0000032306905,0.0000311663,0.00024496243],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99580926,0.0017002155,0.0005763974,0.0005255843,0.00080325216,0.0005852945],"domain_scores_gemma":[0.9947539,0.0031635086,0.00021166688,0.0016345739,0.00013192797,0.00010440777],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0033234,0.0003233768,0.00044954752,0.0007697557,0.00022916467,0.000069873095,0.001749199,0.00009942886,0.00011788962],"category_scores_gemma":[0.0018155515,0.00016896,0.00022505767,0.003307805,0.0005245638,0.0002914711,0.00015691739,0.00041079975,0.000048675305],"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.000048262293,0.00064173905,0.00015787699,0.000060871072,0.000027089713,0.000032811367,0.0035341585,0.000068351845,0.0003915595,0.99387,0.00006084825,0.0011063978],"study_design_scores_gemma":[0.0005444479,0.00013819397,0.00086379144,0.00016887726,0.000010621256,0.000023892138,0.0009317153,0.0008962928,0.0009900843,0.99512106,0.000064060485,0.00024695985],"about_ca_topic_score_codex":0.0000013746277,"about_ca_topic_score_gemma":0.0000030548479,"teacher_disagreement_score":0.7151772,"about_ca_system_score_codex":0.000014093809,"about_ca_system_score_gemma":0.000054535474,"threshold_uncertainty_score":0.68899894},"labels":[],"label_agreement":null},{"id":"W2052404722","doi":"10.7151/dmgt.1808","title":"Bipartition polynomials, the Ising model and domination in graphs","year":2015,"lang":"en","type":"article","venue":"Discussiones Mathematicae Graph Theory","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":9,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Cape Breton University","funders":"European Social Fund; Austrian Science Fund; Vienna Science and Technology Fund","keywords":"Mathematics; Combinatorics; Ising model; Discrete mathematics; Statistical physics; Physics","score_opus":0.039834455206508294,"score_gpt":0.3003661581116008,"score_spread":0.2605317029050925,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2052404722","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.21809573,0.0005822123,0.77410614,0.0036775125,0.00013453906,0.00063459185,0.000003900749,0.00016724705,0.0025980962],"genre_scores_gemma":[0.9844005,0.000042143103,0.015038941,0.00016732067,0.000014108678,0.00010228367,0.0000022830714,0.000019619927,0.00021281253],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9978646,0.0005490524,0.00036573,0.00039714834,0.00045269958,0.00037077733],"domain_scores_gemma":[0.9984025,0.0004963063,0.00012612359,0.00073129276,0.00008208575,0.00016170114],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003617252,0.00019592799,0.00023503498,0.00045449237,0.00022654438,0.00016307116,0.00072544924,0.00007057266,0.0000052432765],"category_scores_gemma":[0.0004383211,0.00010693284,0.00007939821,0.0009169223,0.0003512816,0.00086575485,0.00035502165,0.00021528624,0.000019571477],"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.000040113762,0.00008398979,0.00007033917,0.00002248611,0.000007795943,0.0000034383434,0.0049844906,0.0004651872,0.0007237246,0.98577917,0.00009232012,0.007726958],"study_design_scores_gemma":[0.00042454546,0.000028236245,0.00029332592,0.00007742968,0.0000064522974,0.000016614611,0.0012656773,0.06493809,0.00046297567,0.93230724,0.000020408675,0.00015899671],"about_ca_topic_score_codex":0.0000023271634,"about_ca_topic_score_gemma":0.0000060503494,"teacher_disagreement_score":0.76630473,"about_ca_system_score_codex":0.00003327041,"about_ca_system_score_gemma":0.00005359441,"threshold_uncertainty_score":0.43605947},"labels":[],"label_agreement":null},{"id":"W2061151678","doi":"10.7151/dmgt.1503","title":"Structure of the set of all minimal total dominating functions of some classes of graphs","year":2010,"lang":"en","type":"article","venue":"Discussiones Mathematicae Graph Theory","topic":"Advanced Graph Theory Research","field":"Computer Science","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":"University of Victoria","funders":"","keywords":"Mathematics; Combinatorics; Dominating set; Set (abstract data type); Discrete mathematics; Graph; Vertex (graph theory); Computer science","score_opus":0.0143643200391098,"score_gpt":0.2804135836343913,"score_spread":0.26604926359528147,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2061151678","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.9798976,0.00007931565,0.018668214,0.00016305223,0.0002930933,0.00038511647,0.00012955473,0.000029536095,0.00035448823],"genre_scores_gemma":[0.9825859,0.0000047981603,0.017239537,0.000008212082,0.000015492285,0.000012045118,0.0000031052698,0.000019951955,0.000110949484],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9974317,0.0003676521,0.00085351296,0.00032288567,0.00071769266,0.00030656627],"domain_scores_gemma":[0.9960583,0.0012443762,0.0008566257,0.0014693228,0.00028695338,0.00008440841],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001014805,0.00023141343,0.0005661884,0.000414537,0.00011465999,0.000012755821,0.0015682648,0.00012767431,0.000099161916],"category_scores_gemma":[0.000722097,0.00012246607,0.00044738775,0.0010870751,0.0013671549,0.0003925081,0.0006309123,0.00037086915,0.0000011462294],"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.000040248196,0.00012404718,0.0003651914,0.00029186232,0.00006404797,3.5467318e-7,0.0019150882,0.000018446231,0.36131272,0.6346544,0.000013471083,0.0012001033],"study_design_scores_gemma":[0.00028735795,0.00009206761,0.0030037235,0.00016927035,0.00003782706,0.000015217724,0.001371425,0.00027413547,0.19125023,0.8033747,0.0000051940083,0.00011884722],"about_ca_topic_score_codex":0.0000025244174,"about_ca_topic_score_gemma":0.00000420711,"teacher_disagreement_score":0.17006248,"about_ca_system_score_codex":0.0000047934836,"about_ca_system_score_gemma":0.00007532963,"threshold_uncertainty_score":0.50373393},"labels":[],"label_agreement":null},{"id":"W2081467762","doi":"10.7151/dmgt.1594","title":"Characterizing Cartesian fixers and multipliers","year":2012,"lang":"en","type":"article","venue":"Discussiones Mathematicae Graph Theory","topic":"Advanced Algebra and Logic","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"","keywords":"Mathematics; Combinatorics; Cartesian coordinate system; Geometry","score_opus":0.011748426298101706,"score_gpt":0.23554724997994775,"score_spread":0.22379882368184603,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2081467762","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.23660308,0.00075553765,0.75463086,0.0011129079,0.0004996342,0.00035662224,0.000003501131,0.00044341726,0.005594448],"genre_scores_gemma":[0.97041714,0.000023810171,0.028957019,0.00029544608,0.000051314397,0.0000331246,0.0000019057311,0.000015374775,0.00020483758],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99880594,0.00011227699,0.00021481048,0.00025960064,0.00017326872,0.0004341238],"domain_scores_gemma":[0.99894863,0.00021393062,0.00010150122,0.0004845868,0.000015318936,0.00023602409],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00054282125,0.0001923064,0.00022102507,0.00012165124,0.0002450918,0.00006739378,0.0003756317,0.00005681074,0.000034035016],"category_scores_gemma":[0.0000835388,0.00011450287,0.00008422163,0.00023293334,0.00013783455,0.00083667354,0.00021508329,0.00011416515,0.00006030944],"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.0000044857784,0.000080160826,0.0005479111,0.000043271128,0.00001478728,0.0000019384943,0.006961376,4.0527095e-7,0.0031509304,0.9713009,0.000020633252,0.01787323],"study_design_scores_gemma":[0.0003173297,0.000029707993,0.009825345,0.000104105224,0.00002135673,0.00005639096,0.0024031566,0.00051746634,0.0021587352,0.98359597,0.00055804086,0.00041239808],"about_ca_topic_score_codex":2.467499e-7,"about_ca_topic_score_gemma":1.1026042e-7,"teacher_disagreement_score":0.7338141,"about_ca_system_score_codex":0.000009589759,"about_ca_system_score_gemma":0.000007250042,"threshold_uncertainty_score":0.46692914},"labels":[],"label_agreement":null},{"id":"W2081711724","doi":"10.7151/dmgt.1221","title":"Generalised irredundance in graphs: Nordhaus-Gaddum bounds","year":2004,"lang":"en","type":"article","venue":"Discussiones Mathematicae Graph Theory","topic":"Limits and Structures in Graph Theory","field":"Mathematics","cited_by":4,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"","keywords":"Mathematics; Combinatorics","score_opus":0.027726365848837992,"score_gpt":0.29879046669518233,"score_spread":0.27106410084634436,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2081711724","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.9703621,0.000609667,0.0112215625,0.0007365323,0.0008913622,0.0010094037,0.00004165166,0.000479843,0.014647862],"genre_scores_gemma":[0.9794958,0.00008951191,0.018601723,0.00035452953,0.000112874186,0.00020613948,0.000015835643,0.00014518666,0.0009783644],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99601924,0.0004109247,0.001162165,0.0007788885,0.00070453493,0.00092421524],"domain_scores_gemma":[0.99710816,0.00067481736,0.0003858155,0.0014711501,0.00009330511,0.0002667777],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0018935209,0.0006825735,0.0009248909,0.00074603106,0.0006195897,0.00011488415,0.00097259873,0.00030572084,0.00043567154],"category_scores_gemma":[0.0006951554,0.0004376683,0.0005593724,0.0011608308,0.00074087706,0.00039005268,0.0003159858,0.00054246915,0.000048991125],"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.00013177255,0.00053005625,0.0003468777,0.0003066841,0.00009782943,0.000046098907,0.0072198426,0.000031525684,0.0006938295,0.98945713,0.00029746655,0.0008409097],"study_design_scores_gemma":[0.0017017453,0.00007034572,0.001314247,0.00054324744,0.00008404303,0.000057476725,0.0017764298,0.000017600953,0.0011485505,0.99236774,0.00022539169,0.00069320237],"about_ca_topic_score_codex":0.000011089865,"about_ca_topic_score_gemma":0.00004261563,"teacher_disagreement_score":0.013669498,"about_ca_system_score_codex":0.00009581473,"about_ca_system_score_gemma":0.00007685172,"threshold_uncertainty_score":0.99980754},"labels":[],"label_agreement":null},{"id":"W2087046441","doi":"10.7151/dmgt.1638","title":"Minimal trees and monophonic convexity","year":2012,"lang":"en","type":"article","venue":"Discussiones Mathematicae Graph Theory","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":17,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Winnipeg","funders":"","keywords":"Mathematics; Convexity; Combinatorics; Tree (set theory)","score_opus":0.02274028201100312,"score_gpt":0.2843460459271388,"score_spread":0.26160576391613566,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2087046441","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.39829051,0.002568776,0.5898145,0.0009196018,0.00038414038,0.000602209,0.000011712892,0.0004975072,0.0069110743],"genre_scores_gemma":[0.9713997,0.000065847154,0.02751128,0.00010484848,0.00005302864,0.00008044325,0.000002177983,0.000028117045,0.00075455103],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9976518,0.00043269634,0.0003410888,0.0004193137,0.0004196383,0.00073545304],"domain_scores_gemma":[0.99767417,0.0007600971,0.00012281549,0.0009938077,0.000049034003,0.00040007764],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0019227709,0.00027905405,0.00034511863,0.00028119172,0.0003171368,0.00010649906,0.0008871444,0.00009152595,0.00013219102],"category_scores_gemma":[0.0002566985,0.00017251745,0.0001438119,0.00057135057,0.0005184981,0.0011070312,0.00063512434,0.00023169706,0.00021436972],"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.00003091486,0.00020460077,0.0010562687,0.000057082125,0.000032273496,0.0000035797054,0.0031529719,6.433593e-7,0.0014910244,0.9833071,0.000093943934,0.010569591],"study_design_scores_gemma":[0.00031956614,0.000055393502,0.007044889,0.000058850193,0.00001481889,0.000053507207,0.0008883994,0.00051208975,0.0019621095,0.9884624,0.00032302615,0.00030496976],"about_ca_topic_score_codex":6.735567e-7,"about_ca_topic_score_gemma":6.287077e-7,"teacher_disagreement_score":0.5731092,"about_ca_system_score_codex":0.000016674765,"about_ca_system_score_gemma":0.000023561091,"threshold_uncertainty_score":0.70350575},"labels":[],"label_agreement":null},{"id":"W2165079333","doi":"10.7151/dmgt.1409","title":"A note on domination parameters in random graphs","year":2008,"lang":"en","type":"article","venue":"Discussiones Mathematicae Graph Theory","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":9,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Toronto Metropolitan University; Rogers Communications (Canada)","funders":"","keywords":"Mathematics; Combinatorics; Domination analysis; Random graph; Discrete mathematics; Graph; Vertex (graph theory)","score_opus":0.0239342018942265,"score_gpt":0.2893510288309336,"score_spread":0.2654168269367071,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2165079333","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.31470653,0.0001135496,0.67662627,0.0008960071,0.00024420305,0.0009727838,0.00000470661,0.00032263546,0.0061132894],"genre_scores_gemma":[0.968357,0.000080946316,0.030662626,0.00019712711,0.000010821409,0.00023527899,0.0000039021784,0.00003417294,0.00041810688],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99663174,0.0008147856,0.00054565805,0.00066562934,0.0007460384,0.0005961623],"domain_scores_gemma":[0.99641275,0.0019371482,0.00017166481,0.0012266476,0.00006909901,0.00018268132],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0020380286,0.00032902864,0.00047053536,0.0011391875,0.0003251535,0.000060386195,0.0012609672,0.000113247166,0.000033589084],"category_scores_gemma":[0.0007117934,0.00021088538,0.00028626338,0.0017217029,0.00045349266,0.0006288494,0.00023178148,0.00037781266,0.00017787289],"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.0003026972,0.00037972952,0.000101210986,0.000037206995,0.000017650715,0.000085762214,0.0040964773,0.000184274,0.0005325053,0.9860844,0.00005966743,0.008118409],"study_design_scores_gemma":[0.0018705982,0.000112242014,0.0010591977,0.00017156021,0.000005563582,0.000052349646,0.00021625601,0.0020849882,0.0031022523,0.99096715,0.00003913748,0.00031869952],"about_ca_topic_score_codex":0.0000018113723,"about_ca_topic_score_gemma":0.000002537527,"teacher_disagreement_score":0.65365046,"about_ca_system_score_codex":0.000047262518,"about_ca_system_score_gemma":0.000055172957,"threshold_uncertainty_score":0.8599656},"labels":[],"label_agreement":null},{"id":"W2592983029","doi":"10.7151/dmgt.1732","title":"On the Erd\\H{o}s-Gyárfás conjecture in claw-free graphs","year":2013,"lang":"en","type":"article","venue":"Discussiones Mathematicae Graph Theory","topic":"Limits and Structures in Graph Theory","field":"Mathematics","cited_by":4,"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 Waterloo","funders":"","keywords":"Claw; Mathematics; Combinatorics; Conjecture; Biology","score_opus":0.020317075585290206,"score_gpt":0.26123493593084746,"score_spread":0.24091786034555726,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2592983029","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.9456529,0.00025677006,0.0017236125,0.006289347,0.00065693934,0.0025495985,0.000040177707,0.0003968111,0.04243383],"genre_scores_gemma":[0.99400395,0.000031558226,0.0021064372,0.0015174954,0.000075943346,0.00056611875,0.000006187105,0.00012848571,0.0015638283],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99592674,0.0008980279,0.0009519682,0.00064657925,0.00075896026,0.00081773335],"domain_scores_gemma":[0.9910004,0.0057042814,0.00035814857,0.0026473599,0.00008934814,0.00020043299],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0020613915,0.00068223436,0.0007803942,0.0005076237,0.0006898651,0.00014528159,0.0017851036,0.00032849875,0.0040520644],"category_scores_gemma":[0.0026662722,0.00030588105,0.0005503695,0.00086428283,0.0007876466,0.00024276858,0.0005219617,0.00085489155,0.00019793378],"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.0000641188,0.00030416486,0.00011077526,0.00015522256,0.00010371377,0.00001131481,0.005872422,0.000003147619,0.00014082798,0.98080266,0.011530186,0.0009014255],"study_design_scores_gemma":[0.0007663604,0.00008960297,0.0010449719,0.00039034724,0.00006181693,0.000028745604,0.0027973664,0.00005182187,0.00037145065,0.99369407,0.00019542634,0.0005080523],"about_ca_topic_score_codex":0.00000775709,"about_ca_topic_score_gemma":0.000010221595,"teacher_disagreement_score":0.048351035,"about_ca_system_score_codex":0.000037078273,"about_ca_system_score_gemma":0.000028148206,"threshold_uncertainty_score":0.9999393},"labels":[],"label_agreement":null},{"id":"W2949778016","doi":"10.7151/dmgt.2230","title":"Block graphs with large paired domination multisubdivision number","year":2019,"lang":"en","type":"article","venue":"Discussiones Mathematicae Graph Theory","topic":"Advanced Graph Theory Research","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 Victoria","funders":"","keywords":"Combinatorics; Domination analysis; Mathematics; Block (permutation group theory); Graph; Enhanced Data Rates for GSM Evolution; Discrete mathematics; Computer science; Artificial intelligence; Vertex (graph theory)","score_opus":0.009081031418182142,"score_gpt":0.26549238221620197,"score_spread":0.25641135079801985,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2949778016","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.46765643,0.00007371745,0.52133113,0.00044637854,0.0002652218,0.0013615058,0.000013453004,0.0006346267,0.008217546],"genre_scores_gemma":[0.96760005,0.000018058538,0.029773928,0.00010211724,0.000015961858,0.00012656118,0.000010971972,0.000058623733,0.0022937125],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99627686,0.0006040771,0.000470002,0.0008580573,0.0010145531,0.0007764825],"domain_scores_gemma":[0.99677205,0.0007758314,0.00025102936,0.0017592525,0.0001997485,0.00024206977],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0021602006,0.00041359678,0.00048061064,0.00042324266,0.00035757496,0.00017468176,0.0014180414,0.00013300372,0.00040960117],"category_scores_gemma":[0.00015344193,0.0002384014,0.00024525693,0.0014166705,0.00020860365,0.0010940538,0.0005192574,0.00033263897,0.0011878957],"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.00015942464,0.000426509,0.002515572,0.00012829178,0.000058092304,0.00001786734,0.001756904,0.000018445187,0.0012992871,0.9890403,0.00008427568,0.0044949953],"study_design_scores_gemma":[0.0016355843,0.00015885138,0.0028647168,0.0003167359,0.000020249083,0.000066528984,0.0008576863,0.0038372818,0.002142558,0.98736376,0.00022321363,0.00051283377],"about_ca_topic_score_codex":8.483649e-7,"about_ca_topic_score_gemma":0.0000023930775,"teacher_disagreement_score":0.4999436,"about_ca_system_score_codex":0.00003245769,"about_ca_system_score_gemma":0.000042729116,"threshold_uncertainty_score":0.9995898},"labels":[],"label_agreement":null},{"id":"W2973413571","doi":"10.7151/dmgt.2239","title":"Bounds on watching and watching graph products","year":2019,"lang":"en","type":"article","venue":"Discussiones Mathematicae Graph Theory","topic":"Artificial Intelligence in Games","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":"Memorial University of Newfoundland","funders":"","keywords":"Mathematics; Combinatorics; Graph; Discrete mathematics","score_opus":0.01496610401219423,"score_gpt":0.25460680920500744,"score_spread":0.23964070519281322,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2973413571","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.8452979,0.0002324728,0.13988577,0.0041727526,0.0008961823,0.0007081289,0.0000025706656,0.0004636489,0.008340619],"genre_scores_gemma":[0.98315597,0.000029459712,0.01500146,0.00032636433,0.000059327635,0.000034984085,0.000001881623,0.00003441104,0.0013561648],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99761325,0.00022859672,0.00044487556,0.0007496265,0.00049779925,0.0004658671],"domain_scores_gemma":[0.997875,0.00053971005,0.00017222881,0.0012076567,0.0000671829,0.00013822134],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014294608,0.0003185361,0.000360991,0.00027637047,0.0003357072,0.0003218768,0.00096127804,0.00008865084,0.0000683317],"category_scores_gemma":[0.000275529,0.00019010773,0.00012901062,0.00053719606,0.00019091941,0.00070955546,0.0004208806,0.00028891282,0.0004738407],"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.000018188372,0.00013292498,0.00021378553,0.00011841426,0.000027169433,0.000007991572,0.00913152,0.000030035197,0.0028325072,0.965371,0.00012352994,0.021992907],"study_design_scores_gemma":[0.000083347004,0.00009159664,0.00036495,0.00032108702,0.000011826206,0.000027964943,0.0014346031,0.0016813899,0.008325324,0.9869596,0.0003536383,0.00034467038],"about_ca_topic_score_codex":0.0000037057418,"about_ca_topic_score_gemma":0.0000012204133,"teacher_disagreement_score":0.1378581,"about_ca_system_score_codex":0.000018026036,"about_ca_system_score_gemma":0.000030098086,"threshold_uncertainty_score":0.77523685},"labels":[],"label_agreement":null},{"id":"W3001905662","doi":"10.7151/dmgt.2293","title":"A new framework to approach Vizing's conjecture","year":2020,"lang":"en","type":"article","venue":"Discussiones Mathematicae Graph Theory","topic":"Limits and Structures in Graph Theory","field":"Mathematics","cited_by":8,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Saint Mary's University","funders":"","keywords":"Mathematics; Conjecture; Combinatorics; Discrete mathematics","score_opus":0.043397361792862126,"score_gpt":0.30206699216061644,"score_spread":0.2586696303677543,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3001905662","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.027382549,0.00025650172,0.9445266,0.0043621296,0.00038808383,0.0012486473,0.000027673377,0.00077283336,0.021034941],"genre_scores_gemma":[0.55209,0.000011138247,0.44229648,0.003609832,0.00061858515,0.00009601172,0.0000087707995,0.00018385489,0.0010853615],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9967345,0.00037116118,0.00074450724,0.00080383813,0.00067429786,0.0006716682],"domain_scores_gemma":[0.99634176,0.0012936516,0.000251001,0.001120845,0.00004625581,0.0009464769],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00082132785,0.00062372454,0.0008960134,0.000222826,0.0005061082,0.00011715002,0.0010861772,0.00033966184,0.0010381739],"category_scores_gemma":[0.0025542649,0.0003685685,0.0005162054,0.0010130764,0.00017455724,0.00015337534,0.0005296527,0.00064759434,0.0001370948],"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.00017533747,0.00010722334,0.000031565825,0.00033114356,0.0001581692,0.000010593917,0.030367991,0.000008226913,0.00018730579,0.95441926,0.009973247,0.00422993],"study_design_scores_gemma":[0.00039423432,0.00012500041,0.000043104203,0.00023789355,0.00015155307,0.000029682456,0.003356743,0.000063411884,0.00052557595,0.991985,0.0024817921,0.0006059731],"about_ca_topic_score_codex":0.0000010688798,"about_ca_topic_score_gemma":3.1036748e-7,"teacher_disagreement_score":0.52470744,"about_ca_system_score_codex":0.000020963551,"about_ca_system_score_gemma":0.0000546043,"threshold_uncertainty_score":0.9998766},"labels":[],"label_agreement":null},{"id":"W3007984159","doi":"10.7151/dmgt.2359","title":"The threshold dimension and irreducible graphs","year":2020,"lang":"en","type":"preprint","venue":"Discussiones Mathematicae Graph Theory","topic":"Graph Labeling and Dimension Problems","field":"Computer Science","cited_by":0,"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; University of Winnipeg","funders":"","keywords":"Combinatorics; Metric dimension; Mathematics; Vertex (graph theory); Dimension (graph theory); Graph; Discrete mathematics; Chordal graph; 1-planar graph","score_opus":0.023276330664994398,"score_gpt":0.25142615005723523,"score_spread":0.22814981939224083,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3007984159","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3070056,0.08047375,0.34311607,0.19910388,0.017226698,0.010711061,0.00015019895,0.009361676,0.03285106],"genre_scores_gemma":[0.9758045,0.0015280944,0.020806389,0.00079008925,0.000030449664,0.00027548178,0.000020616335,0.00009429335,0.00065005705],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9961403,0.00038546996,0.00081019796,0.0013288697,0.0007382772,0.0005969096],"domain_scores_gemma":[0.99580914,0.0007043512,0.00047046,0.002501489,0.00013369534,0.00038084385],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0020890094,0.00064274395,0.0006734192,0.0002696955,0.0010524323,0.00080986065,0.0020272168,0.00030632506,0.000012786234],"category_scores_gemma":[0.0002581056,0.00032272158,0.00041987307,0.00062568724,0.0006271623,0.00022201879,0.0040622405,0.0009173474,0.00006867685],"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.000021205813,0.00009136759,0.000023909311,0.0002423444,0.00010583281,0.000011976447,0.0020041938,0.000026071648,0.00055754,0.99045855,0.002857951,0.0035990332],"study_design_scores_gemma":[0.00023865038,0.00005259537,0.000100175785,0.0005804303,0.0000775678,0.00002476791,0.0003418437,0.0057724607,0.00045738273,0.99153674,0.0003138253,0.0005035438],"about_ca_topic_score_codex":0.0000037296054,"about_ca_topic_score_gemma":0.0000013528415,"teacher_disagreement_score":0.6687989,"about_ca_system_score_codex":0.000012993698,"about_ca_system_score_gemma":0.000094256204,"threshold_uncertainty_score":0.9999225},"labels":[],"label_agreement":null},{"id":"W3047403295","doi":"10.7151/dmgt.2407","title":"Enumerating the digitally convex sets of powers of cycles and Cartesian products of paths and complete graphs","year":2021,"lang":"en","type":"preprint","venue":"Discussiones Mathematicae Graph Theory","topic":"Digital Image Processing Techniques","field":"Computer Science","cited_by":0,"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 Winnipeg; University of Victoria","funders":"","keywords":"Cartesian product; Bijection; Combinatorics; Mathematics; Convexity; Regular polygon; Product (mathematics); Binary number; Convex hull; Convex set; Set (abstract data type); Discrete mathematics; Convex optimization; Geometry; Arithmetic; Computer science","score_opus":0.017957794261899387,"score_gpt":0.25459006193379125,"score_spread":0.23663226767189185,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3047403295","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.70012224,0.0074639423,0.28402734,0.0014977229,0.00026221317,0.0018247471,0.0002000193,0.0003481498,0.0042536575],"genre_scores_gemma":[0.9200329,0.00010861169,0.07974185,0.00002450908,0.000004250285,0.00003498348,0.00001089814,0.000026109945,0.000015880558],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9975895,0.00025765077,0.0008636066,0.00060249993,0.00046202837,0.00022466405],"domain_scores_gemma":[0.99676204,0.00052095164,0.0010169069,0.001265411,0.00036135502,0.00007333562],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011084789,0.00036047687,0.00086977147,0.00024069814,0.00009482432,0.0002798641,0.0010399938,0.000121051264,0.0000025616935],"category_scores_gemma":[0.00057613815,0.00020936929,0.00017471702,0.00039085074,0.0012280982,0.0004663841,0.0020951254,0.0002504582,1.5113223e-7],"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.000031863565,0.00058516697,0.00065218407,0.012870267,0.0004044644,0.000018119725,0.035775367,0.000007538662,0.023734668,0.85094017,0.000054073214,0.07492613],"study_design_scores_gemma":[0.00012208207,0.00006565571,0.0010953997,0.0031904927,0.000068617206,0.000034811557,0.0019743203,0.00083679234,0.025094336,0.9672223,0.0000026235946,0.00029259056],"about_ca_topic_score_codex":0.0000050064464,"about_ca_topic_score_gemma":0.000001002616,"teacher_disagreement_score":0.2199107,"about_ca_system_score_codex":0.0000052116993,"about_ca_system_score_gemma":0.00011722081,"threshold_uncertainty_score":0.8537832},"labels":[],"label_agreement":null},{"id":"W3086793159","doi":"10.7151/dmgt.2355","title":"Efficient <i>(j, k)</i> -dominating functions","year":2020,"lang":"en","type":"article","venue":"Discussiones Mathematicae Graph Theory","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":0,"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; Combinatorics; Dominating set; Discrete mathematics; Graph; Vertex (graph theory)","score_opus":0.010157933203239268,"score_gpt":0.19143911717733153,"score_spread":0.18128118397409226,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3086793159","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.55222994,0.00096606725,0.3721632,0.00071162987,0.0011076997,0.00083833473,0.00005912609,0.002674701,0.069249295],"genre_scores_gemma":[0.99875784,0.0000045947513,0.0006065762,0.0001306177,0.00010964754,0.00008872561,0.00000771537,0.00006626275,0.00022802995],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9986044,0.00014405824,0.00042287956,0.00025485526,0.00024028377,0.00033349564],"domain_scores_gemma":[0.9991133,0.00022355201,0.000060722,0.00034076144,0.000028336433,0.00023331285],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00050819095,0.00027116117,0.00032941572,0.00010883511,0.00021721756,0.000046771784,0.00026222222,0.00008228723,0.0004278122],"category_scores_gemma":[0.00012139641,0.00018310215,0.00024086091,0.000543563,0.000107550186,0.00005943821,0.000052939726,0.00020882858,0.00064539444],"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.00006460304,0.00016394196,0.00007804,0.0010857037,0.00021127427,0.000018570308,0.011866751,0.021249453,0.02511292,0.9314898,0.0031799574,0.0054789446],"study_design_scores_gemma":[0.0021494562,0.0002086725,0.00038721075,0.0010190888,0.0004083276,0.000100100646,0.03809432,0.21977279,0.009347552,0.7186955,0.0074686734,0.002348288],"about_ca_topic_score_codex":1.6386446e-7,"about_ca_topic_score_gemma":1.3794029e-7,"teacher_disagreement_score":0.44652787,"about_ca_system_score_codex":0.000011999762,"about_ca_system_score_gemma":0.0000064798937,"threshold_uncertainty_score":0.82954556},"labels":[],"label_agreement":null},{"id":"W3160192199","doi":"10.7151/dmgt.2494","title":"An analogue of quasi-transitivity for edge-coloured graphs","year":2023,"lang":"en","type":"article","venue":"Discussiones Mathematicae Graph Theory","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":3,"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 Prince Edward Island","funders":"","keywords":"Mathematics; Combinatorics; Transitive relation; Enhanced Data Rates for GSM Evolution; Discrete mathematics; Computer science; Artificial intelligence","score_opus":0.02918938736880279,"score_gpt":0.3245934464297203,"score_spread":0.29540405906091755,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3160192199","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.11697406,0.00006565224,0.88012123,0.000549193,0.000210498,0.00096812187,0.00008605529,0.0006262369,0.00039894335],"genre_scores_gemma":[0.9721767,0.000027725931,0.027086796,0.000051698717,0.000025457959,0.00032646608,0.000041526946,0.00005046588,0.00021318531],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9967275,0.000709246,0.0005725732,0.00070039846,0.00058546144,0.00070480845],"domain_scores_gemma":[0.995921,0.0017081725,0.00022412084,0.0016577822,0.00022392182,0.00026497807],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003971965,0.00031844497,0.000593085,0.0009402556,0.00035989727,0.0000730493,0.0017823913,0.00013632195,0.000029687611],"category_scores_gemma":[0.00043462115,0.00021528946,0.00045168833,0.002639021,0.0005063049,0.0007365536,0.00021709006,0.00019816434,0.0000448018],"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.000112839945,0.00050010154,0.00008020983,0.00027687754,0.00006708948,0.000009069646,0.0034509606,0.000050433166,0.011324999,0.9736475,0.00014190335,0.01033803],"study_design_scores_gemma":[0.0005234551,0.00033541667,0.001248492,0.000109955094,0.00002471858,0.000007760846,0.0011913318,0.007538959,0.006913561,0.9817556,0.000045206507,0.00030555652],"about_ca_topic_score_codex":0.0000014289393,"about_ca_topic_score_gemma":0.00000526566,"teacher_disagreement_score":0.8552026,"about_ca_system_score_codex":0.000013993798,"about_ca_system_score_gemma":0.00006253025,"threshold_uncertainty_score":0.8779249},"labels":[],"label_agreement":null},{"id":"W4293915036","doi":"10.7151/dmgt.2468","title":"On the Strong Path Partition Conjecture","year":2022,"lang":"en","type":"article","venue":"Discussiones Mathematicae Graph Theory","topic":"Graph Labeling and Dimension Problems","field":"Computer Science","cited_by":0,"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 Winnipeg","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Mathematics; Conjecture; Partition (number theory); Combinatorics; Path (computing); Discrete mathematics; Computer science","score_opus":0.01399524355016314,"score_gpt":0.21898789988232675,"score_spread":0.20499265633216363,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4293915036","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.33389914,0.00073497614,0.6088147,0.03281117,0.0020501297,0.0018344409,0.000063228814,0.0015626984,0.018229485],"genre_scores_gemma":[0.9967306,0.0000038647345,0.0013218652,0.0011658138,0.000006414036,0.0002457319,0.0000067381716,0.000017216353,0.0005017322],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9978086,0.0006441895,0.00028433307,0.00037838315,0.00058076053,0.00030377455],"domain_scores_gemma":[0.99804926,0.0006294528,0.00020534454,0.0010046673,0.00002835938,0.00008290551],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016939066,0.00019202933,0.00018259612,0.00014122816,0.0011304527,0.00010633734,0.0009306516,0.000033039796,0.0006274117],"category_scores_gemma":[0.00014415811,0.000092952316,0.00017561483,0.00057821523,0.00012209856,0.00012030294,0.00041662488,0.00032342496,0.000090155],"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.00001116865,0.00017493346,0.0000069537386,0.000011806781,0.000019784855,0.0000063029047,0.0014818136,0.00032632684,0.00023726917,0.99336255,0.0030836933,0.001277425],"study_design_scores_gemma":[0.0001867124,0.00011862863,0.000034227232,0.000042239655,0.000012089381,0.000020000954,0.00090744987,0.0027443052,0.00027832235,0.9951217,0.0003696129,0.00016466968],"about_ca_topic_score_codex":9.825332e-7,"about_ca_topic_score_gemma":2.2682893e-7,"teacher_disagreement_score":0.6628315,"about_ca_system_score_codex":0.00001725487,"about_ca_system_score_gemma":0.000027857599,"threshold_uncertainty_score":0.8694643},"labels":[],"label_agreement":null},{"id":"W4313905169","doi":"10.7151/dmgt.2480","title":"On the <i>k</i>-independence number of graph products","year":2023,"lang":"en","type":"article","venue":"Discussiones Mathematicae Graph Theory","topic":"Graph Labeling and Dimension Problems","field":"Computer Science","cited_by":2,"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 Waterloo","funders":"Fonds Wetenschappelijk Onderzoek","keywords":"Mathematics; Independence number; Combinatorics; Graph; Independence (probability theory); Discrete mathematics; Statistics","score_opus":0.01918261965728592,"score_gpt":0.2552629948764604,"score_spread":0.2360803752191745,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4313905169","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.88633657,0.00026415766,0.059610683,0.021617636,0.0018514793,0.001804988,0.000025300675,0.002357238,0.026131937],"genre_scores_gemma":[0.99457645,0.00003493854,0.003567616,0.00035973202,0.000007883106,0.00008948185,0.0000031714185,0.000027079788,0.001333644],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9973726,0.00035915407,0.00048259055,0.0005316182,0.0008390891,0.0004149414],"domain_scores_gemma":[0.9967036,0.0010938707,0.0002424984,0.0016922704,0.00016937891,0.00009834923],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0028909277,0.00025619453,0.00030926292,0.00027743293,0.00032675275,0.00007585496,0.0014070286,0.00008748565,0.00009810261],"category_scores_gemma":[0.00066697854,0.00012053124,0.00020830882,0.0025888241,0.00032611133,0.00021073697,0.00037113327,0.00024565213,0.0008096787],"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.000011520053,0.00014807943,0.00005323411,0.00008369982,0.0000325491,0.00000647013,0.0014467073,0.000028090166,0.00183597,0.991663,0.0037285895,0.00096211745],"study_design_scores_gemma":[0.00015828086,0.000036151458,0.00022184296,0.00025019734,0.000014480047,0.000016181739,0.00035182334,0.00050091825,0.006638526,0.9915658,0.00005325105,0.00019250801],"about_ca_topic_score_codex":0.0000020501695,"about_ca_topic_score_gemma":3.2027225e-7,"teacher_disagreement_score":0.108239874,"about_ca_system_score_codex":0.0000049318246,"about_ca_system_score_gemma":0.000044116812,"threshold_uncertainty_score":0.9999683},"labels":[],"label_agreement":null},{"id":"W4378981483","doi":"10.7151/dmgt.2499","title":"Chromatic Ramsey numbers of generalised Mycielski graphs","year":2023,"lang":"en","type":"article","venue":"Discussiones Mathematicae Graph Theory","topic":"Advanced Topology and Set Theory","field":"Mathematics","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Royal Military College of Canada","funders":"","keywords":"Mathematics; Combinatorics; Chromatic scale; Ramsey's theorem; Discrete mathematics; Graph","score_opus":0.04089103654064718,"score_gpt":0.3316269036095605,"score_spread":0.2907358670689133,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4378981483","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.95572925,0.00018382142,0.022846924,0.0005598147,0.00058160105,0.0009794225,0.00006645889,0.0011300803,0.017922616],"genre_scores_gemma":[0.9800204,0.000100764635,0.013706336,0.00013689668,0.000059759852,0.0001861603,0.00004750805,0.00013764946,0.0056045447],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.996853,0.000591169,0.0009812401,0.0004569205,0.0004888297,0.0006288721],"domain_scores_gemma":[0.9957438,0.0023699831,0.0004894604,0.0011255093,0.00008959506,0.0001816113],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.002157981,0.0004326358,0.0008878004,0.0005520713,0.00029789237,0.000018306415,0.00062422326,0.00024818705,0.0010074445],"category_scores_gemma":[0.0012660734,0.0002819937,0.00052139186,0.0012900153,0.0008248421,0.00021007001,0.00019913299,0.00027344492,0.00030005866],"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.00008875791,0.0002763016,0.00009676001,0.00069442886,0.00019363055,0.000023244858,0.0041889693,0.000013571392,0.0034071184,0.9879113,0.0023057633,0.0008001932],"study_design_scores_gemma":[0.0006701124,0.000056638757,0.00025709975,0.0003177876,0.00015027274,0.00002805936,0.0041607055,0.00013287304,0.0035180652,0.9902489,0.000082871855,0.0003766096],"about_ca_topic_score_codex":0.000001389629,"about_ca_topic_score_gemma":0.0000025528018,"teacher_disagreement_score":0.02429112,"about_ca_system_score_codex":0.000019160268,"about_ca_system_score_gemma":0.000039583665,"threshold_uncertainty_score":0.9999632},"labels":[],"label_agreement":null},{"id":"W4384027103","doi":"10.7151/dmgt.2503","title":"Fractional eternal domination: securely distributing resources across a network","year":2023,"lang":"en","type":"article","venue":"Discussiones Mathematicae Graph Theory","topic":"Game Theory and Applications","field":"Decision Sciences","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University; Dawson College; Université de Montréal; University of Victoria","funders":"Fonds de recherche du Québec – Nature et technologies; Université de Montréal; Natural Sciences and Engineering Research Council of Canada; Mitacs","keywords":"Mathematics; Combinatorics","score_opus":0.07314322653004089,"score_gpt":0.3988477076159836,"score_spread":0.3257044810859427,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4384027103","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.8786584,0.000093512404,0.10648935,0.003599142,0.0005257005,0.00046243425,0.00019390874,0.0005368736,0.009440667],"genre_scores_gemma":[0.9915487,0.000008560338,0.0007335963,0.0001422875,0.0003643478,0.00016288688,0.000043354874,0.000030206267,0.006966024],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99564165,0.00068594766,0.00096303114,0.0006355584,0.0014343037,0.0006395145],"domain_scores_gemma":[0.99233615,0.0058085974,0.0005117614,0.0009298517,0.00020909426,0.00020456506],"candidate_categories":["sts","insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.010988262,0.00026754808,0.00041169886,0.00020623425,0.0014149776,0.0004234878,0.00112692,0.00013110565,0.0014505947],"category_scores_gemma":[0.0030189762,0.0001561516,0.0003631098,0.002689008,0.00043348747,0.00036085153,0.00042577754,0.00030181534,0.003205859],"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.00010072054,0.00011039454,0.0009944636,0.000017003185,0.000043711905,0.0000097939355,0.0053257705,0.0005541992,0.0002503345,0.97349167,0.007729797,0.011372138],"study_design_scores_gemma":[0.00025346418,0.000018203076,0.014040807,0.00008602057,0.000019635405,0.000026378539,0.009053195,0.0009035708,0.000118527525,0.96462286,0.010627816,0.00022953609],"about_ca_topic_score_codex":9.169518e-7,"about_ca_topic_score_gemma":0.0000029970258,"teacher_disagreement_score":0.112890325,"about_ca_system_score_codex":0.000020693922,"about_ca_system_score_gemma":0.000025369909,"threshold_uncertainty_score":0.999885},"labels":[],"label_agreement":null}]}