{"meta":{"query_hash":"98e307a8f3e7","filters":{"venue":"Computing: The Australasian Theory Symposium"},"cohort_total":3,"direct_labels_cover":0,"predictions_cover":3,"exported":3,"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/98e307a8f3e7","api":"https://metacan.xera.ac/api/v1/cohort?venue=Computing%3A+The+Australasian+Theory+Symposium"},"results":[{"id":"W198326635","doi":"","title":"Geometric spanners with few edges and degree five","year":2006,"lang":"en","type":"article","venue":"Computing: The Australasian Theory Symposium","topic":"Computational Geometry and Mesh Generation","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":"Carleton University","funders":"","keywords":"Combinatorics; Degree (music); Vertex (graph theory); Integer (computer science); Mathematics; Set (abstract data type); Graph; Point (geometry); Discrete mathematics; Computer science; Physics; Geometry","score_opus":0.012887919714954454,"score_gpt":0.21939387482442727,"score_spread":0.2065059551094728,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W198326635","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.47498888,0.0005128956,0.49068642,0.00044202807,0.00008974627,0.0001788904,0.0005622354,0.0023713857,0.030167568],"genre_scores_gemma":[0.7997019,0.00027401478,0.18967278,0.000097796845,0.000045766228,0.00008891199,0.0013223808,0.0001493296,0.0086470535],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9995561,0.000056001278,0.000033647186,0.00013269676,0.00012776007,0.00009380444],"domain_scores_gemma":[0.99909127,0.0002872561,0.00013741512,0.00029227207,0.000056537272,0.00013518785],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00024806755,0.00060168334,0.0005755616,0.00050797226,0.00039691615,0.00078607554,0.0008470934,0.0005858634,0.0061065815],"category_scores_gemma":[0.0016071697,0.0003019794,0.00046515188,0.00073932915,0.000496656,0.0023616347,0.002245829,0.0005310547,0.001554868],"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.0013427136,0.00036262002,0.008665677,0.0006638438,0.00014341138,0.0013247161,0.0007853857,0.1944323,0.06643328,0.2185082,0.013008928,0.4943289],"study_design_scores_gemma":[0.00017225751,0.0009013739,0.0024977587,0.000109446504,0.0000657121,0.0018986948,0.00052449043,0.44097662,0.048459057,0.47203,0.03229074,0.000073832234],"about_ca_topic_score_codex":0.00037127905,"about_ca_topic_score_gemma":0.0008649737,"teacher_disagreement_score":0.0061065815,"about_ca_system_score_codex":0.00031197927,"about_ca_system_score_gemma":0.00029723183,"threshold_uncertainty_score":0.020428538},"labels":[],"label_agreement":null},{"id":"W20688002","doi":"","title":"Minimum cost homomorphisms to oriented cycles with some loops","year":2009,"lang":"en","type":"article","venue":"Computing: The Australasian Theory Symposium","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":"Simon Fraser University","funders":"","keywords":"Homomorphism; Digraph; Combinatorics; Partition (number theory); Algebra homomorphism; Mathematics; Loop (graph theory); Discrete mathematics; Vertex (graph theory); Graph homomorphism; Directed graph; Graph; Line graph","score_opus":0.014754832187541159,"score_gpt":0.27610765207257515,"score_spread":0.261352819885034,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W20688002","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.8128856,0.0003921156,0.1632298,0.00091183,0.00011186154,0.00014491388,0.00037630228,0.00043513923,0.021512458],"genre_scores_gemma":[0.95207024,0.00018692912,0.03863323,0.00015420557,0.00008953889,0.00008553824,0.00032700173,0.000084452324,0.008368922],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99960643,0.00010516212,0.000027563357,0.00008406281,0.00007530349,0.000101569545],"domain_scores_gemma":[0.9979448,0.0011525918,0.00023849889,0.00022348839,0.00021187663,0.00022874483],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004120796,0.00031991405,0.00037719536,0.0009544952,0.0007956545,0.0010308871,0.00077645684,0.00072823535,0.003780171],"category_scores_gemma":[0.004598949,0.00028286266,0.00045276663,0.000832426,0.0007773923,0.0016131487,0.0012229326,0.000725004,0.00034485976],"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.0004894591,0.00025029253,0.0034871032,0.0003728576,0.00009870448,0.0018138967,0.0016463123,0.07931995,0.010199156,0.8083416,0.0067055095,0.087275185],"study_design_scores_gemma":[0.000078591,0.00010381841,0.00090769626,0.000029336634,0.000037276524,0.00057226827,0.00032196756,0.14560156,0.0029286053,0.84283864,0.0065558436,0.000024332732],"about_ca_topic_score_codex":0.000953361,"about_ca_topic_score_gemma":0.0010695354,"teacher_disagreement_score":0.003780171,"about_ca_system_score_codex":0.0007249743,"about_ca_system_score_gemma":0.00039850833,"threshold_uncertainty_score":0.0126459},"labels":[],"label_agreement":null},{"id":"W2295936211","doi":"","title":"Decomposing a multigraph into split components","year":2012,"lang":"en","type":"article","venue":"Computing: The Australasian Theory Symposium","topic":"Embedded Systems Design Techniques","field":"Computer Science","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":"University of Windsor","funders":"","keywords":"Multigraph; Butterfly graph; Computer science; Graph; Null graph; Graph rewriting; Strength of a graph; Voltage graph; Algorithm; Graph factorization; Theoretical computer science; Line graph; Mathematics","score_opus":0.020042283327913506,"score_gpt":0.27262001934202496,"score_spread":0.25257773601411143,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2295936211","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.014832701,0.0001364503,0.9799257,0.0001012479,0.00003221021,0.00021500389,0.00018703303,0.0018525711,0.0027170759],"genre_scores_gemma":[0.0625828,0.00017532319,0.9306925,0.000079216305,0.000016779299,0.0001391105,0.0011090793,0.0004895385,0.0047157775],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99956566,0.00005563685,0.00002404353,0.00013370613,0.00015946754,0.000061485436],"domain_scores_gemma":[0.9991542,0.0002600543,0.00006107892,0.00020078853,0.00025910794,0.0000647429],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00034063534,0.0010975066,0.00068914605,0.0016884481,0.00076300505,0.0010918155,0.00092880294,0.00049653003,0.010998608],"category_scores_gemma":[0.0015300601,0.0005284416,0.0009165219,0.0016366645,0.0005589219,0.0019953107,0.0018847919,0.0010010903,0.0030931071],"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.00024542218,0.00014479923,0.0012206942,0.0005209048,0.000082339204,0.000648337,0.00039621352,0.051472522,0.060782064,0.03028042,0.0105369,0.84366953],"study_design_scores_gemma":[0.000079967125,0.0003595785,0.002004995,0.00012652932,0.00013415594,0.0012172651,0.00087946845,0.6817731,0.07029404,0.19123909,0.051819637,0.00007212889],"about_ca_topic_score_codex":0.0035950472,"about_ca_topic_score_gemma":0.0064153452,"teacher_disagreement_score":0.010998608,"about_ca_system_score_codex":0.000642869,"about_ca_system_score_gemma":0.0010265578,"threshold_uncertainty_score":0.036794007},"labels":[],"label_agreement":null}]}