{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:HDQEFMTYTEBYOX5PQ6CI5AZPPE","short_pith_number":"pith:HDQEFMTY","canonical_record":{"source":{"id":"1612.07493","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2016-12-22T08:59:45Z","cross_cats_sorted":[],"title_canon_sha256":"741ed0fe8811a77e774386ae0273bdd36e0fec731833444457a33fbe0fb35258","abstract_canon_sha256":"1cb36c930d9bb9f3ecedb3bd3b13dbedb59e4dcd7b1c54e6aa9b7d14fa35b262"},"schema_version":"1.0"},"canonical_sha256":"38e042b2789903875faf87848e832f7921bee2b1ae177e49de246504d15767ea","source":{"kind":"arxiv","id":"1612.07493","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1612.07493","created_at":"2026-05-18T00:54:09Z"},{"alias_kind":"arxiv_version","alias_value":"1612.07493v1","created_at":"2026-05-18T00:54:09Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1612.07493","created_at":"2026-05-18T00:54:09Z"},{"alias_kind":"pith_short_12","alias_value":"HDQEFMTYTEBY","created_at":"2026-05-18T12:30:19Z"},{"alias_kind":"pith_short_16","alias_value":"HDQEFMTYTEBYOX5P","created_at":"2026-05-18T12:30:19Z"},{"alias_kind":"pith_short_8","alias_value":"HDQEFMTY","created_at":"2026-05-18T12:30:19Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:HDQEFMTYTEBYOX5PQ6CI5AZPPE","target":"record","payload":{"canonical_record":{"source":{"id":"1612.07493","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2016-12-22T08:59:45Z","cross_cats_sorted":[],"title_canon_sha256":"741ed0fe8811a77e774386ae0273bdd36e0fec731833444457a33fbe0fb35258","abstract_canon_sha256":"1cb36c930d9bb9f3ecedb3bd3b13dbedb59e4dcd7b1c54e6aa9b7d14fa35b262"},"schema_version":"1.0"},"canonical_sha256":"38e042b2789903875faf87848e832f7921bee2b1ae177e49de246504d15767ea","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:54:09.907008Z","signature_b64":"AjCzA8BwcxtKjvbtPuaH8tNQrFXC85zKGTSEmnAdX6Gn0lbyw/BFDtnMI0bPp4hdaTe41XB9LtSDWDo31L21Bg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"38e042b2789903875faf87848e832f7921bee2b1ae177e49de246504d15767ea","last_reissued_at":"2026-05-18T00:54:09.906615Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:54:09.906615Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1612.07493","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-18T00:54:09Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"mKvV9Gn9zm1JKsGn/EzKGYoZP7qfb/p4JiJ+Qil+A3w6hY91OcMhyvB0Z5iSpnUmm6XOzl9+4UbstWkMP2ywCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T01:37:50.148064Z"},"content_sha256":"5b21dd6a4c5526149ba1df13718204e73a818accbaf025f8505450a32bbbbf73","schema_version":"1.0","event_id":"sha256:5b21dd6a4c5526149ba1df13718204e73a818accbaf025f8505450a32bbbbf73"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:HDQEFMTYTEBYOX5PQ6CI5AZPPE","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Simultaneous encodings for range and next/previous larger/smaller value queries","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Seungbum Jo, Srinivasa Rao Satti","submitted_at":"2016-12-22T08:59:45Z","abstract_excerpt":"Given an array of $n$ elements from a total order, we propose encodings that support various range queries (range minimum, range maximum and their variants), and previous and next smaller/larger value queries. When query time is not of concern, we obtain a $4.088n + o(n)$-bit encoding that supports all these queries. For the case when we need to support all these queries in constant time, we give an encoding that takes $4.585n + o(n)$ bits, where $n$ is the length of input array. This improves the $5.08n+o(n)$-bit encoding obtained by encoding the colored $2d$-Min and Max heaps proposed by Fis"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1612.07493","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-18T00:54:09Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"yVoBDLjCgsezCU98TNb+HdXa3ocMsq4GSJqHi/3657G4xnOrLIB3bc9XcDE47C9QAiLl3iE2HAl5gjJBCgHNBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T01:37:50.148785Z"},"content_sha256":"2c8c9bd18d9a90d42aee26142943ddc1c4f9e2adc8017be622b726922188b2e5","schema_version":"1.0","event_id":"sha256:2c8c9bd18d9a90d42aee26142943ddc1c4f9e2adc8017be622b726922188b2e5"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/HDQEFMTYTEBYOX5PQ6CI5AZPPE/bundle.json","state_url":"https://pith.science/pith/HDQEFMTYTEBYOX5PQ6CI5AZPPE/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/HDQEFMTYTEBYOX5PQ6CI5AZPPE/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-30T01:37:50Z","links":{"resolver":"https://pith.science/pith/HDQEFMTYTEBYOX5PQ6CI5AZPPE","bundle":"https://pith.science/pith/HDQEFMTYTEBYOX5PQ6CI5AZPPE/bundle.json","state":"https://pith.science/pith/HDQEFMTYTEBYOX5PQ6CI5AZPPE/state.json","well_known_bundle":"https://pith.science/.well-known/pith/HDQEFMTYTEBYOX5PQ6CI5AZPPE/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:HDQEFMTYTEBYOX5PQ6CI5AZPPE","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":"1cb36c930d9bb9f3ecedb3bd3b13dbedb59e4dcd7b1c54e6aa9b7d14fa35b262","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2016-12-22T08:59:45Z","title_canon_sha256":"741ed0fe8811a77e774386ae0273bdd36e0fec731833444457a33fbe0fb35258"},"schema_version":"1.0","source":{"id":"1612.07493","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1612.07493","created_at":"2026-05-18T00:54:09Z"},{"alias_kind":"arxiv_version","alias_value":"1612.07493v1","created_at":"2026-05-18T00:54:09Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1612.07493","created_at":"2026-05-18T00:54:09Z"},{"alias_kind":"pith_short_12","alias_value":"HDQEFMTYTEBY","created_at":"2026-05-18T12:30:19Z"},{"alias_kind":"pith_short_16","alias_value":"HDQEFMTYTEBYOX5P","created_at":"2026-05-18T12:30:19Z"},{"alias_kind":"pith_short_8","alias_value":"HDQEFMTY","created_at":"2026-05-18T12:30:19Z"}],"graph_snapshots":[{"event_id":"sha256:2c8c9bd18d9a90d42aee26142943ddc1c4f9e2adc8017be622b726922188b2e5","target":"graph","created_at":"2026-05-18T00:54:09Z","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 an array of $n$ elements from a total order, we propose encodings that support various range queries (range minimum, range maximum and their variants), and previous and next smaller/larger value queries. When query time is not of concern, we obtain a $4.088n + o(n)$-bit encoding that supports all these queries. For the case when we need to support all these queries in constant time, we give an encoding that takes $4.585n + o(n)$ bits, where $n$ is the length of input array. This improves the $5.08n+o(n)$-bit encoding obtained by encoding the colored $2d$-Min and Max heaps proposed by Fis","authors_text":"Seungbum Jo, Srinivasa Rao Satti","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2016-12-22T08:59:45Z","title":"Simultaneous encodings for range and next/previous larger/smaller value queries"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1612.07493","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:5b21dd6a4c5526149ba1df13718204e73a818accbaf025f8505450a32bbbbf73","target":"record","created_at":"2026-05-18T00:54:09Z","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":"1cb36c930d9bb9f3ecedb3bd3b13dbedb59e4dcd7b1c54e6aa9b7d14fa35b262","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2016-12-22T08:59:45Z","title_canon_sha256":"741ed0fe8811a77e774386ae0273bdd36e0fec731833444457a33fbe0fb35258"},"schema_version":"1.0","source":{"id":"1612.07493","kind":"arxiv","version":1}},"canonical_sha256":"38e042b2789903875faf87848e832f7921bee2b1ae177e49de246504d15767ea","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"38e042b2789903875faf87848e832f7921bee2b1ae177e49de246504d15767ea","first_computed_at":"2026-05-18T00:54:09.906615Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:54:09.906615Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"AjCzA8BwcxtKjvbtPuaH8tNQrFXC85zKGTSEmnAdX6Gn0lbyw/BFDtnMI0bPp4hdaTe41XB9LtSDWDo31L21Bg==","signature_status":"signed_v1","signed_at":"2026-05-18T00:54:09.907008Z","signed_message":"canonical_sha256_bytes"},"source_id":"1612.07493","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:5b21dd6a4c5526149ba1df13718204e73a818accbaf025f8505450a32bbbbf73","sha256:2c8c9bd18d9a90d42aee26142943ddc1c4f9e2adc8017be622b726922188b2e5"],"state_sha256":"059fc9125dd5435543f3441d5d5bb8257cb75faa13cf1ad41d6c51080e0a4e97"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"6j8wWw16DYHInV4zhkYLa/vjkrqRpmjotwtHMmmM+nYOusoQ9B1a2TdzuvGI8pBJ7xkXofGz1zuOWe9oCEv1AA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-30T01:37:50.152777Z","bundle_sha256":"0704de101bd73dc4e9bb5fb31cd6031bb3d37f412d36326cc0972b7ee0b10b3b"}}