{"meta":{"query_hash":"01ac7382f21f","filters":{"venue":"Annual Symposium on Foundations of Computer Science"},"cohort_total":3,"direct_labels_cover":0,"predictions_cover":3,"exported":3,"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/01ac7382f21f","api":"https://metacan.xera.ac/api/v1/cohort?venue=Annual+Symposium+on+Foundations+of+Computer+Science"},"results":[{"id":"W1590866142","doi":"10.1109/focs.2007.4389515","title":"Discrepancy and the Power of Bottom Fan-in in Depth-three Circuits","year":2007,"lang":"en","type":"article","venue":"Annual Symposium on Foundations of Computer Science","topic":"Semiconductor materials and devices","field":"Engineering","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":"McGill University","funders":"","keywords":"Polynomial; Bounded function; Combinatorics; Discrete mathematics; Degree (music); Fan-in; Logarithm; Function (biology); Mathematics; Computer science; Algorithm; Topology (electrical circuits); Physics; Mathematical analysis","score_opus":0.009690302873235886,"score_gpt":0.24621480717185915,"score_spread":0.23652450429862326,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1590866142","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.9911958,0.00007095838,0.0064479774,0.000105335144,0.00040687498,0.00012530645,0.0000042813313,0.000017829983,0.0016256442],"genre_scores_gemma":[0.9990787,0.000014029862,0.00084399903,0.00003167788,0.00002136742,0.0000025974473,8.1271475e-7,0.000004604235,0.000002233104],"study_design_codex":"bench_or_experimental","study_design_gemma":"observational","domain_scores_codex":[0.99919236,0.000012909709,0.00029419616,0.00014608946,0.00018891628,0.00016555567],"domain_scores_gemma":[0.99951535,0.00013905982,0.000048732567,0.00020579605,0.00006102717,0.000030048743],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00073548977,0.00007502433,0.00014435587,0.00021003987,0.00003866539,0.000043695953,0.00028029917,0.000025041416,0.000004881132],"category_scores_gemma":[0.00001605957,0.000056269164,0.000018784522,0.0004754658,0.00034418175,0.0003690247,0.00005725393,0.000057890582,0.0000023104258],"study_design_candidate":"observational","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.00014139907,0.0005042133,0.14656058,0.000276836,0.00005653869,0.000015772208,0.03742005,0.020925077,0.47382876,0.28165203,0.00014072232,0.038478013],"study_design_scores_gemma":[0.0016010248,0.00017907313,0.92017007,0.00021428002,0.000007791018,0.000011567327,0.00035839286,0.016230563,0.056803662,0.00379622,0.0003203558,0.00030699253],"about_ca_topic_score_codex":0.00015061487,"about_ca_topic_score_gemma":0.00028616394,"teacher_disagreement_score":0.7736095,"about_ca_system_score_codex":0.000021772601,"about_ca_system_score_gemma":0.000026270825,"threshold_uncertainty_score":0.22945899},"labels":[],"label_agreement":null},{"id":"W4231383310","doi":"10.1109/focs.2007.4389507","title":"Any AND-OR Formula of Size N can be Evaluated in time N^{1/2 + o(1)} on a Quantum Computer","year":2007,"lang":"en","type":"article","venue":"Annual Symposium on Foundations of Computer Science","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":19,"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 Waterloo","funders":"Army Research Office; Natural Sciences and Engineering Research Council of Canada; Latvijas Universitate; University of Waterloo; Mitacs; California Institute of Technology; Deutscher Akademischer Austauschdienst; National Science Foundation","keywords":"Quantum; Quantum computer; Computer science; Physics; Quantum mechanics","score_opus":0.012901820470101246,"score_gpt":0.2818570957638533,"score_spread":0.26895527529375207,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4231383310","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.7399383,0.0000073931114,0.25622037,0.00267218,0.0005045748,0.0003445715,0.000021225134,0.00009289802,0.00019846116],"genre_scores_gemma":[0.9177463,0.0000045497873,0.08126766,0.0008238076,0.00009285679,0.0000034383638,0.0000035733865,0.000011596662,0.000046205896],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99666184,0.00010234681,0.0007092345,0.0008042592,0.001113722,0.0006086213],"domain_scores_gemma":[0.99718714,0.0010243426,0.00030834507,0.0008314095,0.00043442022,0.0002143345],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0022782227,0.00027836507,0.00040817112,0.0007752622,0.00028411145,0.00019380994,0.0019499746,0.00007894332,0.000006891946],"category_scores_gemma":[0.00008808424,0.00022692334,0.000082269784,0.00223624,0.0005968265,0.00051318645,0.0007586308,0.0002456955,0.000008406351],"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.0006572689,0.0043554916,0.003653825,0.00023306992,0.00013686759,0.00016271725,0.03153083,0.23804596,0.029806456,0.21410096,0.0017047244,0.47561184],"study_design_scores_gemma":[0.00085692067,0.0023819965,0.026388591,0.000220273,0.0000059359377,0.00004426032,0.000015382151,0.96309394,0.004808755,0.0013322624,0.000523661,0.00032804802],"about_ca_topic_score_codex":0.000121748235,"about_ca_topic_score_gemma":0.00003212366,"teacher_disagreement_score":0.72504795,"about_ca_system_score_codex":0.00008506522,"about_ca_system_score_gemma":0.000355801,"threshold_uncertainty_score":0.9253665},"labels":[],"label_agreement":null},{"id":"W4250124835","doi":"10.1109/focs.2007.4389538","title":"Integrality gaps of 2 - o(1) for Vertex Cover SDPs in the Lovész-Schrijver Hierarchy","year":2007,"lang":"en","type":"article","venue":"Annual Symposium on Foundations of Computer Science","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","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 Toronto","funders":"","keywords":"Semidefinite programming; Vertex cover; Approximation algorithm; Cover (algebra); Combinatorics; Vertex (graph theory); Linear programming; Mathematics; Time complexity; Omega; Computer science; Algorithm; Discrete mathematics; Mathematical optimization; Graph; Physics","score_opus":0.027782965703401368,"score_gpt":0.31612913376889534,"score_spread":0.28834616806549396,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4250124835","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.06276999,0.000020759102,0.93161213,0.002059646,0.0009656055,0.0004582694,0.000035253674,0.000040788196,0.0020375687],"genre_scores_gemma":[0.84367394,0.000009569574,0.15528937,0.0008476273,0.00007873958,0.000014446024,0.000009584954,0.0000064503533,0.00007030493],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9972261,0.00010163509,0.0006464605,0.000599297,0.0009158634,0.0005106073],"domain_scores_gemma":[0.9967759,0.0010451186,0.0002452812,0.0011961311,0.0006355578,0.00010196576],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0034650492,0.00019849678,0.00027529866,0.0006118384,0.0003674485,0.00021209661,0.003644557,0.000060703213,0.000010982416],"category_scores_gemma":[0.000121696896,0.00015537834,0.00016110438,0.0026147356,0.0011226409,0.0013580655,0.00049159286,0.00021951483,0.000019380494],"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.000055505963,0.0007875958,0.0008563925,0.000050295705,0.00001572539,0.0000025677082,0.007156099,0.0017008565,0.0016959478,0.9337058,0.0016399178,0.05233328],"study_design_scores_gemma":[0.005376221,0.0055692275,0.16426575,0.0007849916,0.000068726804,0.00014296976,0.000796868,0.24788861,0.036008023,0.2963686,0.24019419,0.0025358105],"about_ca_topic_score_codex":0.00013754488,"about_ca_topic_score_gemma":0.00006395513,"teacher_disagreement_score":0.78090394,"about_ca_system_score_codex":0.00007156524,"about_ca_system_score_gemma":0.00027592288,"threshold_uncertainty_score":0.67725545},"labels":[],"label_agreement":null}]}