{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2024:6YYCBBVMXJ7MW6BCBTRR2247DW","short_pith_number":"pith:6YYCBBVM","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"},"canonical_sha256":"f6302086acba7ecb78220ce31d6b9f1d8f5a582407651e69be915e66d2a7dead","source":{"kind":"arxiv","id":"2411.02421","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2411.02421","created_at":"2026-07-05T09:31:11Z"},{"alias_kind":"arxiv_version","alias_value":"2411.02421v1","created_at":"2026-07-05T09:31:11Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2411.02421","created_at":"2026-07-05T09:31:11Z"},{"alias_kind":"pith_short_12","alias_value":"6YYCBBVMXJ7M","created_at":"2026-07-05T09:31:11Z"},{"alias_kind":"pith_short_16","alias_value":"6YYCBBVMXJ7MW6BC","created_at":"2026-07-05T09:31:11Z"},{"alias_kind":"pith_short_8","alias_value":"6YYCBBVM","created_at":"2026-07-05T09:31:11Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2024:6YYCBBVMXJ7MW6BCBTRR2247DW","target":"record","payload":{"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"},"canonical_sha256":"f6302086acba7ecb78220ce31d6b9f1d8f5a582407651e69be915e66d2a7dead","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"},"source_kind":"arxiv","source_id":"2411.02421","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-05T09:31:11Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ZfR/NitC8nevUwEswrRTqf+9V1OeUkM57s3/RlhXedOqW9WZbo9J/dV/1v2j9fic05uKCCdKxd9XR9S9pohhCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-04T01:46:09.074383Z"},"content_sha256":"fb488bf61b832420d820a72e16551548b7a5e3917e9d1f624ea4cda4e5639950","schema_version":"1.0","event_id":"sha256:fb488bf61b832420d820a72e16551548b7a5e3917e9d1f624ea4cda4e5639950"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2024:6YYCBBVMXJ7MW6BCBTRR2247DW","target":"graph","payload":{"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"},"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-05T09:31:11Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Nt49YVja/Flj+gZmtiFUaOothUe3zuEwvFjvjcVwQLqrwWCuny6hEngha+K3tczBrfdjit5A9wqOx5089honBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-04T01:46:09.074753Z"},"content_sha256":"ec30058fcfec825ba749babed7f7a24059d44176b28bd49fd268973741562d26","schema_version":"1.0","event_id":"sha256:ec30058fcfec825ba749babed7f7a24059d44176b28bd49fd268973741562d26"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/6YYCBBVMXJ7MW6BCBTRR2247DW/bundle.json","state_url":"https://pith.science/pith/6YYCBBVMXJ7MW6BCBTRR2247DW/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/6YYCBBVMXJ7MW6BCBTRR2247DW/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-04T01:46:09Z","links":{"resolver":"https://pith.science/pith/6YYCBBVMXJ7MW6BCBTRR2247DW","bundle":"https://pith.science/pith/6YYCBBVMXJ7MW6BCBTRR2247DW/bundle.json","state":"https://pith.science/pith/6YYCBBVMXJ7MW6BCBTRR2247DW/state.json","well_known_bundle":"https://pith.science/.well-known/pith/6YYCBBVMXJ7MW6BCBTRR2247DW/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2024:6YYCBBVMXJ7MW6BCBTRR2247DW","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":"e58e832aa231391e3a740185282a4fd57e42cf517db753d5f234cb8731359260","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"quant-ph","submitted_at":"2024-10-21T15:52:08Z","title_canon_sha256":"36a39ca609f50096d4f69944f82ebb5e270933e4912b13088d4d588e989ed570"},"schema_version":"1.0","source":{"id":"2411.02421","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2411.02421","created_at":"2026-07-05T09:31:11Z"},{"alias_kind":"arxiv_version","alias_value":"2411.02421v1","created_at":"2026-07-05T09:31:11Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2411.02421","created_at":"2026-07-05T09:31:11Z"},{"alias_kind":"pith_short_12","alias_value":"6YYCBBVMXJ7M","created_at":"2026-07-05T09:31:11Z"},{"alias_kind":"pith_short_16","alias_value":"6YYCBBVMXJ7MW6BC","created_at":"2026-07-05T09:31:11Z"},{"alias_kind":"pith_short_8","alias_value":"6YYCBBVM","created_at":"2026-07-05T09:31:11Z"}],"graph_snapshots":[{"event_id":"sha256:ec30058fcfec825ba749babed7f7a24059d44176b28bd49fd268973741562d26","target":"graph","created_at":"2026-07-05T09:31:11Z","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/2411.02421/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"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","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":"2024-10-21T15:52:08Z","title":"Near-Optimal Quantum Algorithm for Finding the Longest Common Substring between Run-Length Encoded Strings"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2411.02421","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:fb488bf61b832420d820a72e16551548b7a5e3917e9d1f624ea4cda4e5639950","target":"record","created_at":"2026-07-05T09:31:11Z","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":"e58e832aa231391e3a740185282a4fd57e42cf517db753d5f234cb8731359260","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"quant-ph","submitted_at":"2024-10-21T15:52:08Z","title_canon_sha256":"36a39ca609f50096d4f69944f82ebb5e270933e4912b13088d4d588e989ed570"},"schema_version":"1.0","source":{"id":"2411.02421","kind":"arxiv","version":1}},"canonical_sha256":"f6302086acba7ecb78220ce31d6b9f1d8f5a582407651e69be915e66d2a7dead","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"f6302086acba7ecb78220ce31d6b9f1d8f5a582407651e69be915e66d2a7dead","first_computed_at":"2026-07-05T09:31:11.530203Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T09:31:11.530203Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"j66ruOgeF+xHpMyPTuE0DlB3aJjMfv4WupAO5qOrAeuuCQDai3H66Frbm2xho8MZlXEmpeQ0d05Ny+ppNIoxDQ==","signature_status":"signed_v1","signed_at":"2026-07-05T09:31:11.530637Z","signed_message":"canonical_sha256_bytes"},"source_id":"2411.02421","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:fb488bf61b832420d820a72e16551548b7a5e3917e9d1f624ea4cda4e5639950","sha256:ec30058fcfec825ba749babed7f7a24059d44176b28bd49fd268973741562d26"],"state_sha256":"9f6c94b16f50c50a7cb597403189b8b0da60db0ccd485ade004433860b836ce2"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"dmgr7TTFu33JoOM99kdiMXNSNEUXUkJH83AHy231dm7jKVwnuZyGFna08oLrpu975gzkRHqsjfqK9Fi5x4SWAA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-04T01:46:09.077121Z","bundle_sha256":"c06100173fd05c6022da29dc0e3076f380b46054db9db3c41a3041d75a488910"}}