{"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":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0004321134,0.0003523261,0.0003842452,0.0002295071,0.0001675832,0.0003367841,0.0007565944,0.0002491732,0.0001316536],"category_scores_gemma":[0.00002945498,0.0003158297,0.0001795396,0.000161496,0.0001030244,0.0001833212,0.001358466,0.0008790607,0.0001465041],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001117709,"about_ca_system_score_gemma":0.0001977483,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0004137063,"about_ca_topic_score_gemma":0.00003110505,"domain_scores_codex":[0.9974999,0.00009698285,0.0004587976,0.0009667855,0.0006256058,0.0003519648],"domain_scores_gemma":[0.9982941,0.000199747,0.0002890774,0.001020628,0.00009905359,0.00009737825],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.000007855597,0.0001503813,0.0004198458,0.0003182039,0.0001364801,0.00001097862,0.0005829903,0.1473334,0.0002178024,0.5908868,0.001622153,0.2583132],"study_design_scores_gemma":[0.0004982727,0.0001402451,0.00298158,0.0004763404,0.00001065764,0.00002698259,0.00004682065,0.7739631,0.0005622703,0.2204323,0.0001574341,0.0007039885],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.03121597,0.0000386315,0.9540576,0.001075171,0.003449203,0.0008422694,0.00001555417,0.000605532,0.008700123],"genre_scores_gemma":[0.7527663,0.000006449306,0.2463307,0.0004798612,0.0001057174,0.0000505077,0.00002619594,0.00001474783,0.0002196197],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.7215502,"threshold_uncertainty_score":0.9999294,"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."}}