{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2023:RKETI7BAI5UBKFW5EWGWQYQO34","short_pith_number":"pith:RKETI7BA","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"},"canonical_sha256":"8a89347c2047681516dd258d68620edf16604ecb3190d3ebd9e3079a1c9c60a2","source":{"kind":"arxiv","id":"2310.00966","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2310.00966","created_at":"2026-07-05T06:56:12Z"},{"alias_kind":"arxiv_version","alias_value":"2310.00966v1","created_at":"2026-07-05T06:56:12Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2310.00966","created_at":"2026-07-05T06:56:12Z"},{"alias_kind":"pith_short_12","alias_value":"RKETI7BAI5UB","created_at":"2026-07-05T06:56:12Z"},{"alias_kind":"pith_short_16","alias_value":"RKETI7BAI5UBKFW5","created_at":"2026-07-05T06:56:12Z"},{"alias_kind":"pith_short_8","alias_value":"RKETI7BA","created_at":"2026-07-05T06:56:12Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2023:RKETI7BAI5UBKFW5EWGWQYQO34","target":"record","payload":{"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"},"canonical_sha256":"8a89347c2047681516dd258d68620edf16604ecb3190d3ebd9e3079a1c9c60a2","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"},"source_kind":"arxiv","source_id":"2310.00966","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-05T06:56:12Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"oc2TeGJAdsPaJhUTBhUyDepsbfFRJZww292PxD5YoBzZ9oV/ZBnQAjvYmPdifj+GFWbxKOrT4e/j7AcG2HykBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-14T12:06:49.921390Z"},"content_sha256":"ec8d3ed1490cf52475112bf9511a8590a97dad392103e158e02339cd828df10f","schema_version":"1.0","event_id":"sha256:ec8d3ed1490cf52475112bf9511a8590a97dad392103e158e02339cd828df10f"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2023:RKETI7BAI5UBKFW5EWGWQYQO34","target":"graph","payload":{"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"},"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-05T06:56:12Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"cP9g2uClcxPU18hds+HDwEndAm6pI0XUA7xIOGrbiUpHZw7Hqyj5jD4ud0XPXLcue6NgcUBwa7FRTyC72tqTCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-14T12:06:49.922775Z"},"content_sha256":"51f36bdb7a95c27c1ae1827050bef8bbcfacbc6a391b6c676ec30499c87d42e3","schema_version":"1.0","event_id":"sha256:51f36bdb7a95c27c1ae1827050bef8bbcfacbc6a391b6c676ec30499c87d42e3"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/RKETI7BAI5UBKFW5EWGWQYQO34/bundle.json","state_url":"https://pith.science/pith/RKETI7BAI5UBKFW5EWGWQYQO34/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/RKETI7BAI5UBKFW5EWGWQYQO34/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-14T12:06:49Z","links":{"resolver":"https://pith.science/pith/RKETI7BAI5UBKFW5EWGWQYQO34","bundle":"https://pith.science/pith/RKETI7BAI5UBKFW5EWGWQYQO34/bundle.json","state":"https://pith.science/pith/RKETI7BAI5UBKFW5EWGWQYQO34/state.json","well_known_bundle":"https://pith.science/.well-known/pith/RKETI7BAI5UBKFW5EWGWQYQO34/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2023:RKETI7BAI5UBKFW5EWGWQYQO34","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":"d9a68978e461bb316512358f08e50522a5fcb365f87044144d90f66428197a9d","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"quant-ph","submitted_at":"2023-10-02T08:14:34Z","title_canon_sha256":"daf289f6171614a60328202198b80ea917f863cd55b4d4e6937d7f427392c379"},"schema_version":"1.0","source":{"id":"2310.00966","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2310.00966","created_at":"2026-07-05T06:56:12Z"},{"alias_kind":"arxiv_version","alias_value":"2310.00966v1","created_at":"2026-07-05T06:56:12Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2310.00966","created_at":"2026-07-05T06:56:12Z"},{"alias_kind":"pith_short_12","alias_value":"RKETI7BAI5UB","created_at":"2026-07-05T06:56:12Z"},{"alias_kind":"pith_short_16","alias_value":"RKETI7BAI5UBKFW5","created_at":"2026-07-05T06:56:12Z"},{"alias_kind":"pith_short_8","alias_value":"RKETI7BA","created_at":"2026-07-05T06:56:12Z"}],"graph_snapshots":[{"event_id":"sha256:51f36bdb7a95c27c1ae1827050bef8bbcfacbc6a391b6c676ec30499c87d42e3","target":"graph","created_at":"2026-07-05T06:56:12Z","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/2310.00966/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"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","authors_text":"Han-Hsuan Lin, Tzu-Ching Lee","cross_cats":[],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"quant-ph","submitted_at":"2023-10-02T08:14:34Z","title":"A sublinear time quantum algorithm for longest common substring problem between run-length encoded strings"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2310.00966","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:ec8d3ed1490cf52475112bf9511a8590a97dad392103e158e02339cd828df10f","target":"record","created_at":"2026-07-05T06:56:12Z","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":"d9a68978e461bb316512358f08e50522a5fcb365f87044144d90f66428197a9d","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"quant-ph","submitted_at":"2023-10-02T08:14:34Z","title_canon_sha256":"daf289f6171614a60328202198b80ea917f863cd55b4d4e6937d7f427392c379"},"schema_version":"1.0","source":{"id":"2310.00966","kind":"arxiv","version":1}},"canonical_sha256":"8a89347c2047681516dd258d68620edf16604ecb3190d3ebd9e3079a1c9c60a2","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"8a89347c2047681516dd258d68620edf16604ecb3190d3ebd9e3079a1c9c60a2","first_computed_at":"2026-07-05T06:56:12.669535Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T06:56:12.669535Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"wPmo27wpA/PviWXKBca86apHHrP9/Z0tIivZ9zuMq4DbPwjoUhrQrS/dzeGqmgbAdInBxgdnLXnSZVqUdW8dAA==","signature_status":"signed_v1","signed_at":"2026-07-05T06:56:12.669919Z","signed_message":"canonical_sha256_bytes"},"source_id":"2310.00966","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:ec8d3ed1490cf52475112bf9511a8590a97dad392103e158e02339cd828df10f","sha256:51f36bdb7a95c27c1ae1827050bef8bbcfacbc6a391b6c676ec30499c87d42e3"],"state_sha256":"5e67df7a29abe35cb175f094d196e089b287a378a55e3bdcfbd3ea6d27a6add9"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Hc0RBrmpnQYG8n0KrCqDGAQ+3Enwll1e6nAOmmfNbHSH5RKO6OcK7WgcaRSF6JqU4oFRTILR9MUVPUNEEMDHBg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-14T12:06:49.931732Z","bundle_sha256":"f318e4c635c5d04db3ff8c663cbe4cb4141ad989b75ad09af19b5a237d6f37cc"}}