{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2012:6M4NCZXYQLZKRPXQ5OFYYU6VB7","short_pith_number":"pith:6M4NCZXY","schema_version":"1.0","canonical_sha256":"f338d166f882f2a8bef0eb8b8c53d50fdd265d70790245b8f2030e09e897f931","source":{"kind":"arxiv","id":"1204.4691","version":1},"attestation_state":"computed","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"},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"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"},"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"},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1204.4691","created_at":"2026-05-18T01:14:09.711200+00:00"},{"alias_kind":"arxiv_version","alias_value":"1204.4691v1","created_at":"2026-05-18T01:14:09.711200+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1204.4691","created_at":"2026-05-18T01:14:09.711200+00:00"},{"alias_kind":"pith_short_12","alias_value":"6M4NCZXYQLZK","created_at":"2026-05-18T12:26:56.085431+00:00"},{"alias_kind":"pith_short_16","alias_value":"6M4NCZXYQLZKRPXQ","created_at":"2026-05-18T12:26:56.085431+00:00"},{"alias_kind":"pith_short_8","alias_value":"6M4NCZXY","created_at":"2026-05-18T12:26:56.085431+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/6M4NCZXYQLZKRPXQ5OFYYU6VB7","json":"https://pith.science/pith/6M4NCZXYQLZKRPXQ5OFYYU6VB7.json","graph_json":"https://pith.science/api/pith-number/6M4NCZXYQLZKRPXQ5OFYYU6VB7/graph.json","events_json":"https://pith.science/api/pith-number/6M4NCZXYQLZKRPXQ5OFYYU6VB7/events.json","paper":"https://pith.science/paper/6M4NCZXY"},"agent_actions":{"view_html":"https://pith.science/pith/6M4NCZXYQLZKRPXQ5OFYYU6VB7","download_json":"https://pith.science/pith/6M4NCZXYQLZKRPXQ5OFYYU6VB7.json","view_paper":"https://pith.science/paper/6M4NCZXY","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1204.4691&json=true","fetch_graph":"https://pith.science/api/pith-number/6M4NCZXYQLZKRPXQ5OFYYU6VB7/graph.json","fetch_events":"https://pith.science/api/pith-number/6M4NCZXYQLZKRPXQ5OFYYU6VB7/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/6M4NCZXYQLZKRPXQ5OFYYU6VB7/action/timestamp_anchor","attest_storage":"https://pith.science/pith/6M4NCZXYQLZKRPXQ5OFYYU6VB7/action/storage_attestation","attest_author":"https://pith.science/pith/6M4NCZXYQLZKRPXQ5OFYYU6VB7/action/author_attestation","sign_citation":"https://pith.science/pith/6M4NCZXYQLZKRPXQ5OFYYU6VB7/action/citation_signature","submit_replication":"https://pith.science/pith/6M4NCZXYQLZKRPXQ5OFYYU6VB7/action/replication_record"}},"created_at":"2026-05-18T01:14:09.711200+00:00","updated_at":"2026-05-18T01:14:09.711200+00:00"}