{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2013:PT4LELEGRE6VUTTCFCOT3CXKUK","short_pith_number":"pith:PT4LELEG","schema_version":"1.0","canonical_sha256":"7cf8b22c86893d5a4e62289d3d8aeaa2be3f6e036567515926bd1de83f59c94d","source":{"kind":"arxiv","id":"1311.4394","version":1},"attestation_state":"computed","paper":{"title":"Encoding Range Minimum Queries","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Gonzalo Navarro, Pooya Davoodi, Rajeev Raman, S. Srinivasa Rao","submitted_at":"2013-11-18T14:29:58Z","abstract_excerpt":"We consider the problem of encoding range minimum queries (RMQs): given an array A[1..n] of distinct totally ordered values, to pre-process A and create a data structure that can answer the query RMQ(i,j), which returns the index containing the smallest element in A[i..j], without access to the array A at query time. We give a data structure whose space usage is 2n + o(n) bits, which is asymptotically optimal for worst-case data, and answers RMQs in O(1) worst-case time. This matches the previous result of Fischer and Heun [SICOMP, 2011], but is obtained in a more natural way. Furthermore, our"},"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":"1311.4394","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2013-11-18T14:29:58Z","cross_cats_sorted":[],"title_canon_sha256":"3de072134c5510dee44b4bfc8c162247dda26a9df1e018e0bec838c8fe4a8af8","abstract_canon_sha256":"075ed3d571c1a81a8d929fa1ce86d559b8ba6da452811d3b3885d9260d29330a"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:06:52.836855Z","signature_b64":"j0PnODS2SgnoERVFFkyW4gcIW4G6FpksfR2hswwnMpB/yHnvJrirpzfPOzhe+lahE4mp79IqcclH/SAFtORsDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"7cf8b22c86893d5a4e62289d3d8aeaa2be3f6e036567515926bd1de83f59c94d","last_reissued_at":"2026-05-18T03:06:52.836228Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:06:52.836228Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Encoding Range Minimum Queries","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Gonzalo Navarro, Pooya Davoodi, Rajeev Raman, S. Srinivasa Rao","submitted_at":"2013-11-18T14:29:58Z","abstract_excerpt":"We consider the problem of encoding range minimum queries (RMQs): given an array A[1..n] of distinct totally ordered values, to pre-process A and create a data structure that can answer the query RMQ(i,j), which returns the index containing the smallest element in A[i..j], without access to the array A at query time. We give a data structure whose space usage is 2n + o(n) bits, which is asymptotically optimal for worst-case data, and answers RMQs in O(1) worst-case time. This matches the previous result of Fischer and Heun [SICOMP, 2011], but is obtained in a more natural way. Furthermore, our"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1311.4394","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":"1311.4394","created_at":"2026-05-18T03:06:52.836327+00:00"},{"alias_kind":"arxiv_version","alias_value":"1311.4394v1","created_at":"2026-05-18T03:06:52.836327+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1311.4394","created_at":"2026-05-18T03:06:52.836327+00:00"},{"alias_kind":"pith_short_12","alias_value":"PT4LELEGRE6V","created_at":"2026-05-18T12:27:57.521954+00:00"},{"alias_kind":"pith_short_16","alias_value":"PT4LELEGRE6VUTTC","created_at":"2026-05-18T12:27:57.521954+00:00"},{"alias_kind":"pith_short_8","alias_value":"PT4LELEG","created_at":"2026-05-18T12:27:57.521954+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/PT4LELEGRE6VUTTCFCOT3CXKUK","json":"https://pith.science/pith/PT4LELEGRE6VUTTCFCOT3CXKUK.json","graph_json":"https://pith.science/api/pith-number/PT4LELEGRE6VUTTCFCOT3CXKUK/graph.json","events_json":"https://pith.science/api/pith-number/PT4LELEGRE6VUTTCFCOT3CXKUK/events.json","paper":"https://pith.science/paper/PT4LELEG"},"agent_actions":{"view_html":"https://pith.science/pith/PT4LELEGRE6VUTTCFCOT3CXKUK","download_json":"https://pith.science/pith/PT4LELEGRE6VUTTCFCOT3CXKUK.json","view_paper":"https://pith.science/paper/PT4LELEG","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1311.4394&json=true","fetch_graph":"https://pith.science/api/pith-number/PT4LELEGRE6VUTTCFCOT3CXKUK/graph.json","fetch_events":"https://pith.science/api/pith-number/PT4LELEGRE6VUTTCFCOT3CXKUK/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/PT4LELEGRE6VUTTCFCOT3CXKUK/action/timestamp_anchor","attest_storage":"https://pith.science/pith/PT4LELEGRE6VUTTCFCOT3CXKUK/action/storage_attestation","attest_author":"https://pith.science/pith/PT4LELEGRE6VUTTCFCOT3CXKUK/action/author_attestation","sign_citation":"https://pith.science/pith/PT4LELEGRE6VUTTCFCOT3CXKUK/action/citation_signature","submit_replication":"https://pith.science/pith/PT4LELEGRE6VUTTCFCOT3CXKUK/action/replication_record"}},"created_at":"2026-05-18T03:06:52.836327+00:00","updated_at":"2026-05-18T03:06:52.836327+00:00"}