{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2009:L3ZLL5ZS7NVENCMNRBUWDJNR3I","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"07f90c83bd72d44242e6b84dafbf26d0086ca1b6cbcc05214e607f8fe09c3540","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2009-11-25T23:31:23Z","title_canon_sha256":"b986c5b1f2abaab43478d058d80db61e36501a8eabbfd7f9635f35bdd3719024"},"schema_version":"1.0","source":{"id":"0911.4981","kind":"arxiv","version":4}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"0911.4981","created_at":"2026-05-18T03:58:51Z"},{"alias_kind":"arxiv_version","alias_value":"0911.4981v4","created_at":"2026-05-18T03:58:51Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.0911.4981","created_at":"2026-05-18T03:58:51Z"},{"alias_kind":"pith_short_12","alias_value":"L3ZLL5ZS7NVE","created_at":"2026-05-18T12:26:00Z"},{"alias_kind":"pith_short_16","alias_value":"L3ZLL5ZS7NVENCMN","created_at":"2026-05-18T12:26:00Z"},{"alias_kind":"pith_short_8","alias_value":"L3ZLL5ZS","created_at":"2026-05-18T12:26:00Z"}],"graph_snapshots":[{"event_id":"sha256:6672356a620b04bf6ad771cc959e3fbbfc82e026cfa79df76632370efbfd2fd1","target":"graph","created_at":"2026-05-18T03:58:51Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"paper":{"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","authors_text":"Francisco Claude, Gonzalo Navarro, Jeremy Barbay, Travis Gagie, Yakov Nekrich","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2009-11-25T23:31:23Z","title":"Efficient Fully-Compressed Sequence Representations"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"0911.4981","kind":"arxiv","version":4},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:1adef3e3e4d3507854c6051509025783eafd32fe0bc9c0211772fdf8030acafb","target":"record","created_at":"2026-05-18T03:58:51Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"07f90c83bd72d44242e6b84dafbf26d0086ca1b6cbcc05214e607f8fe09c3540","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2009-11-25T23:31:23Z","title_canon_sha256":"b986c5b1f2abaab43478d058d80db61e36501a8eabbfd7f9635f35bdd3719024"},"schema_version":"1.0","source":{"id":"0911.4981","kind":"arxiv","version":4}},"canonical_sha256":"5ef2b5f732fb6a46898d886961a5b1da1a0f828d2334d616c51b884e5038aa73","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"5ef2b5f732fb6a46898d886961a5b1da1a0f828d2334d616c51b884e5038aa73","first_computed_at":"2026-05-18T03:58:51.871390Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:58:51.871390Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"AjD2jkWpoS9W2L5omc6L8NcVe5Tvdzk+t+rkujG4O60Nn/GB3ZDUQNsWRrJdslZLlNChtJ6ZZe6/UKrSYS+/Bg==","signature_status":"signed_v1","signed_at":"2026-05-18T03:58:51.872100Z","signed_message":"canonical_sha256_bytes"},"source_id":"0911.4981","source_kind":"arxiv","source_version":4}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:1adef3e3e4d3507854c6051509025783eafd32fe0bc9c0211772fdf8030acafb","sha256:6672356a620b04bf6ad771cc959e3fbbfc82e026cfa79df76632370efbfd2fd1"],"state_sha256":"dc819bcde11589c542abf056d60ad907137970b98987235224d384db2d2f84ec"}