{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:Y37Y4IRINWOGDDXFCECMI6JTZK","short_pith_number":"pith:Y37Y4IRI","canonical_record":{"source":{"id":"1505.03424","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2015-05-13T15:27:16Z","cross_cats_sorted":["cs.DS"],"title_canon_sha256":"be8085a05e078758924bfccec80d650512c04ce4898eaa22f15a50ddee411ae7","abstract_canon_sha256":"78a9e2201010e1256072ea807e124bd18c3b78e5124b40b4b3f6155cf7f4bb99"},"schema_version":"1.0"},"canonical_sha256":"c6ff8e22286d9c618ee51104c47933cab7e335fbf4799a2f94dcf3aef944f6ff","source":{"kind":"arxiv","id":"1505.03424","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1505.03424","created_at":"2026-05-18T01:35:30Z"},{"alias_kind":"arxiv_version","alias_value":"1505.03424v2","created_at":"2026-05-18T01:35:30Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1505.03424","created_at":"2026-05-18T01:35:30Z"},{"alias_kind":"pith_short_12","alias_value":"Y37Y4IRINWOG","created_at":"2026-05-18T12:29:50Z"},{"alias_kind":"pith_short_16","alias_value":"Y37Y4IRINWOGDDXF","created_at":"2026-05-18T12:29:50Z"},{"alias_kind":"pith_short_8","alias_value":"Y37Y4IRI","created_at":"2026-05-18T12:29:50Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:Y37Y4IRINWOGDDXFCECMI6JTZK","target":"record","payload":{"canonical_record":{"source":{"id":"1505.03424","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2015-05-13T15:27:16Z","cross_cats_sorted":["cs.DS"],"title_canon_sha256":"be8085a05e078758924bfccec80d650512c04ce4898eaa22f15a50ddee411ae7","abstract_canon_sha256":"78a9e2201010e1256072ea807e124bd18c3b78e5124b40b4b3f6155cf7f4bb99"},"schema_version":"1.0"},"canonical_sha256":"c6ff8e22286d9c618ee51104c47933cab7e335fbf4799a2f94dcf3aef944f6ff","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:35:30.134470Z","signature_b64":"knc0t+QaMOxuGuJwpuDUdnHIwoxOt/lwzQfQKDYoH30Wftyb5p4qTl+lMStAC8unHiOAHZlNpouYH8G6rQNLDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"c6ff8e22286d9c618ee51104c47933cab7e335fbf4799a2f94dcf3aef944f6ff","last_reissued_at":"2026-05-18T01:35:30.133810Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:35:30.133810Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1505.03424","source_version":2,"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-18T01:35:30Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"4mMY59rEsbZWyhyKrD7nKx0PoPxELXnkYasbZ3K0TnrrhAfts01KOkWwYy+itSWCQGQpIQ5bzulSxV4A00BjAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-25T16:26:36.764235Z"},"content_sha256":"b7367442e6cdf4e9f8780891a5a3b521d00c388d5a7eee83a6f5f4c08530a24f","schema_version":"1.0","event_id":"sha256:b7367442e6cdf4e9f8780891a5a3b521d00c388d5a7eee83a6f5f4c08530a24f"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:Y37Y4IRINWOGDDXFCECMI6JTZK","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Beating the random assignment on constraint satisfaction problems of bounded degree","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS"],"primary_cat":"cs.CC","authors_text":"Ankur Moitra, Aravindan Vijayaraghavan, Boaz Barak, David Steurer, David Witmer, John Wright, Luca Trevisan, Oded Regev, Prasad Raghavendra, Ryan O'Donnell","submitted_at":"2015-05-13T15:27:16Z","abstract_excerpt":"We show that for any odd $k$ and any instance of the Max-kXOR constraint satisfaction problem, there is an efficient algorithm that finds an assignment satisfying at least a $\\frac{1}{2} + \\Omega(1/\\sqrt{D})$ fraction of constraints, where $D$ is a bound on the number of constraints that each variable occurs in. This improves both qualitatively and quantitatively on the recent work of Farhi, Goldstone, and Gutmann (2014), which gave a \\emph{quantum} algorithm to find an assignment satisfying a $\\frac{1}{2} + \\Omega(D^{-3/4})$ fraction of the equations.\n  For arbitrary constraint satisfaction p"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1505.03424","kind":"arxiv","version":2},"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-18T01:35:30Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"WpbBk8jc8oudUuBAU+K0ebGMT9UIBU551HC3K8OlpskpIpr9X9uTa89qbyVApT8LFM+e5+oEEOSBmnbapqo8DQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-25T16:26:36.764965Z"},"content_sha256":"2a9f7807fe9ce8311e1c6fd219e197f5b2c8745fea668be49e0633c7f644d85f","schema_version":"1.0","event_id":"sha256:2a9f7807fe9ce8311e1c6fd219e197f5b2c8745fea668be49e0633c7f644d85f"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/Y37Y4IRINWOGDDXFCECMI6JTZK/bundle.json","state_url":"https://pith.science/pith/Y37Y4IRINWOGDDXFCECMI6JTZK/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/Y37Y4IRINWOGDDXFCECMI6JTZK/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-25T16:26:36Z","links":{"resolver":"https://pith.science/pith/Y37Y4IRINWOGDDXFCECMI6JTZK","bundle":"https://pith.science/pith/Y37Y4IRINWOGDDXFCECMI6JTZK/bundle.json","state":"https://pith.science/pith/Y37Y4IRINWOGDDXFCECMI6JTZK/state.json","well_known_bundle":"https://pith.science/.well-known/pith/Y37Y4IRINWOGDDXFCECMI6JTZK/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:Y37Y4IRINWOGDDXFCECMI6JTZK","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":"78a9e2201010e1256072ea807e124bd18c3b78e5124b40b4b3f6155cf7f4bb99","cross_cats_sorted":["cs.DS"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2015-05-13T15:27:16Z","title_canon_sha256":"be8085a05e078758924bfccec80d650512c04ce4898eaa22f15a50ddee411ae7"},"schema_version":"1.0","source":{"id":"1505.03424","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1505.03424","created_at":"2026-05-18T01:35:30Z"},{"alias_kind":"arxiv_version","alias_value":"1505.03424v2","created_at":"2026-05-18T01:35:30Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1505.03424","created_at":"2026-05-18T01:35:30Z"},{"alias_kind":"pith_short_12","alias_value":"Y37Y4IRINWOG","created_at":"2026-05-18T12:29:50Z"},{"alias_kind":"pith_short_16","alias_value":"Y37Y4IRINWOGDDXF","created_at":"2026-05-18T12:29:50Z"},{"alias_kind":"pith_short_8","alias_value":"Y37Y4IRI","created_at":"2026-05-18T12:29:50Z"}],"graph_snapshots":[{"event_id":"sha256:2a9f7807fe9ce8311e1c6fd219e197f5b2c8745fea668be49e0633c7f644d85f","target":"graph","created_at":"2026-05-18T01:35:30Z","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 show that for any odd $k$ and any instance of the Max-kXOR constraint satisfaction problem, there is an efficient algorithm that finds an assignment satisfying at least a $\\frac{1}{2} + \\Omega(1/\\sqrt{D})$ fraction of constraints, where $D$ is a bound on the number of constraints that each variable occurs in. This improves both qualitatively and quantitatively on the recent work of Farhi, Goldstone, and Gutmann (2014), which gave a \\emph{quantum} algorithm to find an assignment satisfying a $\\frac{1}{2} + \\Omega(D^{-3/4})$ fraction of the equations.\n  For arbitrary constraint satisfaction p","authors_text":"Ankur Moitra, Aravindan Vijayaraghavan, Boaz Barak, David Steurer, David Witmer, John Wright, Luca Trevisan, Oded Regev, Prasad Raghavendra, Ryan O'Donnell","cross_cats":["cs.DS"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2015-05-13T15:27:16Z","title":"Beating the random assignment on constraint satisfaction problems of bounded degree"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1505.03424","kind":"arxiv","version":2},"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:b7367442e6cdf4e9f8780891a5a3b521d00c388d5a7eee83a6f5f4c08530a24f","target":"record","created_at":"2026-05-18T01:35:30Z","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":"78a9e2201010e1256072ea807e124bd18c3b78e5124b40b4b3f6155cf7f4bb99","cross_cats_sorted":["cs.DS"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2015-05-13T15:27:16Z","title_canon_sha256":"be8085a05e078758924bfccec80d650512c04ce4898eaa22f15a50ddee411ae7"},"schema_version":"1.0","source":{"id":"1505.03424","kind":"arxiv","version":2}},"canonical_sha256":"c6ff8e22286d9c618ee51104c47933cab7e335fbf4799a2f94dcf3aef944f6ff","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"c6ff8e22286d9c618ee51104c47933cab7e335fbf4799a2f94dcf3aef944f6ff","first_computed_at":"2026-05-18T01:35:30.133810Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:35:30.133810Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"knc0t+QaMOxuGuJwpuDUdnHIwoxOt/lwzQfQKDYoH30Wftyb5p4qTl+lMStAC8unHiOAHZlNpouYH8G6rQNLDg==","signature_status":"signed_v1","signed_at":"2026-05-18T01:35:30.134470Z","signed_message":"canonical_sha256_bytes"},"source_id":"1505.03424","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:b7367442e6cdf4e9f8780891a5a3b521d00c388d5a7eee83a6f5f4c08530a24f","sha256:2a9f7807fe9ce8311e1c6fd219e197f5b2c8745fea668be49e0633c7f644d85f"],"state_sha256":"bd30144fbd1c93d6e469b8abb38a25871400ff64996246394c5cf0df7c05019c"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"C6VlQ81tuSsng1vV0cKnknD3acKcgzsZhnxoSKl9awfwCJgNRltuySPT3ehw1ZzEaIdnYfEMvnJpgMd5vpaICA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-25T16:26:36.769035Z","bundle_sha256":"086a994b2779b9011add2ad183ff3a7c83aa92333126e1ce5696547c1ad523a9"}}