{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2012:6M4NCZXYQLZKRPXQ5OFYYU6VB7","short_pith_number":"pith:6M4NCZXY","canonical_record":{"source":{"id":"1204.4691","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2012-04-20T18:13:34Z","cross_cats_sorted":["cs.CC"],"title_canon_sha256":"36b09801b27b758f451e3348e62c1aba39784784b8982e94642f6471a306af92","abstract_canon_sha256":"8c9d4c0a31e8ea496c932bcbf17b41e28149bc4d4f0171bf97909e085f810334"},"schema_version":"1.0"},"canonical_sha256":"f338d166f882f2a8bef0eb8b8c53d50fdd265d70790245b8f2030e09e897f931","source":{"kind":"arxiv","id":"1204.4691","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1204.4691","created_at":"2026-05-18T01:14:09Z"},{"alias_kind":"arxiv_version","alias_value":"1204.4691v1","created_at":"2026-05-18T01:14:09Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1204.4691","created_at":"2026-05-18T01:14:09Z"},{"alias_kind":"pith_short_12","alias_value":"6M4NCZXYQLZK","created_at":"2026-05-18T12:26:56Z"},{"alias_kind":"pith_short_16","alias_value":"6M4NCZXYQLZKRPXQ","created_at":"2026-05-18T12:26:56Z"},{"alias_kind":"pith_short_8","alias_value":"6M4NCZXY","created_at":"2026-05-18T12:26:56Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2012:6M4NCZXYQLZKRPXQ5OFYYU6VB7","target":"record","payload":{"canonical_record":{"source":{"id":"1204.4691","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2012-04-20T18:13:34Z","cross_cats_sorted":["cs.CC"],"title_canon_sha256":"36b09801b27b758f451e3348e62c1aba39784784b8982e94642f6471a306af92","abstract_canon_sha256":"8c9d4c0a31e8ea496c932bcbf17b41e28149bc4d4f0171bf97909e085f810334"},"schema_version":"1.0"},"canonical_sha256":"f338d166f882f2a8bef0eb8b8c53d50fdd265d70790245b8f2030e09e897f931","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:14:09.711680Z","signature_b64":"bTqYZqiNjojE/hPUgQnz/4aTzRzIaYRfEQzZBxwBEA+ctzQBtxiJEOD0c7e83BTEs7js/HqE/ytzA31jMVqrAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"f338d166f882f2a8bef0eb8b8c53d50fdd265d70790245b8f2030e09e897f931","last_reissued_at":"2026-05-18T01:14:09.711102Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:14:09.711102Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1204.4691","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-05-18T01:14:09Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"gaeKjCbN46JJuhQNxJSbN299UH+nt4vbVjS3Da/OOkEU9VLrhRXDuJMoRNFySOQxi3Qapj193lZBKbHF3RnKBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T14:57:50.322373Z"},"content_sha256":"d3f5ae1ba35194c5a2b40e304ce734b28f59355c1dc2f752b493a3a84996e7d6","schema_version":"1.0","event_id":"sha256:d3f5ae1ba35194c5a2b40e304ce734b28f59355c1dc2f752b493a3a84996e7d6"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2012:6M4NCZXYQLZKRPXQ5OFYYU6VB7","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Reconstructing Strings from Substrings with Quantum Queries","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CC"],"primary_cat":"quant-ph","authors_text":"Fran\\c{c}ois Le Gall, Harumichi Nishimura, Junichi Teruyama, Kazuo Iwama, Richard Cleve, Seiichiro Tani, Shigeru Yamashita","submitted_at":"2012-04-20T18:13:34Z","abstract_excerpt":"This paper investigates the number of quantum queries made to solve the problem of reconstructing an unknown string from its substrings in a certain query model. More concretely, the goal of the problem is to identify an unknown string $S$ by making queries of the following form: \"Is $s$ a substring of $S$?\", where $s$ is a query string over the given alphabet. The number of queries required to identify the string $S$ is the query complexity of this problem.\n  First we show a quantum algorithm that exactly identifies the string $S$ with at most $3/4N + o(N)$ queries, where $N$ is the length of"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1204.4691","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":""},"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-05-18T01:14:09Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"pP1dyU1S2z/NFhv+kuKV6CRmKFqcAGrT6ZxMDs2lBaRSGiCxAJ6VLG6H2x3LC1Sk0lLPyg54MOZLJl6qIWrOCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T14:57:50.323064Z"},"content_sha256":"9ca96bc43b24393d8f5ed6bcadafa67b64e02821262974617de5abdcd21cc6cb","schema_version":"1.0","event_id":"sha256:9ca96bc43b24393d8f5ed6bcadafa67b64e02821262974617de5abdcd21cc6cb"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/6M4NCZXYQLZKRPXQ5OFYYU6VB7/bundle.json","state_url":"https://pith.science/pith/6M4NCZXYQLZKRPXQ5OFYYU6VB7/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/6M4NCZXYQLZKRPXQ5OFYYU6VB7/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-05-26T14:57:50Z","links":{"resolver":"https://pith.science/pith/6M4NCZXYQLZKRPXQ5OFYYU6VB7","bundle":"https://pith.science/pith/6M4NCZXYQLZKRPXQ5OFYYU6VB7/bundle.json","state":"https://pith.science/pith/6M4NCZXYQLZKRPXQ5OFYYU6VB7/state.json","well_known_bundle":"https://pith.science/.well-known/pith/6M4NCZXYQLZKRPXQ5OFYYU6VB7/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2012:6M4NCZXYQLZKRPXQ5OFYYU6VB7","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":"8c9d4c0a31e8ea496c932bcbf17b41e28149bc4d4f0171bf97909e085f810334","cross_cats_sorted":["cs.CC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2012-04-20T18:13:34Z","title_canon_sha256":"36b09801b27b758f451e3348e62c1aba39784784b8982e94642f6471a306af92"},"schema_version":"1.0","source":{"id":"1204.4691","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1204.4691","created_at":"2026-05-18T01:14:09Z"},{"alias_kind":"arxiv_version","alias_value":"1204.4691v1","created_at":"2026-05-18T01:14:09Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1204.4691","created_at":"2026-05-18T01:14:09Z"},{"alias_kind":"pith_short_12","alias_value":"6M4NCZXYQLZK","created_at":"2026-05-18T12:26:56Z"},{"alias_kind":"pith_short_16","alias_value":"6M4NCZXYQLZKRPXQ","created_at":"2026-05-18T12:26:56Z"},{"alias_kind":"pith_short_8","alias_value":"6M4NCZXY","created_at":"2026-05-18T12:26:56Z"}],"graph_snapshots":[{"event_id":"sha256:9ca96bc43b24393d8f5ed6bcadafa67b64e02821262974617de5abdcd21cc6cb","target":"graph","created_at":"2026-05-18T01:14:09Z","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"},"paper":{"abstract_excerpt":"This paper investigates the number of quantum queries made to solve the problem of reconstructing an unknown string from its substrings in a certain query model. More concretely, the goal of the problem is to identify an unknown string $S$ by making queries of the following form: \"Is $s$ a substring of $S$?\", where $s$ is a query string over the given alphabet. The number of queries required to identify the string $S$ is the query complexity of this problem.\n  First we show a quantum algorithm that exactly identifies the string $S$ with at most $3/4N + o(N)$ queries, where $N$ is the length of","authors_text":"Fran\\c{c}ois Le Gall, Harumichi Nishimura, Junichi Teruyama, Kazuo Iwama, Richard Cleve, Seiichiro Tani, Shigeru Yamashita","cross_cats":["cs.CC"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2012-04-20T18:13:34Z","title":"Reconstructing Strings from Substrings with Quantum Queries"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1204.4691","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:d3f5ae1ba35194c5a2b40e304ce734b28f59355c1dc2f752b493a3a84996e7d6","target":"record","created_at":"2026-05-18T01:14:09Z","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":"8c9d4c0a31e8ea496c932bcbf17b41e28149bc4d4f0171bf97909e085f810334","cross_cats_sorted":["cs.CC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2012-04-20T18:13:34Z","title_canon_sha256":"36b09801b27b758f451e3348e62c1aba39784784b8982e94642f6471a306af92"},"schema_version":"1.0","source":{"id":"1204.4691","kind":"arxiv","version":1}},"canonical_sha256":"f338d166f882f2a8bef0eb8b8c53d50fdd265d70790245b8f2030e09e897f931","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"f338d166f882f2a8bef0eb8b8c53d50fdd265d70790245b8f2030e09e897f931","first_computed_at":"2026-05-18T01:14:09.711102Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:14:09.711102Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"bTqYZqiNjojE/hPUgQnz/4aTzRzIaYRfEQzZBxwBEA+ctzQBtxiJEOD0c7e83BTEs7js/HqE/ytzA31jMVqrAQ==","signature_status":"signed_v1","signed_at":"2026-05-18T01:14:09.711680Z","signed_message":"canonical_sha256_bytes"},"source_id":"1204.4691","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:d3f5ae1ba35194c5a2b40e304ce734b28f59355c1dc2f752b493a3a84996e7d6","sha256:9ca96bc43b24393d8f5ed6bcadafa67b64e02821262974617de5abdcd21cc6cb"],"state_sha256":"04c1fe4a7d4394b805c2465ecb5f0dd717c6f53e900b77993d5cecbaa236eda7"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"7awCnQrbeZ8ui3nkMuvKRqYm5WhSx9VQmu+Ui/LYgMggGQnIO7o1F7Zso3x6dLyUdfs0P0BNPbnwFh3TCphiDg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-26T14:57:50.326683Z","bundle_sha256":"7ecdaf361ddf129a8dd0c5231b1cbc530a00f34dfeebf68d82f72403d8c4b67c"}}