{"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.26447636,0.0006462112,0.7235093,0.00430074,0.0004954998,0.00037394167,0.0000030461608,0.0002654618,0.0059294435],"genre_scores_gemma":[0.9876117,0.000013134712,0.009393043,0.00023873593,0.00038431617,0.000005921797,0.000010656505,0.00001634357,0.0023261611],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"observational","domain_scores_codex":[0.9982238,0.00023081034,0.00027499816,0.0005286393,0.00032257944,0.00041919778],"domain_scores_gemma":[0.9985525,0.00052085967,0.00017524301,0.00051528256,0.0001284154,0.00010767951],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000738956,0.000262489,0.00020544534,0.00031558372,0.0004987433,0.00040531493,0.0007921161,0.00007160807,0.000007158536],"category_scores_gemma":[0.00002909717,0.00018134333,0.00006433138,0.0013532767,0.00020834999,0.00031511908,0.0002721802,0.00021714022,0.000030251811],"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.00008539984,0.00022054647,0.0029689814,0.000063572865,0.00013899652,0.00006713215,0.0016218335,0.11301948,0.0016664983,0.6350294,0.006064261,0.23905393],"study_design_scores_gemma":[0.005942905,0.0024379827,0.48128054,0.00040646616,0.0003994917,0.0030887923,0.0014889651,0.18168133,0.04244266,0.24734703,0.029562024,0.0039218166],"about_ca_topic_score_codex":0.000026648811,"about_ca_topic_score_gemma":0.00000826361,"teacher_disagreement_score":0.72313535,"about_ca_system_score_codex":0.000042697622,"about_ca_system_score_gemma":0.000077901626,"threshold_uncertainty_score":0.73949665},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.21352032,0.00013894457,0.7547222,0.021073798,0.0007771474,0.0021894642,0.0000136140825,0.0010670258,0.006497537],"genre_scores_gemma":[0.98381025,0.000006446651,0.01194981,0.0021251459,0.00029214466,0.000024253974,0.0000064647124,0.00004690886,0.0017386082],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99556017,0.0006880667,0.00049539737,0.0010890204,0.00077546254,0.0013918709],"domain_scores_gemma":[0.99607146,0.00063110504,0.00021937572,0.0022750988,0.00022998515,0.00057295576],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0016159898,0.00054120796,0.00045896164,0.00037007613,0.0007842036,0.0004271078,0.0038827849,0.00012443654,0.000019984225],"category_scores_gemma":[0.00009727877,0.00037431062,0.00016318157,0.0017137917,0.00050514465,0.00066848466,0.0006271845,0.0006620953,0.00030120238],"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.00029218395,0.00023149131,0.0001695384,0.0000116783685,0.00006430182,0.0001495077,0.0022144394,0.004918423,0.008257275,0.95638865,0.0008398331,0.026462657],"study_design_scores_gemma":[0.004361947,0.0049879495,0.016630111,0.0005805769,0.00012314391,0.0013433247,0.0017534306,0.014217543,0.074654914,0.8651864,0.013055399,0.003105266],"about_ca_topic_score_codex":0.000002868208,"about_ca_topic_score_gemma":0.0000014998835,"teacher_disagreement_score":0.7702899,"about_ca_system_score_codex":0.00012917553,"about_ca_system_score_gemma":0.00013689727,"threshold_uncertainty_score":0.9998709},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.18319635,0.00058634987,0.80129325,0.0018018531,0.002267942,0.0010727517,0.000002006777,0.0019433505,0.007836166],"genre_scores_gemma":[0.9342421,0.000006162308,0.06438756,0.00043715388,0.00050531205,0.000023618324,0.0000045004335,0.000054210333,0.0003393574],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99529904,0.0014231661,0.00077352935,0.000683127,0.0005619052,0.0012592343],"domain_scores_gemma":[0.99615663,0.00078926934,0.0004404455,0.0020802768,0.00011909498,0.00041428526],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0036115756,0.0005385684,0.00048296718,0.00029498094,0.0007887645,0.00047369575,0.0036685145,0.00021145523,0.000013518928],"category_scores_gemma":[0.000060786155,0.00041501396,0.0003034835,0.0007659762,0.00032419883,0.00092798384,0.0010058118,0.0005929044,0.0002583891],"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.000055818196,0.00057487236,0.012320271,0.00016379954,0.0002656991,0.000035268502,0.029140398,0.00027092072,0.14200985,0.7821977,0.0040792157,0.028886154],"study_design_scores_gemma":[0.004498359,0.0011031455,0.08909951,0.0023176759,0.00046113183,0.003856916,0.0031464114,0.10542465,0.43601954,0.2917535,0.054616034,0.0077031194],"about_ca_topic_score_codex":0.00005242183,"about_ca_topic_score_gemma":0.0000016917919,"teacher_disagreement_score":0.75104576,"about_ca_system_score_codex":0.00017208514,"about_ca_system_score_gemma":0.000049320224,"threshold_uncertainty_score":0.9998302},"labels":[],"label_agreement":null}]}