{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2024:6YYCBBVMXJ7MW6BCBTRR2247DW","short_pith_number":"pith:6YYCBBVM","schema_version":"1.0","canonical_sha256":"f6302086acba7ecb78220ce31d6b9f1d8f5a582407651e69be915e66d2a7dead","source":{"kind":"arxiv","id":"2411.02421","version":1},"attestation_state":"computed","paper":{"title":"Near-Optimal Quantum Algorithm for Finding the Longest Common Substring 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":"2024-10-21T15:52:08Z","abstract_excerpt":"We give a near-optimal quantum algorithm for the longest common substring (LCS) problem between two run-length encoded (RLE) strings, with the assumption that the prefix-sums of the run-lengths are given.\n  Our algorithm costs $\\tilde{\\mathcal{O}}(n^{2/3}/d^{1/6-o(1)}\\cdot\\mathrm{polylog}(\\tilde{n}))$ time, while the query lower bound for the problem is $\\tilde{\\Omega}(n^{2/3}/d^{1/6})$, where $n$ and $\\tilde{n}$ are the encoded and decoded length of the inputs, respectively, and $d$ is the encoded length of the LCS.\n  We justify the use of prefix-sum oracles for two reasons. First, we note th"},"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":"2411.02421","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"quant-ph","submitted_at":"2024-10-21T15:52:08Z","cross_cats_sorted":[],"title_canon_sha256":"36a39ca609f50096d4f69944f82ebb5e270933e4912b13088d4d588e989ed570","abstract_canon_sha256":"e58e832aa231391e3a740185282a4fd57e42cf517db753d5f234cb8731359260"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T09:31:11.530637Z","signature_b64":"j66ruOgeF+xHpMyPTuE0DlB3aJjMfv4WupAO5qOrAeuuCQDai3H66Frbm2xho8MZlXEmpeQ0d05Ny+ppNIoxDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"f6302086acba7ecb78220ce31d6b9f1d8f5a582407651e69be915e66d2a7dead","last_reissued_at":"2026-07-05T09:31:11.530203Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T09:31:11.530203Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Near-Optimal Quantum Algorithm for Finding the Longest Common Substring 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":"2024-10-21T15:52:08Z","abstract_excerpt":"We give a near-optimal quantum algorithm for the longest common substring (LCS) problem between two run-length encoded (RLE) strings, with the assumption that the prefix-sums of the run-lengths are given.\n  Our algorithm costs $\\tilde{\\mathcal{O}}(n^{2/3}/d^{1/6-o(1)}\\cdot\\mathrm{polylog}(\\tilde{n}))$ time, while the query lower bound for the problem is $\\tilde{\\Omega}(n^{2/3}/d^{1/6})$, where $n$ and $\\tilde{n}$ are the encoded and decoded length of the inputs, respectively, and $d$ is the encoded length of the LCS.\n  We justify the use of prefix-sum oracles for two reasons. First, we note th"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2411.02421","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/2411.02421/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":"2411.02421","created_at":"2026-07-05T09:31:11.530278+00:00"},{"alias_kind":"arxiv_version","alias_value":"2411.02421v1","created_at":"2026-07-05T09:31:11.530278+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2411.02421","created_at":"2026-07-05T09:31:11.530278+00:00"},{"alias_kind":"pith_short_12","alias_value":"6YYCBBVMXJ7M","created_at":"2026-07-05T09:31:11.530278+00:00"},{"alias_kind":"pith_short_16","alias_value":"6YYCBBVMXJ7MW6BC","created_at":"2026-07-05T09:31:11.530278+00:00"},{"alias_kind":"pith_short_8","alias_value":"6YYCBBVM","created_at":"2026-07-05T09:31:11.530278+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/6YYCBBVMXJ7MW6BCBTRR2247DW","json":"https://pith.science/pith/6YYCBBVMXJ7MW6BCBTRR2247DW.json","graph_json":"https://pith.science/api/pith-number/6YYCBBVMXJ7MW6BCBTRR2247DW/graph.json","events_json":"https://pith.science/api/pith-number/6YYCBBVMXJ7MW6BCBTRR2247DW/events.json","paper":"https://pith.science/paper/6YYCBBVM"},"agent_actions":{"view_html":"https://pith.science/pith/6YYCBBVMXJ7MW6BCBTRR2247DW","download_json":"https://pith.science/pith/6YYCBBVMXJ7MW6BCBTRR2247DW.json","view_paper":"https://pith.science/paper/6YYCBBVM","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2411.02421&json=true","fetch_graph":"https://pith.science/api/pith-number/6YYCBBVMXJ7MW6BCBTRR2247DW/graph.json","fetch_events":"https://pith.science/api/pith-number/6YYCBBVMXJ7MW6BCBTRR2247DW/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/6YYCBBVMXJ7MW6BCBTRR2247DW/action/timestamp_anchor","attest_storage":"https://pith.science/pith/6YYCBBVMXJ7MW6BCBTRR2247DW/action/storage_attestation","attest_author":"https://pith.science/pith/6YYCBBVMXJ7MW6BCBTRR2247DW/action/author_attestation","sign_citation":"https://pith.science/pith/6YYCBBVMXJ7MW6BCBTRR2247DW/action/citation_signature","submit_replication":"https://pith.science/pith/6YYCBBVMXJ7MW6BCBTRR2247DW/action/replication_record"}},"created_at":"2026-07-05T09:31:11.530278+00:00","updated_at":"2026-07-05T09:31:11.530278+00:00"}