{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:5BIEOVZIRCX7DJHPCS2RR3CLYP","short_pith_number":"pith:5BIEOVZI","canonical_record":{"source":{"id":"1702.06969","kind":"arxiv","version":5},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2017-02-22T19:08:25Z","cross_cats_sorted":[],"title_canon_sha256":"934a5c1bea37c338a7760617db7a385fba4b4465d63ed53c0ab05ce4b79e7dba","abstract_canon_sha256":"70c5d5eb0e0924469e56eb8bb9245164c723c01b10879e1f1412f641222730cb"},"schema_version":"1.0"},"canonical_sha256":"e85047572888aff1a4ef14b518ec4bc3c9ef5725b8329f36f98723eb7ca8aa95","source":{"kind":"arxiv","id":"1702.06969","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"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:5BIEOVZIRCX7DJHPCS2RR3CLYP","target":"record","payload":{"canonical_record":{"source":{"id":"1702.06969","kind":"arxiv","version":5},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2017-02-22T19:08:25Z","cross_cats_sorted":[],"title_canon_sha256":"934a5c1bea37c338a7760617db7a385fba4b4465d63ed53c0ab05ce4b79e7dba","abstract_canon_sha256":"70c5d5eb0e0924469e56eb8bb9245164c723c01b10879e1f1412f641222730cb"},"schema_version":"1.0"},"canonical_sha256":"e85047572888aff1a4ef14b518ec4bc3c9ef5725b8329f36f98723eb7ca8aa95","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:29:15.377775Z","signature_b64":"Ogb6bCaBvKRDR7tv7//JopuADWJuaNvlXdbqQyU1wbL5GJT/ptuPIxCcjSQkw4nOEhIc2Ep/EG4fzTuqFBOuCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"e85047572888aff1a4ef14b518ec4bc3c9ef5725b8329f36f98723eb7ca8aa95","last_reissued_at":"2026-05-18T00:29:15.377327Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:29:15.377327Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1702.06969","source_version":5,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T00:29:15Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"HoGCCUWoTTjYzf0rAvytQMX7AL1QEQgP+ZG1WGYd4OWc+xTgOFcHGs9IJ0hDYiAfQgtKf2kFS+JPboRKL4jzAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T02:29:13.026420Z"},"content_sha256":"474a21806e78ed01ce33cab3c6dfcd16153f7e7204af3ab7371b432fe4369dd2","schema_version":"1.0","event_id":"sha256:474a21806e78ed01ce33cab3c6dfcd16153f7e7204af3ab7371b432fe4369dd2"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:5BIEOVZIRCX7DJHPCS2RR3CLYP","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Approximating Unique Games Using Low Diameter Graph Decomposition","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Lap Chi Lau, Vedat Levi Alev","submitted_at":"2017-02-22T19:08:25Z","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,"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1702.06969","kind":"arxiv","version":5},"verdict":{"id":null,"model_set":{},"created_at":null,"strongest_claim":"","one_line_summary":"","pipeline_version":null,"weakest_assumption":"","pith_extraction_headline":""},"references":{"count":0,"sample":[],"resolved_work":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","internal_anchors":0},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"author_claims":{"count":0,"strong_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"builder_version":"pith-number-builder-2026-05-17-v1"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T00:29:15Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"HDwh0lRDb1wT24Ac9VMacGc++psrqPTpUTEFgO+uZM6y9P5D5haX/V9w9lg3dX8L79CIxCIPX8G4I5NTrOaEBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T02:29:13.026897Z"},"content_sha256":"5406de059a76afbce8b8a7c02fe6cd29d0af1cfff4a6d4b2b033dec8b51d6937","schema_version":"1.0","event_id":"sha256:5406de059a76afbce8b8a7c02fe6cd29d0af1cfff4a6d4b2b033dec8b51d6937"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/5BIEOVZIRCX7DJHPCS2RR3CLYP/bundle.json","state_url":"https://pith.science/pith/5BIEOVZIRCX7DJHPCS2RR3CLYP/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/5BIEOVZIRCX7DJHPCS2RR3CLYP/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-05-27T02:29:13Z","links":{"resolver":"https://pith.science/pith/5BIEOVZIRCX7DJHPCS2RR3CLYP","bundle":"https://pith.science/pith/5BIEOVZIRCX7DJHPCS2RR3CLYP/bundle.json","state":"https://pith.science/pith/5BIEOVZIRCX7DJHPCS2RR3CLYP/state.json","well_known_bundle":"https://pith.science/.well-known/pith/5BIEOVZIRCX7DJHPCS2RR3CLYP/bundle.json"},"state":{"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"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"NYwsb2x6sHOhMU9L02TepJkJE+cTnzTRNl2U/pQLJPAhfkqz7SKuoaSKxc5JPN8m3TCwLmQw3yOCLBXP5GTJBQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-27T02:29:13.029360Z","bundle_sha256":"6aacecd474f9c08e7dc28f46f6662273823c8583ceb6f9700b56f2b9a788ac41"}}