{"id":"W2957416585","doi":"10.1109/focs.2019.00021","title":"Approximating Constraint Satisfaction Problems on High-Dimensional Expanders","year":2019,"lang":"en","type":"preprint","venue":"","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada; University of Waterloo; University of Chicago; National Science Foundation","keywords":"Combinatorics; Arity; Constraint satisfaction problem; Mathematics; Hypergraph; Rank (graph theory); Expander graph; Constraint (computer-aided design); Degree (music); Measure (data warehouse); Discrete mathematics; Parameterized complexity; Computer science; Physics; Graph","routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false,"invisible_to_affiliation_only":false},"retraction":null,"screen":null,"direct_labels":[],"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002391005,0.00120175,0.001492989,0.001016436,0.000490881,0.001652374,0.001569988,0.001458057,0.003130495],"category_scores_gemma":[0.0191997,0.0006952955,0.001360962,0.002013697,0.001756452,0.004128789,0.002384081,0.003264315,0.0004525507],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001799373,"about_ca_system_score_gemma":0.0008670299,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002685025,"about_ca_topic_score_gemma":0.00282702,"domain_scores_codex":[0.997413,0.0009524385,0.0001265882,0.0006109282,0.0006153776,0.0002816423],"domain_scores_gemma":[0.986365,0.01084021,0.000970141,0.0009253954,0.0005691447,0.0003301085],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.000324242,0.0001029915,0.002004105,0.0001920259,0.00009785897,0.000205469,0.0002619402,0.9105765,0.003161523,0.05922173,0.001706132,0.02214546],"study_design_scores_gemma":[0.00001807213,0.00003291153,0.0001931969,0.00001083259,0.000008390267,0.00004296519,0.00003624994,0.9548059,0.000623479,0.04383557,0.0003858637,0.000006729589],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.32104,0.0009941191,0.6692778,0.001378298,0.0000569743,0.0001374769,0.000826824,0.001211811,0.005076759],"genre_scores_gemma":[0.8061655,0.0005949136,0.186835,0.0004988136,0.0001381788,0.0002665029,0.001646583,0.0002653584,0.003589263],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.003130495,"threshold_uncertainty_score":0.01305544,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.03487265559203002,"score_gpt":0.2509935924655586,"score_spread":0.2161209368735286,"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."}}