{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2019:2Z3NU3SOBJEAB3DIF4VPNDPTSG","short_pith_number":"pith:2Z3NU3SO","canonical_record":{"source":{"id":"1905.07047","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2019-05-16T21:52:22Z","cross_cats_sorted":[],"title_canon_sha256":"8bc1aef877161db7fcd8ec2aa87913d57e8371315f8b34d996318fd80355a831","abstract_canon_sha256":"7a48d56f2c305608a2c41d583976804a9a00784d084ac54f8fc638cdb52b9dfc"},"schema_version":"1.0"},"canonical_sha256":"d676da6e4e0a4800ec682f2af68df39196877e5edc0c4e891d5b125775adaa8f","source":{"kind":"arxiv","id":"1905.07047","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1905.07047","created_at":"2026-07-04T23:51:04Z"},{"alias_kind":"arxiv_version","alias_value":"1905.07047v2","created_at":"2026-07-04T23:51:04Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1905.07047","created_at":"2026-07-04T23:51:04Z"},{"alias_kind":"pith_short_12","alias_value":"2Z3NU3SOBJEA","created_at":"2026-07-04T23:51:04Z"},{"alias_kind":"pith_short_16","alias_value":"2Z3NU3SOBJEAB3DI","created_at":"2026-07-04T23:51:04Z"},{"alias_kind":"pith_short_8","alias_value":"2Z3NU3SO","created_at":"2026-07-04T23:51:04Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2019:2Z3NU3SOBJEAB3DIF4VPNDPTSG","target":"record","payload":{"canonical_record":{"source":{"id":"1905.07047","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2019-05-16T21:52:22Z","cross_cats_sorted":[],"title_canon_sha256":"8bc1aef877161db7fcd8ec2aa87913d57e8371315f8b34d996318fd80355a831","abstract_canon_sha256":"7a48d56f2c305608a2c41d583976804a9a00784d084ac54f8fc638cdb52b9dfc"},"schema_version":"1.0"},"canonical_sha256":"d676da6e4e0a4800ec682f2af68df39196877e5edc0c4e891d5b125775adaa8f","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-04T23:51:04.474807Z","signature_b64":"9vAi4WLHn2DZ0R+lE2yKs2T1LpPjBfDypVqSVxCPsfGSlSwqteWfWuQCg4PoHW5KJjmN2L1u+WlYwu9MLJdmCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"d676da6e4e0a4800ec682f2af68df39196877e5edc0c4e891d5b125775adaa8f","last_reissued_at":"2026-07-04T23:51:04.474407Z","signature_status":"signed_v1","first_computed_at":"2026-07-04T23:51:04.474407Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1905.07047","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-07-04T23:51:04Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"DRySBqBpEDsBhJ/XQY/8f0j9dBoU6ZLBx+RCQN9y3z974xhHII2p9DbxKhg6ipRUs9LRCGHRxY9hWMD+zC/7CQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-08T20:50:05.679748Z"},"content_sha256":"6d1d2e5a2b71951273b0e61eba1f40dabba95028d4644726a20bf3d1d7563d48","schema_version":"1.0","event_id":"sha256:6d1d2e5a2b71951273b0e61eba1f40dabba95028d4644726a20bf3d1d7563d48"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2019:2Z3NU3SOBJEAB3DIF4VPNDPTSG","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Classical and Quantum Bounded Depth Approximation Algorithms","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"M. B. Hastings","submitted_at":"2019-05-16T21:52:22Z","abstract_excerpt":"We consider some classical and quantum approximate optimization algorithms with bounded depth. First, we define a class of \"local\" classical optimization algorithms and show that a single step version of these algorithms can achieve the same performance as the single step QAOA on MAX-3-LIN-2. Second, we show that this class of classical algorithms generalizes a class previously considered in the literature, and also that a single step of the classical algorithm will outperform the single-step QAOA on all triangle-free MAX-CUT instances. In fact, for all but $4$ choices of degree, existing sing"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1905.07047","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/1905.07047/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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-07-04T23:51:04Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"oENgMCf43lPpayjH9/Q3OXA0MWDf2ZFI1xjvdKUWZUh/zVCRiNtSbFZxdHeqMQjyUwRE1miE5FxNc92YIhONAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-08T20:50:05.680230Z"},"content_sha256":"13bc1ecaa0e9cb790bfb26b871c94dc73715b002f30af06d5ca2c942005a6a98","schema_version":"1.0","event_id":"sha256:13bc1ecaa0e9cb790bfb26b871c94dc73715b002f30af06d5ca2c942005a6a98"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/2Z3NU3SOBJEAB3DIF4VPNDPTSG/bundle.json","state_url":"https://pith.science/pith/2Z3NU3SOBJEAB3DIF4VPNDPTSG/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/2Z3NU3SOBJEAB3DIF4VPNDPTSG/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-08-08T20:50:05Z","links":{"resolver":"https://pith.science/pith/2Z3NU3SOBJEAB3DIF4VPNDPTSG","bundle":"https://pith.science/pith/2Z3NU3SOBJEAB3DIF4VPNDPTSG/bundle.json","state":"https://pith.science/pith/2Z3NU3SOBJEAB3DIF4VPNDPTSG/state.json","well_known_bundle":"https://pith.science/.well-known/pith/2Z3NU3SOBJEAB3DIF4VPNDPTSG/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2019:2Z3NU3SOBJEAB3DIF4VPNDPTSG","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":"7a48d56f2c305608a2c41d583976804a9a00784d084ac54f8fc638cdb52b9dfc","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2019-05-16T21:52:22Z","title_canon_sha256":"8bc1aef877161db7fcd8ec2aa87913d57e8371315f8b34d996318fd80355a831"},"schema_version":"1.0","source":{"id":"1905.07047","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1905.07047","created_at":"2026-07-04T23:51:04Z"},{"alias_kind":"arxiv_version","alias_value":"1905.07047v2","created_at":"2026-07-04T23:51:04Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1905.07047","created_at":"2026-07-04T23:51:04Z"},{"alias_kind":"pith_short_12","alias_value":"2Z3NU3SOBJEA","created_at":"2026-07-04T23:51:04Z"},{"alias_kind":"pith_short_16","alias_value":"2Z3NU3SOBJEAB3DI","created_at":"2026-07-04T23:51:04Z"},{"alias_kind":"pith_short_8","alias_value":"2Z3NU3SO","created_at":"2026-07-04T23:51:04Z"}],"graph_snapshots":[{"event_id":"sha256:13bc1ecaa0e9cb790bfb26b871c94dc73715b002f30af06d5ca2c942005a6a98","target":"graph","created_at":"2026-07-04T23:51:04Z","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"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/1905.07047/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"We consider some classical and quantum approximate optimization algorithms with bounded depth. First, we define a class of \"local\" classical optimization algorithms and show that a single step version of these algorithms can achieve the same performance as the single step QAOA on MAX-3-LIN-2. Second, we show that this class of classical algorithms generalizes a class previously considered in the literature, and also that a single step of the classical algorithm will outperform the single-step QAOA on all triangle-free MAX-CUT instances. In fact, for all but $4$ choices of degree, existing sing","authors_text":"M. B. Hastings","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2019-05-16T21:52:22Z","title":"Classical and Quantum Bounded Depth Approximation Algorithms"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1905.07047","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:6d1d2e5a2b71951273b0e61eba1f40dabba95028d4644726a20bf3d1d7563d48","target":"record","created_at":"2026-07-04T23:51:04Z","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":"7a48d56f2c305608a2c41d583976804a9a00784d084ac54f8fc638cdb52b9dfc","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2019-05-16T21:52:22Z","title_canon_sha256":"8bc1aef877161db7fcd8ec2aa87913d57e8371315f8b34d996318fd80355a831"},"schema_version":"1.0","source":{"id":"1905.07047","kind":"arxiv","version":2}},"canonical_sha256":"d676da6e4e0a4800ec682f2af68df39196877e5edc0c4e891d5b125775adaa8f","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"d676da6e4e0a4800ec682f2af68df39196877e5edc0c4e891d5b125775adaa8f","first_computed_at":"2026-07-04T23:51:04.474407Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-04T23:51:04.474407Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"9vAi4WLHn2DZ0R+lE2yKs2T1LpPjBfDypVqSVxCPsfGSlSwqteWfWuQCg4PoHW5KJjmN2L1u+WlYwu9MLJdmCA==","signature_status":"signed_v1","signed_at":"2026-07-04T23:51:04.474807Z","signed_message":"canonical_sha256_bytes"},"source_id":"1905.07047","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:6d1d2e5a2b71951273b0e61eba1f40dabba95028d4644726a20bf3d1d7563d48","sha256:13bc1ecaa0e9cb790bfb26b871c94dc73715b002f30af06d5ca2c942005a6a98"],"state_sha256":"faecebfbb3474cae22f2dec97198b29e3c52ebe75d927d1bc12c641ea2a76f43"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"4IRSz6nHiqXVmkhnAOR7LZEa/tAUoQ/QyhZgUAILphgB+DeJXKXjOVvRFjXmBf+r/Jic1qknUtZSSTSI9t4xAQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-08T20:50:05.684980Z","bundle_sha256":"c5162c41fae9ec51560b6c12aa8eb529af60f9ea9c03f8329d758e25743f5376"}}