{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:HDQEFMTYTEBYOX5PQ6CI5AZPPE","short_pith_number":"pith:HDQEFMTY","schema_version":"1.0","canonical_sha256":"38e042b2789903875faf87848e832f7921bee2b1ae177e49de246504d15767ea","source":{"kind":"arxiv","id":"1612.07493","version":1},"attestation_state":"computed","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"},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"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"},"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"},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1612.07493","created_at":"2026-05-18T00:54:09.906675+00:00"},{"alias_kind":"arxiv_version","alias_value":"1612.07493v1","created_at":"2026-05-18T00:54:09.906675+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1612.07493","created_at":"2026-05-18T00:54:09.906675+00:00"},{"alias_kind":"pith_short_12","alias_value":"HDQEFMTYTEBY","created_at":"2026-05-18T12:30:19.053100+00:00"},{"alias_kind":"pith_short_16","alias_value":"HDQEFMTYTEBYOX5P","created_at":"2026-05-18T12:30:19.053100+00:00"},{"alias_kind":"pith_short_8","alias_value":"HDQEFMTY","created_at":"2026-05-18T12:30:19.053100+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/HDQEFMTYTEBYOX5PQ6CI5AZPPE","json":"https://pith.science/pith/HDQEFMTYTEBYOX5PQ6CI5AZPPE.json","graph_json":"https://pith.science/api/pith-number/HDQEFMTYTEBYOX5PQ6CI5AZPPE/graph.json","events_json":"https://pith.science/api/pith-number/HDQEFMTYTEBYOX5PQ6CI5AZPPE/events.json","paper":"https://pith.science/paper/HDQEFMTY"},"agent_actions":{"view_html":"https://pith.science/pith/HDQEFMTYTEBYOX5PQ6CI5AZPPE","download_json":"https://pith.science/pith/HDQEFMTYTEBYOX5PQ6CI5AZPPE.json","view_paper":"https://pith.science/paper/HDQEFMTY","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1612.07493&json=true","fetch_graph":"https://pith.science/api/pith-number/HDQEFMTYTEBYOX5PQ6CI5AZPPE/graph.json","fetch_events":"https://pith.science/api/pith-number/HDQEFMTYTEBYOX5PQ6CI5AZPPE/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/HDQEFMTYTEBYOX5PQ6CI5AZPPE/action/timestamp_anchor","attest_storage":"https://pith.science/pith/HDQEFMTYTEBYOX5PQ6CI5AZPPE/action/storage_attestation","attest_author":"https://pith.science/pith/HDQEFMTYTEBYOX5PQ6CI5AZPPE/action/author_attestation","sign_citation":"https://pith.science/pith/HDQEFMTYTEBYOX5PQ6CI5AZPPE/action/citation_signature","submit_replication":"https://pith.science/pith/HDQEFMTYTEBYOX5PQ6CI5AZPPE/action/replication_record"}},"created_at":"2026-05-18T00:54:09.906675+00:00","updated_at":"2026-05-18T00:54:09.906675+00:00"}