{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2011:BCUMPY55WAVSMJIBL5MF64WZYA","short_pith_number":"pith:BCUMPY55","canonical_record":{"source":{"id":"1104.3806","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2011-04-19T17:16:59Z","cross_cats_sorted":["cs.CC"],"title_canon_sha256":"3382e70e9136ccb44ed5161b60f60df93a008b40fa7bd5c4516dcc74a245f968","abstract_canon_sha256":"525754de0fbfca80780a72a4df6f97aba4d29e9df50fe0419bed410382d8f9ee"},"schema_version":"1.0"},"canonical_sha256":"08a8c7e3bdb02b2625015f585f72d9c01e44b892561604ced85a635d2b531ae1","source":{"kind":"arxiv","id":"1104.3806","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1104.3806","created_at":"2026-05-18T04:23:55Z"},{"alias_kind":"arxiv_version","alias_value":"1104.3806v1","created_at":"2026-05-18T04:23:55Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1104.3806","created_at":"2026-05-18T04:23:55Z"},{"alias_kind":"pith_short_12","alias_value":"BCUMPY55WAVS","created_at":"2026-05-18T12:26:24Z"},{"alias_kind":"pith_short_16","alias_value":"BCUMPY55WAVSMJIB","created_at":"2026-05-18T12:26:24Z"},{"alias_kind":"pith_short_8","alias_value":"BCUMPY55","created_at":"2026-05-18T12:26:24Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2011:BCUMPY55WAVSMJIBL5MF64WZYA","target":"record","payload":{"canonical_record":{"source":{"id":"1104.3806","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2011-04-19T17:16:59Z","cross_cats_sorted":["cs.CC"],"title_canon_sha256":"3382e70e9136ccb44ed5161b60f60df93a008b40fa7bd5c4516dcc74a245f968","abstract_canon_sha256":"525754de0fbfca80780a72a4df6f97aba4d29e9df50fe0419bed410382d8f9ee"},"schema_version":"1.0"},"canonical_sha256":"08a8c7e3bdb02b2625015f585f72d9c01e44b892561604ced85a635d2b531ae1","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:23:55.665449Z","signature_b64":"jVg0DtHittwaWNqKySfbyhvzgMqCOqQfgW2LvGmblHzYpUXuWyM9HezFEwaDfUeUttl0NJeyFI7nipcJkWu1Cg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"08a8c7e3bdb02b2625015f585f72d9c01e44b892561604ced85a635d2b531ae1","last_reissued_at":"2026-05-18T04:23:55.664875Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:23:55.664875Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1104.3806","source_version":1,"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-18T04:23:55Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"vLQE2pqb/Juf9YVUP4cZ38cacSgZlLkRTS7och9xqLaPWeqctGh7kXc6BfE3FRN4Igk9CdKPOSnNOQ0fDMT+CQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-02T13:07:33.821872Z"},"content_sha256":"1403e1cf9481bb00c835ad27587b527a3f3a64254661085128e30648c1235bee","schema_version":"1.0","event_id":"sha256:1403e1cf9481bb00c835ad27587b527a3f3a64254661085128e30648c1235bee"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2011:BCUMPY55WAVSMJIBL5MF64WZYA","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"How to Play Unique Games against a Semi-Random Adversary","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CC"],"primary_cat":"cs.DS","authors_text":"Alexandra Kolla, Konstantin Makarychev, Yury Makarychev","submitted_at":"2011-04-19T17:16:59Z","abstract_excerpt":"In this paper, we study the average case complexity of the Unique Games problem. We propose a natural semi-random model, in which a unique game instance is generated in several steps. First an adversary selects a completely satisfiable instance of Unique Games, then she chooses an epsilon-fraction of all edges, and finally replaces (\"corrupts\") the constraints corresponding to these edges with new constraints. If all steps are adversarial, the adversary can obtain any (1-epsilon) satisfiable instance, so then the problem is as hard as in the worst case. In our semi-random model, one of the ste"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1104.3806","kind":"arxiv","version":1},"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-18T04:23:55Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"yZ5dKGTVRIJSds7adidL5W52MjQvDo7q29KPV8TVSSjnf1YRrDl/nzOCc5QXsy+I3RWsi6K6pt5Ph0/eq0v8AA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-02T13:07:33.822479Z"},"content_sha256":"f5a1bfbba5ff064d2a36333a33467e89a48f6213f26e17d020d8b309f38f48a8","schema_version":"1.0","event_id":"sha256:f5a1bfbba5ff064d2a36333a33467e89a48f6213f26e17d020d8b309f38f48a8"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/BCUMPY55WAVSMJIBL5MF64WZYA/bundle.json","state_url":"https://pith.science/pith/BCUMPY55WAVSMJIBL5MF64WZYA/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/BCUMPY55WAVSMJIBL5MF64WZYA/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-06-02T13:07:33Z","links":{"resolver":"https://pith.science/pith/BCUMPY55WAVSMJIBL5MF64WZYA","bundle":"https://pith.science/pith/BCUMPY55WAVSMJIBL5MF64WZYA/bundle.json","state":"https://pith.science/pith/BCUMPY55WAVSMJIBL5MF64WZYA/state.json","well_known_bundle":"https://pith.science/.well-known/pith/BCUMPY55WAVSMJIBL5MF64WZYA/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2011:BCUMPY55WAVSMJIBL5MF64WZYA","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":"525754de0fbfca80780a72a4df6f97aba4d29e9df50fe0419bed410382d8f9ee","cross_cats_sorted":["cs.CC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2011-04-19T17:16:59Z","title_canon_sha256":"3382e70e9136ccb44ed5161b60f60df93a008b40fa7bd5c4516dcc74a245f968"},"schema_version":"1.0","source":{"id":"1104.3806","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1104.3806","created_at":"2026-05-18T04:23:55Z"},{"alias_kind":"arxiv_version","alias_value":"1104.3806v1","created_at":"2026-05-18T04:23:55Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1104.3806","created_at":"2026-05-18T04:23:55Z"},{"alias_kind":"pith_short_12","alias_value":"BCUMPY55WAVS","created_at":"2026-05-18T12:26:24Z"},{"alias_kind":"pith_short_16","alias_value":"BCUMPY55WAVSMJIB","created_at":"2026-05-18T12:26:24Z"},{"alias_kind":"pith_short_8","alias_value":"BCUMPY55","created_at":"2026-05-18T12:26:24Z"}],"graph_snapshots":[{"event_id":"sha256:f5a1bfbba5ff064d2a36333a33467e89a48f6213f26e17d020d8b309f38f48a8","target":"graph","created_at":"2026-05-18T04:23:55Z","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":"In this paper, we study the average case complexity of the Unique Games problem. We propose a natural semi-random model, in which a unique game instance is generated in several steps. First an adversary selects a completely satisfiable instance of Unique Games, then she chooses an epsilon-fraction of all edges, and finally replaces (\"corrupts\") the constraints corresponding to these edges with new constraints. If all steps are adversarial, the adversary can obtain any (1-epsilon) satisfiable instance, so then the problem is as hard as in the worst case. In our semi-random model, one of the ste","authors_text":"Alexandra Kolla, Konstantin Makarychev, Yury Makarychev","cross_cats":["cs.CC"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2011-04-19T17:16:59Z","title":"How to Play Unique Games against a Semi-Random Adversary"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1104.3806","kind":"arxiv","version":1},"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:1403e1cf9481bb00c835ad27587b527a3f3a64254661085128e30648c1235bee","target":"record","created_at":"2026-05-18T04:23:55Z","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":"525754de0fbfca80780a72a4df6f97aba4d29e9df50fe0419bed410382d8f9ee","cross_cats_sorted":["cs.CC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2011-04-19T17:16:59Z","title_canon_sha256":"3382e70e9136ccb44ed5161b60f60df93a008b40fa7bd5c4516dcc74a245f968"},"schema_version":"1.0","source":{"id":"1104.3806","kind":"arxiv","version":1}},"canonical_sha256":"08a8c7e3bdb02b2625015f585f72d9c01e44b892561604ced85a635d2b531ae1","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"08a8c7e3bdb02b2625015f585f72d9c01e44b892561604ced85a635d2b531ae1","first_computed_at":"2026-05-18T04:23:55.664875Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T04:23:55.664875Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"jVg0DtHittwaWNqKySfbyhvzgMqCOqQfgW2LvGmblHzYpUXuWyM9HezFEwaDfUeUttl0NJeyFI7nipcJkWu1Cg==","signature_status":"signed_v1","signed_at":"2026-05-18T04:23:55.665449Z","signed_message":"canonical_sha256_bytes"},"source_id":"1104.3806","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:1403e1cf9481bb00c835ad27587b527a3f3a64254661085128e30648c1235bee","sha256:f5a1bfbba5ff064d2a36333a33467e89a48f6213f26e17d020d8b309f38f48a8"],"state_sha256":"f77c14710d32b5b8c0d96561559a1ce706c5f4fd87dcd4efad1d494769ce30bd"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"unXRspI/oH3vO0NwiXlxyvw9dzQtwYyujYe7Dii6HJRn0ZM0O25vp037ZXNMEcbaAEmgGEWCqes37H4dZlPRBw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-02T13:07:33.825521Z","bundle_sha256":"74460c5a32ee7cf4bc2432ae8570e41ecc92938bfa7b68f6315fd21cd61620cd"}}