{"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.12747973,0.0016398554,0.79522294,0.0027502878,0.00029786478,0.00012361933,0.00073779386,0.00058319035,0.07116475],"genre_scores_gemma":[0.84050626,0.0015728372,0.13100168,0.0015732198,0.0004995009,0.00057181943,0.0007708487,0.00064918655,0.02285461],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9973111,0.00061324675,0.00009908482,0.0007431624,0.0006152173,0.0006182475],"domain_scores_gemma":[0.98345184,0.011667456,0.000996791,0.0020610709,0.0012999384,0.00052300084],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0025672158,0.00097474153,0.0008870528,0.0020952756,0.0012589253,0.0020967906,0.00199495,0.0015395207,0.011913315],"category_scores_gemma":[0.016238872,0.00055190496,0.0013004922,0.0015310855,0.0029669744,0.0073933043,0.0022604084,0.0048298063,0.0019064232],"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.00007892232,0.000030940457,0.0004265255,0.000075208154,0.000015730153,0.00008340804,0.00015675562,0.018397758,0.0059631444,0.9612595,0.0030629155,0.010449159],"study_design_scores_gemma":[0.000023363657,0.00003212206,0.0005303356,0.000030568117,0.0000130189965,0.00008462325,0.000051825842,0.16541164,0.0030839469,0.8274295,0.0032784143,0.000030704567],"about_ca_topic_score_codex":0.001247691,"about_ca_topic_score_gemma":0.0010821786,"teacher_disagreement_score":0.011913315,"about_ca_system_score_codex":0.002399019,"about_ca_system_score_gemma":0.0007508147,"threshold_uncertainty_score":0.03985405},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.037795186,0.0002888965,0.94595224,0.0006176977,0.00007642456,0.00017629364,0.0008633588,0.006320792,0.007909143],"genre_scores_gemma":[0.25612992,0.00015840396,0.7361989,0.00021955874,0.000072559975,0.00025147916,0.002198395,0.00097480137,0.0037959057],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99894947,0.00017723076,0.00006627172,0.00031700585,0.00030240402,0.00018762998],"domain_scores_gemma":[0.99783945,0.0011207901,0.00018698409,0.00047833152,0.00029011414,0.00008426804],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008325835,0.0017040654,0.0009124433,0.0011049459,0.0007990664,0.0017134618,0.0016825318,0.0014146825,0.008048496],"category_scores_gemma":[0.0070821866,0.00065632875,0.0010492691,0.0015527059,0.00084753067,0.0037563895,0.0014120123,0.0018137039,0.0020346467],"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.00061319675,0.0002564256,0.0022163393,0.0003879997,0.00010311443,0.00013981177,0.00024711603,0.54354084,0.00979362,0.06977117,0.02081807,0.35211232],"study_design_scores_gemma":[0.00005676206,0.00003104318,0.00030683086,0.00001630047,0.000014639153,0.000059703623,0.00004459832,0.9175959,0.00338469,0.075881295,0.0025953818,0.000012748615],"about_ca_topic_score_codex":0.006984792,"about_ca_topic_score_gemma":0.009575842,"teacher_disagreement_score":0.008048496,"about_ca_system_score_codex":0.0021676177,"about_ca_system_score_gemma":0.0029751728,"threshold_uncertainty_score":0.026924908},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.09990442,0.0037572142,0.7704449,0.008971136,0.0002856618,0.00015111876,0.0008819292,0.0022233333,0.11338042],"genre_scores_gemma":[0.8160172,0.002098033,0.16169278,0.000898972,0.00047824244,0.00030238062,0.0011163395,0.0004531701,0.016942943],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99372935,0.0022940894,0.00041338193,0.001303049,0.0016393586,0.0006206823],"domain_scores_gemma":[0.97714067,0.017985182,0.0008894505,0.0022761899,0.0010999279,0.00060854544],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0029890041,0.0005846173,0.000750492,0.0014259381,0.0012921817,0.004864441,0.0018483696,0.0014772894,0.016183266],"category_scores_gemma":[0.022556776,0.0007157759,0.0017422389,0.0018545045,0.0048449705,0.012647235,0.0037365027,0.0049160775,0.0016296803],"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.00007012531,0.00002178869,0.00034573587,0.00012455847,0.000014085125,0.000055229702,0.00019428234,0.006809661,0.0003607999,0.96934223,0.0018614295,0.02080008],"study_design_scores_gemma":[0.000023009103,0.000021630083,0.00018949555,0.000031949116,0.0000116597785,0.0001183431,0.000052401818,0.022766782,0.00072579406,0.9675839,0.008459725,0.000015275897],"about_ca_topic_score_codex":0.002758273,"about_ca_topic_score_gemma":0.001318688,"teacher_disagreement_score":0.016183266,"about_ca_system_score_codex":0.0042398493,"about_ca_system_score_gemma":0.0020493409,"threshold_uncertainty_score":0.054138362},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.09573705,0.0008939563,0.870202,0.0056702606,0.00022466773,0.00028640014,0.0004423164,0.0014237433,0.025119487],"genre_scores_gemma":[0.8154109,0.00049187476,0.16283605,0.0021913368,0.00057909713,0.0010192124,0.0005421955,0.00075152516,0.01617783],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.98776233,0.004441341,0.00046303583,0.002774815,0.0030140174,0.0015445298],"domain_scores_gemma":[0.94883096,0.038802445,0.0028516112,0.0056899996,0.0020534783,0.0017715287],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.009673039,0.0017949893,0.0025459998,0.0013109759,0.0021361834,0.003949154,0.0034318701,0.002847431,0.012497465],"category_scores_gemma":[0.05140085,0.0009775716,0.002689901,0.0015927318,0.0056818402,0.011461993,0.008507964,0.0076632197,0.0018971764],"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.00069146865,0.0001864806,0.0012999593,0.0003029111,0.00010984427,0.00012620953,0.00038559336,0.07738051,0.005265689,0.8907619,0.0036075008,0.019881867],"study_design_scores_gemma":[0.000111992114,0.00017422719,0.0003366794,0.000038376507,0.00003932421,0.00011450523,0.00004086335,0.30075684,0.0047735316,0.69117993,0.0023887937,0.00004485843],"about_ca_topic_score_codex":0.0008879056,"about_ca_topic_score_gemma":0.00097445044,"teacher_disagreement_score":0.012497465,"about_ca_system_score_codex":0.0046439767,"about_ca_system_score_gemma":0.0034604673,"threshold_uncertainty_score":0.05115658},"labels":[],"label_agreement":null}]}