{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:5BIEOVZIRCX7DJHPCS2RR3CLYP","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"70c5d5eb0e0924469e56eb8bb9245164c723c01b10879e1f1412f641222730cb","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2017-02-22T19:08:25Z","title_canon_sha256":"934a5c1bea37c338a7760617db7a385fba4b4465d63ed53c0ab05ce4b79e7dba"},"schema_version":"1.0","source":{"id":"1702.06969","kind":"arxiv","version":5}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1702.06969","created_at":"2026-05-18T00:29:15Z"},{"alias_kind":"arxiv_version","alias_value":"1702.06969v5","created_at":"2026-05-18T00:29:15Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1702.06969","created_at":"2026-05-18T00:29:15Z"},{"alias_kind":"pith_short_12","alias_value":"5BIEOVZIRCX7","created_at":"2026-05-18T12:31:00Z"},{"alias_kind":"pith_short_16","alias_value":"5BIEOVZIRCX7DJHP","created_at":"2026-05-18T12:31:00Z"},{"alias_kind":"pith_short_8","alias_value":"5BIEOVZI","created_at":"2026-05-18T12:31:00Z"}],"graph_snapshots":[{"event_id":"sha256:5406de059a76afbce8b8a7c02fe6cd29d0af1cfff4a6d4b2b033dec8b51d6937","target":"graph","created_at":"2026-05-18T00:29:15Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"paper":{"abstract_excerpt":"We design approximation algorithms for Unique Games when the constraint graph admits good low diameter graph decomposition. For the ${\\sf Max2Lin}_k$ problem in $K_r$-minor free graphs, when there is an assignment satisfying $1-\\varepsilon$ fraction of constraints, we present an algorithm that produces an assignment satisfying $1-O(r\\varepsilon)$ fraction of constraints, with the approximation ratio independent of the alphabet size. A corollary is an improved approximation algorithm for the ${\\sf MaxCut}$ problem for $K_r$-minor free graphs. For general Unique Games in $K_r$-minor free graphs,","authors_text":"Lap Chi Lau, Vedat Levi Alev","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2017-02-22T19:08:25Z","title":"Approximating Unique Games Using Low Diameter Graph Decomposition"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1702.06969","kind":"arxiv","version":5},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:474a21806e78ed01ce33cab3c6dfcd16153f7e7204af3ab7371b432fe4369dd2","target":"record","created_at":"2026-05-18T00:29:15Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"70c5d5eb0e0924469e56eb8bb9245164c723c01b10879e1f1412f641222730cb","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2017-02-22T19:08:25Z","title_canon_sha256":"934a5c1bea37c338a7760617db7a385fba4b4465d63ed53c0ab05ce4b79e7dba"},"schema_version":"1.0","source":{"id":"1702.06969","kind":"arxiv","version":5}},"canonical_sha256":"e85047572888aff1a4ef14b518ec4bc3c9ef5725b8329f36f98723eb7ca8aa95","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"e85047572888aff1a4ef14b518ec4bc3c9ef5725b8329f36f98723eb7ca8aa95","first_computed_at":"2026-05-18T00:29:15.377327Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:29:15.377327Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"Ogb6bCaBvKRDR7tv7//JopuADWJuaNvlXdbqQyU1wbL5GJT/ptuPIxCcjSQkw4nOEhIc2Ep/EG4fzTuqFBOuCw==","signature_status":"signed_v1","signed_at":"2026-05-18T00:29:15.377775Z","signed_message":"canonical_sha256_bytes"},"source_id":"1702.06969","source_kind":"arxiv","source_version":5}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:474a21806e78ed01ce33cab3c6dfcd16153f7e7204af3ab7371b432fe4369dd2","sha256:5406de059a76afbce8b8a7c02fe6cd29d0af1cfff4a6d4b2b033dec8b51d6937"],"state_sha256":"355417b250e899e507fe2702b9a0507a824ee24805995273ac2c7d1c98d0589a"}