{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2014:TZM2DMLG53QIBGHZQDAM3HWCG5","short_pith_number":"pith:TZM2DMLG","schema_version":"1.0","canonical_sha256":"9e59a1b166eee08098f980c0cd9ec23760b7164d82345ba4d8fa51f322c4fe16","source":{"kind":"arxiv","id":"1407.0522","version":1},"attestation_state":"computed","paper":{"title":"Sublinear Space Algorithms for the Longest Common Substring Problem","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Hjalte Wedel Vildh{\\o}j, Tatiana Starikovskaya, Tomasz Kociumaka","submitted_at":"2014-07-02T11:22:11Z","abstract_excerpt":"Given $m$ documents of total length $n$, we consider the problem of finding a longest string common to at least $d \\geq 2$ of the documents. This problem is known as the \\emph{longest common substring (LCS) problem} and has a classic $O(n)$ space and $O(n)$ time solution (Weiner [FOCS'73], Hui [CPM'92]). However, the use of linear space is impractical in many applications. In this paper we show that for any trade-off parameter $1 \\leq \\tau \\leq n$, the LCS problem can be solved in $O(\\tau)$ space and $O(n^2/\\tau)$ time, thus providing the first smooth deterministic time-space trade-off from co"},"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":"1407.0522","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2014-07-02T11:22:11Z","cross_cats_sorted":[],"title_canon_sha256":"2877507822966f97480a3330e30eba879ea112cdf6946c3dd40fd9828af1b2a2","abstract_canon_sha256":"19fccad5ce9bdd2e9d5f3202a6da5a47c929717abcc0609cecfd306a0da9449a"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:48:26.676642Z","signature_b64":"UatVcCEkkSpNcgJ/nJNLPKorMDTWzdbUIeyHGbLvKSW0DFe7OUChD9Jpt4QRv8wfR7Xt9sPSR2klywJ2rULDCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"9e59a1b166eee08098f980c0cd9ec23760b7164d82345ba4d8fa51f322c4fe16","last_reissued_at":"2026-05-18T02:48:26.676161Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:48:26.676161Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Sublinear Space Algorithms for the Longest Common Substring Problem","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Hjalte Wedel Vildh{\\o}j, Tatiana Starikovskaya, Tomasz Kociumaka","submitted_at":"2014-07-02T11:22:11Z","abstract_excerpt":"Given $m$ documents of total length $n$, we consider the problem of finding a longest string common to at least $d \\geq 2$ of the documents. This problem is known as the \\emph{longest common substring (LCS) problem} and has a classic $O(n)$ space and $O(n)$ time solution (Weiner [FOCS'73], Hui [CPM'92]). However, the use of linear space is impractical in many applications. In this paper we show that for any trade-off parameter $1 \\leq \\tau \\leq n$, the LCS problem can be solved in $O(\\tau)$ space and $O(n^2/\\tau)$ time, thus providing the first smooth deterministic time-space trade-off from co"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1407.0522","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":"1407.0522","created_at":"2026-05-18T02:48:26.676226+00:00"},{"alias_kind":"arxiv_version","alias_value":"1407.0522v1","created_at":"2026-05-18T02:48:26.676226+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1407.0522","created_at":"2026-05-18T02:48:26.676226+00:00"},{"alias_kind":"pith_short_12","alias_value":"TZM2DMLG53QI","created_at":"2026-05-18T12:28:52.271510+00:00"},{"alias_kind":"pith_short_16","alias_value":"TZM2DMLG53QIBGHZ","created_at":"2026-05-18T12:28:52.271510+00:00"},{"alias_kind":"pith_short_8","alias_value":"TZM2DMLG","created_at":"2026-05-18T12:28:52.271510+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/TZM2DMLG53QIBGHZQDAM3HWCG5","json":"https://pith.science/pith/TZM2DMLG53QIBGHZQDAM3HWCG5.json","graph_json":"https://pith.science/api/pith-number/TZM2DMLG53QIBGHZQDAM3HWCG5/graph.json","events_json":"https://pith.science/api/pith-number/TZM2DMLG53QIBGHZQDAM3HWCG5/events.json","paper":"https://pith.science/paper/TZM2DMLG"},"agent_actions":{"view_html":"https://pith.science/pith/TZM2DMLG53QIBGHZQDAM3HWCG5","download_json":"https://pith.science/pith/TZM2DMLG53QIBGHZQDAM3HWCG5.json","view_paper":"https://pith.science/paper/TZM2DMLG","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1407.0522&json=true","fetch_graph":"https://pith.science/api/pith-number/TZM2DMLG53QIBGHZQDAM3HWCG5/graph.json","fetch_events":"https://pith.science/api/pith-number/TZM2DMLG53QIBGHZQDAM3HWCG5/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/TZM2DMLG53QIBGHZQDAM3HWCG5/action/timestamp_anchor","attest_storage":"https://pith.science/pith/TZM2DMLG53QIBGHZQDAM3HWCG5/action/storage_attestation","attest_author":"https://pith.science/pith/TZM2DMLG53QIBGHZQDAM3HWCG5/action/author_attestation","sign_citation":"https://pith.science/pith/TZM2DMLG53QIBGHZQDAM3HWCG5/action/citation_signature","submit_replication":"https://pith.science/pith/TZM2DMLG53QIBGHZQDAM3HWCG5/action/replication_record"}},"created_at":"2026-05-18T02:48:26.676226+00:00","updated_at":"2026-05-18T02:48:26.676226+00:00"}