{"meta":{"page":1,"per_page":50,"max_per_page":100,"total":3,"total_is_capped":false,"direct_labels_cover":0,"predictions_cover":3,"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":"01ac7382f21f","filters":{"venue":"Annual Symposium on Foundations of Computer Science"}},"results":[{"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,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"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","authors":[{"name":"Andris Ambainis","is_ca":false},{"name":"Andrew M. Childs","is_ca":true},{"name":"Ben W. Reichardt","is_ca":false},{"name":"Robert Špalek","is_ca":false},{"name":"Shengyu Zhang","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01290182047010125,"gpt":0.2818570957638533,"spread":0.2689552752937521,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002278223,0.0002783651,0.0004081711,0.0007752622,0.0002841114,0.0001938099,0.001949975,0.00007894332,0.000006891946],"category_scores_gemma":[0.00008808424,0.0002269233,0.00008226978,0.00223624,0.0005968265,0.0005131864,0.0007586308,0.0002456955,0.000008406351],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00008506522,"about_ca_system_score_gemma":0.000355801,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0001217482,"about_ca_topic_score_gemma":0.00003212366,"domain_scores_codex":[0.9966618,0.0001023468,0.0007092345,0.0008042592,0.001113722,0.0006086213],"domain_scores_gemma":[0.9971871,0.001024343,0.0003083451,0.0008314095,0.0004344202,0.0002143345],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0006572689,0.004355492,0.003653825,0.0002330699,0.0001368676,0.0001627172,0.03153083,0.238046,0.02980646,0.214101,0.001704724,0.4756118],"study_design_scores_gemma":[0.0008569207,0.002381996,0.02638859,0.000220273,0.000005935938,0.00004426032,0.00001538215,0.9630939,0.004808755,0.001332262,0.000523661,0.000328048],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.7399383,0.000007393111,0.2562204,0.00267218,0.0005045748,0.0003445715,0.00002122513,0.00009289802,0.0001984612],"genre_scores_gemma":[0.9177463,0.000004549787,0.08126766,0.0008238076,0.00009285679,0.000003438364,0.000003573386,0.00001159666,0.0000462059],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.7250479,"threshold_uncertainty_score":0.9253665,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","authors":[{"name":"Arkadev Chattopadhyay","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.009690302873235886,"gpt":0.2462148071718591,"spread":0.2365245042986233,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007354898,0.00007502433,0.0001443559,0.0002100399,0.00003866539,0.00004369595,0.0002802992,0.00002504142,0.000004881132],"category_scores_gemma":[0.00001605957,0.00005626916,0.00001878452,0.0004754658,0.0003441818,0.0003690247,0.00005725393,0.00005789058,0.000002310426],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0000217726,"about_ca_system_score_gemma":0.00002627083,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0001506149,"about_ca_topic_score_gemma":0.0002861639,"domain_scores_codex":[0.9991924,0.00001290971,0.0002941962,0.0001460895,0.0001889163,0.0001655557],"domain_scores_gemma":[0.9995154,0.0001390598,0.00004873257,0.0002057961,0.00006102717,0.00003004874],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"bench_or_experimental","study_design_gemma":"observational","study_design_scores_codex":[0.0001413991,0.0005042133,0.1465606,0.000276836,0.00005653869,0.00001577221,0.03742005,0.02092508,0.4738288,0.281652,0.0001407223,0.03847801],"study_design_scores_gemma":[0.001601025,0.0001790731,0.9201701,0.00021428,0.000007791018,0.00001156733,0.0003583929,0.01623056,0.05680366,0.00379622,0.0003203558,0.0003069925],"study_design_candidate":"observational","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9911958,0.00007095838,0.006447977,0.0001053351,0.000406875,0.0001253065,0.000004281331,0.00001782998,0.001625644],"genre_scores_gemma":[0.9990787,0.00001402986,0.000843999,0.00003167788,0.00002136742,0.000002597447,8.127147e-7,0.000004604235,0.000002233104],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.7736095,"threshold_uncertainty_score":0.229459,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","authors":[{"name":"Konstantinos Georgiou","is_ca":true},{"name":"Avner Magen","is_ca":true},{"name":"Toniann Pitassi","is_ca":true},{"name":"Iannis Tourlakis","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.02778296570340137,"gpt":0.3161291337688953,"spread":0.288346168065494,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003465049,0.0001984968,0.0002752987,0.0006118384,0.0003674485,0.0002120966,0.003644557,0.00006070321,0.00001098242],"category_scores_gemma":[0.0001216969,0.0001553783,0.0001611044,0.002614736,0.001122641,0.001358066,0.0004915929,0.0002195148,0.00001938049],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00007156524,"about_ca_system_score_gemma":0.0002759229,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0001375449,"about_ca_topic_score_gemma":0.00006395513,"domain_scores_codex":[0.9972261,0.0001016351,0.0006464605,0.000599297,0.0009158634,0.0005106073],"domain_scores_gemma":[0.9967759,0.001045119,0.0002452812,0.001196131,0.0006355578,0.0001019658],"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.00005550596,0.0007875958,0.0008563925,0.0000502957,0.00001572539,0.000002567708,0.007156099,0.001700856,0.001695948,0.9337058,0.001639918,0.05233328],"study_design_scores_gemma":[0.005376221,0.005569228,0.1642658,0.0007849916,0.0000687268,0.0001429698,0.000796868,0.2478886,0.03600802,0.2963686,0.2401942,0.00253581],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.06276999,0.0000207591,0.9316121,0.002059646,0.0009656055,0.0004582694,0.00003525367,0.0000407882,0.002037569],"genre_scores_gemma":[0.8436739,0.000009569574,0.1552894,0.0008476273,0.00007873958,0.00001444602,0.000009584954,0.000006450353,0.00007030493],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.7809039,"threshold_uncertainty_score":0.6772555,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null}]}