{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2013:YDXVGPFXHQUL767GSFMQ6MDNQP","short_pith_number":"pith:YDXVGPFX","schema_version":"1.0","canonical_sha256":"c0ef533cb73c28bffbe691590f306d83ec3deea70d99c451495ed5ba87aa921e","source":{"kind":"arxiv","id":"1312.2217","version":2},"attestation_state":"computed","paper":{"title":"New tabulation and sparse dynamic programming based techniques for sequence similarity problems","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Szymon Grabowski","submitted_at":"2013-12-08T14:09:17Z","abstract_excerpt":"Calculating the length of a longest common subsequence (LCS) of two strings $A$ and $B$ of length $n$ and $m$ is a classic research topic, with many worst-case oriented results known. We present two algorithms for LCS length calculation with respectively $O(mn \\log\\log n / \\log^2 n)$ and $O(mn / \\log^2 n + r)$ time complexity, the latter working for $r = o(mn / (\\log n \\log\\log n))$, where $r$ is the number of matches in the dynamic programming matrix. We also describe conditions for a given problem sufficient to apply our techniques, with several concrete examples presented, namely the edit d"},"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":"1312.2217","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2013-12-08T14:09:17Z","cross_cats_sorted":[],"title_canon_sha256":"37d1113590dda0b1f4c99df36f7f4e0705659d0739b07c051606c364407998d5","abstract_canon_sha256":"486defa39a6544c93af769d0ee9cfd2c1b7a6186f8fcbad568eea56221f72f04"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:51:24.069255Z","signature_b64":"vrAu+cbuqy3RPkikUVXhnElw8ZQsbTk3FUwoUwZZC0Szh8W3Xigy8rTlV/TB8xAqzBfhRJ87sM2ZtLMVEE6fCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"c0ef533cb73c28bffbe691590f306d83ec3deea70d99c451495ed5ba87aa921e","last_reissued_at":"2026-05-18T02:51:24.068687Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:51:24.068687Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"New tabulation and sparse dynamic programming based techniques for sequence similarity problems","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Szymon Grabowski","submitted_at":"2013-12-08T14:09:17Z","abstract_excerpt":"Calculating the length of a longest common subsequence (LCS) of two strings $A$ and $B$ of length $n$ and $m$ is a classic research topic, with many worst-case oriented results known. We present two algorithms for LCS length calculation with respectively $O(mn \\log\\log n / \\log^2 n)$ and $O(mn / \\log^2 n + r)$ time complexity, the latter working for $r = o(mn / (\\log n \\log\\log n))$, where $r$ is the number of matches in the dynamic programming matrix. We also describe conditions for a given problem sufficient to apply our techniques, with several concrete examples presented, namely the edit d"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1312.2217","kind":"arxiv","version":2},"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":"1312.2217","created_at":"2026-05-18T02:51:24.068781+00:00"},{"alias_kind":"arxiv_version","alias_value":"1312.2217v2","created_at":"2026-05-18T02:51:24.068781+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1312.2217","created_at":"2026-05-18T02:51:24.068781+00:00"},{"alias_kind":"pith_short_12","alias_value":"YDXVGPFXHQUL","created_at":"2026-05-18T12:28:06.772260+00:00"},{"alias_kind":"pith_short_16","alias_value":"YDXVGPFXHQUL767G","created_at":"2026-05-18T12:28:06.772260+00:00"},{"alias_kind":"pith_short_8","alias_value":"YDXVGPFX","created_at":"2026-05-18T12:28:06.772260+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/YDXVGPFXHQUL767GSFMQ6MDNQP","json":"https://pith.science/pith/YDXVGPFXHQUL767GSFMQ6MDNQP.json","graph_json":"https://pith.science/api/pith-number/YDXVGPFXHQUL767GSFMQ6MDNQP/graph.json","events_json":"https://pith.science/api/pith-number/YDXVGPFXHQUL767GSFMQ6MDNQP/events.json","paper":"https://pith.science/paper/YDXVGPFX"},"agent_actions":{"view_html":"https://pith.science/pith/YDXVGPFXHQUL767GSFMQ6MDNQP","download_json":"https://pith.science/pith/YDXVGPFXHQUL767GSFMQ6MDNQP.json","view_paper":"https://pith.science/paper/YDXVGPFX","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1312.2217&json=true","fetch_graph":"https://pith.science/api/pith-number/YDXVGPFXHQUL767GSFMQ6MDNQP/graph.json","fetch_events":"https://pith.science/api/pith-number/YDXVGPFXHQUL767GSFMQ6MDNQP/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/YDXVGPFXHQUL767GSFMQ6MDNQP/action/timestamp_anchor","attest_storage":"https://pith.science/pith/YDXVGPFXHQUL767GSFMQ6MDNQP/action/storage_attestation","attest_author":"https://pith.science/pith/YDXVGPFXHQUL767GSFMQ6MDNQP/action/author_attestation","sign_citation":"https://pith.science/pith/YDXVGPFXHQUL767GSFMQ6MDNQP/action/citation_signature","submit_replication":"https://pith.science/pith/YDXVGPFXHQUL767GSFMQ6MDNQP/action/replication_record"}},"created_at":"2026-05-18T02:51:24.068781+00:00","updated_at":"2026-05-18T02:51:24.068781+00:00"}