{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2019:2Z3NU3SOBJEAB3DIF4VPNDPTSG","short_pith_number":"pith:2Z3NU3SO","schema_version":"1.0","canonical_sha256":"d676da6e4e0a4800ec682f2af68df39196877e5edc0c4e891d5b125775adaa8f","source":{"kind":"arxiv","id":"1905.07047","version":2},"attestation_state":"computed","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"},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"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"},"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"},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1905.07047","created_at":"2026-07-04T23:51:04.474465+00:00"},{"alias_kind":"arxiv_version","alias_value":"1905.07047v2","created_at":"2026-07-04T23:51:04.474465+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1905.07047","created_at":"2026-07-04T23:51:04.474465+00:00"},{"alias_kind":"pith_short_12","alias_value":"2Z3NU3SOBJEA","created_at":"2026-07-04T23:51:04.474465+00:00"},{"alias_kind":"pith_short_16","alias_value":"2Z3NU3SOBJEAB3DI","created_at":"2026-07-04T23:51:04.474465+00:00"},{"alias_kind":"pith_short_8","alias_value":"2Z3NU3SO","created_at":"2026-07-04T23:51:04.474465+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":2,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2605.23138","citing_title":"Classical State Preparation for Variational Quantum Algorithms via Reinforcement Learning","ref_index":41,"is_internal_anchor":false},{"citing_arxiv_id":"2507.10908","citing_title":"Optimisation-Free Recursive QAOA for the Binary Paint Shop Problem","ref_index":49,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/2Z3NU3SOBJEAB3DIF4VPNDPTSG","json":"https://pith.science/pith/2Z3NU3SOBJEAB3DIF4VPNDPTSG.json","graph_json":"https://pith.science/api/pith-number/2Z3NU3SOBJEAB3DIF4VPNDPTSG/graph.json","events_json":"https://pith.science/api/pith-number/2Z3NU3SOBJEAB3DIF4VPNDPTSG/events.json","paper":"https://pith.science/paper/2Z3NU3SO"},"agent_actions":{"view_html":"https://pith.science/pith/2Z3NU3SOBJEAB3DIF4VPNDPTSG","download_json":"https://pith.science/pith/2Z3NU3SOBJEAB3DIF4VPNDPTSG.json","view_paper":"https://pith.science/paper/2Z3NU3SO","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1905.07047&json=true","fetch_graph":"https://pith.science/api/pith-number/2Z3NU3SOBJEAB3DIF4VPNDPTSG/graph.json","fetch_events":"https://pith.science/api/pith-number/2Z3NU3SOBJEAB3DIF4VPNDPTSG/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/2Z3NU3SOBJEAB3DIF4VPNDPTSG/action/timestamp_anchor","attest_storage":"https://pith.science/pith/2Z3NU3SOBJEAB3DIF4VPNDPTSG/action/storage_attestation","attest_author":"https://pith.science/pith/2Z3NU3SOBJEAB3DIF4VPNDPTSG/action/author_attestation","sign_citation":"https://pith.science/pith/2Z3NU3SOBJEAB3DIF4VPNDPTSG/action/citation_signature","submit_replication":"https://pith.science/pith/2Z3NU3SOBJEAB3DIF4VPNDPTSG/action/replication_record"}},"created_at":"2026-07-04T23:51:04.474465+00:00","updated_at":"2026-07-04T23:51:04.474465+00:00"}