{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2023:TE6BFR3BD6JQZ7L4Q6YGOJ3NCY","short_pith_number":"pith:TE6BFR3B","canonical_record":{"source":{"id":"2309.13110","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2023-09-22T18:00:03Z","cross_cats_sorted":[],"title_canon_sha256":"aa6bb7787e6160d7d1e6c57a4cef17d571b4051655dd80f81d4064dd334bc66f","abstract_canon_sha256":"f0e491ca0eb42c041d4456d247119be65c04b9daf9280c72c1362026dc1b055d"},"schema_version":"1.0"},"canonical_sha256":"993c12c7611f930cfd7c87b067276d1639988d52f6a81bc91beaa1431601e9b7","source":{"kind":"arxiv","id":"2309.13110","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2309.13110","created_at":"2026-07-05T07:09:01Z"},{"alias_kind":"arxiv_version","alias_value":"2309.13110v2","created_at":"2026-07-05T07:09:01Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2309.13110","created_at":"2026-07-05T07:09:01Z"},{"alias_kind":"pith_short_12","alias_value":"TE6BFR3BD6JQ","created_at":"2026-07-05T07:09:01Z"},{"alias_kind":"pith_short_16","alias_value":"TE6BFR3BD6JQZ7L4","created_at":"2026-07-05T07:09:01Z"},{"alias_kind":"pith_short_8","alias_value":"TE6BFR3B","created_at":"2026-07-05T07:09:01Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2023:TE6BFR3BD6JQZ7L4Q6YGOJ3NCY","target":"record","payload":{"canonical_record":{"source":{"id":"2309.13110","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2023-09-22T18:00:03Z","cross_cats_sorted":[],"title_canon_sha256":"aa6bb7787e6160d7d1e6c57a4cef17d571b4051655dd80f81d4064dd334bc66f","abstract_canon_sha256":"f0e491ca0eb42c041d4456d247119be65c04b9daf9280c72c1362026dc1b055d"},"schema_version":"1.0"},"canonical_sha256":"993c12c7611f930cfd7c87b067276d1639988d52f6a81bc91beaa1431601e9b7","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T07:09:01.777731Z","signature_b64":"uSmTTTtuLYG32nGgGB6dJg4Z8BdVSaLPNYq/xk0YPJUN4gO+VJS96an9EPFAT1mnVynsWdYaRdepDdRYUyF6Aw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"993c12c7611f930cfd7c87b067276d1639988d52f6a81bc91beaa1431601e9b7","last_reissued_at":"2026-07-05T07:09:01.777257Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T07:09:01.777257Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2309.13110","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-05T07:09:01Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"i48KjqvYVYONfEtcbZDGcYZprDRzNNXksMFMY2hOIDS2eOG1+p4VXqst1hc2bbgqT5IlpgE6gMgGzqGQRZLuAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-23T12:29:16.655077Z"},"content_sha256":"4d66a677f5da2ebe06019e620277141c817f0515417b0da435ebb338e508fcdc","schema_version":"1.0","event_id":"sha256:4d66a677f5da2ebe06019e620277141c817f0515417b0da435ebb338e508fcdc"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2023:TE6BFR3BD6JQZ7L4Q6YGOJ3NCY","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Iterative Quantum Algorithms for Maximum Independent Set: A Tale of Low-Depth Quantum Algorithms","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Lucas T. Brady, Stuart Hadfield","submitted_at":"2023-09-22T18:00:03Z","abstract_excerpt":"Quantum algorithms have been widely studied in the context of combinatorial optimization problems. While this endeavor can often analytically and practically achieve quadratic speedups, theoretical and numeric studies remain limited, especially compared to the study of classical algorithms. We propose and study a new class of hybrid approaches to quantum optimization, termed Iterative Quantum Algorithms, which in particular generalizes the Recursive Quantum Approximate Optimization Algorithm. This paradigm can incorporate hard problem constraints, which we demonstrate by considering the Maximu"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2309.13110","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/2309.13110/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-05T07:09:01Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"UMTg+KZaxZGKDT3xReI+GwhvGS9fcDfV9o62iI57mHf9mmg43tXD53bdT97MSYfWiqgPqCUFKXLcGfQg0j05AA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-23T12:29:16.655586Z"},"content_sha256":"a5e311d9b1127a32eda73192c3595f15f83bf19580bc64aaefc8ce831e470c05","schema_version":"1.0","event_id":"sha256:a5e311d9b1127a32eda73192c3595f15f83bf19580bc64aaefc8ce831e470c05"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/TE6BFR3BD6JQZ7L4Q6YGOJ3NCY/bundle.json","state_url":"https://pith.science/pith/TE6BFR3BD6JQZ7L4Q6YGOJ3NCY/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/TE6BFR3BD6JQZ7L4Q6YGOJ3NCY/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-23T12:29:16Z","links":{"resolver":"https://pith.science/pith/TE6BFR3BD6JQZ7L4Q6YGOJ3NCY","bundle":"https://pith.science/pith/TE6BFR3BD6JQZ7L4Q6YGOJ3NCY/bundle.json","state":"https://pith.science/pith/TE6BFR3BD6JQZ7L4Q6YGOJ3NCY/state.json","well_known_bundle":"https://pith.science/.well-known/pith/TE6BFR3BD6JQZ7L4Q6YGOJ3NCY/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2023:TE6BFR3BD6JQZ7L4Q6YGOJ3NCY","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":"f0e491ca0eb42c041d4456d247119be65c04b9daf9280c72c1362026dc1b055d","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2023-09-22T18:00:03Z","title_canon_sha256":"aa6bb7787e6160d7d1e6c57a4cef17d571b4051655dd80f81d4064dd334bc66f"},"schema_version":"1.0","source":{"id":"2309.13110","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2309.13110","created_at":"2026-07-05T07:09:01Z"},{"alias_kind":"arxiv_version","alias_value":"2309.13110v2","created_at":"2026-07-05T07:09:01Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2309.13110","created_at":"2026-07-05T07:09:01Z"},{"alias_kind":"pith_short_12","alias_value":"TE6BFR3BD6JQ","created_at":"2026-07-05T07:09:01Z"},{"alias_kind":"pith_short_16","alias_value":"TE6BFR3BD6JQZ7L4","created_at":"2026-07-05T07:09:01Z"},{"alias_kind":"pith_short_8","alias_value":"TE6BFR3B","created_at":"2026-07-05T07:09:01Z"}],"graph_snapshots":[{"event_id":"sha256:a5e311d9b1127a32eda73192c3595f15f83bf19580bc64aaefc8ce831e470c05","target":"graph","created_at":"2026-07-05T07:09:01Z","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/2309.13110/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Quantum algorithms have been widely studied in the context of combinatorial optimization problems. While this endeavor can often analytically and practically achieve quadratic speedups, theoretical and numeric studies remain limited, especially compared to the study of classical algorithms. We propose and study a new class of hybrid approaches to quantum optimization, termed Iterative Quantum Algorithms, which in particular generalizes the Recursive Quantum Approximate Optimization Algorithm. This paradigm can incorporate hard problem constraints, which we demonstrate by considering the Maximu","authors_text":"Lucas T. Brady, Stuart Hadfield","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2023-09-22T18:00:03Z","title":"Iterative Quantum Algorithms for Maximum Independent Set: A Tale of Low-Depth Quantum Algorithms"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2309.13110","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:4d66a677f5da2ebe06019e620277141c817f0515417b0da435ebb338e508fcdc","target":"record","created_at":"2026-07-05T07:09:01Z","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":"f0e491ca0eb42c041d4456d247119be65c04b9daf9280c72c1362026dc1b055d","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2023-09-22T18:00:03Z","title_canon_sha256":"aa6bb7787e6160d7d1e6c57a4cef17d571b4051655dd80f81d4064dd334bc66f"},"schema_version":"1.0","source":{"id":"2309.13110","kind":"arxiv","version":2}},"canonical_sha256":"993c12c7611f930cfd7c87b067276d1639988d52f6a81bc91beaa1431601e9b7","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"993c12c7611f930cfd7c87b067276d1639988d52f6a81bc91beaa1431601e9b7","first_computed_at":"2026-07-05T07:09:01.777257Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T07:09:01.777257Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"uSmTTTtuLYG32nGgGB6dJg4Z8BdVSaLPNYq/xk0YPJUN4gO+VJS96an9EPFAT1mnVynsWdYaRdepDdRYUyF6Aw==","signature_status":"signed_v1","signed_at":"2026-07-05T07:09:01.777731Z","signed_message":"canonical_sha256_bytes"},"source_id":"2309.13110","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:4d66a677f5da2ebe06019e620277141c817f0515417b0da435ebb338e508fcdc","sha256:a5e311d9b1127a32eda73192c3595f15f83bf19580bc64aaefc8ce831e470c05"],"state_sha256":"42b823d4488c7b600f2ca0f56917bc072eedbc53813ff1e8e96c8c9d58379bf8"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"8wKWX2yle3xX2uSpbvCWn0UEGrN7t1i9a2g+Py8+syEoVQ8UesahQVJZbyP7irugZJZu1r9oNxL7dCtb6xs1CQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-23T12:29:16.661643Z","bundle_sha256":"8255da259d9b95849b42525a0b513660c78654f72f1fa633182cae8780c62a0c"}}