{"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002480675,0.0006016833,0.0005755616,0.0005079723,0.0003969161,0.0007860755,0.0008470934,0.0005858634,0.006106582],"category_scores_gemma":[0.00160717,0.0003019794,0.0004651519,0.0007393291,0.000496656,0.002361635,0.002245829,0.0005310547,0.001554868],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0003119793,"about_ca_system_score_gemma":0.0002972318,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000371279,"about_ca_topic_score_gemma":0.0008649737,"domain_scores_codex":[0.9995561,0.00005600128,0.00003364719,0.0001326968,0.0001277601,0.00009380444],"domain_scores_gemma":[0.9990913,0.0002872561,0.0001374151,0.0002922721,0.00005653727,0.0001351878],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.001342714,0.00036262,0.008665677,0.0006638438,0.0001434114,0.001324716,0.0007853857,0.1944323,0.06643328,0.2185082,0.01300893,0.4943289],"study_design_scores_gemma":[0.0001722575,0.0009013739,0.002497759,0.0001094465,0.0000657121,0.001898695,0.0005244904,0.4409766,0.04845906,0.47203,0.03229074,0.00007383223],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.4749889,0.0005128956,0.4906864,0.0004420281,0.00008974627,0.0001788904,0.0005622354,0.002371386,0.03016757],"genre_scores_gemma":[0.7997019,0.0002740148,0.1896728,0.00009779684,0.00004576623,0.00008891199,0.001322381,0.0001493296,0.008647054],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.006106582,"threshold_uncertainty_score":0.02042854,"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003406353,0.001097507,0.0006891461,0.001688448,0.0007630051,0.001091816,0.0009288029,0.00049653,0.01099861],"category_scores_gemma":[0.00153006,0.0005284416,0.0009165219,0.001636664,0.0005589219,0.001995311,0.001884792,0.00100109,0.003093107],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000642869,"about_ca_system_score_gemma":0.001026558,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.003595047,"about_ca_topic_score_gemma":0.006415345,"domain_scores_codex":[0.9995657,0.00005563685,0.00002404353,0.0001337061,0.0001594675,0.00006148544],"domain_scores_gemma":[0.9991542,0.0002600543,0.00006107892,0.0002007885,0.0002591079,0.0000647429],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0002454222,0.0001447992,0.001220694,0.0005209048,0.0000823392,0.000648337,0.0003962135,0.05147252,0.06078206,0.03028042,0.0105369,0.8436695],"study_design_scores_gemma":[0.00007996713,0.0003595785,0.002004995,0.0001265293,0.0001341559,0.001217265,0.0008794685,0.6817731,0.07029404,0.1912391,0.05181964,0.00007212889],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.0148327,0.0001364503,0.9799257,0.0001012479,0.00003221021,0.0002150039,0.000187033,0.001852571,0.002717076],"genre_scores_gemma":[0.0625828,0.0001753232,0.9306925,0.0000792163,0.0000167793,0.0001391105,0.001109079,0.0004895385,0.004715777],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01099861,"threshold_uncertainty_score":0.03679401,"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004120796,0.000319914,0.0003771954,0.0009544952,0.0007956545,0.001030887,0.0007764568,0.0007282353,0.003780171],"category_scores_gemma":[0.004598949,0.0002828627,0.0004527666,0.000832426,0.0007773923,0.001613149,0.001222933,0.000725004,0.0003448598],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0007249743,"about_ca_system_score_gemma":0.0003985083,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000953361,"about_ca_topic_score_gemma":0.001069535,"domain_scores_codex":[0.9996064,0.0001051621,0.00002756336,0.00008406281,0.00007530349,0.0001015695],"domain_scores_gemma":[0.9979448,0.001152592,0.0002384989,0.0002234884,0.0002118766,0.0002287448],"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.0004894591,0.0002502925,0.003487103,0.0003728576,0.00009870448,0.001813897,0.001646312,0.07931995,0.01019916,0.8083416,0.006705509,0.08727518],"study_design_scores_gemma":[0.000078591,0.0001038184,0.0009076963,0.00002933663,0.00003727652,0.0005722683,0.0003219676,0.1456016,0.002928605,0.8428386,0.006555844,0.00002433273],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.8128856,0.0003921156,0.1632298,0.00091183,0.0001118615,0.0001449139,0.0003763023,0.0004351392,0.02151246],"genre_scores_gemma":[0.9520702,0.0001869291,0.03863323,0.0001542056,0.00008953889,0.00008553824,0.0003270017,0.00008445232,0.008368922],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.003780171,"threshold_uncertainty_score":0.0126459,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null}]}