{"meta":{"page":1,"per_page":50,"max_per_page":100,"total":4,"total_is_capped":false,"direct_labels_cover":0,"predictions_cover":4,"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":"2cfa67711d32","filters":{"venue":"TheoretiCS"}},"results":[{"id":"W4396930828","doi":"10.46298/theoretics.24.14","title":"Unifying the Three Algebraic Approaches to the CSP via Minimal Taylor Algebras","year":2024,"lang":"en","type":"article","venue":"TheoretiCS","topic":"Multi-Agent Systems and Negotiation","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"Simon Fraser University","funders":"European Commission; Natural Sciences and Engineering Research Council of Canada; Division of Mathematical Sciences; National Science Foundation; Narodowym Centrum Nauki; National Research University Higher School of Economics","keywords":"Algebraic number; Algebra over a field; Mathematics; Computer science; Programming language; Pure mathematics","authors":[{"name":"Zarathustra Brady","is_ca":false},{"name":"Andreǐ A. Bulatov","is_ca":true},{"name":"Marcin Kozik","is_ca":false},{"name":"Dmitriy Zhuk","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.07831644072835506,"gpt":0.2471832289377142,"spread":0.1688667882093592,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004448458,0.0005122713,0.0007864712,0.002084599,0.002235541,0.003932673,0.002312524,0.001453369,0.005403157],"category_scores_gemma":[0.009337245,0.0004372371,0.001608294,0.001601267,0.008662745,0.01683907,0.005445625,0.004302091,0.0006530751],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002832108,"about_ca_system_score_gemma":0.003547478,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001509917,"about_ca_topic_score_gemma":0.001854443,"domain_scores_codex":[0.9962999,0.001332525,0.0002406636,0.0003973732,0.001401342,0.0003282524],"domain_scores_gemma":[0.9934189,0.003627245,0.0006024208,0.001006772,0.0008935935,0.0004510151],"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.000003467505,0.000006630108,0.00003843293,0.00001296898,0.000001641233,0.00001087486,0.00008466021,0.0004056378,0.00009930212,0.9972988,0.0001011973,0.001936421],"study_design_scores_gemma":[0.00000545356,0.0000122612,0.00004788077,0.0000159841,0.000003955739,0.00003123274,0.00008353621,0.008032381,0.000403234,0.9881846,0.003169912,0.000009507206],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01995267,0.0008421358,0.9366155,0.003789113,0.0001147264,0.0001370885,0.00008999459,0.0001688274,0.03828995],"genre_scores_gemma":[0.58246,0.001913975,0.4027265,0.001263592,0.0006311334,0.0004855645,0.0002155115,0.0001506019,0.01015301],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.005403157,"threshold_uncertainty_score":0.02352595,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W4412825210","doi":"10.46298/theoretics.25.16","title":"A Simple $(1-ε)$-Approximation Semi-Streaming Algorithm for Maximum (Weighted) Matching","year":2025,"lang":"en","type":"article","venue":"TheoretiCS","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":false,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"","funders":"Natural Sciences and Engineering Research Council of Canada; University of Waterloo","keywords":"Simple (philosophy); Matching (statistics); Algorithm; Computer science; Mathematics; Mathematical optimization; Statistics","authors":[{"name":"Sepehr Assadi","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01156349149600269,"gpt":0.2623285952666254,"spread":0.2507651037706228,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001166505,0.00124984,0.001205514,0.0007953528,0.0007541167,0.001548558,0.003268964,0.00185354,0.0146577],"category_scores_gemma":[0.005502199,0.000631522,0.001116098,0.001554646,0.0008238512,0.004253252,0.003001546,0.002126509,0.00579328],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001367905,"about_ca_system_score_gemma":0.002222015,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001993709,"about_ca_topic_score_gemma":0.003902924,"domain_scores_codex":[0.99871,0.0002357902,0.00009438278,0.0003591735,0.0004366732,0.0001639121],"domain_scores_gemma":[0.9983228,0.0004839555,0.0001364687,0.0007107047,0.0002088466,0.0001372034],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.001079008,0.0006116165,0.0012284,0.0006388748,0.0001396844,0.0001849408,0.000320092,0.1091615,0.04200084,0.09917694,0.04827733,0.6971807],"study_design_scores_gemma":[0.0002300394,0.000203132,0.0003331074,0.00004560985,0.0000445431,0.0003711548,0.00009089236,0.8601677,0.0125223,0.1100437,0.01590694,0.00004071631],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.0173487,0.0003513117,0.9686834,0.000784372,0.0002190939,0.000285909,0.0005509605,0.004591446,0.007184905],"genre_scores_gemma":[0.1114475,0.0001789655,0.8780288,0.0003496468,0.0001182667,0.0003210807,0.00132677,0.0005840886,0.007644876],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.0146577,"threshold_uncertainty_score":0.04903489,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W4385963754","doi":"10.46298/theoretics.23.9","title":"Brooks' Theorem in Graph Streams: A Single-Pass Semi-Streaming Algorithm for $\\Delta$-Coloring","year":2023,"lang":"en","type":"article","venue":"TheoretiCS","topic":"Complexity and Algorithms in Graphs","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":"University of Waterloo","funders":"European Commission; National Science Foundation","keywords":"Greedy coloring; Graph coloring; Fractional coloring; Edge coloring; Colored; Impossibility; Combinatorics; Complete coloring; Graph; Computer science; Streaming algorithm; Mathematics; Discrete mathematics; Algorithm; Theoretical computer science; Graph power; Line graph; Upper and lower bounds","authors":[{"name":"Sepehr Assadi","is_ca":true},{"name":"Pankaj Kumar","is_ca":false},{"name":"Parth Mittal","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.02922000910492449,"gpt":0.260946489951689,"spread":0.2317264808467645,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004964494,0.001557764,0.001392147,0.0009898777,0.001761324,0.00217818,0.004772368,0.001791,0.00523481],"category_scores_gemma":[0.02234915,0.0009723415,0.001760597,0.001219738,0.003133894,0.006268806,0.003476858,0.003815714,0.001630751],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.003347293,"about_ca_system_score_gemma":0.005602761,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00728718,"about_ca_topic_score_gemma":0.008662761,"domain_scores_codex":[0.9965113,0.0009751152,0.0001997977,0.001111559,0.0007974274,0.0004047483],"domain_scores_gemma":[0.9855912,0.007328402,0.0008928516,0.004177159,0.001191,0.0008193907],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.001643354,0.0004596177,0.004222231,0.0004843111,0.0001833742,0.0003108494,0.001161969,0.3587381,0.01887158,0.3520246,0.03064637,0.2312538],"study_design_scores_gemma":[0.0001491238,0.0001107783,0.0001852294,0.00003350092,0.00002798858,0.0001156791,0.00009352929,0.7537745,0.005119612,0.2367157,0.003634951,0.00003947015],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.02467962,0.0001749793,0.9664588,0.00124646,0.0001278193,0.0002290643,0.0002739669,0.002826473,0.003982834],"genre_scores_gemma":[0.3519761,0.0002905088,0.6362546,0.001238988,0.0001829013,0.0006522392,0.0008497912,0.0009751004,0.007579695],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.00728718,"threshold_uncertainty_score":0.02625513,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W4414684356","doi":"10.46298/theoretics.25.20","title":"Randomized Communication and Implicit Graph Representations","year":2025,"lang":"en","type":"article","venue":"TheoretiCS","topic":"DNA and Biological Computing","field":"Biochemistry, Genetics and Molecular Biology","cited_by":0,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":false,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"","funders":"Natural Sciences and Engineering Research Council of Canada; Engineering and Physical Sciences Research Council; University of Waterloo","keywords":"Adjacency list; Cartesian product; Graph; Probabilistic logic; Randomized algorithm; Adjacency matrix; Perspective (graphical)","authors":[{"name":"Nathaniel Harms","is_ca":false},{"name":"Sebastian Wild","is_ca":false},{"name":"Viktor Zamaraev","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.007706268266125669,"gpt":0.2894070737007912,"spread":0.2817008054346655,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.005666589,0.0008375132,0.001333693,0.0010592,0.002028452,0.004272501,0.003831022,0.002871355,0.009559684],"category_scores_gemma":[0.04445738,0.0007909348,0.001517759,0.002176317,0.005523403,0.02111822,0.005634325,0.005627263,0.0009521622],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.004242636,"about_ca_system_score_gemma":0.002154135,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001035048,"about_ca_topic_score_gemma":0.0008640527,"domain_scores_codex":[0.990463,0.00372836,0.000568689,0.002166013,0.001954802,0.001119246],"domain_scores_gemma":[0.9384311,0.04188626,0.003850164,0.01312568,0.001770581,0.0009360792],"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.0000936314,0.00006025118,0.0002488185,0.0001147026,0.0000142347,0.0000377076,0.0002109674,0.02037037,0.0009864019,0.9585621,0.001239921,0.01806095],"study_design_scores_gemma":[0.00003304446,0.00004590355,0.0001262021,0.00003036462,0.00001712566,0.00007506184,0.00008975547,0.07193373,0.001644936,0.9217115,0.004267331,0.00002508915],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.08736334,0.0007336479,0.8828229,0.006064714,0.0002005278,0.0002550382,0.0004035046,0.0007069974,0.02144924],"genre_scores_gemma":[0.7746089,0.0009078577,0.2087079,0.0008568501,0.0004025059,0.0007560731,0.0005871906,0.0004488757,0.01272386],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.009559684,"threshold_uncertainty_score":0.03198034,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null}]}