{"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"},"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001348321,0.0001652083,0.0001215852,0.00006585947,0.0002779815,0.0004789369,0.001284069,0.00005905326,0.00003449174],"category_scores_gemma":[0.00004830176,0.00008458345,0.00008901703,0.0005049158,0.0001109841,0.000162463,0.0003438672,0.0001936311,0.0004570313],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00003303369,"about_ca_system_score_gemma":0.00003244308,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00002519613,"about_ca_topic_score_gemma":0.00004263561,"domain_scores_codex":[0.9985842,0.0001862348,0.0002397442,0.0003466851,0.0003494236,0.0002936771],"domain_scores_gemma":[0.9986336,0.0004065541,0.00005112714,0.0008145445,0.00002509932,0.00006912217],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.000002845976,0.00001159438,0.00004136885,0.00002411736,0.00002684996,0.000004500611,0.006957136,0.0001599708,0.0003586014,0.9521604,0.001144559,0.03910806],"study_design_scores_gemma":[0.000100394,0.00007557552,0.0007709696,0.00005984482,0.00003279513,0.00003808596,0.0002471565,0.7922382,0.002548715,0.1853727,0.01824986,0.0002656597],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.02812156,0.0007965348,0.9507534,0.0163228,0.001207183,0.0004851803,0.000003530685,0.0002161325,0.002093695],"genre_scores_gemma":[0.9952717,0.000006119186,0.003466539,0.000516459,0.0004013559,0.00004388655,0.000002333059,0.00001989128,0.0002716922],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9671502,"threshold_uncertainty_score":0.5874366,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005646419,0.0001740056,0.0001973604,0.0001794016,0.0003243946,0.0002233884,0.000830962,0.00008244205,0.00001650312],"category_scores_gemma":[0.00004220938,0.0001693588,0.0001138574,0.000521706,0.0001146558,0.0002356035,0.000321805,0.0001489114,0.000008381508],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000047117,"about_ca_system_score_gemma":0.00005799447,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000009641216,"about_ca_topic_score_gemma":0.000001755424,"domain_scores_codex":[0.9987515,0.00006957243,0.0002820607,0.0003599351,0.0001859027,0.0003510372],"domain_scores_gemma":[0.9987574,0.000423237,0.00008873794,0.0005635243,0.0001121989,0.00005490283],"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.000001993786,0.00002874672,0.000006251541,0.00002464569,0.00001459964,0.000001264971,0.0003520908,0.00002189178,0.00009044419,0.6283113,0.0001594626,0.3709873],"study_design_scores_gemma":[0.0002026029,0.00002309383,0.00001843562,0.00003234508,0.000009399352,0.000003110265,0.00007161206,0.4239066,0.002261076,0.5712424,0.002120008,0.0001093639],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.00190133,0.0001224697,0.991546,0.0004510293,0.0004579351,0.0003230648,0.00002479838,0.0002879857,0.004885412],"genre_scores_gemma":[0.1463865,0.00002495597,0.8525162,0.0005197492,0.0001243101,0.00006340594,0.0000383137,0.00001691212,0.0003095957],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.4238847,"threshold_uncertainty_score":0.690625,"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","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":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0009456562,0.0002901928,0.0003322989,0.0005169454,0.0002329272,0.0002163708,0.001270956,0.0001283637,0.00001077311],"category_scores_gemma":[0.0001218781,0.0002876756,0.0001850435,0.001736297,0.0003001697,0.0002730824,0.0005003409,0.0002586712,0.00003229619],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00008010294,"about_ca_system_score_gemma":0.00005474369,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00002219072,"about_ca_topic_score_gemma":0.00002241671,"domain_scores_codex":[0.9977319,0.0001102361,0.00042085,0.000600532,0.0003459384,0.0007905781],"domain_scores_gemma":[0.998057,0.0008566158,0.0001170799,0.000746325,0.00009846118,0.0001245294],"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.000006130307,0.0000738221,0.00006892243,0.00002232397,0.00001761633,0.00002967946,0.001291108,0.0002127861,0.0002317092,0.619348,0.00009591397,0.378602],"study_design_scores_gemma":[0.0004949229,0.0001551518,0.0001844166,0.00009585482,0.000009093868,0.00001137987,0.0003462748,0.4071139,0.003022839,0.5876043,0.0006662956,0.0002955217],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.07282639,0.0001409179,0.9203224,0.0004291994,0.000983774,0.0006089225,0.00007742605,0.0009497771,0.003661231],"genre_scores_gemma":[0.7560757,0.0001066171,0.2427737,0.0002211966,0.0002998704,0.0001638398,0.00005244689,0.00006753422,0.0002390533],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.6832494,"threshold_uncertainty_score":0.9999576,"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)","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003214476,0.00005544497,0.0001062129,0.00002036328,0.00008650336,0.00001797078,0.000106296,0.00006051809,0.000005896642],"category_scores_gemma":[0.0002244457,0.00004140516,0.00004546392,0.00006037966,0.0003072225,7.1504e-7,0.0001514987,0.00004482747,9.835762e-7],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000001540726,"about_ca_system_score_gemma":0.000007866573,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00000496171,"about_ca_topic_score_gemma":0.000001399227,"domain_scores_codex":[0.9995024,0.000158019,0.0001190368,0.0001199687,0.00002434958,0.0000761801],"domain_scores_gemma":[0.9995784,0.00009972123,0.00003299732,0.0002334053,0.00003735763,0.00001808148],"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.002849597,0.00003031772,0.001211844,0.00001072827,0.00007545652,2.552446e-7,0.00005926987,0.00001899126,0.08237702,0.9081301,0.0007595897,0.004476839],"study_design_scores_gemma":[0.04782649,0.000117605,0.002505345,0.00004906312,0.0001284394,0.00000844928,0.0002987246,0.0009747921,0.09395612,0.8471801,0.006644854,0.0003100424],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.933493,0.001629163,0.01797448,0.0006838997,0.00004313936,0.000206268,0.000003137557,0.00001879382,0.04594807],"genre_scores_gemma":[0.9972296,0.0006472837,0.001279945,0.0003798582,0.00001778664,0.00001008294,0.00004571854,0.000002764082,0.0003869563],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.06373656,"threshold_uncertainty_score":0.1688454,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null}]}