{"meta":{"query_hash":"5c18e1baa980","filters":{"venue":"2022 IEEE 63rd Annual Symposium on Foundations of Computer Science (FOCS)"},"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/5c18e1baa980","api":"https://metacan.xera.ac/api/v1/cohort?venue=2022+IEEE+63rd+Annual+Symposium+on+Foundations+of+Computer+Science+%28FOCS%29"},"results":[{"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.030537780830549158,"score_gpt":0.27104683454700434,"score_spread":0.2405090537164552,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4225502324","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.9896759,0.000040105744,0.0014206151,0.0014323416,0.0034242559,0.00053689803,0.0005280455,0.00007082305,0.0028710389],"genre_scores_gemma":[0.99602896,0.000021108379,0.00024153132,0.00042997042,0.00030000627,0.0000994064,0.000030024938,0.000015003971,0.002833981],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9982261,0.00009527691,0.00036330405,0.00043122465,0.0005909588,0.00029310226],"domain_scores_gemma":[0.99885446,0.00016126942,0.0001697766,0.000296383,0.00042859622,0.00008954425],"candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.0008499127,0.00015830284,0.00022522824,0.00036364642,0.0023873644,0.000332342,0.0004605489,0.000020770005,0.0005056709],"category_scores_gemma":[0.000023353632,0.00015231122,0.000083711595,0.00024141876,0.0008016846,0.00075631344,0.0002412687,0.00013095222,0.00001087398],"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.00011028127,0.00065828004,0.0003366829,0.00008497081,0.000067331675,0.0000026542361,0.058345646,0.0013532434,0.013066369,0.89662415,0.021742005,0.007608373],"study_design_scores_gemma":[0.0035720903,0.008539804,0.004043641,0.00015904737,0.00016291189,0.000021431546,0.019394144,0.09726818,0.019013628,0.073120765,0.7725768,0.0021275165],"about_ca_topic_score_codex":0.00015948486,"about_ca_topic_score_gemma":0.00014570559,"teacher_disagreement_score":0.8235034,"about_ca_system_score_codex":0.000109340064,"about_ca_system_score_gemma":0.00019745245,"threshold_uncertainty_score":0.9989114},"labels":[],"label_agreement":null},{"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,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_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","score_opus":0.013994209562291294,"score_gpt":0.2647044641196495,"score_spread":0.2507102545573582,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4313203312","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.049455564,0.000048290123,0.93159914,0.010647615,0.003136725,0.0016703734,0.00024962545,0.0003282203,0.002864467],"genre_scores_gemma":[0.52393526,0.0001395753,0.46698463,0.0043761116,0.00046939138,0.00050510454,0.00012897581,0.00009255576,0.0033683681],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.996119,0.00025451285,0.00059344847,0.001010934,0.00138274,0.0006393283],"domain_scores_gemma":[0.99807435,0.0002092729,0.0001980198,0.00090463995,0.00034539614,0.0002683152],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0018152905,0.0002563669,0.00032817211,0.0010289027,0.0009900427,0.00038225658,0.002387464,0.000050886396,0.00019470767],"category_scores_gemma":[0.000041814823,0.00027554086,0.000085252694,0.0032893934,0.0004936216,0.0018110005,0.0013100706,0.0003963106,0.00010424134],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","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.000040650117,0.00078785996,0.00027934616,0.000024740844,0.00001939684,0.000027423494,0.0060265632,0.922797,0.0042115175,0.0074829096,0.0045584897,0.05374405],"study_design_scores_gemma":[0.0006928509,0.00062127743,0.0002974757,0.000019309471,0.0000035643066,0.000032953678,0.00007044169,0.9885436,0.0005879065,0.00088971265,0.00793092,0.00030993627],"about_ca_topic_score_codex":0.000034306224,"about_ca_topic_score_gemma":0.000009348529,"teacher_disagreement_score":0.4744797,"about_ca_system_score_codex":0.00023228537,"about_ca_system_score_gemma":0.0005276329,"threshold_uncertainty_score":0.99996966},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.025926062884421137,"score_gpt":0.28530665950310496,"score_spread":0.25938059661868385,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4313227384","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.28294817,0.00007490212,0.69923043,0.00859194,0.0040359157,0.0012217882,0.00023058387,0.00028062073,0.0033856763],"genre_scores_gemma":[0.9610404,0.00001136098,0.03797115,0.0005755664,0.0001015921,0.00011630377,0.000011319215,0.000011628538,0.00016067832],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9965552,0.00021595166,0.000569802,0.00095453736,0.0011843564,0.00052015326],"domain_scores_gemma":[0.998162,0.00021534353,0.00023424823,0.0009638749,0.00024793245,0.00017660295],"candidate_categories":["metaepi_narrow","sts"],"consensus_categories":[],"category_scores_codex":[0.0014089262,0.00023575948,0.00032130367,0.0010496893,0.0016104088,0.0003599842,0.0025121104,0.00003539619,0.000057829042],"category_scores_gemma":[0.00002463221,0.0002636326,0.00009642275,0.0037846938,0.0010686872,0.0016670842,0.0014971988,0.00041889359,0.000012193927],"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.000032761585,0.0015844196,0.0013357796,0.000036227353,0.000029012392,0.000022487082,0.008841531,0.0581397,0.0032571054,0.8911904,0.002365106,0.033165485],"study_design_scores_gemma":[0.0010508664,0.0015212622,0.010387625,0.000040441577,0.000010616724,0.00010858639,0.00030628912,0.90871143,0.0026287274,0.063182846,0.011316119,0.00073519244],"about_ca_topic_score_codex":0.000117932505,"about_ca_topic_score_gemma":0.00008090653,"teacher_disagreement_score":0.85057175,"about_ca_system_score_codex":0.00021591988,"about_ca_system_score_gemma":0.0004239977,"threshold_uncertainty_score":0.9999816},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.024539535215569456,"score_gpt":0.25784443180688893,"score_spread":0.23330489659131948,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4313227811","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.30832857,0.00006770178,0.6799605,0.0041433414,0.0043256893,0.00094666006,0.00012604299,0.0003137715,0.0017877236],"genre_scores_gemma":[0.9402344,0.000030956347,0.05808566,0.0010588149,0.00021411173,0.00013311015,0.000019380122,0.000019659186,0.00020388093],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99627745,0.0002986653,0.00061880716,0.0010200944,0.0012511557,0.00053383067],"domain_scores_gemma":[0.99761,0.0004785263,0.00035205393,0.0009918341,0.0003313421,0.00023627857],"candidate_categories":["metaepi_narrow","sts"],"consensus_categories":[],"category_scores_codex":[0.0018286598,0.00028554036,0.00039418723,0.0008661679,0.002149923,0.0005229778,0.0026646429,0.00004217176,0.000056363584],"category_scores_gemma":[0.000026235926,0.00030765202,0.00017444212,0.0024616476,0.0008534472,0.0012127286,0.0013932489,0.0003693508,0.000017698554],"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.00089985784,0.0037794756,0.0007785501,0.00013936599,0.00022313962,0.00009047082,0.02065433,0.06843987,0.06086621,0.64556974,0.007590127,0.19096889],"study_design_scores_gemma":[0.010428922,0.0032492832,0.003018579,0.00009271289,0.000061947234,0.00036533302,0.00045144212,0.92806786,0.017128568,0.019199263,0.01637043,0.0015656817],"about_ca_topic_score_codex":0.00005023438,"about_ca_topic_score_gemma":0.0000061109754,"teacher_disagreement_score":0.85962796,"about_ca_system_score_codex":0.00017085166,"about_ca_system_score_gemma":0.0003218509,"threshold_uncertainty_score":0.99993753},"labels":[],"label_agreement":null}]}