{"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":"5c18e1baa980","filters":{"venue":"2022 IEEE 63rd Annual Symposium on Foundations of Computer Science (FOCS)"}},"results":[{"id":"W4313203312","doi":"10.1109/focs54457.2022.00064","title":"Maximum Flow and Minimum-Cost Flow in Almost-Linear Time","year":2022,"lang":"en","type":"article","venue":"2022 IEEE 63rd Annual Symposium on Foundations of Computer Science (FOCS)","topic":"Optimization and Search Problems","field":"Computer Science","cited_by":132,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Toronto; University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Minimum-cost flow problem; Mathematics; Minimum cut; Separable space; Combinatorics; Amortized analysis; Bounded function; Regular polygon; Scaling; Time complexity; Maximum flow problem; Flow (mathematics); Discrete mathematics; Directed graph; Approximation algorithm; Mathematical optimization; Flow network; Computer science; Data structure","authors":[{"name":"Li Chen","is_ca":false},{"name":"Rasmus Kyng","is_ca":false},{"name":"Yang P. Liu","is_ca":false},{"name":"Richard Peng","is_ca":true},{"name":"Maximilian Probst Gutenberg","is_ca":false},{"name":"Sushant Sachdeva","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01399420956229129,"gpt":0.2647044641196495,"spread":0.2507102545573582,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.001815291,0.0002563669,0.0003281721,0.001028903,0.0009900427,0.0003822566,0.002387464,0.0000508864,0.0001947077],"category_scores_gemma":[0.00004181482,0.0002755409,0.00008525269,0.003289393,0.0004936216,0.001811001,0.001310071,0.0003963106,0.0001042413],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0002322854,"about_ca_system_score_gemma":0.0005276329,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00003430622,"about_ca_topic_score_gemma":0.000009348529,"domain_scores_codex":[0.996119,0.0002545129,0.0005934485,0.001010934,0.00138274,0.0006393283],"domain_scores_gemma":[0.9980744,0.0002092729,0.0001980198,0.00090464,0.0003453961,0.0002683152],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00004065012,0.00078786,0.0002793462,0.00002474084,0.00001939684,0.00002742349,0.006026563,0.922797,0.004211518,0.00748291,0.00455849,0.05374405],"study_design_scores_gemma":[0.0006928509,0.0006212774,0.0002974757,0.00001930947,0.000003564307,0.00003295368,0.00007044169,0.9885436,0.0005879065,0.0008897127,0.00793092,0.0003099363],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.04945556,0.00004829012,0.9315991,0.01064762,0.003136725,0.001670373,0.0002496254,0.0003282203,0.002864467],"genre_scores_gemma":[0.5239353,0.0001395753,0.4669846,0.004376112,0.0004693914,0.0005051045,0.0001289758,0.00009255576,0.003368368],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.4744797,"threshold_uncertainty_score":0.9999697,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W4313227384","doi":"10.1109/focs54457.2022.00111","title":"Separations in Proof Complexity and TFNP","year":2022,"lang":"en","type":"article","venue":"2022 IEEE 63rd Annual Symposium on Foundations of Computer Science (FOCS)","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"McGill University","funders":"","keywords":"Unary operation; Mathematical proof; Resolution (logic); Oracle; Combinatorics; Computer science; Discrete mathematics; Algorithm; Mathematics; Theoretical computer science; Artificial intelligence; Programming language","authors":[{"name":"Mika Göös","is_ca":false},{"name":"Alexandros Hollender","is_ca":false},{"name":"Siddhartha Jain","is_ca":false},{"name":"Gilbert Maystre","is_ca":false},{"name":"William Pires","is_ca":true},{"name":"Robert Robere","is_ca":true},{"name":"Ran Tao","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.02592606288442114,"gpt":0.285306659503105,"spread":0.2593805966186838,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow","sts"],"consensus_categories":[],"category_scores_codex":[0.001408926,0.0002357595,0.0003213037,0.001049689,0.001610409,0.0003599842,0.00251211,0.00003539619,0.00005782904],"category_scores_gemma":[0.00002463221,0.0002636326,0.00009642275,0.003784694,0.001068687,0.001667084,0.001497199,0.0004188936,0.00001219393],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0002159199,"about_ca_system_score_gemma":0.0004239977,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0001179325,"about_ca_topic_score_gemma":0.00008090653,"domain_scores_codex":[0.9965552,0.0002159517,0.000569802,0.0009545374,0.001184356,0.0005201533],"domain_scores_gemma":[0.998162,0.0002153435,0.0002342482,0.0009638749,0.0002479324,0.0001766029],"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.00003276159,0.00158442,0.00133578,0.00003622735,0.00002901239,0.00002248708,0.008841531,0.0581397,0.003257105,0.8911904,0.002365106,0.03316548],"study_design_scores_gemma":[0.001050866,0.001521262,0.01038762,0.00004044158,0.00001061672,0.0001085864,0.0003062891,0.9087114,0.002628727,0.06318285,0.01131612,0.0007351924],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.2829482,0.00007490212,0.6992304,0.00859194,0.004035916,0.001221788,0.0002305839,0.0002806207,0.003385676],"genre_scores_gemma":[0.9610404,0.00001136098,0.03797115,0.0005755664,0.0001015921,0.0001163038,0.00001131922,0.00001162854,0.0001606783],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.8505718,"threshold_uncertainty_score":0.9999816,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W4313227811","doi":"10.1109/focs54457.2022.00065","title":"Randomised Composition and Small-Bias Minimax","year":2022,"lang":"en","type":"article","venue":"2022 IEEE 63rd Annual Symposium on Foundations of Computer Science (FOCS)","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":2,"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":"","keywords":"Bounded function; Omega; Combinatorics; Measure (data warehouse); Composition (language); Minimax; Mathematics; Discrete mathematics; Computer science; Physics; Mathematical economics; Philosophy; Data mining; Mathematical analysis","authors":[{"name":"Shalev Ben-David","is_ca":true},{"name":"Eric Blais","is_ca":true},{"name":"Mika Göös","is_ca":false},{"name":"Gilbert Maystre","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.02453953521556946,"gpt":0.2578444318068889,"spread":0.2333048965913195,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow","sts"],"consensus_categories":[],"category_scores_codex":[0.00182866,0.0002855404,0.0003941872,0.0008661679,0.002149923,0.0005229778,0.002664643,0.00004217176,0.00005636358],"category_scores_gemma":[0.00002623593,0.000307652,0.0001744421,0.002461648,0.0008534472,0.001212729,0.001393249,0.0003693508,0.00001769855],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001708517,"about_ca_system_score_gemma":0.0003218509,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00005023438,"about_ca_topic_score_gemma":0.000006110975,"domain_scores_codex":[0.9962775,0.0002986653,0.0006188072,0.001020094,0.001251156,0.0005338307],"domain_scores_gemma":[0.99761,0.0004785263,0.0003520539,0.0009918341,0.0003313421,0.0002362786],"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.0008998578,0.003779476,0.0007785501,0.000139366,0.0002231396,0.00009047082,0.02065433,0.06843987,0.06086621,0.6455697,0.007590127,0.1909689],"study_design_scores_gemma":[0.01042892,0.003249283,0.003018579,0.00009271289,0.00006194723,0.000365333,0.0004514421,0.9280679,0.01712857,0.01919926,0.01637043,0.001565682],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.3083286,0.00006770178,0.6799605,0.004143341,0.004325689,0.0009466601,0.000126043,0.0003137715,0.001787724],"genre_scores_gemma":[0.9402344,0.00003095635,0.05808566,0.001058815,0.0002141117,0.0001331102,0.00001938012,0.00001965919,0.0002038809],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.859628,"threshold_uncertainty_score":0.9999375,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W4225502324","doi":"10.1109/focs54457.2022.00042","title":"Cheeger Inequalities for Vertex Expansion and Reweighted Eigenvalues","year":2022,"lang":"en","type":"article","venue":"2022 IEEE 63rd Annual Symposium on Foundations of Computer Science (FOCS)","topic":"Hermeneutics and Narrative Identity","field":"Arts and Humanities","cited_by":0,"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":"","keywords":"Mathematics; Combinatorics; Conjecture; Vertex (graph theory); Laplace operator; Eigenvalues and eigenvectors; Polytope; Taylor series; Laplacian matrix; Lambda; Graph; Mathematical analysis; Physics","authors":[{"name":"Tsz Chiu Kwok","is_ca":false},{"name":"Lap Lau","is_ca":true},{"name":"Kam Chuen Tung","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.03053778083054916,"gpt":0.2710468345470043,"spread":0.2405090537164552,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.0008499127,0.0001583028,0.0002252282,0.0003636464,0.002387364,0.000332342,0.0004605489,0.00002077,0.0005056709],"category_scores_gemma":[0.00002335363,0.0001523112,0.00008371159,0.0002414188,0.0008016846,0.0007563134,0.0002412687,0.0001309522,0.00001087398],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001093401,"about_ca_system_score_gemma":0.0001974524,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0001594849,"about_ca_topic_score_gemma":0.0001457056,"domain_scores_codex":[0.9982261,0.00009527691,0.000363304,0.0004312246,0.0005909588,0.0002931023],"domain_scores_gemma":[0.9988545,0.0001612694,0.0001697766,0.000296383,0.0004285962,0.00008954425],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","study_design_scores_codex":[0.0001102813,0.00065828,0.0003366829,0.00008497081,0.00006733168,0.000002654236,0.05834565,0.001353243,0.01306637,0.8966241,0.021742,0.007608373],"study_design_scores_gemma":[0.00357209,0.008539804,0.004043641,0.0001590474,0.0001629119,0.00002143155,0.01939414,0.09726818,0.01901363,0.07312077,0.7725768,0.002127517],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9896759,0.00004010574,0.001420615,0.001432342,0.003424256,0.000536898,0.0005280455,0.00007082305,0.002871039],"genre_scores_gemma":[0.996029,0.00002110838,0.0002415313,0.0004299704,0.0003000063,0.0000994064,0.00003002494,0.00001500397,0.002833981],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.8235034,"threshold_uncertainty_score":0.9989114,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null}]}