{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2019:RYLETVIOKA2KI25U7PZYXLNW3F","short_pith_number":"pith:RYLETVIO","canonical_record":{"source":{"id":"1903.02533","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2019-03-06T18:13:33Z","cross_cats_sorted":[],"title_canon_sha256":"8bcfa7c86c04df00f7bc03b28c5cd83b07bab24c62b5ac7b771eded8c8b48d97","abstract_canon_sha256":"0cdd7d0bca95c370b9bfef852513b648564b0771240a85144c5a5b0b480dcfd7"},"schema_version":"1.0"},"canonical_sha256":"8e1649d50e5034a46bb4fbf38badb6d978399ab57b486c3d42bfaaa464d8bef6","source":{"kind":"arxiv","id":"1903.02533","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1903.02533","created_at":"2026-05-17T23:51:55Z"},{"alias_kind":"arxiv_version","alias_value":"1903.02533v1","created_at":"2026-05-17T23:51:55Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1903.02533","created_at":"2026-05-17T23:51:55Z"},{"alias_kind":"pith_short_12","alias_value":"RYLETVIOKA2K","created_at":"2026-05-18T12:33:27Z"},{"alias_kind":"pith_short_16","alias_value":"RYLETVIOKA2KI25U","created_at":"2026-05-18T12:33:27Z"},{"alias_kind":"pith_short_8","alias_value":"RYLETVIO","created_at":"2026-05-18T12:33:27Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2019:RYLETVIOKA2KI25U7PZYXLNW3F","target":"record","payload":{"canonical_record":{"source":{"id":"1903.02533","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2019-03-06T18:13:33Z","cross_cats_sorted":[],"title_canon_sha256":"8bcfa7c86c04df00f7bc03b28c5cd83b07bab24c62b5ac7b771eded8c8b48d97","abstract_canon_sha256":"0cdd7d0bca95c370b9bfef852513b648564b0771240a85144c5a5b0b480dcfd7"},"schema_version":"1.0"},"canonical_sha256":"8e1649d50e5034a46bb4fbf38badb6d978399ab57b486c3d42bfaaa464d8bef6","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:51:55.130228Z","signature_b64":"/CGIXh/bIrMkVgh3hq7mkF9DH4j5UtcP563cwaPqrQNI+chLAruZ9vtXaH/afKZn2QIZR8H493dqPhemYwFIDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"8e1649d50e5034a46bb4fbf38badb6d978399ab57b486c3d42bfaaa464d8bef6","last_reissued_at":"2026-05-17T23:51:55.129733Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:51:55.129733Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1903.02533","source_version":1,"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-17T23:51:55Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"nWD1oOmiaMTX02FQgu9IXB7WziS2CCcWdhMY13ESFhCYvy1FbKJHjOaDCxlZiNUjnTpmr5saN3t+mZYmStriBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T01:42:21.075139Z"},"content_sha256":"53134179b057beb649c08cb00c04e8e56b1f17004e6dc2c51d2b30b6d9c10c4c","schema_version":"1.0","event_id":"sha256:53134179b057beb649c08cb00c04e8e56b1f17004e6dc2c51d2b30b6d9c10c4c"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2019:RYLETVIOKA2KI25U7PZYXLNW3F","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Entropy Trees and Range-Minimum Queries In Optimal Average-Case Space","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"J. Ian Munro, Sebastian Wild","submitted_at":"2019-03-06T18:13:33Z","abstract_excerpt":"The range-minimum query (RMQ) problem is a fundamental data structuring task with numerous applications. Despite the fact that succinct solutions with worst-case optimal $2n+o(n)$ bits of space and constant query time are known, it has been unknown whether such a data structure can be made adaptive to the reduced entropy of random inputs (Davoodi et al. 2014). We construct a succinct data structure with the optimal $1.736n+o(n)$ bits of space on average for random RMQ instances, settling this open problem.\n  Our solution relies on a compressed data structure for binary trees that is of indepen"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1903.02533","kind":"arxiv","version":1},"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-17T23:51:55Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"hCifW7DsSHc9Pna8Mj6Ln08b+rzNZUqfVMrdUP3LaKKGv55vZGzNeZD/Eg5lPONx1qJyux7R4/HsqkVQyR44BA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T01:42:21.075518Z"},"content_sha256":"22a92d741dd481d14264aef0a05499119b725cc3d429bbec3865382eb4b22bca","schema_version":"1.0","event_id":"sha256:22a92d741dd481d14264aef0a05499119b725cc3d429bbec3865382eb4b22bca"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/RYLETVIOKA2KI25U7PZYXLNW3F/bundle.json","state_url":"https://pith.science/pith/RYLETVIOKA2KI25U7PZYXLNW3F/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/RYLETVIOKA2KI25U7PZYXLNW3F/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-28T01:42:21Z","links":{"resolver":"https://pith.science/pith/RYLETVIOKA2KI25U7PZYXLNW3F","bundle":"https://pith.science/pith/RYLETVIOKA2KI25U7PZYXLNW3F/bundle.json","state":"https://pith.science/pith/RYLETVIOKA2KI25U7PZYXLNW3F/state.json","well_known_bundle":"https://pith.science/.well-known/pith/RYLETVIOKA2KI25U7PZYXLNW3F/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2019:RYLETVIOKA2KI25U7PZYXLNW3F","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":"0cdd7d0bca95c370b9bfef852513b648564b0771240a85144c5a5b0b480dcfd7","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2019-03-06T18:13:33Z","title_canon_sha256":"8bcfa7c86c04df00f7bc03b28c5cd83b07bab24c62b5ac7b771eded8c8b48d97"},"schema_version":"1.0","source":{"id":"1903.02533","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1903.02533","created_at":"2026-05-17T23:51:55Z"},{"alias_kind":"arxiv_version","alias_value":"1903.02533v1","created_at":"2026-05-17T23:51:55Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1903.02533","created_at":"2026-05-17T23:51:55Z"},{"alias_kind":"pith_short_12","alias_value":"RYLETVIOKA2K","created_at":"2026-05-18T12:33:27Z"},{"alias_kind":"pith_short_16","alias_value":"RYLETVIOKA2KI25U","created_at":"2026-05-18T12:33:27Z"},{"alias_kind":"pith_short_8","alias_value":"RYLETVIO","created_at":"2026-05-18T12:33:27Z"}],"graph_snapshots":[{"event_id":"sha256:22a92d741dd481d14264aef0a05499119b725cc3d429bbec3865382eb4b22bca","target":"graph","created_at":"2026-05-17T23:51:55Z","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":"The range-minimum query (RMQ) problem is a fundamental data structuring task with numerous applications. Despite the fact that succinct solutions with worst-case optimal $2n+o(n)$ bits of space and constant query time are known, it has been unknown whether such a data structure can be made adaptive to the reduced entropy of random inputs (Davoodi et al. 2014). We construct a succinct data structure with the optimal $1.736n+o(n)$ bits of space on average for random RMQ instances, settling this open problem.\n  Our solution relies on a compressed data structure for binary trees that is of indepen","authors_text":"J. Ian Munro, Sebastian Wild","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2019-03-06T18:13:33Z","title":"Entropy Trees and Range-Minimum Queries In Optimal Average-Case Space"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1903.02533","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:53134179b057beb649c08cb00c04e8e56b1f17004e6dc2c51d2b30b6d9c10c4c","target":"record","created_at":"2026-05-17T23:51:55Z","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":"0cdd7d0bca95c370b9bfef852513b648564b0771240a85144c5a5b0b480dcfd7","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2019-03-06T18:13:33Z","title_canon_sha256":"8bcfa7c86c04df00f7bc03b28c5cd83b07bab24c62b5ac7b771eded8c8b48d97"},"schema_version":"1.0","source":{"id":"1903.02533","kind":"arxiv","version":1}},"canonical_sha256":"8e1649d50e5034a46bb4fbf38badb6d978399ab57b486c3d42bfaaa464d8bef6","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"8e1649d50e5034a46bb4fbf38badb6d978399ab57b486c3d42bfaaa464d8bef6","first_computed_at":"2026-05-17T23:51:55.129733Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:51:55.129733Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"/CGIXh/bIrMkVgh3hq7mkF9DH4j5UtcP563cwaPqrQNI+chLAruZ9vtXaH/afKZn2QIZR8H493dqPhemYwFIDQ==","signature_status":"signed_v1","signed_at":"2026-05-17T23:51:55.130228Z","signed_message":"canonical_sha256_bytes"},"source_id":"1903.02533","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:53134179b057beb649c08cb00c04e8e56b1f17004e6dc2c51d2b30b6d9c10c4c","sha256:22a92d741dd481d14264aef0a05499119b725cc3d429bbec3865382eb4b22bca"],"state_sha256":"9e8456539c08cbd1e103a7843d24a4a2c54b7889a21c03ca9f289404f2cf895f"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"peNTecDf7Qm2gJX+pw6OLQTkJ7z2Mnw25xyo9/Lhtpptw1R9tW1btTkudywoRDX4oK164iz+OSR1l5J3W/q/DQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-28T01:42:21.077566Z","bundle_sha256":"21e23b045af4ef1246dcb481236e33f769ceca4141e04ed7cc7f8e6e2c5ffa1c"}}