{"id":"W2593693579","doi":"10.48550/arxiv.1702.06969","title":"Approximating Unique Games Using Low Diameter Graph Decomposition","year":2017,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Waterloo","funders":"","keywords":"Combinatorics; Mathematics; Minor (academic); Graph; Alphabet; Approximation algorithm; Discrete mathematics","routes":{"ca_aff":true,"ca_fund":false,"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.001247294,0.002313077,0.001550997,0.001689651,0.000908156,0.001661431,0.00285459,0.001621307,0.004903565],"category_scores_gemma":[0.008618669,0.001032881,0.001856033,0.001887412,0.001143336,0.00374274,0.002658122,0.002843609,0.001205677],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002687291,"about_ca_system_score_gemma":0.0014826,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.005012315,"about_ca_topic_score_gemma":0.00854349,"domain_scores_codex":[0.9981611,0.0005034608,0.00007645907,0.000570812,0.0003376607,0.000350395],"domain_scores_gemma":[0.9965838,0.001824149,0.0004579648,0.0005909918,0.0002799114,0.0002631052],"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.0004179102,0.0003088955,0.002337534,0.0003910188,0.0001337399,0.0002155664,0.0002770608,0.7636843,0.007456296,0.1015527,0.01023148,0.1129935],"study_design_scores_gemma":[0.00003765261,0.00006149789,0.000146013,0.00002156538,0.00001682707,0.00006128226,0.00004408434,0.9360147,0.001517203,0.06053887,0.001529029,0.00001139971],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.03967227,0.0003498727,0.9519389,0.000474758,0.00007696399,0.000147823,0.000226754,0.001157722,0.005955041],"genre_scores_gemma":[0.3732754,0.0003869542,0.6193695,0.0004130927,0.00007952845,0.0004222911,0.0009519013,0.0004814788,0.004619982],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.005012315,"threshold_uncertainty_score":0.01949775,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.1041973609482268,"score_gpt":0.2302774897750129,"score_spread":0.1260801288267862,"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."}}