{"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":"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.24997632,0.0012441003,0.71132773,0.0050591403,0.00020470054,0.00017722402,0.00092996017,0.0018769917,0.029203847],"genre_scores_gemma":[0.9323422,0.00057036505,0.058392692,0.0012498175,0.00017018903,0.00030086524,0.00050447736,0.00039339633,0.006076173],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99512047,0.0012077593,0.00016431563,0.0010425623,0.0013305455,0.001134325],"domain_scores_gemma":[0.97072875,0.022277415,0.0015979527,0.0035210156,0.00090578507,0.00096905854],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0041645253,0.0016399053,0.0019875218,0.0011527725,0.0015148866,0.004327627,0.003390426,0.0018772734,0.0073060174],"category_scores_gemma":[0.019181358,0.0010637251,0.003294961,0.0010174772,0.004147882,0.008396799,0.0048373295,0.0073025185,0.0010584323],"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.0017027666,0.00025878815,0.003690512,0.00050365756,0.00016557812,0.00039042303,0.0005700682,0.1646785,0.017820708,0.7718863,0.00559817,0.032734532],"study_design_scores_gemma":[0.00016065032,0.00016584873,0.00044030635,0.000079228885,0.00007896487,0.00017185826,0.000049329963,0.40033242,0.0104113035,0.58429646,0.003752701,0.000060976567],"about_ca_topic_score_codex":0.0018136961,"about_ca_topic_score_gemma":0.0014989275,"teacher_disagreement_score":0.0073060174,"about_ca_system_score_codex":0.0039026004,"about_ca_system_score_gemma":0.0022471843,"threshold_uncertainty_score":0.028315485},"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":"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.23157671,0.0023688264,0.65789896,0.015305454,0.0005853583,0.00062656146,0.0025335336,0.0070199003,0.082084686],"genre_scores_gemma":[0.6662927,0.0014762899,0.30414903,0.0020629803,0.0005679026,0.0007019043,0.0022469189,0.00086917053,0.021633094],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99634993,0.0007082532,0.00025923888,0.00088122697,0.0010509184,0.00075037446],"domain_scores_gemma":[0.9863551,0.009295065,0.00068971585,0.0027162153,0.00060978037,0.00033405752],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0026885723,0.001091918,0.0014602197,0.00052018225,0.0012807004,0.0033161903,0.0030146642,0.0018502631,0.017588925],"category_scores_gemma":[0.015032805,0.0005383224,0.0016890022,0.0013378845,0.0020921722,0.011363895,0.0028544404,0.002426502,0.0031146028],"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.0058841873,0.00077435863,0.005552131,0.0018469125,0.0003504996,0.0004964897,0.0004957613,0.095692836,0.059512734,0.3890537,0.039985962,0.4003544],"study_design_scores_gemma":[0.00056480675,0.0003281856,0.0020415876,0.00020157511,0.00026848054,0.0004373722,0.00023320809,0.30819964,0.031098716,0.63548684,0.021032628,0.000106973675],"about_ca_topic_score_codex":0.0023471764,"about_ca_topic_score_gemma":0.0057537532,"teacher_disagreement_score":0.017588925,"about_ca_system_score_codex":0.0026893395,"about_ca_system_score_gemma":0.004653062,"threshold_uncertainty_score":0.05884075},"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":"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.1962413,0.00662465,0.5544449,0.011998697,0.0006794952,0.0004999249,0.0028296227,0.0026990667,0.22398238],"genre_scores_gemma":[0.8224946,0.0028510331,0.14317033,0.0023157701,0.00055736233,0.0006510647,0.001492047,0.0010246643,0.02544304],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9974655,0.0005723126,0.00007032697,0.0004433071,0.0006940838,0.0007545339],"domain_scores_gemma":[0.98845726,0.009006075,0.0004878747,0.00094534864,0.00034095446,0.000762406],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0036235892,0.0017881835,0.0026926375,0.001513764,0.0021888972,0.004370394,0.0030693044,0.0025395525,0.021370031],"category_scores_gemma":[0.016981138,0.0009807784,0.0021641469,0.0015338435,0.0030762367,0.006480946,0.004389991,0.009167318,0.0024690314],"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.0007812839,0.00039913057,0.0016452805,0.00084823585,0.000098082135,0.000269563,0.0007378384,0.15548585,0.0031440943,0.757301,0.024543013,0.054746617],"study_design_scores_gemma":[0.00007081809,0.00009993105,0.0005353055,0.00012696674,0.00004835623,0.00014500154,0.00011626304,0.3864463,0.0011799553,0.60410666,0.0070943916,0.000029972338],"about_ca_topic_score_codex":0.0033399882,"about_ca_topic_score_gemma":0.004199938,"teacher_disagreement_score":0.021370031,"about_ca_system_score_codex":0.005983052,"about_ca_system_score_gemma":0.0028695317,"threshold_uncertainty_score":0.07148987},"labels":[],"label_agreement":null}]}