{"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.030207975,0.0018635726,0.86735845,0.0022113258,0.00080121576,0.00040347234,0.002165548,0.003195157,0.09179323],"genre_scores_gemma":[0.4047387,0.0043676263,0.5121216,0.0023151217,0.0010760059,0.0010455293,0.0075899675,0.0026257995,0.06411964],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99699867,0.0012539963,0.00024909695,0.0005459757,0.00070868194,0.00024357736],"domain_scores_gemma":[0.9935521,0.0030042066,0.00053990696,0.0017419485,0.0008173281,0.0003445302],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0022385302,0.0012018301,0.0013031146,0.0033799985,0.0015663592,0.0051055336,0.001646295,0.0011335625,0.030378433],"category_scores_gemma":[0.012658017,0.0007108424,0.0020073336,0.0043133483,0.0029865068,0.007848846,0.0034047298,0.002325885,0.005401395],"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.00012042078,0.00004039916,0.00047837108,0.00019150843,0.000040896197,0.0001612941,0.0003195811,0.006433136,0.00056913117,0.91531855,0.014461585,0.061865184],"study_design_scores_gemma":[0.000023571682,0.0000364025,0.00023335034,0.0000732201,0.000028370634,0.00015340955,0.00007992165,0.01492578,0.00033756637,0.94852144,0.035567667,0.000019316432],"about_ca_topic_score_codex":0.002369493,"about_ca_topic_score_gemma":0.0023210559,"teacher_disagreement_score":0.030378433,"about_ca_system_score_codex":0.001424186,"about_ca_system_score_gemma":0.00095799554,"threshold_uncertainty_score":0.10162598},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.15696909,0.0005122054,0.79970396,0.00052901095,0.00014190907,0.000055668348,0.00023168945,0.0006173158,0.041239224],"genre_scores_gemma":[0.9058118,0.0004555243,0.081376016,0.0001636463,0.00019654757,0.00009770314,0.00024614835,0.00042044366,0.011232219],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9976948,0.0005010457,0.00011710733,0.00039712715,0.00085693854,0.00043292192],"domain_scores_gemma":[0.9922621,0.0032974125,0.0012598375,0.0010674741,0.0017090917,0.0004040242],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002445659,0.0008865425,0.00065425684,0.0027975861,0.0011857225,0.0024247563,0.0010128784,0.0009818648,0.008148225],"category_scores_gemma":[0.015040029,0.0007144514,0.00093859393,0.0020784896,0.0030413826,0.0035606732,0.0023139778,0.003632371,0.0021480834],"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.00006390998,0.000015718375,0.00034833903,0.00005233496,0.000010683883,0.00024253131,0.00027907756,0.008764531,0.0036850485,0.97016203,0.0013142886,0.015061519],"study_design_scores_gemma":[0.000018117376,0.00008608716,0.00047343198,0.00003582468,0.000015171973,0.0004428631,0.00013689577,0.05553833,0.0042258673,0.93330437,0.005667153,0.00005586439],"about_ca_topic_score_codex":0.00048261802,"about_ca_topic_score_gemma":0.0003475376,"teacher_disagreement_score":0.008148225,"about_ca_system_score_codex":0.0009887975,"about_ca_system_score_gemma":0.0005627965,"threshold_uncertainty_score":0.027258515},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.70822644,0.00054574385,0.23893957,0.0011729833,0.00017451307,0.0007183396,0.0035315438,0.00096486695,0.045725983],"genre_scores_gemma":[0.82462895,0.00046865435,0.14692122,0.00052938226,0.000054108594,0.00091556023,0.0031041342,0.000284897,0.023093147],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9990619,0.00023759968,0.00008650926,0.00022758984,0.0001868575,0.00019957419],"domain_scores_gemma":[0.995886,0.0018874177,0.00062491006,0.00040327533,0.0005785617,0.0006197667],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00054664,0.00073474477,0.0007301853,0.0020687643,0.0025625804,0.002443997,0.0017196105,0.0021098605,0.007063494],"category_scores_gemma":[0.004417011,0.00083189236,0.00062082126,0.002899902,0.0011897808,0.002185982,0.0017156001,0.00088204595,0.0013719839],"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.0018900965,0.0005690205,0.008452346,0.0009936533,0.00022773695,0.003801079,0.0024061045,0.039138883,0.04778668,0.8045013,0.013616996,0.07661618],"study_design_scores_gemma":[0.0003096386,0.00023754133,0.0030057547,0.0003134505,0.00027890434,0.0014189369,0.0012862383,0.14807157,0.027354714,0.7897582,0.027853211,0.00011185198],"about_ca_topic_score_codex":0.0032783397,"about_ca_topic_score_gemma":0.004765198,"teacher_disagreement_score":0.007063494,"about_ca_system_score_codex":0.0009371301,"about_ca_system_score_gemma":0.0014481471,"threshold_uncertainty_score":0.023629785},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.40793142,0.003157385,0.21881996,0.023323633,0.0011413496,0.0003201143,0.0035198543,0.0010376656,0.34074873],"genre_scores_gemma":[0.845956,0.002218734,0.0510551,0.0020166798,0.0007209143,0.00031036432,0.0022939425,0.00041379913,0.0950144],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9990521,0.00029272563,0.000038518865,0.00030270778,0.0001603995,0.00015355632],"domain_scores_gemma":[0.9979557,0.0010737154,0.00017197174,0.0002783394,0.00018368711,0.00033652678],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012181393,0.0009138898,0.0015738695,0.0009861487,0.0022089856,0.003994805,0.0026316363,0.0024442947,0.023739189],"category_scores_gemma":[0.0056837937,0.0007361535,0.00092330284,0.0018527824,0.0018055893,0.010030418,0.0033559834,0.0039605843,0.0021947976],"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.00022183893,0.00015952908,0.00031133284,0.00027215807,0.00007272247,0.00011755401,0.00031022084,0.0066977195,0.0010847962,0.94369984,0.025819115,0.021233203],"study_design_scores_gemma":[0.00005017629,0.000025164096,0.00017431982,0.00003292186,0.000037832928,0.00013628787,0.0001695884,0.019773277,0.0005753062,0.9692142,0.009795013,0.00001588527],"about_ca_topic_score_codex":0.001635697,"about_ca_topic_score_gemma":0.001644942,"teacher_disagreement_score":0.023739189,"about_ca_system_score_codex":0.0015556582,"about_ca_system_score_gemma":0.0012098933,"threshold_uncertainty_score":0.0794155},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5541755,0.0023916804,0.31877357,0.004323715,0.0008959612,0.00012090817,0.0005544773,0.00029369057,0.118470594],"genre_scores_gemma":[0.93499833,0.0009824105,0.030783698,0.000736385,0.00060636865,0.00013997727,0.00024908828,0.00007179915,0.031431817],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9986664,0.0004499309,0.00007918905,0.0001804435,0.0004017557,0.0002222717],"domain_scores_gemma":[0.9972397,0.001286253,0.0005037089,0.00040902183,0.00035058334,0.00021077965],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001469816,0.0007416331,0.00059043797,0.0019248712,0.0013969258,0.0023240456,0.000539383,0.0013546996,0.0042461674],"category_scores_gemma":[0.0038098712,0.0005925775,0.0006082956,0.0016025159,0.002519306,0.002071919,0.002753504,0.0018261742,0.0007808298],"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.00009752142,0.00001453092,0.00019240311,0.000022656914,0.0000057429347,0.000066381544,0.00014559363,0.0013735365,0.0011139651,0.99048877,0.00064922625,0.005829683],"study_design_scores_gemma":[0.00003101881,0.000027043068,0.000115512514,0.000015357755,0.0000083537525,0.00019927847,0.000054958593,0.0062122256,0.0010385999,0.9891266,0.0031559751,0.000015097335],"about_ca_topic_score_codex":0.00028299456,"about_ca_topic_score_gemma":0.00031675867,"teacher_disagreement_score":0.0042461674,"about_ca_system_score_codex":0.0010418285,"about_ca_system_score_gemma":0.00078791403,"threshold_uncertainty_score":0.01420486},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.21203282,0.0003236855,0.66884226,0.0012302054,0.00031676033,0.00023207224,0.0016156255,0.0011090491,0.1142976],"genre_scores_gemma":[0.68237305,0.0006030227,0.26981372,0.00030935623,0.000091479196,0.00022820964,0.0027201977,0.001007595,0.042853326],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9994388,0.00004994151,0.000024944562,0.00012810498,0.0002649129,0.000093315124],"domain_scores_gemma":[0.99915516,0.0002610846,0.00010055692,0.00017506875,0.00020089425,0.00010722271],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00015485621,0.00061727915,0.0006102305,0.0007077631,0.000576197,0.0020930984,0.0011947094,0.0009659735,0.021403616],"category_scores_gemma":[0.002014485,0.000634056,0.00041452132,0.00089389813,0.0007526618,0.0024500801,0.0012016802,0.0022431177,0.0037726755],"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.00092193513,0.00042458222,0.002867549,0.0007966488,0.000090224756,0.0010619194,0.0007602039,0.087054804,0.09652234,0.39026254,0.027137643,0.39209968],"study_design_scores_gemma":[0.00019206866,0.00044804817,0.0056236545,0.000225423,0.000067897156,0.002159967,0.0013932117,0.37634474,0.05183045,0.4690146,0.09258885,0.00011111673],"about_ca_topic_score_codex":0.0011771029,"about_ca_topic_score_gemma":0.0018702425,"teacher_disagreement_score":0.021403616,"about_ca_system_score_codex":0.00058320205,"about_ca_system_score_gemma":0.0003482397,"threshold_uncertainty_score":0.071602225},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.52860457,0.0009847216,0.27765405,0.0023157792,0.00053156284,0.00012472758,0.0021595268,0.0011270009,0.18649803],"genre_scores_gemma":[0.8922726,0.00031289627,0.07438384,0.0004997456,0.00010352752,0.00010234657,0.0012290148,0.00027035823,0.030825725],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99916434,0.00018635769,0.000054557244,0.00021454548,0.00014830465,0.00023198075],"domain_scores_gemma":[0.9973074,0.0012773655,0.00030196106,0.00040487977,0.00035950943,0.00034887707],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007229697,0.00040713744,0.0005680835,0.0012359904,0.0020194328,0.002934861,0.0010891878,0.0013471819,0.011701466],"category_scores_gemma":[0.004204072,0.00078752596,0.0008865045,0.00093788235,0.0025940163,0.003929212,0.0022241962,0.001563502,0.001649853],"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.0002029088,0.000023524446,0.0010293315,0.0000804215,0.0000129808695,0.00013421818,0.00031913666,0.0017721591,0.0019185143,0.9734327,0.0056250202,0.015448919],"study_design_scores_gemma":[0.00003661591,0.000017617564,0.0006171332,0.000041629428,0.0000158202,0.00020004186,0.00017644005,0.006470459,0.0015450558,0.9823498,0.008503968,0.00002552485],"about_ca_topic_score_codex":0.002143997,"about_ca_topic_score_gemma":0.0031469394,"teacher_disagreement_score":0.011701466,"about_ca_system_score_codex":0.0012960408,"about_ca_system_score_gemma":0.0006744164,"threshold_uncertainty_score":0.03914529},"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":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.29796374,0.005614983,0.16806757,0.015193932,0.0010267315,0.00023871846,0.004195335,0.0007991176,0.50689983],"genre_scores_gemma":[0.83256626,0.0035133634,0.047590815,0.0038657228,0.0011257322,0.000328071,0.0031970828,0.00033232308,0.10748065],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9986364,0.00028593745,0.00006886677,0.00048401896,0.00024751722,0.00027731905],"domain_scores_gemma":[0.9930059,0.003985164,0.0006039832,0.0009538506,0.00056106615,0.0008899734],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009252888,0.000569997,0.0006287699,0.0026378366,0.0037552053,0.0045916946,0.0013296732,0.0021419637,0.026030965],"category_scores_gemma":[0.006590471,0.0005575157,0.0010273928,0.0031183239,0.0021608572,0.009240356,0.0029505894,0.002788027,0.0021488706],"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.000042862186,0.000033959106,0.00074354996,0.00006083486,0.000008637323,0.000059751586,0.00020671889,0.0003901026,0.0002679975,0.97835314,0.008813743,0.011018828],"study_design_scores_gemma":[0.000020634261,0.000017835237,0.0011281364,0.000061545565,0.000015842395,0.00032867576,0.00023028435,0.0030910482,0.00030838943,0.9671496,0.027631056,0.000016812082],"about_ca_topic_score_codex":0.0023079826,"about_ca_topic_score_gemma":0.0031005722,"teacher_disagreement_score":0.026030965,"about_ca_system_score_codex":0.0031241667,"about_ca_system_score_gemma":0.00079666387,"threshold_uncertainty_score":0.08708221},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.36096972,0.0008337477,0.49246347,0.0012324037,0.00067906006,0.000373365,0.0009928672,0.0026212865,0.13983402],"genre_scores_gemma":[0.8057618,0.0004043616,0.1602629,0.0005625716,0.00009928264,0.0001928922,0.00082270417,0.00047428266,0.031419173],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9983577,0.00042430134,0.00011090973,0.00030692332,0.00033265224,0.0004674772],"domain_scores_gemma":[0.99741864,0.00097403873,0.00028534018,0.00078210025,0.0003036831,0.00023622306],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009452565,0.0005835963,0.00045194323,0.0006929186,0.0016394781,0.0029202213,0.0009909893,0.0014680912,0.016229382],"category_scores_gemma":[0.005680507,0.00057619583,0.0006640415,0.00097494584,0.0012359157,0.0032596146,0.0035515085,0.0015468068,0.004071037],"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.0012153389,0.00030422516,0.002804691,0.00040143097,0.000105154,0.0024319403,0.0017708662,0.0124947205,0.03884155,0.75886804,0.019510467,0.16125156],"study_design_scores_gemma":[0.00011107724,0.00018715377,0.00048477878,0.00010642091,0.000068420435,0.0014749871,0.001073551,0.01832286,0.037609376,0.90054566,0.039960496,0.000055284836],"about_ca_topic_score_codex":0.00059631455,"about_ca_topic_score_gemma":0.0009917746,"teacher_disagreement_score":0.016229382,"about_ca_system_score_codex":0.0005666145,"about_ca_system_score_gemma":0.0008558558,"threshold_uncertainty_score":0.05429274},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8751358,0.0006118664,0.027765187,0.0019063484,0.00025732975,0.00006612501,0.00011073053,0.00019240768,0.09395427],"genre_scores_gemma":[0.9773038,0.00035189392,0.0037935774,0.0002822016,0.0002046424,0.00003951112,0.00011954822,0.00006925232,0.017835574],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9997873,0.000051740953,0.0000072806943,0.000034544275,0.000045158926,0.00007395761],"domain_scores_gemma":[0.99917233,0.00022310295,0.00015406388,0.000051303152,0.00008289686,0.00031639996],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00039909646,0.00059516594,0.0006898916,0.0029352226,0.0020205153,0.0019523631,0.0007793133,0.0010375337,0.0069024586],"category_scores_gemma":[0.0016377713,0.00031779165,0.00045156063,0.0008145893,0.0032914241,0.001986337,0.0017660831,0.0012738106,0.00076483696],"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.00005927915,0.000018875535,0.00030692192,0.000021793756,0.000004987011,0.00017172223,0.0003708042,0.0008977369,0.0015895985,0.99368733,0.0006554449,0.002215582],"study_design_scores_gemma":[0.000027900454,0.000019482635,0.00032765206,0.000015905951,0.000005762534,0.00009046414,0.00022035082,0.0039495975,0.00057493325,0.9929264,0.0018319488,0.0000095955575],"about_ca_topic_score_codex":0.0029297767,"about_ca_topic_score_gemma":0.0029202963,"teacher_disagreement_score":0.0069024586,"about_ca_system_score_codex":0.0016078791,"about_ca_system_score_gemma":0.0008611415,"threshold_uncertainty_score":0.023091018},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.89610976,0.00040095288,0.02490389,0.0008006385,0.00020904832,0.000029721039,0.00020865317,0.00012652739,0.07721083],"genre_scores_gemma":[0.97580075,0.00020525772,0.0066537824,0.00024386094,0.00011379697,0.00003689176,0.00021114107,0.00006397028,0.016670633],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99958366,0.00011014225,0.000013850915,0.000064834254,0.00012030974,0.00010723689],"domain_scores_gemma":[0.9988518,0.00045934334,0.00017783612,0.0001267176,0.00020942709,0.00017479892],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000340629,0.00050472596,0.0005493383,0.0017714966,0.0021626183,0.001564753,0.0006950214,0.00089902745,0.0037798584],"category_scores_gemma":[0.0024891458,0.00029544206,0.00028475755,0.00093827693,0.001739313,0.001120933,0.0012583145,0.0010634409,0.00075036153],"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.00022822301,0.000033242006,0.00087072887,0.000033179964,0.0000068697555,0.00033347667,0.00042163563,0.0056284848,0.002584201,0.9821239,0.0020902657,0.005645908],"study_design_scores_gemma":[0.000045502424,0.000044333803,0.0005199406,0.000035180867,0.000010941055,0.0003931796,0.0003030764,0.029752243,0.0019687947,0.96239036,0.004499509,0.00003702194],"about_ca_topic_score_codex":0.0024661417,"about_ca_topic_score_gemma":0.0027856298,"teacher_disagreement_score":0.0037798584,"about_ca_system_score_codex":0.0006872156,"about_ca_system_score_gemma":0.0007549044,"threshold_uncertainty_score":0.012644887},"labels":[],"label_agreement":null}]}