{"id":"W2594003820","doi":"10.4086/toc.2019.v015a017","title":"","year":2019,"lang":"en","type":"article","venue":"Theory of Computing","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"ca_institutions":"","funders":"Natural Sciences and Engineering Research Council of Canada; Science and Engineering Research Board; Alfred P. Sloan Foundation","keywords":"Combinatorics; Upper and lower bounds; Boolean function; Degree (music); Mathematics; Omega; Polynomial; Monotone polygon; Function (biology); Binary logarithm; Discrete mathematics; Physics; Mathematical analysis; Quantum mechanics; Geometry","routes":{"ca_aff":false,"ca_fund":true,"ca_venue":false,"about_ca":false,"invisible_to_affiliation_only":true},"retraction":null,"screen":null,"direct_labels":[],"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.000717752,0.0008418402,0.0006543127,0.0007193725,0.000931588,0.001797799,0.001798905,0.001120368,0.03572525],"category_scores_gemma":[0.004213087,0.0004914948,0.001416566,0.0006957518,0.0009919986,0.004112415,0.003969533,0.002387936,0.009774507],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001352915,"about_ca_system_score_gemma":0.001258298,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001153847,"about_ca_topic_score_gemma":0.00187148,"domain_scores_codex":[0.9987231,0.0001885729,0.00008542578,0.0003200586,0.0004314012,0.0002514299],"domain_scores_gemma":[0.9980732,0.0004362893,0.0001048674,0.0008235148,0.0004259868,0.0001361403],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","study_design_scores_codex":[0.0002418608,0.0002331863,0.001063404,0.000453142,0.00007242979,0.0001611732,0.0001341183,0.007170455,0.02131961,0.6538161,0.06907737,0.2462573],"study_design_scores_gemma":[0.00008016347,0.0002702273,0.001162373,0.0001252077,0.0001457126,0.0009892847,0.00006802937,0.05393237,0.03428317,0.4932652,0.4156003,0.0000779739],"study_design_candidate":"not_applicable","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"other","genre_scores_codex":[0.0189293,0.001505209,0.8263083,0.005812629,0.002469755,0.0002934415,0.001411779,0.004961138,0.1383086],"genre_scores_gemma":[0.3558193,0.002248975,0.5481995,0.008008023,0.001471522,0.0005637371,0.003789825,0.00151206,0.07838699],"genre_candidate":"other","genre_consensus":null,"teacher_disagreement_score":0.9642748,"threshold_uncertainty_score":0,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01417735764664866,"score_gpt":0.2334054208585872,"score_spread":0.2192280632119386,"validation_status":"score_only:v0-immature-baseline","note":"Baseline scores from an immature model (maturity gate not passed). Scores rank; they never assert a category."}}