{"meta":{"page":1,"per_page":50,"max_per_page":100,"total":3,"total_is_capped":false,"direct_labels_cover":0,"predictions_cover":3,"direct_label_status":"direct model label, unvalidated","prediction_status":"machine_predicted_unvalidated (Codex and Gemma teacher distillation)","score_status":"score_only:v0-immature-baseline (scores rank; they never assert a category)","snapshot":{"source":"OpenAlex, pinned release, all 482 partitions","release":"2026-06-24","frame_built":"2026-07-12","author_layer_release":"2026-06-26"},"query_hash":"98e307a8f3e7","filters":{"venue":"Computing: 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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","authors":[{"name":"Michiel Smid","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01288791971495445,"gpt":0.2193938748244273,"spread":0.2065059551094728,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000738956,0.000262489,0.0002054453,0.0003155837,0.0004987433,0.0004053149,0.0007921161,0.00007160807,0.000007158536],"category_scores_gemma":[0.00002909717,0.0001813433,0.00006433138,0.001353277,0.00020835,0.0003151191,0.0002721802,0.0002171402,0.00003025181],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00004269762,"about_ca_system_score_gemma":0.00007790163,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00002664881,"about_ca_topic_score_gemma":0.00000826361,"domain_scores_codex":[0.9982238,0.0002308103,0.0002749982,0.0005286393,0.0003225794,0.0004191978],"domain_scores_gemma":[0.9985525,0.0005208597,0.000175243,0.0005152826,0.0001284154,0.0001076795],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"observational","study_design_scores_codex":[0.00008539984,0.0002205465,0.002968981,0.00006357286,0.0001389965,0.00006713215,0.001621834,0.1130195,0.001666498,0.6350294,0.006064261,0.2390539],"study_design_scores_gemma":[0.005942905,0.002437983,0.4812805,0.0004064662,0.0003994917,0.003088792,0.001488965,0.1816813,0.04244266,0.247347,0.02956202,0.003921817],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.2644764,0.0006462112,0.7235093,0.00430074,0.0004954998,0.0003739417,0.000003046161,0.0002654618,0.005929444],"genre_scores_gemma":[0.9876117,0.00001313471,0.009393043,0.0002387359,0.0003843162,0.000005921797,0.0000106565,0.00001634357,0.002326161],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.7231354,"threshold_uncertainty_score":0.7394966,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","authors":[{"name":"Yung H. Tsin","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.02004228332791351,"gpt":0.272620019342025,"spread":0.2525777360141114,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.003611576,0.0005385684,0.0004829672,0.0002949809,0.0007887645,0.0004736957,0.003668515,0.0002114552,0.00001351893],"category_scores_gemma":[0.00006078615,0.000415014,0.0003034835,0.0007659762,0.0003241988,0.0009279838,0.001005812,0.0005929044,0.0002583891],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001720851,"about_ca_system_score_gemma":0.00004932022,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00005242183,"about_ca_topic_score_gemma":0.000001691792,"domain_scores_codex":[0.995299,0.001423166,0.0007735293,0.000683127,0.0005619052,0.001259234],"domain_scores_gemma":[0.9961566,0.0007892693,0.0004404455,0.002080277,0.000119095,0.0004142853],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","study_design_scores_codex":[0.0000558182,0.0005748724,0.01232027,0.0001637995,0.0002656991,0.0000352685,0.0291404,0.0002709207,0.1420099,0.7821977,0.004079216,0.02888615],"study_design_scores_gemma":[0.004498359,0.001103146,0.08909951,0.002317676,0.0004611318,0.003856916,0.003146411,0.1054247,0.4360195,0.2917535,0.05461603,0.007703119],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1831964,0.0005863499,0.8012933,0.001801853,0.002267942,0.001072752,0.000002006777,0.001943351,0.007836166],"genre_scores_gemma":[0.9342421,0.000006162308,0.06438756,0.0004371539,0.0005053121,0.00002361832,0.000004500434,0.00005421033,0.0003393574],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.7510458,"threshold_uncertainty_score":0.9998302,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","authors":[{"name":"Mohammad M. Karimi","is_ca":true},{"name":"Arvind Gupta","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01475483218754116,"gpt":0.2761076520725751,"spread":0.261352819885034,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00161599,0.000541208,0.0004589616,0.0003700761,0.0007842036,0.0004271078,0.003882785,0.0001244365,0.00001998423],"category_scores_gemma":[0.00009727877,0.0003743106,0.0001631816,0.001713792,0.0005051446,0.0006684847,0.0006271845,0.0006620953,0.0003012024],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001291755,"about_ca_system_score_gemma":0.0001368973,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000002868208,"about_ca_topic_score_gemma":0.000001499884,"domain_scores_codex":[0.9955602,0.0006880667,0.0004953974,0.00108902,0.0007754625,0.001391871],"domain_scores_gemma":[0.9960715,0.000631105,0.0002193757,0.002275099,0.0002299851,0.0005729558],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0002921839,0.0002314913,0.0001695384,0.00001167837,0.00006430182,0.0001495077,0.002214439,0.004918423,0.008257275,0.9563887,0.0008398331,0.02646266],"study_design_scores_gemma":[0.004361947,0.00498795,0.01663011,0.0005805769,0.0001231439,0.001343325,0.001753431,0.01421754,0.07465491,0.8651864,0.0130554,0.003105266],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.2135203,0.0001389446,0.7547222,0.0210738,0.0007771474,0.002189464,0.00001361408,0.001067026,0.006497537],"genre_scores_gemma":[0.9838102,0.000006446651,0.01194981,0.002125146,0.0002921447,0.00002425397,0.000006464712,0.00004690886,0.001738608],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.7702899,"threshold_uncertainty_score":0.9998709,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null}]}