{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2024:SIW7XM5AEUC7FM3ARA5VBN2Z77","short_pith_number":"pith:SIW7XM5A","canonical_record":{"source":{"id":"2410.13927","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"quant-ph","submitted_at":"2024-10-17T17:45:50Z","cross_cats_sorted":[],"title_canon_sha256":"d72556c6bd6f29365e857958da863d96de537c8e3f14ddc1dc510e4ee064e2c4","abstract_canon_sha256":"a115b272b9c5def2f9d31806fca9abbf8e26f4db5113cdf648a1937f6c06c63d"},"schema_version":"1.0"},"canonical_sha256":"922dfbb3a02505f2b360883b50b759fff943a686145d2f5eb3ea9f232d53fcf3","source":{"kind":"arxiv","id":"2410.13927","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2410.13927","created_at":"2026-07-05T09:22:24Z"},{"alias_kind":"arxiv_version","alias_value":"2410.13927v1","created_at":"2026-07-05T09:22:24Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2410.13927","created_at":"2026-07-05T09:22:24Z"},{"alias_kind":"pith_short_12","alias_value":"SIW7XM5AEUC7","created_at":"2026-07-05T09:22:24Z"},{"alias_kind":"pith_short_16","alias_value":"SIW7XM5AEUC7FM3A","created_at":"2026-07-05T09:22:24Z"},{"alias_kind":"pith_short_8","alias_value":"SIW7XM5A","created_at":"2026-07-05T09:22:24Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2024:SIW7XM5AEUC7FM3ARA5VBN2Z77","target":"record","payload":{"canonical_record":{"source":{"id":"2410.13927","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"quant-ph","submitted_at":"2024-10-17T17:45:50Z","cross_cats_sorted":[],"title_canon_sha256":"d72556c6bd6f29365e857958da863d96de537c8e3f14ddc1dc510e4ee064e2c4","abstract_canon_sha256":"a115b272b9c5def2f9d31806fca9abbf8e26f4db5113cdf648a1937f6c06c63d"},"schema_version":"1.0"},"canonical_sha256":"922dfbb3a02505f2b360883b50b759fff943a686145d2f5eb3ea9f232d53fcf3","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T09:22:24.706877Z","signature_b64":"ANXneaAcFKVivREBQkfKPu2zEIqCdMEBH7JcaNx2Qebx+mSQAXhxXUig05m+vGUUUr6O/6ZbY3A/VvTcGeVdBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"922dfbb3a02505f2b360883b50b759fff943a686145d2f5eb3ea9f232d53fcf3","last_reissued_at":"2026-07-05T09:22:24.706376Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T09:22:24.706376Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2410.13927","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-05T09:22:24Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"vMvzh3zyNN96Adl/XM9Fj7AuIZhjD5vJcvD19jCe9AyEFR0OPgW2NaZe6df5aqQsi1spfkYLv58OpRLaEyxMDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-16T14:42:50.550542Z"},"content_sha256":"cfaced9c3f966504af49f34db18b49761b5b185156bd7800d3affddf87b33e7c","schema_version":"1.0","event_id":"sha256:cfaced9c3f966504af49f34db18b49761b5b185156bd7800d3affddf87b33e7c"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2024:SIW7XM5AEUC7FM3ARA5VBN2Z77","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Exploiting recursive structures for the design of novel quantum primitives","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Gun Suer, Ning Bao","submitted_at":"2024-10-17T17:45:50Z","abstract_excerpt":"The advent of fault-tolerant quantum computers marks a significant milestone, yet the development of practical quantum algorithms remains a critical challenge. Effective quantum algorithms are essential for leveraging the power of quantum computers, and their design is often non-intuitive. This paper addresses the issue of generating novel quantum primitives by focusing on recursive circuits. We explore the recursive circuit structures prevalent in existing quantum algorithms and demonstrate how these structures can be exploited to design new, potentially advantageous quantum algorithms. We ba"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2410.13927","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/2410.13927/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-05T09:22:24Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ql1wWmvVg7GAjJ849ib4QJESQiNrF4eVVn+CWwCUeYjXTEelcQMzeUb0CMDBi773ha8PyQDcuZBjCUl+rhzjCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-16T14:42:50.551549Z"},"content_sha256":"40da813c5ca648e1ce75687d549491bbe3a81d8f864c94adc4643be88a85439e","schema_version":"1.0","event_id":"sha256:40da813c5ca648e1ce75687d549491bbe3a81d8f864c94adc4643be88a85439e"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/SIW7XM5AEUC7FM3ARA5VBN2Z77/bundle.json","state_url":"https://pith.science/pith/SIW7XM5AEUC7FM3ARA5VBN2Z77/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/SIW7XM5AEUC7FM3ARA5VBN2Z77/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-16T14:42:50Z","links":{"resolver":"https://pith.science/pith/SIW7XM5AEUC7FM3ARA5VBN2Z77","bundle":"https://pith.science/pith/SIW7XM5AEUC7FM3ARA5VBN2Z77/bundle.json","state":"https://pith.science/pith/SIW7XM5AEUC7FM3ARA5VBN2Z77/state.json","well_known_bundle":"https://pith.science/.well-known/pith/SIW7XM5AEUC7FM3ARA5VBN2Z77/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2024:SIW7XM5AEUC7FM3ARA5VBN2Z77","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":"a115b272b9c5def2f9d31806fca9abbf8e26f4db5113cdf648a1937f6c06c63d","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"quant-ph","submitted_at":"2024-10-17T17:45:50Z","title_canon_sha256":"d72556c6bd6f29365e857958da863d96de537c8e3f14ddc1dc510e4ee064e2c4"},"schema_version":"1.0","source":{"id":"2410.13927","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2410.13927","created_at":"2026-07-05T09:22:24Z"},{"alias_kind":"arxiv_version","alias_value":"2410.13927v1","created_at":"2026-07-05T09:22:24Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2410.13927","created_at":"2026-07-05T09:22:24Z"},{"alias_kind":"pith_short_12","alias_value":"SIW7XM5AEUC7","created_at":"2026-07-05T09:22:24Z"},{"alias_kind":"pith_short_16","alias_value":"SIW7XM5AEUC7FM3A","created_at":"2026-07-05T09:22:24Z"},{"alias_kind":"pith_short_8","alias_value":"SIW7XM5A","created_at":"2026-07-05T09:22:24Z"}],"graph_snapshots":[{"event_id":"sha256:40da813c5ca648e1ce75687d549491bbe3a81d8f864c94adc4643be88a85439e","target":"graph","created_at":"2026-07-05T09:22:24Z","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/2410.13927/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"The advent of fault-tolerant quantum computers marks a significant milestone, yet the development of practical quantum algorithms remains a critical challenge. Effective quantum algorithms are essential for leveraging the power of quantum computers, and their design is often non-intuitive. This paper addresses the issue of generating novel quantum primitives by focusing on recursive circuits. We explore the recursive circuit structures prevalent in existing quantum algorithms and demonstrate how these structures can be exploited to design new, potentially advantageous quantum algorithms. We ba","authors_text":"Gun Suer, Ning Bao","cross_cats":[],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"quant-ph","submitted_at":"2024-10-17T17:45:50Z","title":"Exploiting recursive structures for the design of novel quantum primitives"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2410.13927","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:cfaced9c3f966504af49f34db18b49761b5b185156bd7800d3affddf87b33e7c","target":"record","created_at":"2026-07-05T09:22:24Z","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":"a115b272b9c5def2f9d31806fca9abbf8e26f4db5113cdf648a1937f6c06c63d","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"quant-ph","submitted_at":"2024-10-17T17:45:50Z","title_canon_sha256":"d72556c6bd6f29365e857958da863d96de537c8e3f14ddc1dc510e4ee064e2c4"},"schema_version":"1.0","source":{"id":"2410.13927","kind":"arxiv","version":1}},"canonical_sha256":"922dfbb3a02505f2b360883b50b759fff943a686145d2f5eb3ea9f232d53fcf3","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"922dfbb3a02505f2b360883b50b759fff943a686145d2f5eb3ea9f232d53fcf3","first_computed_at":"2026-07-05T09:22:24.706376Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T09:22:24.706376Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"ANXneaAcFKVivREBQkfKPu2zEIqCdMEBH7JcaNx2Qebx+mSQAXhxXUig05m+vGUUUr6O/6ZbY3A/VvTcGeVdBg==","signature_status":"signed_v1","signed_at":"2026-07-05T09:22:24.706877Z","signed_message":"canonical_sha256_bytes"},"source_id":"2410.13927","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:cfaced9c3f966504af49f34db18b49761b5b185156bd7800d3affddf87b33e7c","sha256:40da813c5ca648e1ce75687d549491bbe3a81d8f864c94adc4643be88a85439e"],"state_sha256":"38a701f16bb368d6f88c705ab5cd506018dbcb8a00e716a5a8e39589a1cdc76d"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"xtNtWCle6ecUXNpcTPgMAvL2/tpJItYHElfZ5fk1Nl/NyZuogLiV9YVEGxzKnOly4cZ4uHG2/MK2kGq5SniXDw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-16T14:42:50.559632Z","bundle_sha256":"738846203e871c3a4822a21f8ae2e7bb950158c8d2cfa67300ce4159e007c66a"}}