{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2026:VGCXXVAXNLQLVT4AXDK7LFE7PV","short_pith_number":"pith:VGCXXVAX","canonical_record":{"source":{"id":"2606.29562","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"quant-ph","submitted_at":"2026-06-28T19:00:40Z","cross_cats_sorted":[],"title_canon_sha256":"69738f4ee46441edaeb131236f85c2cd4629a49cf3b5ed34a2b6d12d822b5b46","abstract_canon_sha256":"42917a5842697f198679fae9e29f4112faba195c4286062818e7b44ff20fe9fe"},"schema_version":"1.0"},"canonical_sha256":"a9857bd4176ae0bacf80b8d5f5949f7d71f4f9f85da3ab95f25817d064613011","source":{"kind":"arxiv","id":"2606.29562","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2606.29562","created_at":"2026-06-30T01:18:12Z"},{"alias_kind":"arxiv_version","alias_value":"2606.29562v1","created_at":"2026-06-30T01:18:12Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2606.29562","created_at":"2026-06-30T01:18:12Z"},{"alias_kind":"pith_short_12","alias_value":"VGCXXVAXNLQL","created_at":"2026-06-30T01:18:12Z"},{"alias_kind":"pith_short_16","alias_value":"VGCXXVAXNLQLVT4A","created_at":"2026-06-30T01:18:12Z"},{"alias_kind":"pith_short_8","alias_value":"VGCXXVAX","created_at":"2026-06-30T01:18:12Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2026:VGCXXVAXNLQLVT4AXDK7LFE7PV","target":"record","payload":{"canonical_record":{"source":{"id":"2606.29562","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"quant-ph","submitted_at":"2026-06-28T19:00:40Z","cross_cats_sorted":[],"title_canon_sha256":"69738f4ee46441edaeb131236f85c2cd4629a49cf3b5ed34a2b6d12d822b5b46","abstract_canon_sha256":"42917a5842697f198679fae9e29f4112faba195c4286062818e7b44ff20fe9fe"},"schema_version":"1.0"},"canonical_sha256":"a9857bd4176ae0bacf80b8d5f5949f7d71f4f9f85da3ab95f25817d064613011","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-06-30T01:18:12.055249Z","signature_b64":"/XuN4dXycQTDAYHt9bIG7mnHwgmeLXAQ0ouxq8YfUvgg1Vgxs+ioCFe/AXoOtYU2N4H2X+u+ryDKjnrlY7GEBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"a9857bd4176ae0bacf80b8d5f5949f7d71f4f9f85da3ab95f25817d064613011","last_reissued_at":"2026-06-30T01:18:12.054598Z","signature_status":"signed_v1","first_computed_at":"2026-06-30T01:18:12.054598Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2606.29562","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-06-30T01:18:12Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"4BB9V7ob1MpQHL3NE2BfS2AQfyYopT4AWzhvTyCJ0JpVVlLmO8adz0CGhFTbZ0sUXZWHqOr2c2Lg7cXjGxl6CA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-18T12:23:39.578016Z"},"content_sha256":"0a1a06ddcc238cfc02b64006d1c118a53836c2cc3802672b7ddbb5b0737fd647","schema_version":"1.0","event_id":"sha256:0a1a06ddcc238cfc02b64006d1c118a53836c2cc3802672b7ddbb5b0737fd647"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2026:VGCXXVAXNLQLVT4AXDK7LFE7PV","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"The QAOA on the ring of disagrees","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Kunal Marwaha","submitted_at":"2026-06-28T19:00:40Z","abstract_excerpt":"We study the performance of symmetric local algorithms finding large cuts on the cycle graph. Such algorithms that cannot see the whole graph at depth p cut at most a (2p+1)/(2p+2) fraction of edges in expectation. We prove that the QAOA achieves this value, a long-standing conjecture of Farhi, Goldstone, and Gutmann. Curiously we do this without finding the optimal parameters. Instead we show it is equivalent to find an optimal pair of Laurent polynomials of degree at most 2p-1. This is made possible by recasting the QAOA on one qubit in the language of quantum signal processing."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2606.29562","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2606.29562/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-06-30T01:18:12Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"E6MpuEu9I0c0aKctEkE0MNwcW43do+wVXONSrM22t3mX3hpUJY46UWb4tQV7CkyE41dqje9OvBxkg3/aAArQAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-18T12:23:39.578642Z"},"content_sha256":"7fe992353ec0403d7e0317cb416651d87c97c29d7f6671a52af7fbf48dae950a","schema_version":"1.0","event_id":"sha256:7fe992353ec0403d7e0317cb416651d87c97c29d7f6671a52af7fbf48dae950a"},{"event_type":"integrity_finding","subject_pith_number":"pith:2026:VGCXXVAXNLQLVT4AXDK7LFE7PV","target":"integrity","payload":{"note":"DOI in the printed bibliography is fragmented by whitespace or line breaks. A longer candidate (10.1103/PhysRevLett.118.010501.arXiv:1606.02685) was visible in the surrounding text but could not be confirmed against doi.org as printed.","snippet":"Guang Hao Low and Isaac L. Chuang. “Optimal Hamiltonian Simulation by Quantum Signal Processing”. In:Physical Review Letters118.1 (2017), p. 010501.doi: 10.1103/PhysRevLett. 118.010501. arXiv:1606.02685","arxiv_id":"2606.29562","detector":"doi_compliance","evidence":{"ref_index":6,"verdict_class":"incontrovertible","resolved_title":null,"printed_excerpt":"Guang Hao Low and Isaac L. Chuang. “Optimal Hamiltonian Simulation by Quantum Signal Processing”. In:Physical Review Letters118.1 (2017), p. 010501.doi: 10.1103/PhysRevLett. 118.010501. arXiv:1606.02685","reconstructed_doi":"10.1103/PhysRevLett.118.010501.arXiv:1606.02685"},"severity":"advisory","ref_index":6,"audited_at":"2026-07-09T12:37:13.368566Z","event_type":"pith.integrity.v1","detected_doi":"10.1103/PhysRevLett.118.010501.arXiv:1606.02685","detector_url":"https://pith.science/pith-integrity-protocol#doi_compliance","external_url":null,"finding_type":"recoverable_identifier","evidence_hash":"75fe5495cc989f12152f5a931a83450ac16e47d010613784925919ab2f0e6a9e","paper_version":1,"verdict_class":"incontrovertible","resolved_title":null,"detector_version":"1.0.0","detected_arxiv_id":null,"integrity_event_id":8877,"payload_sha256":"591de69a129fc057b22d4478cf83938b097479127b44d4d6ad03cbdc1a10f0e4","signature_b64":"ghLqEfdWFiBRSqu3G4cFSTQ+2RQ88NIm12ng/1iHqMCdCFIsO7+LNWPq1AzwlQWuKN8p2uyFEYAYtkU7PumqBg==","signing_key_id":"pith-v1-2026-05"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-07-09T12:37:44Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"jzXzoEXYgB0ViFLS9beAPv8f8e7ahBKjKQNkGY/yq/32QFOAtsOLmmLhP50ZymuhaaWivo82JYnb+xXDnwJ1CA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-18T12:23:39.583841Z"},"content_sha256":"5adb9f345487c8c3806a397c93e7dee8a0bd08f6df806667cd470670ed4a2447","schema_version":"1.0","event_id":"sha256:5adb9f345487c8c3806a397c93e7dee8a0bd08f6df806667cd470670ed4a2447"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/VGCXXVAXNLQLVT4AXDK7LFE7PV/bundle.json","state_url":"https://pith.science/pith/VGCXXVAXNLQLVT4AXDK7LFE7PV/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/VGCXXVAXNLQLVT4AXDK7LFE7PV/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-18T12:23:39Z","links":{"resolver":"https://pith.science/pith/VGCXXVAXNLQLVT4AXDK7LFE7PV","bundle":"https://pith.science/pith/VGCXXVAXNLQLVT4AXDK7LFE7PV/bundle.json","state":"https://pith.science/pith/VGCXXVAXNLQLVT4AXDK7LFE7PV/state.json","well_known_bundle":"https://pith.science/.well-known/pith/VGCXXVAXNLQLVT4AXDK7LFE7PV/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2026:VGCXXVAXNLQLVT4AXDK7LFE7PV","merge_version":"pith-open-graph-merge-v1","event_count":3,"valid_event_count":3,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"42917a5842697f198679fae9e29f4112faba195c4286062818e7b44ff20fe9fe","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"quant-ph","submitted_at":"2026-06-28T19:00:40Z","title_canon_sha256":"69738f4ee46441edaeb131236f85c2cd4629a49cf3b5ed34a2b6d12d822b5b46"},"schema_version":"1.0","source":{"id":"2606.29562","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2606.29562","created_at":"2026-06-30T01:18:12Z"},{"alias_kind":"arxiv_version","alias_value":"2606.29562v1","created_at":"2026-06-30T01:18:12Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2606.29562","created_at":"2026-06-30T01:18:12Z"},{"alias_kind":"pith_short_12","alias_value":"VGCXXVAXNLQL","created_at":"2026-06-30T01:18:12Z"},{"alias_kind":"pith_short_16","alias_value":"VGCXXVAXNLQLVT4A","created_at":"2026-06-30T01:18:12Z"},{"alias_kind":"pith_short_8","alias_value":"VGCXXVAX","created_at":"2026-06-30T01:18:12Z"}],"graph_snapshots":[{"event_id":"sha256:7fe992353ec0403d7e0317cb416651d87c97c29d7f6671a52af7fbf48dae950a","target":"graph","created_at":"2026-06-30T01:18:12Z","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/2606.29562/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"We study the performance of symmetric local algorithms finding large cuts on the cycle graph. Such algorithms that cannot see the whole graph at depth p cut at most a (2p+1)/(2p+2) fraction of edges in expectation. We prove that the QAOA achieves this value, a long-standing conjecture of Farhi, Goldstone, and Gutmann. Curiously we do this without finding the optimal parameters. Instead we show it is equivalent to find an optimal pair of Laurent polynomials of degree at most 2p-1. This is made possible by recasting the QAOA on one qubit in the language of quantum signal processing.","authors_text":"Kunal Marwaha","cross_cats":[],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"quant-ph","submitted_at":"2026-06-28T19:00:40Z","title":"The QAOA on the ring of disagrees"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2606.29562","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:0a1a06ddcc238cfc02b64006d1c118a53836c2cc3802672b7ddbb5b0737fd647","target":"record","created_at":"2026-06-30T01:18:12Z","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":"42917a5842697f198679fae9e29f4112faba195c4286062818e7b44ff20fe9fe","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"quant-ph","submitted_at":"2026-06-28T19:00:40Z","title_canon_sha256":"69738f4ee46441edaeb131236f85c2cd4629a49cf3b5ed34a2b6d12d822b5b46"},"schema_version":"1.0","source":{"id":"2606.29562","kind":"arxiv","version":1}},"canonical_sha256":"a9857bd4176ae0bacf80b8d5f5949f7d71f4f9f85da3ab95f25817d064613011","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"a9857bd4176ae0bacf80b8d5f5949f7d71f4f9f85da3ab95f25817d064613011","first_computed_at":"2026-06-30T01:18:12.054598Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-06-30T01:18:12.054598Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"/XuN4dXycQTDAYHt9bIG7mnHwgmeLXAQ0ouxq8YfUvgg1Vgxs+ioCFe/AXoOtYU2N4H2X+u+ryDKjnrlY7GEBw==","signature_status":"signed_v1","signed_at":"2026-06-30T01:18:12.055249Z","signed_message":"canonical_sha256_bytes"},"source_id":"2606.29562","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:0a1a06ddcc238cfc02b64006d1c118a53836c2cc3802672b7ddbb5b0737fd647","sha256:7fe992353ec0403d7e0317cb416651d87c97c29d7f6671a52af7fbf48dae950a","sha256:5adb9f345487c8c3806a397c93e7dee8a0bd08f6df806667cd470670ed4a2447"],"state_sha256":"829c9d99cd48dae12abb343398d255bade758fcbe8f987c74850aa93c3ffebfb"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"LIkvIBzJZ7UoRer8/tkjRbkhzYQq1ox0+nlMhMznGTW9hBcvxNW9pKp+ytJ8dRIIiUY7O/GIm/UcYyafK/EIBQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-18T12:23:39.587139Z","bundle_sha256":"34d2aa0471ba86ad2f87212aa91d434e21003176d974d933ade5b05fe94ee43d"}}