{"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002688572,0.001091918,0.00146022,0.0005201822,0.0012807,0.00331619,0.003014664,0.001850263,0.01758892],"category_scores_gemma":[0.0150328,0.0005383224,0.001689002,0.001337884,0.002092172,0.01136389,0.00285444,0.002426502,0.003114603],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002689339,"about_ca_system_score_gemma":0.004653062,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002347176,"about_ca_topic_score_gemma":0.005753753,"domain_scores_codex":[0.9963499,0.0007082532,0.0002592389,0.000881227,0.001050918,0.0007503745],"domain_scores_gemma":[0.9863551,0.009295065,0.0006897158,0.002716215,0.0006097804,0.0003340575],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.005884187,0.0007743586,0.005552131,0.001846913,0.0003504996,0.0004964897,0.0004957613,0.09569284,0.05951273,0.3890537,0.03998596,0.4003544],"study_design_scores_gemma":[0.0005648067,0.0003281856,0.002041588,0.0002015751,0.0002684805,0.0004373722,0.0002332081,0.3081996,0.03109872,0.6354868,0.02103263,0.0001069737],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.2315767,0.002368826,0.657899,0.01530545,0.0005853583,0.0006265615,0.002533534,0.0070199,0.08208469],"genre_scores_gemma":[0.6662927,0.00147629,0.304149,0.00206298,0.0005679026,0.0007019043,0.002246919,0.0008691705,0.02163309],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01758892,"threshold_uncertainty_score":0.05884075,"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004164525,0.001639905,0.001987522,0.001152772,0.001514887,0.004327627,0.003390426,0.001877273,0.007306017],"category_scores_gemma":[0.01918136,0.001063725,0.003294961,0.001017477,0.004147882,0.008396799,0.004837329,0.007302518,0.001058432],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0039026,"about_ca_system_score_gemma":0.002247184,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001813696,"about_ca_topic_score_gemma":0.001498927,"domain_scores_codex":[0.9951205,0.001207759,0.0001643156,0.001042562,0.001330546,0.001134325],"domain_scores_gemma":[0.9707288,0.02227741,0.001597953,0.003521016,0.0009057851,0.0009690585],"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.001702767,0.0002587881,0.003690512,0.0005036576,0.0001655781,0.000390423,0.0005700682,0.1646785,0.01782071,0.7718863,0.00559817,0.03273453],"study_design_scores_gemma":[0.0001606503,0.0001658487,0.0004403064,0.00007922888,0.00007896487,0.0001718583,0.00004932996,0.4003324,0.0104113,0.5842965,0.003752701,0.00006097657],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.2499763,0.0012441,0.7113277,0.00505914,0.0002047005,0.000177224,0.0009299602,0.001876992,0.02920385],"genre_scores_gemma":[0.9323422,0.0005703651,0.05839269,0.001249818,0.000170189,0.0003008652,0.0005044774,0.0003933963,0.006076173],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.007306017,"threshold_uncertainty_score":0.02831548,"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003623589,0.001788183,0.002692637,0.001513764,0.002188897,0.004370394,0.003069304,0.002539553,0.02137003],"category_scores_gemma":[0.01698114,0.0009807784,0.002164147,0.001533843,0.003076237,0.006480946,0.004389991,0.009167318,0.002469031],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.005983052,"about_ca_system_score_gemma":0.002869532,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.003339988,"about_ca_topic_score_gemma":0.004199938,"domain_scores_codex":[0.9974655,0.0005723126,0.00007032697,0.0004433071,0.0006940838,0.0007545339],"domain_scores_gemma":[0.9884573,0.009006075,0.0004878747,0.0009453486,0.0003409545,0.000762406],"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.0007812839,0.0003991306,0.001645281,0.0008482359,0.00009808214,0.000269563,0.0007378384,0.1554859,0.003144094,0.757301,0.02454301,0.05474662],"study_design_scores_gemma":[0.00007081809,0.00009993105,0.0005353055,0.0001269667,0.00004835623,0.0001450015,0.000116263,0.3864463,0.001179955,0.6041067,0.007094392,0.00002997234],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1962413,0.00662465,0.5544449,0.0119987,0.0006794952,0.0004999249,0.002829623,0.002699067,0.2239824],"genre_scores_gemma":[0.8224946,0.002851033,0.1431703,0.00231577,0.0005573623,0.0006510647,0.001492047,0.001024664,0.02544304],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.02137003,"threshold_uncertainty_score":0.07148987,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null}]}