{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2026:WHREGSYHKUBFGMV2WEHVKOVXQM","short_pith_number":"pith:WHREGSYH","canonical_record":{"source":{"id":"2606.19035","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"quant-ph","submitted_at":"2026-06-17T13:05:47Z","cross_cats_sorted":[],"title_canon_sha256":"b7ffc26e31cc33fd281215a3c00420f407459f8d0683c981fc2ddc2dd5a81e0a","abstract_canon_sha256":"47fd94fec626eba03b06252cd5458cc873360693f490053a06955de7a58ede29"},"schema_version":"1.0"},"canonical_sha256":"b1e2434b0755025332bab10f553ab7832b73a159b589165217ef8d0014e2e561","source":{"kind":"arxiv","id":"2606.19035","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2606.19035","created_at":"2026-06-19T16:12:58Z"},{"alias_kind":"arxiv_version","alias_value":"2606.19035v2","created_at":"2026-06-19T16:12:58Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2606.19035","created_at":"2026-06-19T16:12:58Z"},{"alias_kind":"pith_short_12","alias_value":"WHREGSYHKUBF","created_at":"2026-06-19T16:12:58Z"},{"alias_kind":"pith_short_16","alias_value":"WHREGSYHKUBFGMV2","created_at":"2026-06-19T16:12:58Z"},{"alias_kind":"pith_short_8","alias_value":"WHREGSYH","created_at":"2026-06-19T16:12:58Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2026:WHREGSYHKUBFGMV2WEHVKOVXQM","target":"record","payload":{"canonical_record":{"source":{"id":"2606.19035","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"quant-ph","submitted_at":"2026-06-17T13:05:47Z","cross_cats_sorted":[],"title_canon_sha256":"b7ffc26e31cc33fd281215a3c00420f407459f8d0683c981fc2ddc2dd5a81e0a","abstract_canon_sha256":"47fd94fec626eba03b06252cd5458cc873360693f490053a06955de7a58ede29"},"schema_version":"1.0"},"canonical_sha256":"b1e2434b0755025332bab10f553ab7832b73a159b589165217ef8d0014e2e561","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-06-19T16:12:58.473688Z","signature_b64":"/fLsNEA/UoDiMpGTPesPi41GmPyOVLOUatme56mbwooWPQUmfD9/tSWwlnbHnJoENaRMds8pBjTxzDZyFTE/BQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"b1e2434b0755025332bab10f553ab7832b73a159b589165217ef8d0014e2e561","last_reissued_at":"2026-06-19T16:12:58.473251Z","signature_status":"signed_v1","first_computed_at":"2026-06-19T16:12:58.473251Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2606.19035","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-06-19T16:12:58Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"bsnQaz23thuH7l2gO13IvQiB5HnKmzjoSt90pxw3L/p9hrm3U7y0GHhcdL8J0H7OTyQH+dTWAXhfyLsmq2oYAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-28T20:35:21.380775Z"},"content_sha256":"648838d3df9e2ddb7f2a5da1b8ae1ae37a7de5cd4660a9b420a0df2b2665d919","schema_version":"1.0","event_id":"sha256:648838d3df9e2ddb7f2a5da1b8ae1ae37a7de5cd4660a9b420a0df2b2665d919"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2026:WHREGSYHKUBFGMV2WEHVKOVXQM","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Scalable quantum circuit knitting using a weak-coupling approximation","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Daniel Gunlycke, John P. T. Stenger, Nikos Chrisochoides","submitted_at":"2026-06-17T13:05:47Z","abstract_excerpt":"We present a method for performing distributed quantum computing with controlled approximations. Exact distributed quantum computing requires exponential classical information to reconstruct the quantum process. However, we show how the classical cost is reduced to polynomial if the quantum procedure can be partitioned between a qubit that is weakly coupled the other qubits. We demonstrate our method for a layered circuit based on the circuits used for the quantum approximate optimization algorithm."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2606.19035","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/2606.19035/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-19T16:12:58Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"OWNysdKVTzDjXOr2q0e081Ur/0edPhEqZudQT2Pt9MryIiz/ha1/t5xn7PjJb8gZVlVPlaEBMh7+KxARbTB3Cg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-28T20:35:21.381139Z"},"content_sha256":"4861e4eff2d9f0a2ae50f741ce9f3079d0e69409420d0217106769530479df14","schema_version":"1.0","event_id":"sha256:4861e4eff2d9f0a2ae50f741ce9f3079d0e69409420d0217106769530479df14"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/WHREGSYHKUBFGMV2WEHVKOVXQM/bundle.json","state_url":"https://pith.science/pith/WHREGSYHKUBFGMV2WEHVKOVXQM/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/WHREGSYHKUBFGMV2WEHVKOVXQM/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-06-28T20:35:21Z","links":{"resolver":"https://pith.science/pith/WHREGSYHKUBFGMV2WEHVKOVXQM","bundle":"https://pith.science/pith/WHREGSYHKUBFGMV2WEHVKOVXQM/bundle.json","state":"https://pith.science/pith/WHREGSYHKUBFGMV2WEHVKOVXQM/state.json","well_known_bundle":"https://pith.science/.well-known/pith/WHREGSYHKUBFGMV2WEHVKOVXQM/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2026:WHREGSYHKUBFGMV2WEHVKOVXQM","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":"47fd94fec626eba03b06252cd5458cc873360693f490053a06955de7a58ede29","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"quant-ph","submitted_at":"2026-06-17T13:05:47Z","title_canon_sha256":"b7ffc26e31cc33fd281215a3c00420f407459f8d0683c981fc2ddc2dd5a81e0a"},"schema_version":"1.0","source":{"id":"2606.19035","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2606.19035","created_at":"2026-06-19T16:12:58Z"},{"alias_kind":"arxiv_version","alias_value":"2606.19035v2","created_at":"2026-06-19T16:12:58Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2606.19035","created_at":"2026-06-19T16:12:58Z"},{"alias_kind":"pith_short_12","alias_value":"WHREGSYHKUBF","created_at":"2026-06-19T16:12:58Z"},{"alias_kind":"pith_short_16","alias_value":"WHREGSYHKUBFGMV2","created_at":"2026-06-19T16:12:58Z"},{"alias_kind":"pith_short_8","alias_value":"WHREGSYH","created_at":"2026-06-19T16:12:58Z"}],"graph_snapshots":[{"event_id":"sha256:4861e4eff2d9f0a2ae50f741ce9f3079d0e69409420d0217106769530479df14","target":"graph","created_at":"2026-06-19T16:12:58Z","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.19035/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"We present a method for performing distributed quantum computing with controlled approximations. Exact distributed quantum computing requires exponential classical information to reconstruct the quantum process. However, we show how the classical cost is reduced to polynomial if the quantum procedure can be partitioned between a qubit that is weakly coupled the other qubits. We demonstrate our method for a layered circuit based on the circuits used for the quantum approximate optimization algorithm.","authors_text":"Daniel Gunlycke, John P. T. Stenger, Nikos Chrisochoides","cross_cats":[],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"quant-ph","submitted_at":"2026-06-17T13:05:47Z","title":"Scalable quantum circuit knitting using a weak-coupling approximation"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2606.19035","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:648838d3df9e2ddb7f2a5da1b8ae1ae37a7de5cd4660a9b420a0df2b2665d919","target":"record","created_at":"2026-06-19T16:12:58Z","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":"47fd94fec626eba03b06252cd5458cc873360693f490053a06955de7a58ede29","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"quant-ph","submitted_at":"2026-06-17T13:05:47Z","title_canon_sha256":"b7ffc26e31cc33fd281215a3c00420f407459f8d0683c981fc2ddc2dd5a81e0a"},"schema_version":"1.0","source":{"id":"2606.19035","kind":"arxiv","version":2}},"canonical_sha256":"b1e2434b0755025332bab10f553ab7832b73a159b589165217ef8d0014e2e561","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"b1e2434b0755025332bab10f553ab7832b73a159b589165217ef8d0014e2e561","first_computed_at":"2026-06-19T16:12:58.473251Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-06-19T16:12:58.473251Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"/fLsNEA/UoDiMpGTPesPi41GmPyOVLOUatme56mbwooWPQUmfD9/tSWwlnbHnJoENaRMds8pBjTxzDZyFTE/BQ==","signature_status":"signed_v1","signed_at":"2026-06-19T16:12:58.473688Z","signed_message":"canonical_sha256_bytes"},"source_id":"2606.19035","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:648838d3df9e2ddb7f2a5da1b8ae1ae37a7de5cd4660a9b420a0df2b2665d919","sha256:4861e4eff2d9f0a2ae50f741ce9f3079d0e69409420d0217106769530479df14"],"state_sha256":"0daffd813c6b8c3ace5e3113bd1ca3604b3f34c839b512129e1ee742bbe309f6"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"sh3MvDxWYJGRLMOoaf5JqaAJ6lBwi2DxDf2DMYn5cZPnpXQoAky4MIwDP4AhESN3hbPWAJ8XTN8mRRRn+wbqDg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-28T20:35:21.383006Z","bundle_sha256":"cf2730e03d5aca9d08a4484a9597404e6805d7f39898855fc685e9a78474b485"}}