{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2007:ZSFAQRWA43UOFQLJ67Z36CLOYQ","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":"984077014589ddbb23d397c9112d0fc940a98d14f2afe5df9ab87681adb8c195","cross_cats_sorted":["cs.DM","cs.IT","math.IT"],"license":"","primary_cat":"cs.DS","submitted_at":"2007-05-04T07:47:05Z","title_canon_sha256":"8b7baa038ab8668897b11ccf15f5aa03b1b0542d00c5a66510082049b1e1b32d"},"schema_version":"1.0","source":{"id":"0705.0552","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"0705.0552","created_at":"2026-05-18T04:15:59Z"},{"alias_kind":"arxiv_version","alias_value":"0705.0552v1","created_at":"2026-05-18T04:15:59Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.0705.0552","created_at":"2026-05-18T04:15:59Z"},{"alias_kind":"pith_short_12","alias_value":"ZSFAQRWA43UO","created_at":"2026-05-18T12:25:56Z"},{"alias_kind":"pith_short_16","alias_value":"ZSFAQRWA43UOFQLJ","created_at":"2026-05-18T12:25:56Z"},{"alias_kind":"pith_short_8","alias_value":"ZSFAQRWA","created_at":"2026-05-18T12:25:56Z"}],"graph_snapshots":[{"event_id":"sha256:3ecf40444899f3a8bc086735005a2b6320134e882b9ee16484991c0bf7d98002","target":"graph","created_at":"2026-05-18T04:15:59Z","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 consider the {\\it indexable dictionary} problem, which consists of storing a set $S \\subseteq \\{0,...,m-1\\}$ for some integer $m$, while supporting the operations of $\\Rank(x)$, which returns the number of elements in $S$ that are less than $x$ if $x \\in S$, and -1 otherwise; and $\\Select(i)$ which returns the $i$-th smallest element in $S$. We give a data structure that supports both operations in O(1) time on the RAM model and requires ${\\cal B}(n,m) + o(n) + O(\\lg \\lg m)$ bits to store a set of size $n$, where ${\\cal B}(n,m) = \\ceil{\\lg {m \\choose n}}$ is the minimum number of bits requi","authors_text":"Rajeev Raman, Srinivasa Rao Satti, Venkatesh Raman","cross_cats":["cs.DM","cs.IT","math.IT"],"headline":"","license":"","primary_cat":"cs.DS","submitted_at":"2007-05-04T07:47:05Z","title":"Succinct Indexable Dictionaries with Applications to Encoding $k$-ary Trees, Prefix Sums and Multisets"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"0705.0552","kind":"arxiv","version":1},"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:94e004466fb957c37b879117c587a88f242cd905940089592cf1a84624eaf8b3","target":"record","created_at":"2026-05-18T04:15:59Z","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":"984077014589ddbb23d397c9112d0fc940a98d14f2afe5df9ab87681adb8c195","cross_cats_sorted":["cs.DM","cs.IT","math.IT"],"license":"","primary_cat":"cs.DS","submitted_at":"2007-05-04T07:47:05Z","title_canon_sha256":"8b7baa038ab8668897b11ccf15f5aa03b1b0542d00c5a66510082049b1e1b32d"},"schema_version":"1.0","source":{"id":"0705.0552","kind":"arxiv","version":1}},"canonical_sha256":"cc8a0846c0e6e8e2c169f7f3bf096ec40346246747e931818da5f7e6c8621284","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"cc8a0846c0e6e8e2c169f7f3bf096ec40346246747e931818da5f7e6c8621284","first_computed_at":"2026-05-18T04:15:59.765110Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T04:15:59.765110Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"I5aih85thcOPsRRNufdqp7hFMfentCM4rtF6UrEv3mnl2ezX1hjFkZzyuD7glqQMfRBfk3Jm0ZzO9YxZ0OlGBg==","signature_status":"signed_v1","signed_at":"2026-05-18T04:15:59.765732Z","signed_message":"canonical_sha256_bytes"},"source_id":"0705.0552","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:94e004466fb957c37b879117c587a88f242cd905940089592cf1a84624eaf8b3","sha256:3ecf40444899f3a8bc086735005a2b6320134e882b9ee16484991c0bf7d98002"],"state_sha256":"db8439001e9fef1855b26899de612846955f3fbc88172914942dececeab49e1a"}