{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:UYP6DTROLREHENQWYO63LIWIUB","short_pith_number":"pith:UYP6DTRO","schema_version":"1.0","canonical_sha256":"a61fe1ce2e5c48723616c3bdb5a2c8a04764a6554b701baf504e13d119ed4d15","source":{"kind":"arxiv","id":"1810.01238","version":1},"attestation_state":"computed","paper":{"title":"Sketching, Streaming, and Fine-Grained Complexity of (Weighted) LCS","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Bhaskar Ray Chaudhury, Karl Bringmann","submitted_at":"2018-10-02T13:42:21Z","abstract_excerpt":"We study sketching and streaming algorithms for the Longest Common Subsequence problem (LCS) on strings of small alphabet size $|\\Sigma|$. For the problem of deciding whether the LCS of strings $x,y$ has length at least $L$, we obtain a sketch size and streaming space usage of $\\mathcal{O}(L^{|\\Sigma| - 1} \\log L)$.\n  We also prove matching unconditional lower bounds.\n  As an application, we study a variant of LCS where each alphabet symbol is equipped with a weight that is given as input, and the task is to compute a common subsequence of maximum total weight. Using our sketching algorithm, w"},"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":"1810.01238","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DS","submitted_at":"2018-10-02T13:42:21Z","cross_cats_sorted":[],"title_canon_sha256":"da2f5771185034aa3e5af553c5d55122ceb9987c6e5567e67164bb38b8ff2167","abstract_canon_sha256":"4905c206f5288394d349375cb3b1059bdb57beb6a808b9898bdc5f579e7215d0"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:04:18.437799Z","signature_b64":"Fl8x+2ztJjmK5TNB8T3nKzl7qVDfObugpXssDrkC54Nyssrb6FoMf0kUybP9JkVi4jryKmUWY3oqz5w+L1BkDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"a61fe1ce2e5c48723616c3bdb5a2c8a04764a6554b701baf504e13d119ed4d15","last_reissued_at":"2026-05-18T00:04:18.437145Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:04:18.437145Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Sketching, Streaming, and Fine-Grained Complexity of (Weighted) LCS","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Bhaskar Ray Chaudhury, Karl Bringmann","submitted_at":"2018-10-02T13:42:21Z","abstract_excerpt":"We study sketching and streaming algorithms for the Longest Common Subsequence problem (LCS) on strings of small alphabet size $|\\Sigma|$. For the problem of deciding whether the LCS of strings $x,y$ has length at least $L$, we obtain a sketch size and streaming space usage of $\\mathcal{O}(L^{|\\Sigma| - 1} \\log L)$.\n  We also prove matching unconditional lower bounds.\n  As an application, we study a variant of LCS where each alphabet symbol is equipped with a weight that is given as input, and the task is to compute a common subsequence of maximum total weight. Using our sketching algorithm, w"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1810.01238","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":"1810.01238","created_at":"2026-05-18T00:04:18.437220+00:00"},{"alias_kind":"arxiv_version","alias_value":"1810.01238v1","created_at":"2026-05-18T00:04:18.437220+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1810.01238","created_at":"2026-05-18T00:04:18.437220+00:00"},{"alias_kind":"pith_short_12","alias_value":"UYP6DTROLREH","created_at":"2026-05-18T12:32:56.356000+00:00"},{"alias_kind":"pith_short_16","alias_value":"UYP6DTROLREHENQW","created_at":"2026-05-18T12:32:56.356000+00:00"},{"alias_kind":"pith_short_8","alias_value":"UYP6DTRO","created_at":"2026-05-18T12:32:56.356000+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/UYP6DTROLREHENQWYO63LIWIUB","json":"https://pith.science/pith/UYP6DTROLREHENQWYO63LIWIUB.json","graph_json":"https://pith.science/api/pith-number/UYP6DTROLREHENQWYO63LIWIUB/graph.json","events_json":"https://pith.science/api/pith-number/UYP6DTROLREHENQWYO63LIWIUB/events.json","paper":"https://pith.science/paper/UYP6DTRO"},"agent_actions":{"view_html":"https://pith.science/pith/UYP6DTROLREHENQWYO63LIWIUB","download_json":"https://pith.science/pith/UYP6DTROLREHENQWYO63LIWIUB.json","view_paper":"https://pith.science/paper/UYP6DTRO","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1810.01238&json=true","fetch_graph":"https://pith.science/api/pith-number/UYP6DTROLREHENQWYO63LIWIUB/graph.json","fetch_events":"https://pith.science/api/pith-number/UYP6DTROLREHENQWYO63LIWIUB/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/UYP6DTROLREHENQWYO63LIWIUB/action/timestamp_anchor","attest_storage":"https://pith.science/pith/UYP6DTROLREHENQWYO63LIWIUB/action/storage_attestation","attest_author":"https://pith.science/pith/UYP6DTROLREHENQWYO63LIWIUB/action/author_attestation","sign_citation":"https://pith.science/pith/UYP6DTROLREHENQWYO63LIWIUB/action/citation_signature","submit_replication":"https://pith.science/pith/UYP6DTROLREHENQWYO63LIWIUB/action/replication_record"}},"created_at":"2026-05-18T00:04:18.437220+00:00","updated_at":"2026-05-18T00:04:18.437220+00:00"}