{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2024:VPIKMFYOZVTVLAEVNH6QF32HOI","short_pith_number":"pith:VPIKMFYO","canonical_record":{"source":{"id":"2408.10054","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2024-08-19T14:48:41Z","cross_cats_sorted":["cs.AR","cs.PL"],"title_canon_sha256":"476c66a971819b45f3655405610ee2d5254f6ffab4e066d408e51ecd9a47a257","abstract_canon_sha256":"e50174e72fbf0fff5d60c23dd6cb65b187c1b2bf47c46e176e660be6c182510b"},"schema_version":"1.0"},"canonical_sha256":"abd0a6170ecd6755809569fd02ef47721c00187ce37214ef3536b811d6a8f25f","source":{"kind":"arxiv","id":"2408.10054","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2408.10054","created_at":"2026-07-05T11:21:35Z"},{"alias_kind":"arxiv_version","alias_value":"2408.10054v3","created_at":"2026-07-05T11:21:35Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2408.10054","created_at":"2026-07-05T11:21:35Z"},{"alias_kind":"pith_short_12","alias_value":"VPIKMFYOZVTV","created_at":"2026-07-05T11:21:35Z"},{"alias_kind":"pith_short_16","alias_value":"VPIKMFYOZVTVLAEV","created_at":"2026-07-05T11:21:35Z"},{"alias_kind":"pith_short_8","alias_value":"VPIKMFYO","created_at":"2026-07-05T11:21:35Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2024:VPIKMFYOZVTVLAEVNH6QF32HOI","target":"record","payload":{"canonical_record":{"source":{"id":"2408.10054","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2024-08-19T14:48:41Z","cross_cats_sorted":["cs.AR","cs.PL"],"title_canon_sha256":"476c66a971819b45f3655405610ee2d5254f6ffab4e066d408e51ecd9a47a257","abstract_canon_sha256":"e50174e72fbf0fff5d60c23dd6cb65b187c1b2bf47c46e176e660be6c182510b"},"schema_version":"1.0"},"canonical_sha256":"abd0a6170ecd6755809569fd02ef47721c00187ce37214ef3536b811d6a8f25f","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T11:21:35.013388Z","signature_b64":"pIlBAvyIHl8hSZxpF+zB7KCouOEw7Z3qX+R4GKf4NR6YjsX4MgIk4pC9N/PLd8y7tb4Z62Iz1CMcfXX1C/FfAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"abd0a6170ecd6755809569fd02ef47721c00187ce37214ef3536b811d6a8f25f","last_reissued_at":"2026-07-05T11:21:35.012836Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T11:21:35.012836Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2408.10054","source_version":3,"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-05T11:21:35Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"XrRm11vd7X9Wj9Dj0a35aokv+EstXjq2HjnN7RvUg5Y1SLW70jC1YTlEEdKw1dDtK7QeSQbYBUTYQIVsAFy3DQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-11T04:50:02.149496Z"},"content_sha256":"8d62f4ebfb25b6a5c36000bf618dc2fcae53be80a058527e1cee8b4dae5d3bcf","schema_version":"1.0","event_id":"sha256:8d62f4ebfb25b6a5c36000bf618dc2fcae53be80a058527e1cee8b4dae5d3bcf"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2024:VPIKMFYOZVTVLAEVNH6QF32HOI","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Quantum Register Machine: Efficient Implementation of Quantum Recursive Programs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AR","cs.PL"],"primary_cat":"quant-ph","authors_text":"Mingsheng Ying, Zhicheng Zhang","submitted_at":"2024-08-19T14:48:41Z","abstract_excerpt":"Quantum recursive programming has been recently introduced for describing sophisticated and complicated quantum algorithms in a compact and elegant way. However, implementation of quantum recursion involves intricate interplay between quantum control flow and recursive procedure calls. In this paper, we aim at resolving this fundamental challenge and develop a series of techniques to efficiently implement quantum recursive programs. Our main contributions include:\n  1. We propose a notion of quantum register machine, the first quantum architecture (including an instruction set) that provides i"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2408.10054","kind":"arxiv","version":3},"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/2408.10054/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-05T11:21:35Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"W42xNGD2zWZzT6A/wbl+wBOpsW/5S/Ff9TLAlyaS+8A73aSWySvLvypEeM7d7IsTk7rLnkgVea/lfmG3m2SqDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-11T04:50:02.150001Z"},"content_sha256":"0f5eafca7ce9480b48bb8e5c84422d6a6b13b32a91d3e8dc2ac57a363b21523e","schema_version":"1.0","event_id":"sha256:0f5eafca7ce9480b48bb8e5c84422d6a6b13b32a91d3e8dc2ac57a363b21523e"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/VPIKMFYOZVTVLAEVNH6QF32HOI/bundle.json","state_url":"https://pith.science/pith/VPIKMFYOZVTVLAEVNH6QF32HOI/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/VPIKMFYOZVTVLAEVNH6QF32HOI/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-11T04:50:02Z","links":{"resolver":"https://pith.science/pith/VPIKMFYOZVTVLAEVNH6QF32HOI","bundle":"https://pith.science/pith/VPIKMFYOZVTVLAEVNH6QF32HOI/bundle.json","state":"https://pith.science/pith/VPIKMFYOZVTVLAEVNH6QF32HOI/state.json","well_known_bundle":"https://pith.science/.well-known/pith/VPIKMFYOZVTVLAEVNH6QF32HOI/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2024:VPIKMFYOZVTVLAEVNH6QF32HOI","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":"e50174e72fbf0fff5d60c23dd6cb65b187c1b2bf47c46e176e660be6c182510b","cross_cats_sorted":["cs.AR","cs.PL"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2024-08-19T14:48:41Z","title_canon_sha256":"476c66a971819b45f3655405610ee2d5254f6ffab4e066d408e51ecd9a47a257"},"schema_version":"1.0","source":{"id":"2408.10054","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2408.10054","created_at":"2026-07-05T11:21:35Z"},{"alias_kind":"arxiv_version","alias_value":"2408.10054v3","created_at":"2026-07-05T11:21:35Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2408.10054","created_at":"2026-07-05T11:21:35Z"},{"alias_kind":"pith_short_12","alias_value":"VPIKMFYOZVTV","created_at":"2026-07-05T11:21:35Z"},{"alias_kind":"pith_short_16","alias_value":"VPIKMFYOZVTVLAEV","created_at":"2026-07-05T11:21:35Z"},{"alias_kind":"pith_short_8","alias_value":"VPIKMFYO","created_at":"2026-07-05T11:21:35Z"}],"graph_snapshots":[{"event_id":"sha256:0f5eafca7ce9480b48bb8e5c84422d6a6b13b32a91d3e8dc2ac57a363b21523e","target":"graph","created_at":"2026-07-05T11:21:35Z","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/2408.10054/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Quantum recursive programming has been recently introduced for describing sophisticated and complicated quantum algorithms in a compact and elegant way. However, implementation of quantum recursion involves intricate interplay between quantum control flow and recursive procedure calls. In this paper, we aim at resolving this fundamental challenge and develop a series of techniques to efficiently implement quantum recursive programs. Our main contributions include:\n  1. We propose a notion of quantum register machine, the first quantum architecture (including an instruction set) that provides i","authors_text":"Mingsheng Ying, Zhicheng Zhang","cross_cats":["cs.AR","cs.PL"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2024-08-19T14:48:41Z","title":"Quantum Register Machine: Efficient Implementation of Quantum Recursive Programs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2408.10054","kind":"arxiv","version":3},"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:8d62f4ebfb25b6a5c36000bf618dc2fcae53be80a058527e1cee8b4dae5d3bcf","target":"record","created_at":"2026-07-05T11:21:35Z","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":"e50174e72fbf0fff5d60c23dd6cb65b187c1b2bf47c46e176e660be6c182510b","cross_cats_sorted":["cs.AR","cs.PL"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2024-08-19T14:48:41Z","title_canon_sha256":"476c66a971819b45f3655405610ee2d5254f6ffab4e066d408e51ecd9a47a257"},"schema_version":"1.0","source":{"id":"2408.10054","kind":"arxiv","version":3}},"canonical_sha256":"abd0a6170ecd6755809569fd02ef47721c00187ce37214ef3536b811d6a8f25f","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"abd0a6170ecd6755809569fd02ef47721c00187ce37214ef3536b811d6a8f25f","first_computed_at":"2026-07-05T11:21:35.012836Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T11:21:35.012836Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"pIlBAvyIHl8hSZxpF+zB7KCouOEw7Z3qX+R4GKf4NR6YjsX4MgIk4pC9N/PLd8y7tb4Z62Iz1CMcfXX1C/FfAg==","signature_status":"signed_v1","signed_at":"2026-07-05T11:21:35.013388Z","signed_message":"canonical_sha256_bytes"},"source_id":"2408.10054","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:8d62f4ebfb25b6a5c36000bf618dc2fcae53be80a058527e1cee8b4dae5d3bcf","sha256:0f5eafca7ce9480b48bb8e5c84422d6a6b13b32a91d3e8dc2ac57a363b21523e"],"state_sha256":"4418239092f4a1228309aeac95db07dbce228d348e9a0bccf779c084fc731b6e"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"BnsLuDM2s10CP1gEZGG152xDpBYlM0e2Ev/xC2oUrKw1FRoH/2ypEdTyYTOf24ZA+EOEhKOaZ5FAf+TeL4V0Aw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-11T04:50:02.153692Z","bundle_sha256":"0d1f0839dca12b845a66f51bb3d54d6e46435d14cd108c173f10b2332ff007ee"}}