{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2009:L3ZLL5ZS7NVENCMNRBUWDJNR3I","short_pith_number":"pith:L3ZLL5ZS","schema_version":"1.0","canonical_sha256":"5ef2b5f732fb6a46898d886961a5b1da1a0f828d2334d616c51b884e5038aa73","source":{"kind":"arxiv","id":"0911.4981","version":4},"attestation_state":"computed","paper":{"title":"Efficient Fully-Compressed Sequence Representations","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Francisco Claude, Gonzalo Navarro, Jeremy Barbay, Travis Gagie, Yakov Nekrich","submitted_at":"2009-11-25T23:31:23Z","abstract_excerpt":"We present a data structure that stores a sequence $s[1..n]$ over alphabet $[1..\\sigma]$ in $n\\Ho(s) + o(n)(\\Ho(s){+}1)$ bits, where $\\Ho(s)$ is the zero-order entropy of $s$. This structure supports the queries \\access, \\rank\\ and \\select, which are fundamental building blocks for many other compressed data structures, in worst-case time $\\Oh{\\lg\\lg\\sigma}$ and average time $\\Oh{\\lg \\Ho(s)}$. The worst-case complexity matches the best previous results, yet these had been achieved with data structures using $n\\Ho(s)+o(n\\lg\\sigma)$ bits. On highly compressible sequences the $o(n\\lg\\sigma)$ bits"},"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":"0911.4981","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2009-11-25T23:31:23Z","cross_cats_sorted":[],"title_canon_sha256":"b986c5b1f2abaab43478d058d80db61e36501a8eabbfd7f9635f35bdd3719024","abstract_canon_sha256":"07f90c83bd72d44242e6b84dafbf26d0086ca1b6cbcc05214e607f8fe09c3540"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:58:51.872100Z","signature_b64":"AjD2jkWpoS9W2L5omc6L8NcVe5Tvdzk+t+rkujG4O60Nn/GB3ZDUQNsWRrJdslZLlNChtJ6ZZe6/UKrSYS+/Bg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"5ef2b5f732fb6a46898d886961a5b1da1a0f828d2334d616c51b884e5038aa73","last_reissued_at":"2026-05-18T03:58:51.871390Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:58:51.871390Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Efficient Fully-Compressed Sequence Representations","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Francisco Claude, Gonzalo Navarro, Jeremy Barbay, Travis Gagie, Yakov Nekrich","submitted_at":"2009-11-25T23:31:23Z","abstract_excerpt":"We present a data structure that stores a sequence $s[1..n]$ over alphabet $[1..\\sigma]$ in $n\\Ho(s) + o(n)(\\Ho(s){+}1)$ bits, where $\\Ho(s)$ is the zero-order entropy of $s$. This structure supports the queries \\access, \\rank\\ and \\select, which are fundamental building blocks for many other compressed data structures, in worst-case time $\\Oh{\\lg\\lg\\sigma}$ and average time $\\Oh{\\lg \\Ho(s)}$. The worst-case complexity matches the best previous results, yet these had been achieved with data structures using $n\\Ho(s)+o(n\\lg\\sigma)$ bits. On highly compressible sequences the $o(n\\lg\\sigma)$ bits"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"0911.4981","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":"0911.4981","created_at":"2026-05-18T03:58:51.871515+00:00"},{"alias_kind":"arxiv_version","alias_value":"0911.4981v4","created_at":"2026-05-18T03:58:51.871515+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.0911.4981","created_at":"2026-05-18T03:58:51.871515+00:00"},{"alias_kind":"pith_short_12","alias_value":"L3ZLL5ZS7NVE","created_at":"2026-05-18T12:26:00.592388+00:00"},{"alias_kind":"pith_short_16","alias_value":"L3ZLL5ZS7NVENCMN","created_at":"2026-05-18T12:26:00.592388+00:00"},{"alias_kind":"pith_short_8","alias_value":"L3ZLL5ZS","created_at":"2026-05-18T12:26:00.592388+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/L3ZLL5ZS7NVENCMNRBUWDJNR3I","json":"https://pith.science/pith/L3ZLL5ZS7NVENCMNRBUWDJNR3I.json","graph_json":"https://pith.science/api/pith-number/L3ZLL5ZS7NVENCMNRBUWDJNR3I/graph.json","events_json":"https://pith.science/api/pith-number/L3ZLL5ZS7NVENCMNRBUWDJNR3I/events.json","paper":"https://pith.science/paper/L3ZLL5ZS"},"agent_actions":{"view_html":"https://pith.science/pith/L3ZLL5ZS7NVENCMNRBUWDJNR3I","download_json":"https://pith.science/pith/L3ZLL5ZS7NVENCMNRBUWDJNR3I.json","view_paper":"https://pith.science/paper/L3ZLL5ZS","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=0911.4981&json=true","fetch_graph":"https://pith.science/api/pith-number/L3ZLL5ZS7NVENCMNRBUWDJNR3I/graph.json","fetch_events":"https://pith.science/api/pith-number/L3ZLL5ZS7NVENCMNRBUWDJNR3I/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/L3ZLL5ZS7NVENCMNRBUWDJNR3I/action/timestamp_anchor","attest_storage":"https://pith.science/pith/L3ZLL5ZS7NVENCMNRBUWDJNR3I/action/storage_attestation","attest_author":"https://pith.science/pith/L3ZLL5ZS7NVENCMNRBUWDJNR3I/action/author_attestation","sign_citation":"https://pith.science/pith/L3ZLL5ZS7NVENCMNRBUWDJNR3I/action/citation_signature","submit_replication":"https://pith.science/pith/L3ZLL5ZS7NVENCMNRBUWDJNR3I/action/replication_record"}},"created_at":"2026-05-18T03:58:51.871515+00:00","updated_at":"2026-05-18T03:58:51.871515+00:00"}