{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:W6KT3352NJAERGTM6KENOIAIOK","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":"d9062c7c5e715d6a6b5223098ec44845e1609b5b8df7a87c1159a6429aa6d791","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2014-12-18T20:38:18Z","title_canon_sha256":"a694b1ef0d926f095cfce90eb225da95b68b6128e73cff822e3397d0ecc0ceb7"},"schema_version":"1.0","source":{"id":"1412.6062","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1412.6062","created_at":"2026-05-18T01:38:54Z"},{"alias_kind":"arxiv_version","alias_value":"1412.6062v2","created_at":"2026-05-18T01:38:54Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1412.6062","created_at":"2026-05-18T01:38:54Z"},{"alias_kind":"pith_short_12","alias_value":"W6KT3352NJAE","created_at":"2026-05-18T12:28:54Z"},{"alias_kind":"pith_short_16","alias_value":"W6KT3352NJAERGTM","created_at":"2026-05-18T12:28:54Z"},{"alias_kind":"pith_short_8","alias_value":"W6KT3352","created_at":"2026-05-18T12:28:54Z"}],"graph_snapshots":[{"event_id":"sha256:316c0886af6b494654c1d209f637a396e57f26d856c8e36236210f9c02337fc4","target":"graph","created_at":"2026-05-18T01:38:54Z","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 apply our recent Quantum Approximate Optimization Algorithm to the combinatorial problem of bounded occurrence Max E3LIN2. The input is a set of linear equations each of which contains exactly three boolean variables and each equation says that the sum of the variables mod 2 is 0 or is 1. Every variable is in no more than D equations. A random string will satisfy 1/2 of the equations. We show that the level one QAOA will efficiently produce a string that satisfies $\\left(\\frac{1}{2} + \\frac{1}{101 D^{1/2}\\, l n\\, D}\\right)$ times the number of equations. A recent classical algorithm achieve","authors_text":"Edward Farhi, Jeffrey Goldstone, Sam Gutmann","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2014-12-18T20:38:18Z","title":"A Quantum Approximate Optimization Algorithm Applied to a Bounded Occurrence Constraint Problem"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1412.6062","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:0cbb90a10e32a9d4b90b3530a32c4bd66e4cd5e3c93129f411d5f8ca266205c7","target":"record","created_at":"2026-05-18T01:38:54Z","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":"d9062c7c5e715d6a6b5223098ec44845e1609b5b8df7a87c1159a6429aa6d791","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2014-12-18T20:38:18Z","title_canon_sha256":"a694b1ef0d926f095cfce90eb225da95b68b6128e73cff822e3397d0ecc0ceb7"},"schema_version":"1.0","source":{"id":"1412.6062","kind":"arxiv","version":2}},"canonical_sha256":"b7953defba6a40489a6cf288d7200872bc4dd917b9da21bc6b0d4cfad334fe70","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"b7953defba6a40489a6cf288d7200872bc4dd917b9da21bc6b0d4cfad334fe70","first_computed_at":"2026-05-18T01:38:54.003914Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:38:54.003914Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"66/AYLuJ5jGEyeAZ9IhqgKOKcHx0uoJZIJXSQ2ju+HKmIRJ88fBTxDrU+6XbYJU4YyGexvoKt4YZV8EjPxltCw==","signature_status":"signed_v1","signed_at":"2026-05-18T01:38:54.004551Z","signed_message":"canonical_sha256_bytes"},"source_id":"1412.6062","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:0cbb90a10e32a9d4b90b3530a32c4bd66e4cd5e3c93129f411d5f8ca266205c7","sha256:316c0886af6b494654c1d209f637a396e57f26d856c8e36236210f9c02337fc4"],"state_sha256":"e40178d41fe17b72b3acfcf27716a9cec938ca739f29e7f1e40b83b447b7dafc"}