{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2012:SVX2V4OMIAYQBEMCIXQIPCUCTY","short_pith_number":"pith:SVX2V4OM","schema_version":"1.0","canonical_sha256":"956faaf1cc403100918245e0878a829e36d16c7aaabd262dec6fd2b6abc8e7ea","source":{"kind":"arxiv","id":"1207.1135","version":1},"attestation_state":"computed","paper":{"title":"Sparse Suffix Tree Construction with Small Space","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Benjamin Sach, Hjalte Wedel Vildh{\\o}j, Inge Li G{\\o}rtz, Philip Bille, Tsvi Kopelowitz","submitted_at":"2012-07-04T22:41:51Z","abstract_excerpt":"We consider the problem of constructing a sparse suffix tree (or suffix array) for $b$ suffixes of a given text $T$ of size $n$, using only $O(b)$ words of space during construction time. Breaking the naive bound of $\\Omega(nb)$ time for this problem has occupied many algorithmic researchers since a different structure, the (evenly spaced) sparse suffix tree, was introduced by K{\\\"a}rkk{\\\"a}inen and Ukkonen in 1996. While in the evenly spaced sparse suffix tree the suffixes considered must be evenly spaced in $T$, here there is no constraint on the locations of the suffixes.\n  We show that the"},"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":"1207.1135","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2012-07-04T22:41:51Z","cross_cats_sorted":[],"title_canon_sha256":"6ef752ea07de8c88009d25bb2b584c402147b1a50492545513440bc87637d0ef","abstract_canon_sha256":"cb58a2c48a3d24ecf9a899422e6267d99f670ba8c54bb0085189cbd27881e9fe"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:51:46.798293Z","signature_b64":"ZaI3T4Tb43GV0cHsnAEBGOguLVCK+DNdZl/fyGnQyAA8ezl/NizWUpxKuhAiR09Oc/V29nj+bqkUP7K34Gj6CQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"956faaf1cc403100918245e0878a829e36d16c7aaabd262dec6fd2b6abc8e7ea","last_reissued_at":"2026-05-18T03:51:46.797848Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:51:46.797848Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Sparse Suffix Tree Construction with Small Space","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Benjamin Sach, Hjalte Wedel Vildh{\\o}j, Inge Li G{\\o}rtz, Philip Bille, Tsvi Kopelowitz","submitted_at":"2012-07-04T22:41:51Z","abstract_excerpt":"We consider the problem of constructing a sparse suffix tree (or suffix array) for $b$ suffixes of a given text $T$ of size $n$, using only $O(b)$ words of space during construction time. Breaking the naive bound of $\\Omega(nb)$ time for this problem has occupied many algorithmic researchers since a different structure, the (evenly spaced) sparse suffix tree, was introduced by K{\\\"a}rkk{\\\"a}inen and Ukkonen in 1996. While in the evenly spaced sparse suffix tree the suffixes considered must be evenly spaced in $T$, here there is no constraint on the locations of the suffixes.\n  We show that the"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1207.1135","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":"1207.1135","created_at":"2026-05-18T03:51:46.797920+00:00"},{"alias_kind":"arxiv_version","alias_value":"1207.1135v1","created_at":"2026-05-18T03:51:46.797920+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1207.1135","created_at":"2026-05-18T03:51:46.797920+00:00"},{"alias_kind":"pith_short_12","alias_value":"SVX2V4OMIAYQ","created_at":"2026-05-18T12:27:23.164592+00:00"},{"alias_kind":"pith_short_16","alias_value":"SVX2V4OMIAYQBEMC","created_at":"2026-05-18T12:27:23.164592+00:00"},{"alias_kind":"pith_short_8","alias_value":"SVX2V4OM","created_at":"2026-05-18T12:27:23.164592+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/SVX2V4OMIAYQBEMCIXQIPCUCTY","json":"https://pith.science/pith/SVX2V4OMIAYQBEMCIXQIPCUCTY.json","graph_json":"https://pith.science/api/pith-number/SVX2V4OMIAYQBEMCIXQIPCUCTY/graph.json","events_json":"https://pith.science/api/pith-number/SVX2V4OMIAYQBEMCIXQIPCUCTY/events.json","paper":"https://pith.science/paper/SVX2V4OM"},"agent_actions":{"view_html":"https://pith.science/pith/SVX2V4OMIAYQBEMCIXQIPCUCTY","download_json":"https://pith.science/pith/SVX2V4OMIAYQBEMCIXQIPCUCTY.json","view_paper":"https://pith.science/paper/SVX2V4OM","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1207.1135&json=true","fetch_graph":"https://pith.science/api/pith-number/SVX2V4OMIAYQBEMCIXQIPCUCTY/graph.json","fetch_events":"https://pith.science/api/pith-number/SVX2V4OMIAYQBEMCIXQIPCUCTY/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/SVX2V4OMIAYQBEMCIXQIPCUCTY/action/timestamp_anchor","attest_storage":"https://pith.science/pith/SVX2V4OMIAYQBEMCIXQIPCUCTY/action/storage_attestation","attest_author":"https://pith.science/pith/SVX2V4OMIAYQBEMCIXQIPCUCTY/action/author_attestation","sign_citation":"https://pith.science/pith/SVX2V4OMIAYQBEMCIXQIPCUCTY/action/citation_signature","submit_replication":"https://pith.science/pith/SVX2V4OMIAYQBEMCIXQIPCUCTY/action/replication_record"}},"created_at":"2026-05-18T03:51:46.797920+00:00","updated_at":"2026-05-18T03:51:46.797920+00:00"}