{"meta":{"query_hash":"2cfa67711d32","filters":{"venue":"TheoretiCS"},"cohort_total":4,"direct_labels_cover":0,"predictions_cover":4,"exported":4,"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/2cfa67711d32","api":"https://metacan.xera.ac/api/v1/cohort?venue=TheoretiCS"},"results":[{"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.02922000910492449,"score_gpt":0.260946489951689,"score_spread":0.2317264808467645,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4385963754","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.02467962,0.00017497934,0.9664588,0.0012464602,0.00012781925,0.00022906429,0.00027396693,0.0028264727,0.003982834],"genre_scores_gemma":[0.3519761,0.00029050882,0.6362546,0.0012389885,0.00018290128,0.0006522392,0.00084979116,0.00097510044,0.0075796954],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9965113,0.00097511517,0.00019979767,0.0011115591,0.00079742743,0.00040474834],"domain_scores_gemma":[0.9855912,0.0073284023,0.00089285156,0.004177159,0.0011909995,0.0008193907],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0049644937,0.0015577638,0.0013921473,0.0009898777,0.0017613239,0.0021781796,0.004772368,0.0017910004,0.00523481],"category_scores_gemma":[0.022349149,0.00097234146,0.0017605972,0.0012197376,0.0031338942,0.0062688063,0.0034768577,0.0038157138,0.0016307513],"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.0016433544,0.00045961767,0.004222231,0.0004843111,0.00018337423,0.00031084937,0.0011619692,0.35873806,0.018871585,0.35202456,0.030646374,0.23125379],"study_design_scores_gemma":[0.00014912384,0.00011077831,0.00018522938,0.00003350092,0.000027988584,0.00011567913,0.00009352929,0.75377446,0.0051196124,0.23671572,0.003634951,0.000039470153],"about_ca_topic_score_codex":0.00728718,"about_ca_topic_score_gemma":0.008662761,"teacher_disagreement_score":0.00728718,"about_ca_system_score_codex":0.003347293,"about_ca_system_score_gemma":0.0056027607,"threshold_uncertainty_score":0.02625513},"labels":[],"label_agreement":null},{"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,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_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","score_opus":0.07831644072835506,"score_gpt":0.24718322893771422,"score_spread":0.16886678820935916,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4396930828","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.019952668,0.0008421358,0.93661547,0.0037891127,0.00011472641,0.00013708854,0.00008999459,0.0001688274,0.038289946],"genre_scores_gemma":[0.58246,0.0019139751,0.40272653,0.0012635917,0.0006311334,0.0004855645,0.0002155115,0.00015060187,0.010153012],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9962999,0.0013325246,0.0002406636,0.0003973732,0.0014013419,0.00032825244],"domain_scores_gemma":[0.9934189,0.0036272446,0.00060242077,0.0010067717,0.0008935935,0.00045101508],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0044484576,0.0005122713,0.0007864712,0.0020845989,0.0022355407,0.0039326735,0.002312524,0.0014533686,0.0054031573],"category_scores_gemma":[0.009337245,0.0004372371,0.001608294,0.0016012669,0.008662745,0.01683907,0.0054456247,0.0043020914,0.00065307505],"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.000003467505,0.0000066301077,0.000038432932,0.0000129689815,0.0000016412325,0.000010874864,0.00008466021,0.00040563778,0.00009930212,0.9972988,0.000101197336,0.0019364211],"study_design_scores_gemma":[0.00000545356,0.000012261199,0.000047880767,0.000015984102,0.0000039557385,0.00003123274,0.00008353621,0.008032381,0.00040323398,0.9881846,0.003169912,0.0000095072055],"about_ca_topic_score_codex":0.0015099173,"about_ca_topic_score_gemma":0.0018544428,"teacher_disagreement_score":0.0054031573,"about_ca_system_score_codex":0.0028321084,"about_ca_system_score_gemma":0.0035474775,"threshold_uncertainty_score":0.023525953},"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,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_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","score_opus":0.011563491496002689,"score_gpt":0.26232859526662544,"score_spread":0.2507651037706228,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4412825210","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.017348696,0.00035131173,0.96868336,0.000784372,0.00021909387,0.00028590905,0.00055096054,0.004591446,0.0071849045],"genre_scores_gemma":[0.11144751,0.00017896552,0.8780288,0.00034964675,0.00011826665,0.0003210807,0.0013267697,0.00058408856,0.007644876],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99871004,0.00023579017,0.00009438278,0.00035917346,0.00043667323,0.00016391207],"domain_scores_gemma":[0.9983228,0.00048395555,0.0001364687,0.0007107047,0.00020884658,0.0001372034],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001166505,0.0012498397,0.0012055144,0.0007953528,0.0007541167,0.0015485582,0.0032689637,0.0018535401,0.014657703],"category_scores_gemma":[0.005502199,0.00063152204,0.0011160978,0.001554646,0.00082385115,0.004253252,0.0030015465,0.0021265086,0.00579328],"study_design_candidate":"simulation_or_modeling","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.0010790079,0.00061161653,0.0012283996,0.0006388748,0.00013968442,0.0001849408,0.00032009196,0.10916147,0.042000838,0.09917694,0.048277326,0.69718075],"study_design_scores_gemma":[0.00023003937,0.00020313202,0.0003331074,0.000045609846,0.0000445431,0.0003711548,0.00009089236,0.86016774,0.012522295,0.11004375,0.015906945,0.00004071631],"about_ca_topic_score_codex":0.0019937085,"about_ca_topic_score_gemma":0.0039029242,"teacher_disagreement_score":0.014657703,"about_ca_system_score_codex":0.0013679054,"about_ca_system_score_gemma":0.0022220153,"threshold_uncertainty_score":0.049034894},"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,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_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)","score_opus":0.007706268266125669,"score_gpt":0.2894070737007912,"score_spread":0.2817008054346655,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4414684356","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.08736334,0.0007336479,0.88282293,0.0060647144,0.00020052781,0.00025503818,0.0004035046,0.0007069974,0.02144924],"genre_scores_gemma":[0.77460885,0.00090785767,0.20870788,0.00085685006,0.0004025059,0.0007560731,0.00058719056,0.0004488757,0.012723861],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99046296,0.0037283604,0.00056868896,0.0021660132,0.0019548023,0.0011192465],"domain_scores_gemma":[0.93843114,0.041886255,0.003850164,0.013125678,0.0017705812,0.0009360792],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.005666589,0.00083751325,0.0013336933,0.0010592005,0.0020284518,0.0042725005,0.0038310222,0.0028713548,0.0095596835],"category_scores_gemma":[0.044457376,0.0007909348,0.0015177586,0.0021763172,0.0055234027,0.021118222,0.0056343246,0.005627263,0.0009521622],"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.000093631395,0.000060251183,0.00024881848,0.00011470263,0.000014234699,0.000037707603,0.0002109674,0.020370368,0.0009864019,0.9585621,0.0012399212,0.01806095],"study_design_scores_gemma":[0.000033044456,0.00004590355,0.0001262021,0.000030364623,0.000017125658,0.00007506184,0.00008975547,0.07193373,0.0016449358,0.9217115,0.004267331,0.000025089153],"about_ca_topic_score_codex":0.0010350478,"about_ca_topic_score_gemma":0.00086405274,"teacher_disagreement_score":0.0095596835,"about_ca_system_score_codex":0.0042426363,"about_ca_system_score_gemma":0.0021541354,"threshold_uncertainty_score":0.031980336},"labels":[],"label_agreement":null}]}