{"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.072826385,0.00014091788,0.92032236,0.00042919937,0.000983774,0.0006089225,0.00007742605,0.0009497771,0.0036612307],"genre_scores_gemma":[0.75607574,0.000106617095,0.24277371,0.00022119656,0.00029987044,0.00016383984,0.00005244689,0.00006753422,0.0002390533],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99773186,0.00011023612,0.00042084997,0.00060053205,0.00034593843,0.00079057814],"domain_scores_gemma":[0.998057,0.00085661584,0.00011707994,0.000746325,0.00009846118,0.00012452935],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00094565615,0.00029019278,0.0003322989,0.0005169454,0.00023292721,0.00021637083,0.0012709562,0.00012836371,0.00001077311],"category_scores_gemma":[0.00012187811,0.0002876756,0.00018504354,0.001736297,0.00030016966,0.0002730824,0.0005003409,0.00025867118,0.000032296193],"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.000006130307,0.0000738221,0.000068922425,0.00002232397,0.000017616327,0.000029679464,0.0012911075,0.00021278612,0.0002317092,0.619348,0.00009591397,0.37860203],"study_design_scores_gemma":[0.00049492286,0.00015515179,0.00018441664,0.00009585482,0.000009093868,0.0000113798715,0.00034627476,0.4071139,0.0030228393,0.58760434,0.0006662956,0.0002955217],"about_ca_topic_score_codex":0.000022190716,"about_ca_topic_score_gemma":0.000022416707,"teacher_disagreement_score":0.68324935,"about_ca_system_score_codex":0.00008010294,"about_ca_system_score_gemma":0.000054743694,"threshold_uncertainty_score":0.99995756},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.028121555,0.0007965348,0.9507534,0.016322805,0.0012071831,0.0004851803,0.0000035306846,0.00021613247,0.0020936949],"genre_scores_gemma":[0.99527174,0.000006119186,0.0034665389,0.000516459,0.00040135594,0.00004388655,0.0000023330588,0.00001989128,0.00027169217],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9985842,0.00018623477,0.00023974419,0.0003466851,0.00034942364,0.00029367706],"domain_scores_gemma":[0.99863356,0.00040655414,0.000051127136,0.0008145445,0.000025099322,0.00006912217],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013483207,0.00016520826,0.00012158524,0.00006585947,0.00027798148,0.00047893688,0.0012840688,0.000059053258,0.000034491743],"category_scores_gemma":[0.000048301765,0.00008458345,0.00008901703,0.00050491584,0.00011098412,0.00016246298,0.00034386717,0.00019363113,0.00045703133],"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.0000028459756,0.000011594378,0.000041368847,0.000024117364,0.000026849964,0.000004500611,0.0069571356,0.0001599708,0.00035860136,0.9521604,0.001144559,0.039108057],"study_design_scores_gemma":[0.000100394,0.00007557552,0.0007709696,0.000059844824,0.000032795135,0.000038085964,0.00024715648,0.79223824,0.0025487146,0.18537274,0.018249862,0.00026565974],"about_ca_topic_score_codex":0.00002519613,"about_ca_topic_score_gemma":0.000042635605,"teacher_disagreement_score":0.96715015,"about_ca_system_score_codex":0.00003303369,"about_ca_system_score_gemma":0.000032443077,"threshold_uncertainty_score":0.58743656},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0019013303,0.00012246973,0.991546,0.00045102934,0.00045793512,0.00032306477,0.000024798375,0.00028798566,0.004885412],"genre_scores_gemma":[0.14638655,0.000024955969,0.85251623,0.00051974924,0.00012431014,0.00006340594,0.0000383137,0.000016912116,0.00030959566],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9987515,0.00006957243,0.00028206073,0.00035993507,0.00018590268,0.00035103725],"domain_scores_gemma":[0.9987574,0.00042323698,0.00008873794,0.0005635243,0.000112198875,0.000054902826],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005646419,0.00017400556,0.0001973604,0.00017940163,0.00032439464,0.00022338843,0.000830962,0.00008244205,0.000016503123],"category_scores_gemma":[0.000042209376,0.00016935877,0.00011385743,0.000521706,0.000114655806,0.00023560345,0.00032180498,0.00014891138,0.0000083815075],"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.000001993786,0.000028746725,0.000006251541,0.000024645686,0.000014599642,0.0000012649706,0.00035209078,0.00002189178,0.00009044419,0.62831134,0.00015946264,0.3709873],"study_design_scores_gemma":[0.00020260285,0.000023093831,0.000018435618,0.000032345077,0.000009399352,0.0000031102652,0.000071612056,0.42390656,0.002261076,0.5712424,0.0021200075,0.00010936391],"about_ca_topic_score_codex":0.000009641216,"about_ca_topic_score_gemma":0.0000017554241,"teacher_disagreement_score":0.42388466,"about_ca_system_score_codex":0.000047117,"about_ca_system_score_gemma":0.000057994468,"threshold_uncertainty_score":0.690625},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.933493,0.0016291627,0.017974485,0.0006838997,0.00004313936,0.000206268,0.0000031375569,0.000018793819,0.04594807],"genre_scores_gemma":[0.9972296,0.00064728374,0.0012799448,0.0003798582,0.000017786642,0.000010082945,0.00004571854,0.0000027640817,0.00038695626],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9995024,0.00015801903,0.00011903678,0.000119968696,0.000024349583,0.0000761801],"domain_scores_gemma":[0.9995784,0.000099721234,0.00003299732,0.00023340531,0.000037357633,0.000018081484],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00032144765,0.000055444965,0.00010621286,0.000020363283,0.00008650336,0.000017970777,0.00010629596,0.000060518087,0.0000058966416],"category_scores_gemma":[0.00022444571,0.000041405165,0.00004546392,0.000060379658,0.00030722254,7.1504e-7,0.0001514987,0.000044827466,9.835762e-7],"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.0028495966,0.00003031772,0.0012118444,0.000010728273,0.00007545652,2.5524457e-7,0.000059269874,0.000018991259,0.08237702,0.9081301,0.00075958966,0.004476839],"study_design_scores_gemma":[0.04782649,0.000117604985,0.002505345,0.000049063125,0.00012843937,0.00000844928,0.00029872463,0.0009747921,0.09395612,0.84718007,0.006644854,0.00031004244],"about_ca_topic_score_codex":0.00000496171,"about_ca_topic_score_gemma":0.0000013992274,"teacher_disagreement_score":0.06373656,"about_ca_system_score_codex":0.0000015407262,"about_ca_system_score_gemma":0.0000078665735,"threshold_uncertainty_score":0.16884536},"labels":[],"label_agreement":null}]}