{"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008325835,0.001704065,0.0009124433,0.001104946,0.0007990664,0.001713462,0.001682532,0.001414682,0.008048496],"category_scores_gemma":[0.007082187,0.0006563287,0.001049269,0.001552706,0.0008475307,0.003756389,0.001412012,0.001813704,0.002034647],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002167618,"about_ca_system_score_gemma":0.002975173,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.006984792,"about_ca_topic_score_gemma":0.009575842,"domain_scores_codex":[0.9989495,0.0001772308,0.00006627172,0.0003170058,0.000302404,0.00018763],"domain_scores_gemma":[0.9978395,0.00112079,0.0001869841,0.0004783315,0.0002901141,0.00008426804],"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.0006131968,0.0002564256,0.002216339,0.0003879997,0.0001031144,0.0001398118,0.000247116,0.5435408,0.00979362,0.06977117,0.02081807,0.3521123],"study_design_scores_gemma":[0.00005676206,0.00003104318,0.0003068309,0.00001630047,0.00001463915,0.00005970362,0.00004459832,0.9175959,0.00338469,0.07588129,0.002595382,0.00001274861],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.03779519,0.0002888965,0.9459522,0.0006176977,0.00007642456,0.0001762936,0.0008633588,0.006320792,0.007909143],"genre_scores_gemma":[0.2561299,0.000158404,0.7361989,0.0002195587,0.00007255997,0.0002514792,0.002198395,0.0009748014,0.003795906],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.008048496,"threshold_uncertainty_score":0.02692491,"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002989004,0.0005846173,0.000750492,0.001425938,0.001292182,0.004864441,0.00184837,0.001477289,0.01618327],"category_scores_gemma":[0.02255678,0.0007157759,0.001742239,0.001854504,0.004844971,0.01264723,0.003736503,0.004916077,0.00162968],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.004239849,"about_ca_system_score_gemma":0.002049341,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002758273,"about_ca_topic_score_gemma":0.001318688,"domain_scores_codex":[0.9937294,0.002294089,0.0004133819,0.001303049,0.001639359,0.0006206823],"domain_scores_gemma":[0.9771407,0.01798518,0.0008894505,0.00227619,0.001099928,0.0006085454],"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.00007012531,0.00002178869,0.0003457359,0.0001245585,0.00001408513,0.0000552297,0.0001942823,0.006809661,0.0003607999,0.9693422,0.00186143,0.02080008],"study_design_scores_gemma":[0.0000230091,0.00002163008,0.0001894955,0.00003194912,0.00001165978,0.0001183431,0.00005240182,0.02276678,0.0007257941,0.9675839,0.008459725,0.0000152759],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.09990442,0.003757214,0.7704449,0.008971136,0.0002856618,0.0001511188,0.0008819292,0.002223333,0.1133804],"genre_scores_gemma":[0.8160172,0.002098033,0.1616928,0.000898972,0.0004782424,0.0003023806,0.001116339,0.0004531701,0.01694294],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01618327,"threshold_uncertainty_score":0.05413836,"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.009673039,0.001794989,0.002546,0.001310976,0.002136183,0.003949154,0.00343187,0.002847431,0.01249747],"category_scores_gemma":[0.05140085,0.0009775716,0.002689901,0.001592732,0.00568184,0.01146199,0.008507964,0.00766322,0.001897176],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.004643977,"about_ca_system_score_gemma":0.003460467,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0008879056,"about_ca_topic_score_gemma":0.0009744504,"domain_scores_codex":[0.9877623,0.004441341,0.0004630358,0.002774815,0.003014017,0.00154453],"domain_scores_gemma":[0.948831,0.03880244,0.002851611,0.00569,0.002053478,0.001771529],"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.0006914687,0.0001864806,0.001299959,0.0003029111,0.0001098443,0.0001262095,0.0003855934,0.07738051,0.005265689,0.8907619,0.003607501,0.01988187],"study_design_scores_gemma":[0.0001119921,0.0001742272,0.0003366794,0.00003837651,0.00003932421,0.0001145052,0.00004086335,0.3007568,0.004773532,0.6911799,0.002388794,0.00004485843],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.09573705,0.0008939563,0.870202,0.005670261,0.0002246677,0.0002864001,0.0004423164,0.001423743,0.02511949],"genre_scores_gemma":[0.8154109,0.0004918748,0.162836,0.002191337,0.0005790971,0.001019212,0.0005421955,0.0007515252,0.01617783],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01249747,"threshold_uncertainty_score":0.05115658,"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002567216,0.0009747415,0.0008870528,0.002095276,0.001258925,0.002096791,0.00199495,0.001539521,0.01191332],"category_scores_gemma":[0.01623887,0.000551905,0.001300492,0.001531085,0.002966974,0.007393304,0.002260408,0.004829806,0.001906423],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002399019,"about_ca_system_score_gemma":0.0007508147,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001247691,"about_ca_topic_score_gemma":0.001082179,"domain_scores_codex":[0.9973111,0.0006132468,0.00009908482,0.0007431624,0.0006152173,0.0006182475],"domain_scores_gemma":[0.9834518,0.01166746,0.0009967909,0.002061071,0.001299938,0.0005230008],"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.00007892232,0.00003094046,0.0004265255,0.00007520815,0.00001573015,0.00008340804,0.0001567556,0.01839776,0.005963144,0.9612595,0.003062916,0.01044916],"study_design_scores_gemma":[0.00002336366,0.00003212206,0.0005303356,0.00003056812,0.000013019,0.00008462325,0.00005182584,0.1654116,0.003083947,0.8274295,0.003278414,0.00003070457],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1274797,0.001639855,0.7952229,0.002750288,0.0002978648,0.0001236193,0.0007377939,0.0005831904,0.07116475],"genre_scores_gemma":[0.8405063,0.001572837,0.1310017,0.00157322,0.0004995009,0.0005718194,0.0007708487,0.0006491865,0.02285461],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01191332,"threshold_uncertainty_score":0.03985405,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null}]}