{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2013:YDXVGPFXHQUL767GSFMQ6MDNQP","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":"486defa39a6544c93af769d0ee9cfd2c1b7a6186f8fcbad568eea56221f72f04","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2013-12-08T14:09:17Z","title_canon_sha256":"37d1113590dda0b1f4c99df36f7f4e0705659d0739b07c051606c364407998d5"},"schema_version":"1.0","source":{"id":"1312.2217","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1312.2217","created_at":"2026-05-18T02:51:24Z"},{"alias_kind":"arxiv_version","alias_value":"1312.2217v2","created_at":"2026-05-18T02:51:24Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1312.2217","created_at":"2026-05-18T02:51:24Z"},{"alias_kind":"pith_short_12","alias_value":"YDXVGPFXHQUL","created_at":"2026-05-18T12:28:06Z"},{"alias_kind":"pith_short_16","alias_value":"YDXVGPFXHQUL767G","created_at":"2026-05-18T12:28:06Z"},{"alias_kind":"pith_short_8","alias_value":"YDXVGPFX","created_at":"2026-05-18T12:28:06Z"}],"graph_snapshots":[{"event_id":"sha256:adb912d6ba19c139f040d88236bcce4e3547cd2f204d5d02044904ac50b1fcbf","target":"graph","created_at":"2026-05-18T02:51:24Z","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"},"paper":{"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","authors_text":"Szymon Grabowski","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2013-12-08T14:09:17Z","title":"New tabulation and sparse dynamic programming based techniques for sequence similarity problems"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1312.2217","kind":"arxiv","version":2},"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:d6351047fcbefe8f5c8198f0ac417c7f4e4209458c7bd5a7f4ce5c195dad0f7e","target":"record","created_at":"2026-05-18T02:51:24Z","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":"486defa39a6544c93af769d0ee9cfd2c1b7a6186f8fcbad568eea56221f72f04","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2013-12-08T14:09:17Z","title_canon_sha256":"37d1113590dda0b1f4c99df36f7f4e0705659d0739b07c051606c364407998d5"},"schema_version":"1.0","source":{"id":"1312.2217","kind":"arxiv","version":2}},"canonical_sha256":"c0ef533cb73c28bffbe691590f306d83ec3deea70d99c451495ed5ba87aa921e","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"c0ef533cb73c28bffbe691590f306d83ec3deea70d99c451495ed5ba87aa921e","first_computed_at":"2026-05-18T02:51:24.068687Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:51:24.068687Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"vrAu+cbuqy3RPkikUVXhnElw8ZQsbTk3FUwoUwZZC0Szh8W3Xigy8rTlV/TB8xAqzBfhRJ87sM2ZtLMVEE6fCg==","signature_status":"signed_v1","signed_at":"2026-05-18T02:51:24.069255Z","signed_message":"canonical_sha256_bytes"},"source_id":"1312.2217","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:d6351047fcbefe8f5c8198f0ac417c7f4e4209458c7bd5a7f4ce5c195dad0f7e","sha256:adb912d6ba19c139f040d88236bcce4e3547cd2f204d5d02044904ac50b1fcbf"],"state_sha256":"e8ca85dbbb4829beaa15f8285a13caed23fe5ac13b8b43dedfade6c9d99f27cb"}