{"meta":{"query_hash":"8a77b03eb5ea","filters":{"venue":"The Australasian Journal of Combinatorics"},"cohort_total":11,"direct_labels_cover":0,"predictions_cover":11,"exported":11,"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/8a77b03eb5ea","api":"https://metacan.xera.ac/api/v1/cohort?venue=The+Australasian+Journal+of+Combinatorics"},"results":[{"id":"W23801234","doi":"10.1701/1295.14331","title":"On vertex-magic and edge-magic total injections of graphs","year":2002,"lang":"en","type":"article","venue":"The Australasian Journal of Combinatorics","topic":"Graph Labeling and Dimension Problems","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":"Carleton University","funders":"","keywords":"Combinatorics; MAGIC (telescope); Vertex (graph theory); Mathematics; Graph; Discrete mathematics; Physics; Quantum mechanics","score_opus":0.015049336506013632,"score_gpt":0.21743340742892694,"score_spread":0.2023840709229133,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W23801234","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.9900748,0.00088023837,0.0013392473,0.0030954264,0.001622401,0.00009304757,0.0000012077071,0.000029403935,0.0028642416],"genre_scores_gemma":[0.9990387,0.00011305089,0.00039082018,0.00007033909,0.0000063126713,3.7468953e-7,7.673462e-8,0.0000071722357,0.0003731387],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9987636,0.000101701386,0.00042141095,0.00013040853,0.00037925882,0.0002036128],"domain_scores_gemma":[0.99873334,0.00017399955,0.00035001026,0.0003594963,0.00024245713,0.0001406892],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004285109,0.00013361197,0.00022954195,0.00026426392,0.00012832816,0.00007663994,0.00053838635,0.000056043547,0.000017913651],"category_scores_gemma":[0.00008390693,0.0000906492,0.00012298184,0.0007299383,0.0001593727,0.00027628714,0.00006865559,0.000396708,0.0000143099105],"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.000009260104,0.00029727945,0.00066841074,0.000014055078,0.00005226834,0.000026476097,0.0008084425,0.00031477158,0.00037159407,0.98900664,0.005870437,0.0025603895],"study_design_scores_gemma":[0.0010248509,0.0013028292,0.003422815,0.000098859775,0.000043301552,0.00082214543,0.000087347296,0.0022424643,0.0010044854,0.98962843,0.0001753876,0.00014705132],"about_ca_topic_score_codex":0.0000038349435,"about_ca_topic_score_gemma":2.3405364e-7,"teacher_disagreement_score":0.008963929,"about_ca_system_score_codex":0.000018237562,"about_ca_system_score_gemma":0.000026217192,"threshold_uncertainty_score":0.3696567},"labels":[],"label_agreement":null},{"id":"W2567441696","doi":"","title":"Inflection points of coherent reliability polynomials","year":2011,"lang":"en","type":"article","venue":"The Australasian Journal of Combinatorics","topic":"Mathematical functions and polynomials","field":"Mathematics","cited_by":5,"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","funders":"","keywords":"Mathematics; Inflection point; Inflection; Reliability (semiconductor); Combinatorics; Geometry; Computer science; Artificial intelligence; Physics","score_opus":0.07947958899832963,"score_gpt":0.30678289967018035,"score_spread":0.22730331067185072,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2567441696","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.9845108,0.00004392397,0.0028786324,0.00045260586,0.0010608769,0.00025492074,0.0000041220896,0.000017745582,0.010776398],"genre_scores_gemma":[0.9967914,0.000019865267,0.0025135593,0.000015341539,0.00009049888,0.0000027711142,1.6711053e-7,0.000017372766,0.00054899364],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9980569,0.00024325473,0.0011130896,0.00008688554,0.00030012944,0.0001997564],"domain_scores_gemma":[0.9974329,0.0005859936,0.0010490763,0.0004352172,0.00037445282,0.00012236446],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0019870978,0.00015330475,0.00047951788,0.00010961668,0.000081423015,0.000015886997,0.00039159736,0.000103630984,0.0006124649],"category_scores_gemma":[0.0010763332,0.00009514785,0.00025027458,0.00027886048,0.00013501826,0.00014567963,0.000043372438,0.0003411947,0.000014005645],"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.00041070694,0.0018549955,0.0056644655,0.00037615767,0.00030161647,0.000012182128,0.0045316988,0.0000049225364,0.0020715266,0.96259475,0.021208474,0.00096849684],"study_design_scores_gemma":[0.00062129606,0.0006164819,0.0030010017,0.00010449238,0.00018585539,0.000117372336,0.00034983674,0.000006768892,0.027981536,0.966113,0.00079284277,0.00010957243],"about_ca_topic_score_codex":0.000012060478,"about_ca_topic_score_gemma":0.0000013195332,"teacher_disagreement_score":0.02591001,"about_ca_system_score_codex":0.000069948226,"about_ca_system_score_gemma":0.00009338511,"threshold_uncertainty_score":0.6706061},"labels":[],"label_agreement":null},{"id":"W2591699638","doi":"","title":"Vertex-disjoint cycles containing specified edges in a bipartite graph","year":2001,"lang":"en","type":"article","venue":"The Australasian Journal of Combinatorics","topic":"graph theory and CDMA systems","field":"Engineering","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":"Combinatorics; Mathematics; Bipartite graph; Disjoint sets; Complete bipartite graph; Vertex (graph theory); Graph; Discrete mathematics","score_opus":0.01967958250240626,"score_gpt":0.224978922846505,"score_spread":0.20529934034409875,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2591699638","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.99202496,0.00090121187,0.00039292566,0.00024126194,0.0014779379,0.00009764457,9.990207e-7,0.000043446184,0.0048196227],"genre_scores_gemma":[0.9994827,0.00030391253,0.0000136067365,0.0000140157445,0.000096030926,0.0000028184102,3.9734354e-7,0.000025933357,0.0000605837],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99864084,0.00012203829,0.00058965606,0.00007925843,0.00023872481,0.00032947084],"domain_scores_gemma":[0.9993178,0.00011523439,0.00015800165,0.00022410095,0.000063119645,0.00012171962],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007818512,0.00017858675,0.0003382675,0.0002506204,0.000067303125,0.00005852,0.00039621655,0.00007941693,0.000037369096],"category_scores_gemma":[0.00003383104,0.00013298028,0.00015524407,0.0005800316,0.0000691503,0.00021223247,0.000016860777,0.0005093257,0.000016080552],"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.0012111411,0.00080542796,0.20390284,0.00036230215,0.0010645135,0.00333076,0.021971624,0.029259482,0.015114319,0.69910806,0.008050591,0.015818937],"study_design_scores_gemma":[0.007991845,0.0014799931,0.2176648,0.0016200984,0.00023617512,0.0042838943,0.019018784,0.0015913479,0.026232306,0.70117235,0.017289765,0.0014186294],"about_ca_topic_score_codex":0.000003153588,"about_ca_topic_score_gemma":0.00000668702,"teacher_disagreement_score":0.027668135,"about_ca_system_score_codex":0.000068224224,"about_ca_system_score_gemma":0.000019932926,"threshold_uncertainty_score":0.5422778},"labels":[],"label_agreement":null},{"id":"W2594427453","doi":"","title":"Weighted Ramsey problem","year":2006,"lang":"en","type":"article","venue":"The Australasian Journal of Combinatorics","topic":"Limits and Structures in Graph Theory","field":"Mathematics","cited_by":2,"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; Mathematical economics; Statistics","score_opus":0.015688198503357967,"score_gpt":0.26270673195593686,"score_spread":0.2470185334525789,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2594427453","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.97027546,0.00031060365,0.0014853245,0.0015370579,0.0013464736,0.00022904873,0.0000031756692,0.000046025318,0.024766846],"genre_scores_gemma":[0.9956492,0.000018155213,0.0023218642,0.000033347496,0.00032205874,0.0000013082139,4.779555e-7,0.000027569024,0.0016259984],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99832135,0.00016713586,0.00066549145,0.000091007314,0.00046702518,0.00028798485],"domain_scores_gemma":[0.99836665,0.00031322322,0.0006453474,0.00033865432,0.00025330568,0.00008281386],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009105495,0.0001834096,0.00032301014,0.000117462245,0.0002648301,0.00005597016,0.00066801376,0.0001062273,0.00006516274],"category_scores_gemma":[0.00007021419,0.000104998966,0.0002219716,0.0003294602,0.00015208483,0.000141711,0.000064021,0.00055309787,0.0000039944644],"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.000031138436,0.00010949461,0.0011796159,0.000026869822,0.000059517668,0.000041728556,0.0003317464,0.0000068782247,0.00007720633,0.98280936,0.014936007,0.0003904389],"study_design_scores_gemma":[0.0006965764,0.0001607243,0.0019414956,0.000045179382,0.00009861193,0.00040837564,0.00012762197,0.0000075435055,0.0011186318,0.98904145,0.0062284176,0.00012539707],"about_ca_topic_score_codex":0.0000031105023,"about_ca_topic_score_gemma":8.2385765e-7,"teacher_disagreement_score":0.025373776,"about_ca_system_score_codex":0.000052902407,"about_ca_system_score_gemma":0.000052152045,"threshold_uncertainty_score":0.42817336},"labels":[],"label_agreement":null},{"id":"W2739858881","doi":"","title":"Orthogonal designs and MDS self-dual codes","year":2006,"lang":"en","type":"article","venue":"The Australasian Journal of Combinatorics","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":29,"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 Lethbridge","funders":"","keywords":"Mathematics; Dual (grammatical number); Combinatorics; Orthogonal array; Arithmetic; Statistics; Taguchi methods; Philosophy; Linguistics","score_opus":0.013060633229469244,"score_gpt":0.22629292382948352,"score_spread":0.21323229060001428,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2739858881","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.91491526,0.000559779,0.0786632,0.0020439948,0.0008318071,0.00009934441,0.0000015262074,0.000088603185,0.0027964844],"genre_scores_gemma":[0.99582916,0.000032109674,0.00388126,0.000048667906,0.00012205152,7.4955483e-7,1.8924281e-7,0.0000071129693,0.00007871175],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9987731,0.00018760691,0.0003396869,0.000119271484,0.00033973527,0.00024058935],"domain_scores_gemma":[0.99901223,0.00021045185,0.0002746465,0.00025852982,0.00014108347,0.00010305908],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001011773,0.00013816457,0.00019350761,0.0001365506,0.00021498768,0.0001967412,0.0007120642,0.00005383024,0.0000053357867],"category_scores_gemma":[0.000017040116,0.00009508916,0.00011655171,0.00047845958,0.000110134606,0.00036964603,0.00009480354,0.0003245745,0.000003104843],"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.000013842524,0.000117170544,0.0047424794,0.000006839331,0.000037531543,0.00006917701,0.00031992194,0.00003534725,0.00020683865,0.9921188,0.0011068211,0.001225262],"study_design_scores_gemma":[0.00079213193,0.00060934323,0.03421901,0.000035205016,0.00006416178,0.0015121143,0.00009491856,0.00025240195,0.0011297455,0.9567513,0.0043332055,0.00020647624],"about_ca_topic_score_codex":0.0000015919892,"about_ca_topic_score_gemma":6.973455e-7,"teacher_disagreement_score":0.08091389,"about_ca_system_score_codex":0.000022264976,"about_ca_system_score_gemma":0.000077461154,"threshold_uncertainty_score":0.38776237},"labels":[],"label_agreement":null},{"id":"W2740363516","doi":"","title":"The convex hull of every optimal pseudolinear drawing of kn is a triangle","year":2007,"lang":"en","type":"article","venue":"The Australasian Journal of Combinatorics","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","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":"University of Waterloo","funders":"","keywords":"Mathematics; Combinatorics; Convex hull; Hull; Regular polygon; Geometry; Materials science; Composite material","score_opus":0.01522270383847111,"score_gpt":0.26651780474252373,"score_spread":0.2512951009040526,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2740363516","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.6807396,0.000640955,0.31413257,0.002353616,0.0014267599,0.00013171128,0.0000017704352,0.000009255072,0.00056377664],"genre_scores_gemma":[0.9956638,0.000046989175,0.0037509918,0.000052886695,0.00014031421,2.8143242e-7,2.9347314e-7,0.0000057739817,0.00033864556],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.998212,0.000114165814,0.00077662827,0.00009272032,0.0005942693,0.00021021656],"domain_scores_gemma":[0.9975565,0.00062474684,0.0008441328,0.00030253993,0.00058639835,0.00008568026],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0026447892,0.000107149695,0.00025684084,0.0001547647,0.00015001913,0.000059905506,0.0009802831,0.000054377488,0.0000071128507],"category_scores_gemma":[0.0001629729,0.000067454086,0.00019342093,0.0007803925,0.000108981105,0.00029461543,0.00008812629,0.00026335567,0.0000028147363],"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.00078264193,0.0011516364,0.003559792,0.00015467155,0.0007564876,0.00014316688,0.014750631,0.024302065,0.01510361,0.8544984,0.01610199,0.06869494],"study_design_scores_gemma":[0.010128975,0.0056061116,0.058478355,0.0005120986,0.00038151548,0.0021066659,0.0034620636,0.044410843,0.58742034,0.25268045,0.03380299,0.0010095815],"about_ca_topic_score_codex":0.0000023956854,"about_ca_topic_score_gemma":3.4880225e-7,"teacher_disagreement_score":0.6018179,"about_ca_system_score_codex":0.000037382433,"about_ca_system_score_gemma":0.00021824059,"threshold_uncertainty_score":0.27506977},"labels":[],"label_agreement":null},{"id":"W2740436644","doi":"","title":"ℤ k -magic labellings of fans and wheels with magic value zero.","year":2009,"lang":"en","type":"article","venue":"The Australasian Journal of Combinatorics","topic":"Graph Labeling and Dimension Problems","field":"Computer Science","cited_by":3,"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":"MAGIC (telescope); Mathematics; Zero (linguistics); Combinatorics; Physics; Philosophy; Linguistics; Astronomy","score_opus":0.007878301333030588,"score_gpt":0.21294287892108904,"score_spread":0.20506457758805846,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2740436644","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.9446206,0.0013466555,0.040180314,0.01202585,0.00045613508,0.00015617636,0.0000010294187,0.000039930306,0.0011733208],"genre_scores_gemma":[0.9938329,0.00015074771,0.0056080846,0.00018094557,0.000007655906,1.4738666e-7,1.1294872e-7,0.000007080646,0.00021234331],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9985783,0.00009859244,0.00045832002,0.00014597237,0.00047216794,0.0002466604],"domain_scores_gemma":[0.9985285,0.000090318434,0.00051678537,0.00037316245,0.00033505625,0.0001561979],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008107803,0.000158883,0.00030085817,0.00015926466,0.00008932182,0.00009477617,0.0007806407,0.000055543405,0.0000022587315],"category_scores_gemma":[0.000024107117,0.0000954521,0.000074678355,0.00059358036,0.00015139666,0.0003396636,0.00004397335,0.00036571908,0.0000030441815],"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.00003583812,0.00023271763,0.0016044958,0.000024717508,0.000057807156,0.00007497,0.0015649487,0.00089152687,0.002372814,0.9894189,0.001128549,0.0025926956],"study_design_scores_gemma":[0.0012979286,0.0019032002,0.0035116693,0.00018295906,0.00006551514,0.00072002143,0.00007571956,0.0008011608,0.0061002453,0.9848074,0.00036066465,0.0001735221],"about_ca_topic_score_codex":0.0000039640786,"about_ca_topic_score_gemma":1.2344633e-7,"teacher_disagreement_score":0.049212296,"about_ca_system_score_codex":0.000015879412,"about_ca_system_score_gemma":0.00008442936,"threshold_uncertainty_score":0.38924238},"labels":[],"label_agreement":null},{"id":"W2742125785","doi":"","title":"On several classes of monographs.","year":2007,"lang":"en","type":"article","venue":"The Australasian Journal of Combinatorics","topic":"Graph Labeling and Dimension Problems","field":"Computer Science","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":"Toronto Metropolitan University","funders":"","keywords":"Mathematics; Combinatorics","score_opus":0.013254445672268222,"score_gpt":0.24929224185780893,"score_spread":0.23603779618554072,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2742125785","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.95230466,0.00025484856,0.0417893,0.0019252016,0.0016782741,0.00008275152,8.0236333e-7,0.00003193648,0.0019322472],"genre_scores_gemma":[0.99735314,0.0000286481,0.0023835392,0.000113365066,0.000011368871,1.8249341e-7,1.1588241e-7,0.0000065788367,0.00010308957],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9984855,0.00007257827,0.0005609269,0.000100809506,0.00052619074,0.00025398337],"domain_scores_gemma":[0.9983469,0.00026251216,0.00054392917,0.00039396092,0.00031760964,0.00013504278],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015231927,0.00012133346,0.00022229107,0.00027603412,0.000089498004,0.000045869467,0.0010270531,0.00006151789,0.0000039550814],"category_scores_gemma":[0.00007058398,0.00007738384,0.00017371462,0.00079580693,0.000101951344,0.00021612001,0.000059053025,0.00037091417,0.0000046223713],"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.000036198213,0.00020883996,0.0011732776,0.000009670446,0.000047501475,0.000046248428,0.0004701652,0.00042923493,0.00041549423,0.9914253,0.0039794203,0.0017586482],"study_design_scores_gemma":[0.00097221596,0.0012221196,0.007402159,0.00009945908,0.000027172115,0.00024228547,0.00012692134,0.00024752822,0.012790794,0.97590715,0.00081602804,0.00014614857],"about_ca_topic_score_codex":0.0000022057798,"about_ca_topic_score_gemma":3.4552278e-7,"teacher_disagreement_score":0.045048475,"about_ca_system_score_codex":0.000021258676,"about_ca_system_score_gemma":0.00006731742,"threshold_uncertainty_score":0.31556213},"labels":[],"label_agreement":null},{"id":"W2753908926","doi":"","title":"Resolving P(v, 3, λ) designs into regular P 3 -configurations.","year":2003,"lang":"en","type":"article","venue":"The Australasian Journal of Combinatorics","topic":"graph theory and CDMA systems","field":"Engineering","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":"McMaster University","funders":"","keywords":"Mathematics; Combinatorics","score_opus":0.013488460348556284,"score_gpt":0.21520820202965218,"score_spread":0.2017197416810959,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2753908926","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.93931353,0.0031794927,0.02567778,0.0006431796,0.004695577,0.0003058873,0.0000014675004,0.0001422979,0.026040796],"genre_scores_gemma":[0.9993374,0.000049485116,0.00023695602,0.000012632514,0.00006876068,0.0000020797675,2.6184316e-7,0.000024538418,0.00026790085],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9988299,0.00020875,0.0004530892,0.00005994315,0.00023673342,0.00021155553],"domain_scores_gemma":[0.99925345,0.00010061074,0.00014703796,0.00026681335,0.000121991194,0.00011007141],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010397595,0.00014100841,0.0002099533,0.000119563585,0.00015176582,0.0000650119,0.00033786843,0.0000767235,0.000045802393],"category_scores_gemma":[0.000098238255,0.00010402667,0.00012526533,0.00036869178,0.00005798093,0.0002083784,0.0000054522466,0.00037916529,0.000017104363],"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.000017303008,0.00005671694,0.00059804576,0.000075565615,0.00018884327,0.00008552256,0.002721442,0.0066752713,0.013583351,0.96704865,0.008308547,0.0006407222],"study_design_scores_gemma":[0.0014133939,0.0003699602,0.0014579851,0.00025054807,0.00016979169,0.0014973809,0.0038168272,0.00036399745,0.06964899,0.8553104,0.0651954,0.00050532597],"about_ca_topic_score_codex":6.2782084e-7,"about_ca_topic_score_gemma":4.0294495e-7,"teacher_disagreement_score":0.111738265,"about_ca_system_score_codex":0.000066700726,"about_ca_system_score_gemma":0.000039379327,"threshold_uncertainty_score":0.42420846},"labels":[],"label_agreement":null},{"id":"W2794193535","doi":"","title":"On the critical group of the Möbius ladder graph","year":2006,"lang":"en","type":"article","venue":"The Australasian Journal of Combinatorics","topic":"Finite Group Theory Research","field":"Mathematics","cited_by":20,"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; Group (periodic table); Graph; Chemistry; Organic chemistry","score_opus":0.04149432054172672,"score_gpt":0.31465681585963856,"score_spread":0.2731624953179118,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2794193535","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.9729637,0.00012986815,0.0005604801,0.013534043,0.0009192709,0.00034048653,0.000009433657,0.000017471306,0.011525244],"genre_scores_gemma":[0.9988902,0.000008850555,0.00010914864,0.000088426124,0.0001525431,0.0000038227204,2.0930541e-7,0.00003467345,0.00071209925],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99674445,0.0008483403,0.0007198212,0.00011140808,0.0011681133,0.00040785276],"domain_scores_gemma":[0.9932898,0.0050068875,0.00045197955,0.00079285854,0.0003762778,0.000082149105],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0029049148,0.00020148433,0.00033704087,0.00011846104,0.00029326222,0.00007163996,0.001612187,0.000110051384,0.00016056016],"category_scores_gemma":[0.0019799424,0.00008788149,0.00037717432,0.000693811,0.0007239225,0.00010622809,0.00013158607,0.0012274438,0.000014382426],"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.000067435154,0.0003985982,0.0005236775,0.000037299265,0.00005419143,0.000020737962,0.00024676736,0.000011124306,0.0003124905,0.9805273,0.017752519,0.000047880472],"study_design_scores_gemma":[0.00050068274,0.00037057427,0.0036841196,0.00011996929,0.00008905469,0.00016992424,0.00042150856,0.000012844084,0.002162265,0.9918703,0.0005047351,0.000094038216],"about_ca_topic_score_codex":0.000005729759,"about_ca_topic_score_gemma":0.0000029423416,"teacher_disagreement_score":0.025926525,"about_ca_system_score_codex":0.000066554036,"about_ca_system_score_gemma":0.00007993651,"threshold_uncertainty_score":0.53327006},"labels":[],"label_agreement":null},{"id":"W3044956106","doi":"","title":"On double circulant doubly even self-dual [72, 36, 12] codes and their neighbors","year":2008,"lang":"en","type":"article","venue":"The Australasian Journal of Combinatorics","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":8,"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":"Circulant matrix; Mathematics; Dual (grammatical number); Combinatorics; Discrete mathematics; Philosophy; Linguistics","score_opus":0.020536902347200583,"score_gpt":0.22682279172034892,"score_spread":0.20628588937314835,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3044956106","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.98446506,0.0002798516,0.0101006115,0.001575371,0.0009427282,0.0001390265,0.0000021599528,0.00008583124,0.0024093536],"genre_scores_gemma":[0.99921095,0.00015272689,0.00030589846,0.00013472556,0.0000976896,0.0000017481891,3.1847162e-7,0.000013143475,0.000082808765],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9984327,0.00018301111,0.00040294303,0.00019932569,0.00040622032,0.0003758207],"domain_scores_gemma":[0.998497,0.0002988485,0.00035955213,0.0004937461,0.00013837333,0.00021245379],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009583664,0.00023587514,0.000327671,0.00020346987,0.00044632505,0.00014028695,0.0010921797,0.00008197219,0.000007848325],"category_scores_gemma":[0.000020366595,0.00014709971,0.00019354859,0.0004942868,0.00016125059,0.00040142483,0.0001417523,0.0005444906,0.000006759459],"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.00021081683,0.00037712028,0.0027673496,0.000014520842,0.00019548897,0.00024604794,0.006168063,0.00019575622,0.0002462872,0.98625004,0.002050543,0.001277962],"study_design_scores_gemma":[0.0053057782,0.002569439,0.03471384,0.00017341675,0.00009080244,0.007561714,0.0005408713,0.0007134259,0.0051799454,0.93685776,0.0056173895,0.0006756387],"about_ca_topic_score_codex":0.0000030089934,"about_ca_topic_score_gemma":5.753741e-7,"teacher_disagreement_score":0.0493923,"about_ca_system_score_codex":0.000045577053,"about_ca_system_score_gemma":0.00011853098,"threshold_uncertainty_score":0.5998552},"labels":[],"label_agreement":null}]}