{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:M5EO7OW767BF4W7A7BIE67HMXP","short_pith_number":"pith:M5EO7OW7","schema_version":"1.0","canonical_sha256":"6748efbadff7c25e5be0f8504f7cecbbf3cff6529a768aea4dc3ab61e54b7e3d","source":{"kind":"arxiv","id":"1609.06378","version":1},"attestation_state":"computed","paper":{"title":"Linear-time string indexing and analysis in small space","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Djamal Belazzougui, Fabio Cunial, Juha K\\\"arkk\\\"ainen, Veli M\\\"akinen","submitted_at":"2016-09-20T22:51:19Z","abstract_excerpt":"The field of succinct data structures has flourished over the last 16 years. Starting from the compressed suffix array (CSA) by Grossi and Vitter (STOC 2000) and the FM-index by Ferragina and Manzini (FOCS 2000), a number of generalizations and applications of string indexes based on the Burrows-Wheeler transform (BWT) have been developed, all taking an amount of space that is close to the input size in bits. In many large-scale applications, the construction of the index and its usage need to be considered as one unit of computation. Efficient string indexing and analysis in small space lies "},"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":"1609.06378","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2016-09-20T22:51:19Z","cross_cats_sorted":[],"title_canon_sha256":"46d6b69101e1a2245f5a0e7aec1a966f5b4c738e6c9f79a43f4f6e3c46719aca","abstract_canon_sha256":"8bb622fa8c6c0c1e7303fc5c7bfd41c7eca94e8f910e6a410364a06e9f4aa45d"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:04:08.489777Z","signature_b64":"FNyFbwCb3dMsOYXCFy91IcB0WIBxAC54Fx/wz5Qp1nu0pFTxB+G2Joz+R2p3YrbnPscUtxKR2pMOqe56TNwXDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"6748efbadff7c25e5be0f8504f7cecbbf3cff6529a768aea4dc3ab61e54b7e3d","last_reissued_at":"2026-05-18T01:04:08.489063Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:04:08.489063Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Linear-time string indexing and analysis in small space","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Djamal Belazzougui, Fabio Cunial, Juha K\\\"arkk\\\"ainen, Veli M\\\"akinen","submitted_at":"2016-09-20T22:51:19Z","abstract_excerpt":"The field of succinct data structures has flourished over the last 16 years. Starting from the compressed suffix array (CSA) by Grossi and Vitter (STOC 2000) and the FM-index by Ferragina and Manzini (FOCS 2000), a number of generalizations and applications of string indexes based on the Burrows-Wheeler transform (BWT) have been developed, all taking an amount of space that is close to the input size in bits. In many large-scale applications, the construction of the index and its usage need to be considered as one unit of computation. Efficient string indexing and analysis in small space lies "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1609.06378","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":"1609.06378","created_at":"2026-05-18T01:04:08.489172+00:00"},{"alias_kind":"arxiv_version","alias_value":"1609.06378v1","created_at":"2026-05-18T01:04:08.489172+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1609.06378","created_at":"2026-05-18T01:04:08.489172+00:00"},{"alias_kind":"pith_short_12","alias_value":"M5EO7OW767BF","created_at":"2026-05-18T12:30:29.479603+00:00"},{"alias_kind":"pith_short_16","alias_value":"M5EO7OW767BF4W7A","created_at":"2026-05-18T12:30:29.479603+00:00"},{"alias_kind":"pith_short_8","alias_value":"M5EO7OW7","created_at":"2026-05-18T12:30:29.479603+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/M5EO7OW767BF4W7A7BIE67HMXP","json":"https://pith.science/pith/M5EO7OW767BF4W7A7BIE67HMXP.json","graph_json":"https://pith.science/api/pith-number/M5EO7OW767BF4W7A7BIE67HMXP/graph.json","events_json":"https://pith.science/api/pith-number/M5EO7OW767BF4W7A7BIE67HMXP/events.json","paper":"https://pith.science/paper/M5EO7OW7"},"agent_actions":{"view_html":"https://pith.science/pith/M5EO7OW767BF4W7A7BIE67HMXP","download_json":"https://pith.science/pith/M5EO7OW767BF4W7A7BIE67HMXP.json","view_paper":"https://pith.science/paper/M5EO7OW7","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1609.06378&json=true","fetch_graph":"https://pith.science/api/pith-number/M5EO7OW767BF4W7A7BIE67HMXP/graph.json","fetch_events":"https://pith.science/api/pith-number/M5EO7OW767BF4W7A7BIE67HMXP/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/M5EO7OW767BF4W7A7BIE67HMXP/action/timestamp_anchor","attest_storage":"https://pith.science/pith/M5EO7OW767BF4W7A7BIE67HMXP/action/storage_attestation","attest_author":"https://pith.science/pith/M5EO7OW767BF4W7A7BIE67HMXP/action/author_attestation","sign_citation":"https://pith.science/pith/M5EO7OW767BF4W7A7BIE67HMXP/action/citation_signature","submit_replication":"https://pith.science/pith/M5EO7OW767BF4W7A7BIE67HMXP/action/replication_record"}},"created_at":"2026-05-18T01:04:08.489172+00:00","updated_at":"2026-05-18T01:04:08.489172+00:00"}