{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:U3OSWYIAX64GTUZ6BEBEMV5PUY","short_pith_number":"pith:U3OSWYIA","schema_version":"1.0","canonical_sha256":"a6dd2b6100bfb869d33e09024657afa632fb529011163fd5fe83ed022911c1af","source":{"kind":"arxiv","id":"1705.10382","version":4},"attestation_state":"computed","paper":{"title":"Optimal-Time Text Indexing in BWT-runs Bounded Space","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Gonzalo Navarro, Nicola Prezza, Travis Gagie","submitted_at":"2017-05-29T20:24:07Z","abstract_excerpt":"Indexing highly repetitive texts --- such as genomic databases, software repositories and versioned text collections --- has become an important problem since the turn of the millennium. A relevant compressibility measure for repetitive texts is $r$, the number of runs in their Burrows-Wheeler Transform (BWT). One of the earliest indexes for repetitive collections, the Run-Length FM-index, used $O(r)$ space and was able to efficiently count the number of occurrences of a pattern of length $m$ in the text (in loglogarithmic time per pattern symbol, with current techniques). However, it was unab"},"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":"1705.10382","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2017-05-29T20:24:07Z","cross_cats_sorted":[],"title_canon_sha256":"1bd51b79d383ae0f71a8a81564287e0c99593c5873983e8103511fcbaa5a4d93","abstract_canon_sha256":"b5f134394fc271313d42e18fe2b4e334c4f6da72707eb8503cc65e18bc939c17"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:40:28.320867Z","signature_b64":"uIyMeovGki/DJQsTk5+/YeXTA0gEFKAKVfLCZxkqK8/ySYNzb9mIpDdBzlSUCaRRuYP8EZWzFIgHDrtBydLqDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"a6dd2b6100bfb869d33e09024657afa632fb529011163fd5fe83ed022911c1af","last_reissued_at":"2026-05-18T00:40:28.320279Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:40:28.320279Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Optimal-Time Text Indexing in BWT-runs Bounded Space","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Gonzalo Navarro, Nicola Prezza, Travis Gagie","submitted_at":"2017-05-29T20:24:07Z","abstract_excerpt":"Indexing highly repetitive texts --- such as genomic databases, software repositories and versioned text collections --- has become an important problem since the turn of the millennium. A relevant compressibility measure for repetitive texts is $r$, the number of runs in their Burrows-Wheeler Transform (BWT). One of the earliest indexes for repetitive collections, the Run-Length FM-index, used $O(r)$ space and was able to efficiently count the number of occurrences of a pattern of length $m$ in the text (in loglogarithmic time per pattern symbol, with current techniques). However, it was unab"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1705.10382","kind":"arxiv","version":4},"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":"1705.10382","created_at":"2026-05-18T00:40:28.320371+00:00"},{"alias_kind":"arxiv_version","alias_value":"1705.10382v4","created_at":"2026-05-18T00:40:28.320371+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1705.10382","created_at":"2026-05-18T00:40:28.320371+00:00"},{"alias_kind":"pith_short_12","alias_value":"U3OSWYIAX64G","created_at":"2026-05-18T12:31:46.661854+00:00"},{"alias_kind":"pith_short_16","alias_value":"U3OSWYIAX64GTUZ6","created_at":"2026-05-18T12:31:46.661854+00:00"},{"alias_kind":"pith_short_8","alias_value":"U3OSWYIA","created_at":"2026-05-18T12:31:46.661854+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/U3OSWYIAX64GTUZ6BEBEMV5PUY","json":"https://pith.science/pith/U3OSWYIAX64GTUZ6BEBEMV5PUY.json","graph_json":"https://pith.science/api/pith-number/U3OSWYIAX64GTUZ6BEBEMV5PUY/graph.json","events_json":"https://pith.science/api/pith-number/U3OSWYIAX64GTUZ6BEBEMV5PUY/events.json","paper":"https://pith.science/paper/U3OSWYIA"},"agent_actions":{"view_html":"https://pith.science/pith/U3OSWYIAX64GTUZ6BEBEMV5PUY","download_json":"https://pith.science/pith/U3OSWYIAX64GTUZ6BEBEMV5PUY.json","view_paper":"https://pith.science/paper/U3OSWYIA","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1705.10382&json=true","fetch_graph":"https://pith.science/api/pith-number/U3OSWYIAX64GTUZ6BEBEMV5PUY/graph.json","fetch_events":"https://pith.science/api/pith-number/U3OSWYIAX64GTUZ6BEBEMV5PUY/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/U3OSWYIAX64GTUZ6BEBEMV5PUY/action/timestamp_anchor","attest_storage":"https://pith.science/pith/U3OSWYIAX64GTUZ6BEBEMV5PUY/action/storage_attestation","attest_author":"https://pith.science/pith/U3OSWYIAX64GTUZ6BEBEMV5PUY/action/author_attestation","sign_citation":"https://pith.science/pith/U3OSWYIAX64GTUZ6BEBEMV5PUY/action/citation_signature","submit_replication":"https://pith.science/pith/U3OSWYIAX64GTUZ6BEBEMV5PUY/action/replication_record"}},"created_at":"2026-05-18T00:40:28.320371+00:00","updated_at":"2026-05-18T00:40:28.320371+00:00"}