{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2023:RKETI7BAI5UBKFW5EWGWQYQO34","short_pith_number":"pith:RKETI7BA","schema_version":"1.0","canonical_sha256":"8a89347c2047681516dd258d68620edf16604ecb3190d3ebd9e3079a1c9c60a2","source":{"kind":"arxiv","id":"2310.00966","version":1},"attestation_state":"computed","paper":{"title":"A sublinear time quantum algorithm for longest common substring problem between run-length encoded strings","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Han-Hsuan Lin, Tzu-Ching Lee","submitted_at":"2023-10-02T08:14:34Z","abstract_excerpt":"We give a sublinear quantum algorithm for the longest common substring (LCS) problem on the run-length encoded (RLE) inputs, under the assumption that the prefix-sums of the runs are given. Our algorithm costs $\\tilde{O}(n^{5/6})\\cdot O(\\mathrm{polylog}(\\tilde{n}))$ time, where $n$ and $\\tilde{n}$ are the encoded and decoded length of the inputs, respectively. We justify the use of the prefix-sum oracles by showing that, without the oracles, there is a $\\Omega(n/\\log^2n)$ lower-bound on the quantum query complexity of finding LCS given two RLE strings due to a reduction of $\\mathsf{PARITY}$ to"},"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":"2310.00966","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"quant-ph","submitted_at":"2023-10-02T08:14:34Z","cross_cats_sorted":[],"title_canon_sha256":"daf289f6171614a60328202198b80ea917f863cd55b4d4e6937d7f427392c379","abstract_canon_sha256":"d9a68978e461bb316512358f08e50522a5fcb365f87044144d90f66428197a9d"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T06:56:12.669919Z","signature_b64":"wPmo27wpA/PviWXKBca86apHHrP9/Z0tIivZ9zuMq4DbPwjoUhrQrS/dzeGqmgbAdInBxgdnLXnSZVqUdW8dAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"8a89347c2047681516dd258d68620edf16604ecb3190d3ebd9e3079a1c9c60a2","last_reissued_at":"2026-07-05T06:56:12.669535Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T06:56:12.669535Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A sublinear time quantum algorithm for longest common substring problem between run-length encoded strings","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Han-Hsuan Lin, Tzu-Ching Lee","submitted_at":"2023-10-02T08:14:34Z","abstract_excerpt":"We give a sublinear quantum algorithm for the longest common substring (LCS) problem on the run-length encoded (RLE) inputs, under the assumption that the prefix-sums of the runs are given. Our algorithm costs $\\tilde{O}(n^{5/6})\\cdot O(\\mathrm{polylog}(\\tilde{n}))$ time, where $n$ and $\\tilde{n}$ are the encoded and decoded length of the inputs, respectively. We justify the use of the prefix-sum oracles by showing that, without the oracles, there is a $\\Omega(n/\\log^2n)$ lower-bound on the quantum query complexity of finding LCS given two RLE strings due to a reduction of $\\mathsf{PARITY}$ to"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2310.00966","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/2310.00966/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"},"aliases":[{"alias_kind":"arxiv","alias_value":"2310.00966","created_at":"2026-07-05T06:56:12.669587+00:00"},{"alias_kind":"arxiv_version","alias_value":"2310.00966v1","created_at":"2026-07-05T06:56:12.669587+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2310.00966","created_at":"2026-07-05T06:56:12.669587+00:00"},{"alias_kind":"pith_short_12","alias_value":"RKETI7BAI5UB","created_at":"2026-07-05T06:56:12.669587+00:00"},{"alias_kind":"pith_short_16","alias_value":"RKETI7BAI5UBKFW5","created_at":"2026-07-05T06:56:12.669587+00:00"},{"alias_kind":"pith_short_8","alias_value":"RKETI7BA","created_at":"2026-07-05T06:56:12.669587+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/RKETI7BAI5UBKFW5EWGWQYQO34","json":"https://pith.science/pith/RKETI7BAI5UBKFW5EWGWQYQO34.json","graph_json":"https://pith.science/api/pith-number/RKETI7BAI5UBKFW5EWGWQYQO34/graph.json","events_json":"https://pith.science/api/pith-number/RKETI7BAI5UBKFW5EWGWQYQO34/events.json","paper":"https://pith.science/paper/RKETI7BA"},"agent_actions":{"view_html":"https://pith.science/pith/RKETI7BAI5UBKFW5EWGWQYQO34","download_json":"https://pith.science/pith/RKETI7BAI5UBKFW5EWGWQYQO34.json","view_paper":"https://pith.science/paper/RKETI7BA","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2310.00966&json=true","fetch_graph":"https://pith.science/api/pith-number/RKETI7BAI5UBKFW5EWGWQYQO34/graph.json","fetch_events":"https://pith.science/api/pith-number/RKETI7BAI5UBKFW5EWGWQYQO34/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/RKETI7BAI5UBKFW5EWGWQYQO34/action/timestamp_anchor","attest_storage":"https://pith.science/pith/RKETI7BAI5UBKFW5EWGWQYQO34/action/storage_attestation","attest_author":"https://pith.science/pith/RKETI7BAI5UBKFW5EWGWQYQO34/action/author_attestation","sign_citation":"https://pith.science/pith/RKETI7BAI5UBKFW5EWGWQYQO34/action/citation_signature","submit_replication":"https://pith.science/pith/RKETI7BAI5UBKFW5EWGWQYQO34/action/replication_record"}},"created_at":"2026-07-05T06:56:12.669587+00:00","updated_at":"2026-07-05T06:56:12.669587+00:00"}