{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2025:BPUYEKYQ5WAVYBULKLY33Y444Z","short_pith_number":"pith:BPUYEKYQ","canonical_record":{"source":{"id":"2509.06455","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","primary_cat":"quant-ph","submitted_at":"2025-09-08T09:00:09Z","cross_cats_sorted":[],"title_canon_sha256":"f9adfa9035644cedc8d9bb194a1f69fc5e31cab9610663b9946f77d224bf2904","abstract_canon_sha256":"d6fa506f71024d39c506f13b56f9a98ea4a597d19c8195b029438ebca5ec6ccd"},"schema_version":"1.0"},"canonical_sha256":"0be9822b10ed815c068b52f1bde39ce643fd4f44a0e8a9c50b39d846c198bbc3","source":{"kind":"arxiv","id":"2509.06455","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2509.06455","created_at":"2026-07-05T12:06:36Z"},{"alias_kind":"arxiv_version","alias_value":"2509.06455v1","created_at":"2026-07-05T12:06:36Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2509.06455","created_at":"2026-07-05T12:06:36Z"},{"alias_kind":"pith_short_12","alias_value":"BPUYEKYQ5WAV","created_at":"2026-07-05T12:06:36Z"},{"alias_kind":"pith_short_16","alias_value":"BPUYEKYQ5WAVYBUL","created_at":"2026-07-05T12:06:36Z"},{"alias_kind":"pith_short_8","alias_value":"BPUYEKYQ","created_at":"2026-07-05T12:06:36Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2025:BPUYEKYQ5WAVYBULKLY33Y444Z","target":"record","payload":{"canonical_record":{"source":{"id":"2509.06455","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","primary_cat":"quant-ph","submitted_at":"2025-09-08T09:00:09Z","cross_cats_sorted":[],"title_canon_sha256":"f9adfa9035644cedc8d9bb194a1f69fc5e31cab9610663b9946f77d224bf2904","abstract_canon_sha256":"d6fa506f71024d39c506f13b56f9a98ea4a597d19c8195b029438ebca5ec6ccd"},"schema_version":"1.0"},"canonical_sha256":"0be9822b10ed815c068b52f1bde39ce643fd4f44a0e8a9c50b39d846c198bbc3","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T12:06:36.162743Z","signature_b64":"17PTkq1tP4PTIFV0nXoVP7+k5h1rCDt+T+xKw3qLE1dAj86jK2VtAOW+E9c4zK9g9EOZszLDYEIvOGqzxLvECA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"0be9822b10ed815c068b52f1bde39ce643fd4f44a0e8a9c50b39d846c198bbc3","last_reissued_at":"2026-07-05T12:06:36.162217Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T12:06:36.162217Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2509.06455","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-07-05T12:06:36Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ZFyc21h0Vno866O03sjqiE4n3i3FCjMZho6XfUhVQHcZGMVnkIb0xWr9LMhhbg/hlzAlZLYLu6/QqDq+6JuBCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-19T16:49:05.993071Z"},"content_sha256":"3987a7f055a359e93a0d0678221ec8b315010c30f2aaccb3e1b79ba19cf6847c","schema_version":"1.0","event_id":"sha256:3987a7f055a359e93a0d0678221ec8b315010c30f2aaccb3e1b79ba19cf6847c"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2025:BPUYEKYQ5WAVYBULKLY33Y444Z","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Theoretical and experimental analysis of adaptive quantum computers","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Niels M. P. Neumann","submitted_at":"2025-09-08T09:00:09Z","abstract_excerpt":"Fault-tolerant quantum computations require alternating quantum and classical computations, where the classical computations prove vital in detecting and correcting errors in the quantum computation. Recently, interest in using these classical computations has been growing again, not to correct errors, but to perform computations. Various works have looked into these so-called adaptive quantum algorithms. Few works however have looked in the advantages of adaptive quantum algorithms in realistic scenarios. This work provides the first step in this direction. We introduce a worst-case noise mod"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2509.06455","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/2509.06455/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-05T12:06:36Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"G9TJRBMKSC7b0sNYsU9EE4cU4cqB+XMCTboYX85pjhQLmEV/ansT8WhAqJrOoM/HpA5fY29dXyHgGkTbmvp0Bw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-19T16:49:05.994047Z"},"content_sha256":"a5c0015584248a3ccf0aa397aa8fb867049ca07e8fd3b5210bbb880e7df1354d","schema_version":"1.0","event_id":"sha256:a5c0015584248a3ccf0aa397aa8fb867049ca07e8fd3b5210bbb880e7df1354d"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/BPUYEKYQ5WAVYBULKLY33Y444Z/bundle.json","state_url":"https://pith.science/pith/BPUYEKYQ5WAVYBULKLY33Y444Z/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/BPUYEKYQ5WAVYBULKLY33Y444Z/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-19T16:49:05Z","links":{"resolver":"https://pith.science/pith/BPUYEKYQ5WAVYBULKLY33Y444Z","bundle":"https://pith.science/pith/BPUYEKYQ5WAVYBULKLY33Y444Z/bundle.json","state":"https://pith.science/pith/BPUYEKYQ5WAVYBULKLY33Y444Z/state.json","well_known_bundle":"https://pith.science/.well-known/pith/BPUYEKYQ5WAVYBULKLY33Y444Z/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2025:BPUYEKYQ5WAVYBULKLY33Y444Z","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":"d6fa506f71024d39c506f13b56f9a98ea4a597d19c8195b029438ebca5ec6ccd","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","primary_cat":"quant-ph","submitted_at":"2025-09-08T09:00:09Z","title_canon_sha256":"f9adfa9035644cedc8d9bb194a1f69fc5e31cab9610663b9946f77d224bf2904"},"schema_version":"1.0","source":{"id":"2509.06455","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2509.06455","created_at":"2026-07-05T12:06:36Z"},{"alias_kind":"arxiv_version","alias_value":"2509.06455v1","created_at":"2026-07-05T12:06:36Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2509.06455","created_at":"2026-07-05T12:06:36Z"},{"alias_kind":"pith_short_12","alias_value":"BPUYEKYQ5WAV","created_at":"2026-07-05T12:06:36Z"},{"alias_kind":"pith_short_16","alias_value":"BPUYEKYQ5WAVYBUL","created_at":"2026-07-05T12:06:36Z"},{"alias_kind":"pith_short_8","alias_value":"BPUYEKYQ","created_at":"2026-07-05T12:06:36Z"}],"graph_snapshots":[{"event_id":"sha256:a5c0015584248a3ccf0aa397aa8fb867049ca07e8fd3b5210bbb880e7df1354d","target":"graph","created_at":"2026-07-05T12:06:36Z","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/2509.06455/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Fault-tolerant quantum computations require alternating quantum and classical computations, where the classical computations prove vital in detecting and correcting errors in the quantum computation. Recently, interest in using these classical computations has been growing again, not to correct errors, but to perform computations. Various works have looked into these so-called adaptive quantum algorithms. Few works however have looked in the advantages of adaptive quantum algorithms in realistic scenarios. This work provides the first step in this direction. We introduce a worst-case noise mod","authors_text":"Niels M. P. Neumann","cross_cats":[],"headline":"","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","primary_cat":"quant-ph","submitted_at":"2025-09-08T09:00:09Z","title":"Theoretical and experimental analysis of adaptive quantum computers"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2509.06455","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:3987a7f055a359e93a0d0678221ec8b315010c30f2aaccb3e1b79ba19cf6847c","target":"record","created_at":"2026-07-05T12:06:36Z","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":"d6fa506f71024d39c506f13b56f9a98ea4a597d19c8195b029438ebca5ec6ccd","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","primary_cat":"quant-ph","submitted_at":"2025-09-08T09:00:09Z","title_canon_sha256":"f9adfa9035644cedc8d9bb194a1f69fc5e31cab9610663b9946f77d224bf2904"},"schema_version":"1.0","source":{"id":"2509.06455","kind":"arxiv","version":1}},"canonical_sha256":"0be9822b10ed815c068b52f1bde39ce643fd4f44a0e8a9c50b39d846c198bbc3","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"0be9822b10ed815c068b52f1bde39ce643fd4f44a0e8a9c50b39d846c198bbc3","first_computed_at":"2026-07-05T12:06:36.162217Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T12:06:36.162217Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"17PTkq1tP4PTIFV0nXoVP7+k5h1rCDt+T+xKw3qLE1dAj86jK2VtAOW+E9c4zK9g9EOZszLDYEIvOGqzxLvECA==","signature_status":"signed_v1","signed_at":"2026-07-05T12:06:36.162743Z","signed_message":"canonical_sha256_bytes"},"source_id":"2509.06455","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:3987a7f055a359e93a0d0678221ec8b315010c30f2aaccb3e1b79ba19cf6847c","sha256:a5c0015584248a3ccf0aa397aa8fb867049ca07e8fd3b5210bbb880e7df1354d"],"state_sha256":"a9d64db8a98afa22f72bf323562a97cac82133cc883421197b2928c89f9fe6a7"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Pok4qH49A3zSwHy8eOjG2GuJ10WTOahnOfivFL1ZLWzeuEgL3EX5kRhgSFQh0F9AH2AhmK51+270opyG1/wTCA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-19T16:49:05.999783Z","bundle_sha256":"73e7af8320d8a08a82628c8cb4e0993d100c2859477553c682ee1edf389a5bcc"}}