{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:IDAQDWF4FEQTWRZGRL42VCFMZO","short_pith_number":"pith:IDAQDWF4","canonical_record":{"source":{"id":"1711.02910","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2017-11-08T12:01:47Z","cross_cats_sorted":[],"title_canon_sha256":"4db63b39f002cbe300a1f5a86831ac6c7d1996868ae09e66723baa5cacdefdee","abstract_canon_sha256":"784801f51d786c98d4c49a54d577c3051192076606db93e93dd6246bd91fc00a"},"schema_version":"1.0"},"canonical_sha256":"40c101d8bc29213b47268af9aa88accb982ed03f54b71e4a3052224a868f2a68","source":{"kind":"arxiv","id":"1711.02910","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1711.02910","created_at":"2026-05-18T00:22:39Z"},{"alias_kind":"arxiv_version","alias_value":"1711.02910v3","created_at":"2026-05-18T00:22:39Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1711.02910","created_at":"2026-05-18T00:22:39Z"},{"alias_kind":"pith_short_12","alias_value":"IDAQDWF4FEQT","created_at":"2026-05-18T12:31:21Z"},{"alias_kind":"pith_short_16","alias_value":"IDAQDWF4FEQTWRZG","created_at":"2026-05-18T12:31:21Z"},{"alias_kind":"pith_short_8","alias_value":"IDAQDWF4","created_at":"2026-05-18T12:31:21Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:IDAQDWF4FEQTWRZGRL42VCFMZO","target":"record","payload":{"canonical_record":{"source":{"id":"1711.02910","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2017-11-08T12:01:47Z","cross_cats_sorted":[],"title_canon_sha256":"4db63b39f002cbe300a1f5a86831ac6c7d1996868ae09e66723baa5cacdefdee","abstract_canon_sha256":"784801f51d786c98d4c49a54d577c3051192076606db93e93dd6246bd91fc00a"},"schema_version":"1.0"},"canonical_sha256":"40c101d8bc29213b47268af9aa88accb982ed03f54b71e4a3052224a868f2a68","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:22:39.237359Z","signature_b64":"SN35I9uZZxy5lsrsGH0V1zEBOe+CUD5guINCuduvb146M5cUTieT0E6rVLY3ir4Wc4/p6Ea8T3u11LxIe3zKAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"40c101d8bc29213b47268af9aa88accb982ed03f54b71e4a3052224a868f2a68","last_reissued_at":"2026-05-18T00:22:39.237001Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:22:39.237001Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1711.02910","source_version":3,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T00:22:39Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"6hj/99DCcd2JpR8tIf7u1YkbnoxFnMGEPghFwGHLyPExOqzXZsMT9sfyc965XElBtYjMbxRjGqkt8s+Y7IKhAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T07:00:14.379087Z"},"content_sha256":"4dbc008bdee419d87012db02593043e54001f65f2d2a4318336b6535a070ed00","schema_version":"1.0","event_id":"sha256:4dbc008bdee419d87012db02593043e54001f65f2d2a4318336b6535a070ed00"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:IDAQDWF4FEQTWRZGRL42VCFMZO","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Run Compressed Rank/Select for Large Alphabets","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Dmitry Kosolobov, Jos\\'e Fuentes-Sep\\'ulveda, Juha K\\\"arkk\\\"ainen, Simon J. Puglisi","submitted_at":"2017-11-08T12:01:47Z","abstract_excerpt":"Given a string of length $n$ that is composed of $r$ runs of letters from the alphabet $\\{0,1,\\ldots,\\sigma{-}1\\}$ such that $2 \\le \\sigma \\le r$, we describe a data structure that, provided $r \\le n / \\log^{\\omega(1)} n$, stores the string in $r\\log\\frac{n\\sigma}{r} + o(r\\log\\frac{n\\sigma}{r})$ bits and supports select and access queries in $O(\\log\\frac{\\log(n/r)}{\\log\\log n})$ time and rank queries in $O(\\log\\frac{\\log(n\\sigma/r)}{\\log\\log n})$ time. We show that $r\\log\\frac{n(\\sigma-1)}{r} - O(\\log\\frac{n}{r})$ bits are necessary for any such data structure and, thus, our solution is succin"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1711.02910","kind":"arxiv","version":3},"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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T00:22:39Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"QmNCZy2Uu1jTG5LycGF4CxPr7+7AQGrZTVdz111N9cykeGqYubD8ZT2som3B4jksFhy+XDmelp13B40brEhtAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T07:00:14.379945Z"},"content_sha256":"dc66999f586c405819a27e6703ea2f2d592aa8f11f78a939f43c380fe66b2728","schema_version":"1.0","event_id":"sha256:dc66999f586c405819a27e6703ea2f2d592aa8f11f78a939f43c380fe66b2728"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/IDAQDWF4FEQTWRZGRL42VCFMZO/bundle.json","state_url":"https://pith.science/pith/IDAQDWF4FEQTWRZGRL42VCFMZO/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/IDAQDWF4FEQTWRZGRL42VCFMZO/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-05-27T07:00:14Z","links":{"resolver":"https://pith.science/pith/IDAQDWF4FEQTWRZGRL42VCFMZO","bundle":"https://pith.science/pith/IDAQDWF4FEQTWRZGRL42VCFMZO/bundle.json","state":"https://pith.science/pith/IDAQDWF4FEQTWRZGRL42VCFMZO/state.json","well_known_bundle":"https://pith.science/.well-known/pith/IDAQDWF4FEQTWRZGRL42VCFMZO/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:IDAQDWF4FEQTWRZGRL42VCFMZO","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":"784801f51d786c98d4c49a54d577c3051192076606db93e93dd6246bd91fc00a","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2017-11-08T12:01:47Z","title_canon_sha256":"4db63b39f002cbe300a1f5a86831ac6c7d1996868ae09e66723baa5cacdefdee"},"schema_version":"1.0","source":{"id":"1711.02910","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1711.02910","created_at":"2026-05-18T00:22:39Z"},{"alias_kind":"arxiv_version","alias_value":"1711.02910v3","created_at":"2026-05-18T00:22:39Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1711.02910","created_at":"2026-05-18T00:22:39Z"},{"alias_kind":"pith_short_12","alias_value":"IDAQDWF4FEQT","created_at":"2026-05-18T12:31:21Z"},{"alias_kind":"pith_short_16","alias_value":"IDAQDWF4FEQTWRZG","created_at":"2026-05-18T12:31:21Z"},{"alias_kind":"pith_short_8","alias_value":"IDAQDWF4","created_at":"2026-05-18T12:31:21Z"}],"graph_snapshots":[{"event_id":"sha256:dc66999f586c405819a27e6703ea2f2d592aa8f11f78a939f43c380fe66b2728","target":"graph","created_at":"2026-05-18T00:22:39Z","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":"Given a string of length $n$ that is composed of $r$ runs of letters from the alphabet $\\{0,1,\\ldots,\\sigma{-}1\\}$ such that $2 \\le \\sigma \\le r$, we describe a data structure that, provided $r \\le n / \\log^{\\omega(1)} n$, stores the string in $r\\log\\frac{n\\sigma}{r} + o(r\\log\\frac{n\\sigma}{r})$ bits and supports select and access queries in $O(\\log\\frac{\\log(n/r)}{\\log\\log n})$ time and rank queries in $O(\\log\\frac{\\log(n\\sigma/r)}{\\log\\log n})$ time. We show that $r\\log\\frac{n(\\sigma-1)}{r} - O(\\log\\frac{n}{r})$ bits are necessary for any such data structure and, thus, our solution is succin","authors_text":"Dmitry Kosolobov, Jos\\'e Fuentes-Sep\\'ulveda, Juha K\\\"arkk\\\"ainen, Simon J. Puglisi","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2017-11-08T12:01:47Z","title":"Run Compressed Rank/Select for Large Alphabets"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1711.02910","kind":"arxiv","version":3},"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:4dbc008bdee419d87012db02593043e54001f65f2d2a4318336b6535a070ed00","target":"record","created_at":"2026-05-18T00:22:39Z","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":"784801f51d786c98d4c49a54d577c3051192076606db93e93dd6246bd91fc00a","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2017-11-08T12:01:47Z","title_canon_sha256":"4db63b39f002cbe300a1f5a86831ac6c7d1996868ae09e66723baa5cacdefdee"},"schema_version":"1.0","source":{"id":"1711.02910","kind":"arxiv","version":3}},"canonical_sha256":"40c101d8bc29213b47268af9aa88accb982ed03f54b71e4a3052224a868f2a68","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"40c101d8bc29213b47268af9aa88accb982ed03f54b71e4a3052224a868f2a68","first_computed_at":"2026-05-18T00:22:39.237001Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:22:39.237001Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"SN35I9uZZxy5lsrsGH0V1zEBOe+CUD5guINCuduvb146M5cUTieT0E6rVLY3ir4Wc4/p6Ea8T3u11LxIe3zKAg==","signature_status":"signed_v1","signed_at":"2026-05-18T00:22:39.237359Z","signed_message":"canonical_sha256_bytes"},"source_id":"1711.02910","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:4dbc008bdee419d87012db02593043e54001f65f2d2a4318336b6535a070ed00","sha256:dc66999f586c405819a27e6703ea2f2d592aa8f11f78a939f43c380fe66b2728"],"state_sha256":"af449a95235402cd427f751ec868910b2a68806dc7f8e9b07b7e8cb16cfbef21"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"9pi/jJIskiQuyOxHIWHmT03fNmmvxMH6eVhvsLyt7mU0Rh5bn8hg6gqITvDIf4z343NmAqIrbrBfPe2mulIYBw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-27T07:00:14.383900Z","bundle_sha256":"7d0884412d871fcdbc577044e835d0906f8e8ae1cced878a73b17ee1be1cf39c"}}