{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2011:I37RRBVF3HBE54G4DZEQUAQT5A","short_pith_number":"pith:I37RRBVF","canonical_record":{"source":{"id":"1111.2621","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2011-11-10T21:51:27Z","cross_cats_sorted":[],"title_canon_sha256":"ca09e477c23946e5ea9bb59a0d2e2030c54cd8e40a3686e10c2007485b4f8ec8","abstract_canon_sha256":"cc6efd16ff226a1bb52c92ea566767771b97729c8c6292ef55a685d6cdf64734"},"schema_version":"1.0"},"canonical_sha256":"46ff1886a5d9c24ef0dc1e490a0213e8191858cfd1d411f0cdc6791877f39db4","source":{"kind":"arxiv","id":"1111.2621","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1111.2621","created_at":"2026-05-18T03:15:18Z"},{"alias_kind":"arxiv_version","alias_value":"1111.2621v2","created_at":"2026-05-18T03:15:18Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1111.2621","created_at":"2026-05-18T03:15:18Z"},{"alias_kind":"pith_short_12","alias_value":"I37RRBVF3HBE","created_at":"2026-05-18T12:26:30Z"},{"alias_kind":"pith_short_16","alias_value":"I37RRBVF3HBE54G4","created_at":"2026-05-18T12:26:30Z"},{"alias_kind":"pith_short_8","alias_value":"I37RRBVF","created_at":"2026-05-18T12:26:30Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2011:I37RRBVF3HBE54G4DZEQUAQT5A","target":"record","payload":{"canonical_record":{"source":{"id":"1111.2621","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2011-11-10T21:51:27Z","cross_cats_sorted":[],"title_canon_sha256":"ca09e477c23946e5ea9bb59a0d2e2030c54cd8e40a3686e10c2007485b4f8ec8","abstract_canon_sha256":"cc6efd16ff226a1bb52c92ea566767771b97729c8c6292ef55a685d6cdf64734"},"schema_version":"1.0"},"canonical_sha256":"46ff1886a5d9c24ef0dc1e490a0213e8191858cfd1d411f0cdc6791877f39db4","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:15:18.928995Z","signature_b64":"gz4oxvg8M4yTtFfWnpm6gMnW621Uy7uXhozhh3z0IR24ik5HGpi5165PHs/NoCl5gtmk44lgdMxLhs/7PSYAAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"46ff1886a5d9c24ef0dc1e490a0213e8191858cfd1d411f0cdc6791877f39db4","last_reissued_at":"2026-05-18T03:15:18.928167Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:15:18.928167Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1111.2621","source_version":2,"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-18T03:15:18Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"gOLpPPGzDsAPP4SMmbFxYZ27X9au1lkdw8mf/qlHWpbusq4OThUosnzDw1KBLCBdfjKKzU0Q3DWbn9LP3AGiBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-11T07:02:35.857484Z"},"content_sha256":"6684559d662ac549c1e5411e3b9a2c39d015ff8d35af0658c4fa74bbab3a8f1c","schema_version":"1.0","event_id":"sha256:6684559d662ac549c1e5411e3b9a2c39d015ff8d35af0658c4fa74bbab3a8f1c"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2011:I37RRBVF3HBE54G4DZEQUAQT5A","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Optimal Lower and Upper Bounds for Representing Sequences","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Djamal Belazzougui, Gonzalo Navarro","submitted_at":"2011-11-10T21:51:27Z","abstract_excerpt":"Sequence representations supporting queries $access$, $select$ and $rank$ are at the core of many data structures. There is a considerable gap between the various upper bounds and the few lower bounds known for such representations, and how they relate to the space used. In this article we prove a strong lower bound for $rank$, which holds for rather permissive assumptions on the space used, and give matching upper bounds that require only a compressed representation of the sequence. Within this compressed space, operations $access$ and $select$ can be solved in constant or almost-constant tim"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1111.2621","kind":"arxiv","version":2},"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-18T03:15:18Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"rn5z9NKHJy7aw+34KgpwDudvTlEFa9eVKLyEw/vAK0QbTUGZky7di3gqg55c1KhqM6MqFnEv+VK47AqdiOdLAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-11T07:02:35.858215Z"},"content_sha256":"13899f27c62aab39c0d0b2f3954ee0494fa7fc5d8527b5050f9874e9476fb144","schema_version":"1.0","event_id":"sha256:13899f27c62aab39c0d0b2f3954ee0494fa7fc5d8527b5050f9874e9476fb144"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/I37RRBVF3HBE54G4DZEQUAQT5A/bundle.json","state_url":"https://pith.science/pith/I37RRBVF3HBE54G4DZEQUAQT5A/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/I37RRBVF3HBE54G4DZEQUAQT5A/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-06-11T07:02:35Z","links":{"resolver":"https://pith.science/pith/I37RRBVF3HBE54G4DZEQUAQT5A","bundle":"https://pith.science/pith/I37RRBVF3HBE54G4DZEQUAQT5A/bundle.json","state":"https://pith.science/pith/I37RRBVF3HBE54G4DZEQUAQT5A/state.json","well_known_bundle":"https://pith.science/.well-known/pith/I37RRBVF3HBE54G4DZEQUAQT5A/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2011:I37RRBVF3HBE54G4DZEQUAQT5A","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":"cc6efd16ff226a1bb52c92ea566767771b97729c8c6292ef55a685d6cdf64734","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2011-11-10T21:51:27Z","title_canon_sha256":"ca09e477c23946e5ea9bb59a0d2e2030c54cd8e40a3686e10c2007485b4f8ec8"},"schema_version":"1.0","source":{"id":"1111.2621","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1111.2621","created_at":"2026-05-18T03:15:18Z"},{"alias_kind":"arxiv_version","alias_value":"1111.2621v2","created_at":"2026-05-18T03:15:18Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1111.2621","created_at":"2026-05-18T03:15:18Z"},{"alias_kind":"pith_short_12","alias_value":"I37RRBVF3HBE","created_at":"2026-05-18T12:26:30Z"},{"alias_kind":"pith_short_16","alias_value":"I37RRBVF3HBE54G4","created_at":"2026-05-18T12:26:30Z"},{"alias_kind":"pith_short_8","alias_value":"I37RRBVF","created_at":"2026-05-18T12:26:30Z"}],"graph_snapshots":[{"event_id":"sha256:13899f27c62aab39c0d0b2f3954ee0494fa7fc5d8527b5050f9874e9476fb144","target":"graph","created_at":"2026-05-18T03:15:18Z","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":"Sequence representations supporting queries $access$, $select$ and $rank$ are at the core of many data structures. There is a considerable gap between the various upper bounds and the few lower bounds known for such representations, and how they relate to the space used. In this article we prove a strong lower bound for $rank$, which holds for rather permissive assumptions on the space used, and give matching upper bounds that require only a compressed representation of the sequence. Within this compressed space, operations $access$ and $select$ can be solved in constant or almost-constant tim","authors_text":"Djamal Belazzougui, Gonzalo Navarro","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2011-11-10T21:51:27Z","title":"Optimal Lower and Upper Bounds for Representing Sequences"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1111.2621","kind":"arxiv","version":2},"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:6684559d662ac549c1e5411e3b9a2c39d015ff8d35af0658c4fa74bbab3a8f1c","target":"record","created_at":"2026-05-18T03:15:18Z","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":"cc6efd16ff226a1bb52c92ea566767771b97729c8c6292ef55a685d6cdf64734","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2011-11-10T21:51:27Z","title_canon_sha256":"ca09e477c23946e5ea9bb59a0d2e2030c54cd8e40a3686e10c2007485b4f8ec8"},"schema_version":"1.0","source":{"id":"1111.2621","kind":"arxiv","version":2}},"canonical_sha256":"46ff1886a5d9c24ef0dc1e490a0213e8191858cfd1d411f0cdc6791877f39db4","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"46ff1886a5d9c24ef0dc1e490a0213e8191858cfd1d411f0cdc6791877f39db4","first_computed_at":"2026-05-18T03:15:18.928167Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:15:18.928167Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"gz4oxvg8M4yTtFfWnpm6gMnW621Uy7uXhozhh3z0IR24ik5HGpi5165PHs/NoCl5gtmk44lgdMxLhs/7PSYAAQ==","signature_status":"signed_v1","signed_at":"2026-05-18T03:15:18.928995Z","signed_message":"canonical_sha256_bytes"},"source_id":"1111.2621","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:6684559d662ac549c1e5411e3b9a2c39d015ff8d35af0658c4fa74bbab3a8f1c","sha256:13899f27c62aab39c0d0b2f3954ee0494fa7fc5d8527b5050f9874e9476fb144"],"state_sha256":"67522148921b36fdaaddf762e15eec1ebc1133d177441960693a0adb2c5020da"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"D6N5WNbI2PuoIBrZd1b3BVpGt6vakODWyDkAdc465zRAMmqgBrn3GC7ViHKn2AzomWBl6/T1CoVPB6eFegJbCw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-11T07:02:35.862787Z","bundle_sha256":"6903ab328c5159e641496390378bed32392d9681b8aa1661c596592ad90bf4e0"}}