{"meta":{"query_hash":"957631600843","filters":{"venue":"Australas. J Comb."},"cohort_total":19,"direct_labels_cover":0,"predictions_cover":19,"exported":19,"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/957631600843","api":"https://metacan.xera.ac/api/v1/cohort?venue=Australas.+J+Comb."},"results":[{"id":"W206221419","doi":"","title":"A note on critical sets","year":2002,"lang":"es","type":"article","venue":"Australas. J Comb.","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 Manitoba","funders":"","keywords":"Counterexample; Mathematics; Discrete mathematics; Combinatorics","score_opus":0.06425381317664465,"score_gpt":0.37009303445390607,"score_spread":0.30583922127726143,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W206221419","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.41849723,0.0046140286,0.183994,0.18992503,0.012648868,0.0044509596,0.000462266,0.0033224255,0.1820852],"genre_scores_gemma":[0.9871303,0.00012396486,0.007564445,0.0008461052,0.00018180192,0.000023429979,0.0000023104383,0.00004404328,0.0040836437],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99577934,0.00040050916,0.00042612123,0.0010097284,0.0010316222,0.0013526625],"domain_scores_gemma":[0.9961168,0.0014772543,0.00007499208,0.0015625337,0.00019361322,0.00057481625],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.00043778404,0.00043210344,0.00040761585,0.00031530633,0.00037650112,0.00056161964,0.0017933758,0.0002582501,0.0015122237],"category_scores_gemma":[0.0006436856,0.00042995508,0.00022051731,0.0009540062,0.0007171338,0.00065634004,0.0005107869,0.0011262032,0.008086297],"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.000044520333,0.00077455275,0.00094314606,0.00010130017,0.000037557158,0.0006280225,0.0005129736,0.00015299873,0.0005096244,0.92019415,0.016429894,0.059671286],"study_design_scores_gemma":[0.0050899796,0.0075566694,0.025356574,0.0017412929,0.00013828492,0.00061017706,0.00012550743,0.20171808,0.0162152,0.5324306,0.20474333,0.0042743166],"about_ca_topic_score_codex":0.000010299448,"about_ca_topic_score_gemma":0.0000020997097,"teacher_disagreement_score":0.568633,"about_ca_system_score_codex":0.00011164027,"about_ca_system_score_gemma":0.00004509684,"threshold_uncertainty_score":0.9998152},"labels":[],"label_agreement":null},{"id":"W2184053848","doi":"","title":"A complete existence theory for Sarvate-Beam triple systems ∗","year":2012,"lang":"en","type":"article","venue":"Australas. J Comb.","topic":"graph theory and CDMA systems","field":"Engineering","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 Victoria","funders":"","keywords":"Mathematics; Cover (algebra); Block (permutation group theory); Combinatorics; Constant (computer programming); Variation (astronomy); Discrete mathematics; Computer science; Physics; Engineering","score_opus":0.037038494114212867,"score_gpt":0.23667583532448774,"score_spread":0.19963734121027488,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2184053848","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.94832665,0.0033246467,0.014988816,0.00003435745,0.009575681,0.002016173,0.00032078364,0.0013090858,0.020103835],"genre_scores_gemma":[0.9967831,0.000011016296,0.00013460444,0.00002720939,0.00036355839,0.00023378749,0.000038729664,0.000056003515,0.0023520158],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9985701,0.000088016364,0.0003613371,0.00017157351,0.00015075816,0.00065825233],"domain_scores_gemma":[0.9990734,0.00023130493,0.000058192345,0.0004015625,0.000041306477,0.00019422919],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007647242,0.00024814697,0.0003433898,0.0000829984,0.00012093741,0.00006049255,0.00028151856,0.00013160148,0.00005989477],"category_scores_gemma":[0.000027760827,0.00023260464,0.00014904382,0.00017613015,0.00006570827,0.00026233157,0.000021522324,0.00016216762,0.00022536314],"study_design_candidate":"theoretical_or_conceptual","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.00014859451,0.00018874927,0.0065313526,0.0015645688,0.00045732997,0.0000070289548,0.0018694247,0.0041696443,0.030631263,0.9223651,0.030740233,0.0013266891],"study_design_scores_gemma":[0.0054050204,0.0005412467,0.014280745,0.0007593159,0.00039126386,0.00032778882,0.0047760876,0.011755021,0.016547907,0.026571147,0.91561496,0.0030294731],"about_ca_topic_score_codex":0.000012848306,"about_ca_topic_score_gemma":0.0000016706676,"teacher_disagreement_score":0.895794,"about_ca_system_score_codex":0.000047131784,"about_ca_system_score_gemma":0.000007848616,"threshold_uncertainty_score":0.94853413},"labels":[],"label_agreement":null},{"id":"W2184414793","doi":"","title":"Diameter of paired domination edge-critical graphs","year":2008,"lang":"en","type":"article","venue":"Australas. J Comb.","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":6,"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":"Combinatorics; Dominating set; Mathematics; Domination analysis; Graph; Induced subgraph; Discrete mathematics; Vertex (graph theory)","score_opus":0.04648292806852639,"score_gpt":0.31125548283966037,"score_spread":0.264772554771134,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2184414793","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.57776475,0.00012787804,0.4163841,0.0015634617,0.00056046864,0.00036980314,0.000008708346,0.00025226414,0.0029685558],"genre_scores_gemma":[0.9655909,0.0000216449,0.03380845,0.00006045542,0.00002081439,0.000017866189,0.0000023354162,0.000010423606,0.00046709136],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9983785,0.00016287882,0.00027589515,0.0003426444,0.00044977956,0.00039025853],"domain_scores_gemma":[0.9983885,0.00056409376,0.000056640274,0.00064817094,0.00019954,0.00014300726],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003229542,0.00013449254,0.00020977354,0.00023749373,0.00012845965,0.00002515862,0.0008140093,0.00007679323,0.000053601212],"category_scores_gemma":[0.00030150192,0.0001274722,0.00012179925,0.000683923,0.0005194671,0.00057624077,0.00019247949,0.00020653696,0.00006152481],"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.000048956314,0.000449708,0.016327688,0.00006236154,0.0000430876,0.0001382173,0.0009340825,0.000046281533,0.0128566995,0.94296956,0.0038091121,0.022314219],"study_design_scores_gemma":[0.0023312727,0.0010648571,0.16721442,0.00010228289,0.000022767412,0.00027898536,0.00008632693,0.0062852693,0.14300136,0.6761329,0.0026027905,0.00087673205],"about_ca_topic_score_codex":0.000008535648,"about_ca_topic_score_gemma":0.0000018012253,"teacher_disagreement_score":0.38782617,"about_ca_system_score_codex":0.000023697627,"about_ca_system_score_gemma":0.00005133101,"threshold_uncertainty_score":0.5198165},"labels":[],"label_agreement":null},{"id":"W2184743223","doi":"","title":"Eternal domination on 3 × n grid graphs","year":2015,"lang":"en","type":"article","venue":"Australas. J Comb.","topic":"Advanced Graph Theory Research","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":"Mount Allison University; St. Francis Xavier University","funders":"","keywords":"Dominating set; Vertex (graph theory); Domination analysis; Combinatorics; Mathematics; Grid; Graph; Computer science; Discrete mathematics","score_opus":0.06277409480743021,"score_gpt":0.32890396252145476,"score_spread":0.2661298677140246,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2184743223","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.8297625,0.000082578685,0.1359447,0.0038417575,0.0029174911,0.0006342936,0.000012244332,0.0006617466,0.02614264],"genre_scores_gemma":[0.99113524,0.0000061214664,0.007035083,0.00020477374,0.00008721003,0.000019404839,0.0000044801864,0.000011674795,0.0014960184],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9982988,0.00013788702,0.00017859784,0.00037044744,0.00062023336,0.00039402052],"domain_scores_gemma":[0.9987368,0.00013461041,0.000066854496,0.0006409417,0.00015327497,0.00026752916],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005608665,0.00014613336,0.00013599292,0.0002400186,0.00008689635,0.0001298607,0.001067358,0.00006339391,0.000021791662],"category_scores_gemma":[0.00010800134,0.00013235676,0.000070500006,0.000533836,0.000097217344,0.00058803416,0.00019151361,0.00028906422,0.00045545175],"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.000080618265,0.00019009213,0.0040323418,0.000008856333,0.00002599397,0.00009680022,0.0004631076,0.0006205572,0.0009083596,0.9433077,0.015294286,0.034971304],"study_design_scores_gemma":[0.003223528,0.0016274598,0.02506436,0.00006776199,0.000009386073,0.00010416142,0.00009927668,0.0072889156,0.02535114,0.90796757,0.028455438,0.00074099726],"about_ca_topic_score_codex":0.000013940545,"about_ca_topic_score_gemma":0.0000045373145,"teacher_disagreement_score":0.16137269,"about_ca_system_score_codex":0.00006965848,"about_ca_system_score_gemma":0.000059624963,"threshold_uncertainty_score":0.5854063},"labels":[],"label_agreement":null},{"id":"W2188243551","doi":"","title":"A class of trees with equal broadcast and domination numbers","year":2013,"lang":"en","type":"article","venue":"Australas. J Comb.","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 Victoria","funders":"","keywords":"Combinatorics; Mathematics; Vertex (graph theory); Bounded function; Graph; Class (philosophy); Domination analysis; Dominating set; Discrete mathematics; Computer science; Artificial intelligence","score_opus":0.01560847507420745,"score_gpt":0.2673208201156543,"score_spread":0.25171234504144685,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2188243551","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.9352217,0.000033610715,0.061264362,0.000638965,0.00004552686,0.00031078636,0.000002117751,0.000062981446,0.0024199653],"genre_scores_gemma":[0.9867876,0.000007794928,0.012377435,0.000028338627,0.000010516701,0.000023546925,0.0000013644345,0.000007712421,0.0007557002],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"observational","domain_scores_codex":[0.9989712,0.0000709457,0.00015366443,0.00025740237,0.0002868545,0.0002598864],"domain_scores_gemma":[0.999162,0.00016986653,0.000077681354,0.00035589605,0.00012924551,0.000105315456],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00016450594,0.00010966475,0.00014876298,0.000114590875,0.000057790287,0.00007889617,0.000410824,0.00004451031,0.00004211541],"category_scores_gemma":[0.000025961344,0.00008771137,0.000024948362,0.00035741436,0.00024543822,0.0007429307,0.00013758356,0.00013227743,0.0000312097],"study_design_candidate":"theoretical_or_conceptual","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.00010759766,0.00030993734,0.04540276,0.00009954098,0.00011391473,0.000031471427,0.0025956463,0.00039800952,0.023825556,0.6916757,0.0024693387,0.23297048],"study_design_scores_gemma":[0.009571645,0.0043700123,0.5324977,0.0003654585,0.000054961198,0.00034294414,0.0019147719,0.04997595,0.075443745,0.31809682,0.0055149025,0.0018510892],"about_ca_topic_score_codex":0.00008296111,"about_ca_topic_score_gemma":0.000040269853,"teacher_disagreement_score":0.48709494,"about_ca_system_score_codex":0.000017896615,"about_ca_system_score_gemma":0.00003016552,"threshold_uncertainty_score":0.3576766},"labels":[],"label_agreement":null},{"id":"W2188854178","doi":"","title":"The modular product and existential closure II","year":2012,"lang":"en","type":"article","venue":"Australas. J Comb.","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":"Memorial University of Newfoundland","funders":"","keywords":"Combinatorics; Mathematics; Graph; Adjacency list; Adjacency matrix; Modular design; Closure (psychology); Discrete mathematics; Computer science","score_opus":0.025296255952936945,"score_gpt":0.28952756527783374,"score_spread":0.2642313093248968,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2188854178","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.9799583,0.002075799,0.009354964,0.003995957,0.0010514794,0.00050215685,0.0000028088443,0.0002027356,0.0028558208],"genre_scores_gemma":[0.99274623,0.00007011536,0.0032898388,0.000041817922,0.00018859252,0.000021378442,0.0000010141663,0.000010714099,0.003630268],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9984451,0.00013531285,0.00015213151,0.00029739988,0.0003402465,0.0006298037],"domain_scores_gemma":[0.99876475,0.00011010021,0.00004880157,0.0008274076,0.00006814209,0.00018081041],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007474927,0.00013431959,0.0001142415,0.00004893035,0.0006507089,0.00013418286,0.00084428035,0.000040773466,0.000011636982],"category_scores_gemma":[0.00007791495,0.00009309121,0.00005116342,0.00030089077,0.0002522074,0.0008305603,0.00061740074,0.0002655323,0.00004066814],"study_design_candidate":"theoretical_or_conceptual","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.000028876962,0.00015788905,0.017603453,0.000021478261,0.00006372913,0.000010429872,0.00097076106,0.000052428226,0.004509016,0.93856275,0.0043375758,0.033681616],"study_design_scores_gemma":[0.002137254,0.0008208208,0.20281355,0.000057673144,0.000047778256,0.00043657777,0.00026814695,0.0037371772,0.0381599,0.20813954,0.5419957,0.0013858896],"about_ca_topic_score_codex":0.000007112335,"about_ca_topic_score_gemma":0.000002250015,"teacher_disagreement_score":0.7304232,"about_ca_system_score_codex":0.000016939546,"about_ca_system_score_gemma":0.00002390708,"threshold_uncertainty_score":0.5004793},"labels":[],"label_agreement":null},{"id":"W2739569002","doi":"","title":"Even time constraints on the watchman's walk.","year":2013,"lang":"en","type":"article","venue":"Australas. J Comb.","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":"St. Francis Xavier University","funders":"","keywords":"Neighbourhood (mathematics); Traverse; Combinatorics; Vertex (graph theory); Mathematics; Conjecture; Tree (set theory); Interval (graph theory); Computer science; Discrete mathematics; Graph; Geography; Cartography","score_opus":0.0222203577737518,"score_gpt":0.26578216034643154,"score_spread":0.24356180257267973,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2739569002","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.75913024,0.00006804003,0.026530592,0.061677746,0.00090351736,0.0030702972,0.000020896523,0.0011273177,0.14747134],"genre_scores_gemma":[0.9877369,0.0000048985066,0.0020503544,0.00082370767,0.000049132745,0.00007773884,0.0000025424317,0.000015725838,0.00923902],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9980386,0.00021665568,0.00020926066,0.00042664865,0.00048624375,0.0006226134],"domain_scores_gemma":[0.99782443,0.0006559882,0.00006531252,0.0011550982,0.00011723118,0.00018193504],"candidate_categories":["insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.00044768213,0.00019950751,0.0001741102,0.00009051392,0.00022732324,0.00022376534,0.0019620936,0.00007553203,0.0025262896],"category_scores_gemma":[0.00010775977,0.00013182127,0.000095262396,0.00041283594,0.00043891044,0.00048577224,0.00034647866,0.00043579563,0.011222152],"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.0000118510825,0.0002070277,0.00060523814,0.000011350033,0.00008167388,0.000050326318,0.0005353563,0.00013094171,0.00807544,0.78900516,0.10500768,0.096277945],"study_design_scores_gemma":[0.0016651446,0.0010172473,0.039954495,0.00015088741,0.000016426113,0.00013077493,0.00024684973,0.015338681,0.029233566,0.87910044,0.031763755,0.0013817423],"about_ca_topic_score_codex":0.000020823787,"about_ca_topic_score_gemma":0.000001100588,"teacher_disagreement_score":0.22860663,"about_ca_system_score_codex":0.000042557826,"about_ca_system_score_gemma":0.00005128444,"threshold_uncertainty_score":0.99838555},"labels":[],"label_agreement":null},{"id":"W2739627166","doi":"","title":"A class of mutually inequivalent circulant weighing matrices.","year":2012,"lang":"en","type":"article","venue":"Australas. J Comb.","topic":"Coding theory and cryptography","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":"Carleton University","funders":"","keywords":"Circulant matrix; Mathematics; Combinatorics; Order (exchange); Prime (order theory); Matrix (chemical analysis); Weight function; Prime power; Euler's totient function; Ternary operation; Discrete mathematics; Class (philosophy); Euler's formula; Mathematical analysis","score_opus":0.023509549341280165,"score_gpt":0.250974437196984,"score_spread":0.22746488785570382,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2739627166","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.9308344,0.0004996554,0.060376,0.00045399077,0.0012879962,0.00019061641,0.000005000757,0.0002605049,0.0060918247],"genre_scores_gemma":[0.99473965,0.00002447006,0.0048890607,0.0001223222,0.000119466145,0.000007718256,0.0000019255583,0.000009538278,0.00008586361],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"observational","domain_scores_codex":[0.9985722,0.00009680298,0.00031188136,0.000232673,0.0003125458,0.00047394447],"domain_scores_gemma":[0.9988704,0.00013747372,0.00015765514,0.0006087948,0.000055143373,0.00017058608],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005919345,0.00016180206,0.00022093495,0.00018352084,0.00008479506,0.00005933404,0.0009016961,0.00007485114,0.00007020604],"category_scores_gemma":[0.000023434179,0.00014844011,0.00015954813,0.00057571224,0.00006804882,0.00057655096,0.00027551432,0.00017889767,0.00006183363],"study_design_candidate":"theoretical_or_conceptual","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.000015333566,0.00038513515,0.037478216,0.00009424316,0.000092220194,0.000012860837,0.0021041688,0.00004407132,0.0065552597,0.9361264,0.002206071,0.014885989],"study_design_scores_gemma":[0.006384505,0.0020808221,0.5482679,0.0011096353,0.00049283175,0.0005769682,0.0012676225,0.010771241,0.08517919,0.15377145,0.18535191,0.0047459523],"about_ca_topic_score_codex":0.000017407367,"about_ca_topic_score_gemma":0.0000012536754,"teacher_disagreement_score":0.78235495,"about_ca_system_score_codex":0.000024429848,"about_ca_system_score_gemma":0.00003308771,"threshold_uncertainty_score":0.6053212},"labels":[],"label_agreement":null},{"id":"W2739728626","doi":"","title":"Seepage in directed acyclic graphs.","year":2009,"lang":"en","type":"article","venue":"Australas. J Comb.","topic":"Artificial Intelligence in Games","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 Prince Edward Island; Dalhousie University; St. Francis Xavier University; Acadia University","funders":"","keywords":"Cartesian product; Directed acyclic graph; Combinatorics; Directed graph; Vertex (graph theory); Sink (geography); Graph; Mathematics; Cartesian coordinate system; Computer science; Discrete mathematics; Geography; Geometry; Cartography","score_opus":0.027793257691119722,"score_gpt":0.2917460034780117,"score_spread":0.263952745786892,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2739728626","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.9742477,0.000105883315,0.0092054615,0.004268303,0.00059752195,0.00030390144,0.0000015238298,0.00089413364,0.010375567],"genre_scores_gemma":[0.99285024,0.000024412218,0.0058129746,0.0005792743,0.000033292825,0.0000077624145,0.000001885075,0.0000072551325,0.00068291585],"study_design_codex":"design_other","study_design_gemma":"observational","domain_scores_codex":[0.9983674,0.000080125574,0.00035866495,0.00043594692,0.0002649076,0.00049291365],"domain_scores_gemma":[0.99899065,0.00010747383,0.00007498525,0.00065895665,0.00004800601,0.000119946555],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00021630037,0.00018262517,0.00021200911,0.00023055257,0.00007070114,0.00014321704,0.0011370498,0.000102471466,0.000059757367],"category_scores_gemma":[0.000078081284,0.0001807244,0.00008103653,0.0010399066,0.000068742236,0.00055721076,0.000099290184,0.0002752433,0.00030581586],"study_design_candidate":"observational","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.0000325466,0.0010871624,0.064988144,0.000016481377,0.000037703438,0.0005760957,0.0046534985,0.0009301897,0.016797872,0.36757982,0.019293575,0.5240069],"study_design_scores_gemma":[0.0004284066,0.00047535697,0.6076493,0.00011006142,0.00001136114,0.00004868868,0.00012410972,0.03016542,0.06836322,0.28093505,0.010634729,0.0010542753],"about_ca_topic_score_codex":0.00012398588,"about_ca_topic_score_gemma":0.00011068241,"teacher_disagreement_score":0.5426612,"about_ca_system_score_codex":0.00004843117,"about_ca_system_score_gemma":0.000036111993,"threshold_uncertainty_score":0.7369727},"labels":[],"label_agreement":null},{"id":"W2740078596","doi":"","title":"Edge contraction and cop-win critical graphs.","year":2015,"lang":"en","type":"article","venue":"Australas. J Comb.","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 Prince Edward Island","funders":"","keywords":"Edge contraction; Combinatorics; Graph; Mathematics; Vertex (graph theory); Computer science; Discrete mathematics; Line graph; Voltage graph","score_opus":0.06036837910370964,"score_gpt":0.35186802948024765,"score_spread":0.291499650376538,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2740078596","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.6136714,0.0011088557,0.34920317,0.013988089,0.0026831464,0.0009125865,0.000017986898,0.0010158999,0.01739885],"genre_scores_gemma":[0.9919303,0.00001770062,0.007239606,0.0001889406,0.000047584756,0.000016262764,0.0000019245347,0.000010399543,0.00054725754],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9984726,0.00015094805,0.00018140252,0.00038741398,0.00036742716,0.00044023985],"domain_scores_gemma":[0.99851245,0.00038301144,0.000033146775,0.00046263353,0.00019224038,0.0004165043],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005415774,0.00014090155,0.00017259733,0.00014117878,0.00012241288,0.00017399142,0.00047961535,0.00008708614,0.000023202716],"category_scores_gemma":[0.0003716998,0.00013444146,0.00004269871,0.00037624515,0.0003339718,0.0008804335,0.00020230649,0.00031829756,0.0001105462],"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.000036528098,0.00011011263,0.004090589,0.000015267658,0.000016124834,0.000073713556,0.00025729652,0.000015756059,0.0010575689,0.9736346,0.007936715,0.012755702],"study_design_scores_gemma":[0.0021226574,0.0007174481,0.023926882,0.000043552085,0.000017764674,0.00030849068,0.00023456078,0.005395116,0.005922205,0.9347506,0.025968553,0.00059212925],"about_ca_topic_score_codex":0.000020333375,"about_ca_topic_score_gemma":0.0000063796597,"teacher_disagreement_score":0.3782589,"about_ca_system_score_codex":0.000037103255,"about_ca_system_score_gemma":0.000067403766,"threshold_uncertainty_score":0.54823637},"labels":[],"label_agreement":null},{"id":"W2740418798","doi":"","title":"Results for the n-queens problem on the Möbius board.","year":2008,"lang":"en","type":"article","venue":"Australas. J Comb.","topic":"Advanced Combinatorial Mathematics","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":"Carleton University","funders":"","keywords":"Impossibility; Combinatorics; Extension (predicate logic); Mathematics; Möbius strip; Set (abstract data type); Discrete mathematics; Computer science; Geometry","score_opus":0.13331857027828892,"score_gpt":0.33527375288947947,"score_spread":0.20195518261119055,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2740418798","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.68611526,0.0002966073,0.031776648,0.1125529,0.007625273,0.024764793,0.00049951056,0.0027508999,0.13361812],"genre_scores_gemma":[0.9693374,0.000039539234,0.01742483,0.00036639647,0.00038332623,0.00044933378,0.000005668764,0.00008738103,0.011906107],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99809235,0.0000856433,0.00055882,0.00031348204,0.0004528981,0.0004968045],"domain_scores_gemma":[0.9915976,0.006659442,0.00030757775,0.0011921917,0.0001626168,0.0000805542],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00061969756,0.00029909622,0.00032708465,0.000037561975,0.0006087767,0.000043955348,0.0007238725,0.00012850278,0.000027746462],"category_scores_gemma":[0.0017553129,0.00016224002,0.00019805497,0.00021841865,0.000219119,0.000083703475,0.00010178625,0.00041043383,0.00011325881],"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.00010967696,0.00023187356,0.000018451365,0.000055148954,0.00008002873,0.000009210943,0.0010766332,0.00008854417,0.000058087047,0.80694616,0.19105889,0.0002673037],"study_design_scores_gemma":[0.0017356361,0.00041126457,0.000183253,0.000106327694,0.000096441225,0.00003774009,0.0002970303,0.00049392524,0.0024689015,0.92248154,0.0713557,0.0003322653],"about_ca_topic_score_codex":0.000009952558,"about_ca_topic_score_gemma":0.0000073214783,"teacher_disagreement_score":0.28322217,"about_ca_system_score_codex":0.00007830525,"about_ca_system_score_gemma":0.00006415786,"threshold_uncertainty_score":0.6615956},"labels":[],"label_agreement":null},{"id":"W2741239897","doi":"","title":"Palettes in block colourings of designs.","year":2013,"lang":"en","type":"article","venue":"Australas. J Comb.","topic":"graph theory and CDMA systems","field":"Engineering","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":"McMaster University","funders":"","keywords":"Block (permutation group theory); Palette (painting); Combinatorics; Set (abstract data type); Steiner system; Computer science; Mathematics; Programming language; Operating system","score_opus":0.010623943380705287,"score_gpt":0.1830472357789416,"score_spread":0.1724232923982363,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2741239897","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.9947377,0.000085444044,0.000019786205,0.000042433447,0.00014557643,0.00019980884,0.0000017808002,0.00009335053,0.004674149],"genre_scores_gemma":[0.99950844,0.000006812246,0.000093735114,0.000023647686,0.000021105996,0.00002873563,0.0000013233484,0.000016229858,0.00029998508],"study_design_codex":"bench_or_experimental","study_design_gemma":"observational","domain_scores_codex":[0.99934274,0.000029843895,0.00023888452,0.00009108741,0.000080854,0.00021660046],"domain_scores_gemma":[0.9996765,0.000061274426,0.000026870493,0.00016808044,0.000018809122,0.000048415706],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00010867713,0.0001094603,0.00018206837,0.00008886486,0.000011797434,0.00001437415,0.00014405808,0.00007718766,0.00015586468],"category_scores_gemma":[0.000007779501,0.000108325876,0.00004502489,0.0001665098,0.000038218983,0.000096396885,0.000012233661,0.00012424495,0.00015285789],"study_design_candidate":"observational","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.000033901673,0.00038993687,0.3223766,0.0014466183,0.0003373691,0.00010763454,0.0033012726,0.03487237,0.53268915,0.023457503,0.0770735,0.003914106],"study_design_scores_gemma":[0.00235804,0.000320495,0.615798,0.00058317516,0.000047917998,0.00005788871,0.0010107822,0.0057737133,0.34948078,0.016168468,0.0071727387,0.0012280343],"about_ca_topic_score_codex":0.00006225003,"about_ca_topic_score_gemma":0.00000977952,"teacher_disagreement_score":0.29342136,"about_ca_system_score_codex":0.000013870539,"about_ca_system_score_gemma":0.0000039186743,"threshold_uncertainty_score":0.44174013},"labels":[],"label_agreement":null},{"id":"W2741373429","doi":"","title":"A construction of a class of graphs with depression three.","year":2014,"lang":"en","type":"article","venue":"Australas. J Comb.","topic":"Limits and Structures in Graph 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":"University of Victoria","funders":"","keywords":"Combinatorics; Enhanced Data Rates for GSM Evolution; Mathematics; Class (philosophy); Graph; Path (computing); Discrete mathematics; Set (abstract data type); Computer science; Artificial intelligence","score_opus":0.019508305485154705,"score_gpt":0.2614906472667648,"score_spread":0.2419823417816101,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2741373429","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.9917773,0.000016894981,0.002483148,0.000023703447,0.00014294,0.00016081912,0.000007269194,0.00003616749,0.005351772],"genre_scores_gemma":[0.9852974,0.0000041828816,0.014593464,0.0000111055715,0.000021231554,0.000005328475,0.000002020181,0.00001659987,0.000048684375],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9990476,0.00006502291,0.00031799602,0.00016630472,0.00024319503,0.00015991794],"domain_scores_gemma":[0.9988572,0.0002582767,0.00030005857,0.00042775986,0.00010624049,0.00005044663],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00021512168,0.0001399006,0.00032136246,0.00010301174,0.00006612621,0.0000055591327,0.00018057201,0.000110623216,0.000071307026],"category_scores_gemma":[0.00008105615,0.000095831325,0.00009173649,0.00017047786,0.0003714523,0.00006468023,0.00005306916,0.0001428882,6.6403845e-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.00011568226,0.00006065033,0.099392235,0.00018553439,0.00007901951,8.6988706e-7,0.00023295941,0.000010710788,0.001485904,0.8941743,0.00023404456,0.0040281257],"study_design_scores_gemma":[0.0009141134,0.0002837489,0.029049614,0.0001856672,0.00010242035,0.000036731282,0.00011003257,0.000116924486,0.022666976,0.9461534,0.0002279832,0.0001523595],"about_ca_topic_score_codex":0.000021460175,"about_ca_topic_score_gemma":0.00003075064,"teacher_disagreement_score":0.07034262,"about_ca_system_score_codex":0.0000060266866,"about_ca_system_score_gemma":0.0000151777,"threshold_uncertainty_score":0.3907888},"labels":[],"label_agreement":null},{"id":"W2741567607","doi":"","title":"A sharp lower bound on the number of hyperedges in a friendship 3-hypergraph.","year":2013,"lang":"en","type":"article","venue":"Australas. J Comb.","topic":"graph theory and CDMA systems","field":"Engineering","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 Manitoba","funders":"","keywords":"Hypergraph; Combinatorics; Element (criminal law); Friendship; Mathematics; Upper and lower bounds; Set (abstract data type); Discrete mathematics; Computer science; Mathematical analysis; Law; Social psychology","score_opus":0.013924922391757334,"score_gpt":0.21376289317708466,"score_spread":0.19983797078532733,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2741567607","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.9632745,0.000055264423,0.00000340589,0.00016731203,0.00036253087,0.00022425373,0.00000761474,0.00007276179,0.03583236],"genre_scores_gemma":[0.9993509,0.000009244558,0.000012302668,0.000055004122,0.000037757047,0.00008137464,0.0000023902874,0.00002532224,0.00042567466],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"observational","domain_scores_codex":[0.99911726,0.000058944355,0.00025914807,0.00013994171,0.00014199379,0.0002827229],"domain_scores_gemma":[0.99936324,0.0001571308,0.00003248892,0.00036448194,0.000025828356,0.000056833625],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00017445776,0.0001654813,0.00020785273,0.0000713922,0.000034947883,0.00003777271,0.00025343942,0.00009937615,0.0011787607],"category_scores_gemma":[0.000019674495,0.0001192937,0.00009505569,0.00029344374,0.000082070525,0.000109565604,0.000017813696,0.00023882174,0.00050660357],"study_design_candidate":"observational","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.000098714634,0.0007183132,0.30576652,0.00051079644,0.00045538365,0.000055060587,0.0034093773,0.0030282144,0.030602181,0.61151576,0.040331908,0.0035077594],"study_design_scores_gemma":[0.0031523255,0.00043795205,0.779898,0.0011773739,0.00009192668,0.000120300385,0.0039107967,0.0033707786,0.035769247,0.14176363,0.028334634,0.001973023],"about_ca_topic_score_codex":0.00012414232,"about_ca_topic_score_gemma":0.000024146488,"teacher_disagreement_score":0.4741315,"about_ca_system_score_codex":0.000016802505,"about_ca_system_score_gemma":0.0000064642973,"threshold_uncertainty_score":0.9997343},"labels":[],"label_agreement":null},{"id":"W2753131102","doi":"","title":"Progressions of squares.","year":2003,"lang":"en","type":"article","venue":"Australas. J Comb.","topic":"Mathematics and Applications","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":"Simon Fraser University","funders":"","keywords":"Mathematics; Arithmetic; Set (abstract data type); Computer science; Programming language","score_opus":0.11107815914143758,"score_gpt":0.3863829455289312,"score_spread":0.2753047863874936,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2753131102","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.86230856,0.00007607519,0.004739255,0.0006358395,0.00013533625,0.0010234748,0.000032410127,0.00018641,0.13086265],"genre_scores_gemma":[0.9565061,0.0000050273597,0.040355362,0.000012057432,0.000011603861,0.00005840628,0.0000024706467,0.000016352527,0.0030326284],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9992312,0.000028548166,0.00029338492,0.00011975814,0.00016209492,0.00016499682],"domain_scores_gemma":[0.99911153,0.00019739973,0.00013981518,0.00041853834,0.00006413308,0.00006855463],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001820252,0.000097127755,0.00018144886,0.00003926624,0.00006027272,0.000011526177,0.00014508404,0.000056900655,0.0006427845],"category_scores_gemma":[0.00020053308,0.00007990081,0.00007080973,0.00016224635,0.00005953536,0.00003006786,0.000020776193,0.00009070815,0.000045103356],"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":[9.737424e-7,0.00041699616,0.0008926239,0.00012407094,0.000021544403,0.0000010606177,0.00020298046,0.0000013595103,0.0010457858,0.93779874,0.05917989,0.0003139597],"study_design_scores_gemma":[0.0006982699,0.000101927704,0.00076198264,0.00020417286,0.00009957553,0.000022869404,0.00040584567,0.00011749328,0.04653888,0.850966,0.09973792,0.0003451009],"about_ca_topic_score_codex":0.0000025892887,"about_ca_topic_score_gemma":0.000002850868,"teacher_disagreement_score":0.12783003,"about_ca_system_score_codex":0.000008829494,"about_ca_system_score_gemma":0.00003254781,"threshold_uncertainty_score":0.70380396},"labels":[],"label_agreement":null},{"id":"W2962842387","doi":"","title":"Edge Decompositions of Hypercubes by Paths","year":2013,"lang":"en","type":"article","venue":"Australas. J Comb.","topic":"Interconnection Networks and Systems","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":"Royal Canadian Navy","funders":"","keywords":"Hypercube; Combinatorics; Path (computing); Disjoint sets; Enhanced Data Rates for GSM Evolution; Mathematics; Disjoint union (topology); Discrete mathematics; Computer science; Telecommunications; Computer network","score_opus":0.009294119659840214,"score_gpt":0.21715592735450945,"score_spread":0.20786180769466922,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2962842387","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.8200601,0.00020417101,0.1566257,0.0021771777,0.0020930031,0.00048231278,0.000014130945,0.00025644986,0.018086951],"genre_scores_gemma":[0.9957156,0.000007755502,0.0020600501,0.00016634336,0.00006524411,0.000030712083,0.000005313514,0.0000066210223,0.0019423303],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9990787,0.00005963594,0.00028653085,0.00020938889,0.00014356234,0.00022221752],"domain_scores_gemma":[0.9992383,0.00007979481,0.000078406694,0.00039200662,0.00012366609,0.00008782074],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00010050864,0.00010756967,0.00017237842,0.000055689707,0.00008597119,0.000108678745,0.00049290265,0.00006887059,0.00025849088],"category_scores_gemma":[0.000006957001,0.00009484725,0.000083230094,0.0001925949,0.000040758376,0.00040834883,0.00008195503,0.000105434105,0.0003075618],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","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.000002473628,0.00034068868,0.0050181183,0.000038891194,0.000078467005,0.0000056370504,0.0007814818,0.0002609059,0.036738686,0.08598468,0.85675865,0.01399131],"study_design_scores_gemma":[0.004906821,0.003125166,0.10437044,0.0009370457,0.000117451185,0.00083940855,0.001602104,0.33625874,0.15765163,0.042978004,0.34322608,0.0039871274],"about_ca_topic_score_codex":0.00029949917,"about_ca_topic_score_gemma":0.000009006445,"teacher_disagreement_score":0.5135326,"about_ca_system_score_codex":0.000019820884,"about_ca_system_score_gemma":0.000017365956,"threshold_uncertainty_score":0.39531872},"labels":[],"label_agreement":null},{"id":"W2963701486","doi":"","title":"Some Constructions for Amicable Orthogonal Designs","year":2015,"lang":"en","type":"article","venue":"Australas. J Comb.","topic":"graph theory and CDMA systems","field":"Engineering","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":"York University","funders":"","keywords":"Disjoint sets; Orthogonal array; Mathematics; Combinatorial design; Construct (python library); Combinatorics; Kronecker product; Notation; Product (mathematics); Discrete mathematics; Arithmetic; Computer science; Computer network","score_opus":0.06524877658368881,"score_gpt":0.25054375355455266,"score_spread":0.18529497697086383,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2963701486","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.9813069,0.00028287215,0.008399842,0.00008888742,0.0027067738,0.0004959868,0.000089363915,0.0006618376,0.005967536],"genre_scores_gemma":[0.9975741,0.0000049412665,0.0010253373,0.000020792359,0.00023150026,0.00007466997,0.000022107643,0.000026277496,0.0010202712],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99929595,0.000023106622,0.00018670633,0.00012463547,0.00009333377,0.00027628976],"domain_scores_gemma":[0.9995328,0.00005884355,0.000022031401,0.00018341636,0.000047572128,0.00015529583],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00017090121,0.00012863183,0.00016167153,0.00006470221,0.000067043744,0.00003361579,0.00012364921,0.00008692909,0.00003929704],"category_scores_gemma":[0.000017354096,0.00013120394,0.00007814374,0.00011354242,0.0000635106,0.00017743408,0.0000097865795,0.0001068134,0.000102252125],"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.000055863977,0.000090801346,0.00690717,0.00018757238,0.000309816,0.000012653004,0.000513714,0.0305321,0.011592037,0.83506054,0.11303798,0.0016997799],"study_design_scores_gemma":[0.008057394,0.0008179198,0.0062049455,0.00022424501,0.0003458177,0.00059775705,0.0034946587,0.03050193,0.0440803,0.57206434,0.33103254,0.002578133],"about_ca_topic_score_codex":0.000004978732,"about_ca_topic_score_gemma":0.0000052204227,"teacher_disagreement_score":0.26299614,"about_ca_system_score_codex":0.00003348311,"about_ca_system_score_gemma":0.000028632508,"threshold_uncertainty_score":0.5350342},"labels":[],"label_agreement":null},{"id":"W2963962749","doi":"","title":"Revisiting the spread and covering numbers.","year":2013,"lang":"en","type":"article","venue":"Australas. J Comb.","topic":"Advanced Combinatorial Mathematics","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":"Lakehead University","funders":"","keywords":"Integer (computer science); Combinatorics; Connection (principal bundle); Mathematics; Construct (python library); Upper and lower bounds; Discrete mathematics; Computer science","score_opus":0.03780943260618011,"score_gpt":0.3039053561575414,"score_spread":0.26609592355136125,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2963962749","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.9827165,0.00007470818,0.0019995973,0.0016457845,0.00036964056,0.000683516,0.0000021947478,0.00021815333,0.012289929],"genre_scores_gemma":[0.98615134,0.00002033615,0.012036094,0.000087368404,0.0002490744,0.000047420308,8.550945e-7,0.000040691564,0.0013668482],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9988864,0.000051461902,0.0003235616,0.00019914108,0.00022088143,0.0003185493],"domain_scores_gemma":[0.9982156,0.0009778443,0.00016866496,0.0004772522,0.00007406762,0.00008654568],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00024732924,0.00018897347,0.00025698732,0.000023988845,0.00016896334,0.00012692306,0.00025140174,0.00007444007,0.0001909119],"category_scores_gemma":[0.0006120261,0.00013725655,0.000053862386,0.00012353976,0.00009391346,0.00025602485,0.00016794458,0.00026050504,0.00015877519],"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.0000052365076,0.00005387424,0.0029568176,0.00040023282,0.00008326945,0.0000108324,0.0012878681,0.000010823058,0.001478441,0.97521675,0.00786448,0.010631385],"study_design_scores_gemma":[0.0004108695,0.00002744755,0.0014320614,0.00018278148,0.00004753734,0.00004703209,0.00053081673,0.000316153,0.0011470543,0.99253386,0.003069072,0.00025529877],"about_ca_topic_score_codex":0.000039960178,"about_ca_topic_score_gemma":0.0000018007813,"teacher_disagreement_score":0.017317137,"about_ca_system_score_codex":0.00003703446,"about_ca_system_score_gemma":0.000012572958,"threshold_uncertainty_score":0.5597159},"labels":[],"label_agreement":null},{"id":"W71863754","doi":"","title":"Minimal and near-minimal critical sets in back-circulant latin squares","year":2003,"lang":"en","type":"article","venue":"Australas. J Comb.","topic":"graph theory and CDMA systems","field":"Engineering","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 Manitoba","funders":"","keywords":"Latin square; Circulant matrix; Mathematics; Combinatorics; Square (algebra); Conjecture; Cardinality (data modeling); Set (abstract data type); Discrete mathematics; Geometry; Computer science","score_opus":0.017913105463955546,"score_gpt":0.24115261198602986,"score_spread":0.2232395065220743,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W71863754","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.989753,0.00029334176,0.00003240782,0.000051950898,0.00029744647,0.00013050715,0.000013235134,0.00008776212,0.0093403375],"genre_scores_gemma":[0.9993836,0.000008920022,0.0003761401,0.000024029694,0.00002434592,0.00001451398,0.0000045923757,0.00002711992,0.00013671929],"study_design_codex":"observational","study_design_gemma":"observational","domain_scores_codex":[0.9988786,0.00010058807,0.00028611033,0.0002106518,0.0001240864,0.000399962],"domain_scores_gemma":[0.9994825,0.0001679933,0.0000143882835,0.00018429598,0.000015429106,0.00013537628],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00022336961,0.00019040077,0.0002460469,0.00008910106,0.00005372602,0.00007207706,0.000090992085,0.00013664788,0.00033316662],"category_scores_gemma":[0.00006564466,0.00019503315,0.00005118201,0.0001964311,0.00012280658,0.00011839083,0.0000142388335,0.00023533164,0.0001290865],"study_design_candidate":"observational","study_design_consensus":"observational","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.00015318191,0.00053243665,0.5982187,0.001937278,0.00024248146,0.0009893999,0.0063402834,0.0054643326,0.021207998,0.34776515,0.013781346,0.0033674564],"study_design_scores_gemma":[0.0060717813,0.0008684995,0.8623948,0.0009203847,0.0001369373,0.0009631286,0.0036808236,0.027256222,0.016056152,0.019673092,0.058896586,0.0030815967],"about_ca_topic_score_codex":0.000017579154,"about_ca_topic_score_gemma":0.000022347456,"teacher_disagreement_score":0.32809204,"about_ca_system_score_codex":0.000020090021,"about_ca_system_score_gemma":0.0000138230735,"threshold_uncertainty_score":0.7953221},"labels":[],"label_agreement":null}]}