{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2019:REP3XHDLGISV46MWSR73WXP27M","short_pith_number":"pith:REP3XHDL","schema_version":"1.0","canonical_sha256":"891fbb9c6b32255e7996947fbb5dfafb0a9039478e966d9678bcd1750e5a7ad7","source":{"kind":"arxiv","id":"1902.04427","version":2},"attestation_state":"computed","paper":{"title":"Compressed Range Minimum Queries","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Oren Weimann, Pawe{\\l} Gawrychowski, Seungbum Jo, Shay Mozes","submitted_at":"2019-02-12T15:05:59Z","abstract_excerpt":"Given a string $S$ of $n$ integers in $[0,\\sigma)$, a range minimum query RMQ$(i, j)$ asks for the index of the smallest integer in $S[i \\dots j]$. It is well known that the problem can be solved with a succinct data structure of size $2n + o(n)$ and constant query-time. In this paper we show how to preprocess $S$ into a compressed representation that allows fast range minimum queries. This allows for sublinear size data structures with logarithmic query time. The most natural approach is to use string compression and construct a data structure for answering range minimum queries directly on t"},"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":"1902.04427","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2019-02-12T15:05:59Z","cross_cats_sorted":[],"title_canon_sha256":"c88fbdf7bea894d34551e2bf795c9362bf04f1dedab66ff799028270b1a59f01","abstract_canon_sha256":"ba320959d72461bad1c954a7535dd5a9828a73ad60f5ad6823b7abc73e7be968"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:44:47.558813Z","signature_b64":"O/XUgLY0UUHyD6Dr+hqtMw0/B42h96IfVgZMzF2DCCiimGNW4csUF/BZmOeTQZRswDtuf8TvnU84q5/zneWCCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"891fbb9c6b32255e7996947fbb5dfafb0a9039478e966d9678bcd1750e5a7ad7","last_reissued_at":"2026-05-17T23:44:47.558170Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:44:47.558170Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Compressed Range Minimum Queries","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Oren Weimann, Pawe{\\l} Gawrychowski, Seungbum Jo, Shay Mozes","submitted_at":"2019-02-12T15:05:59Z","abstract_excerpt":"Given a string $S$ of $n$ integers in $[0,\\sigma)$, a range minimum query RMQ$(i, j)$ asks for the index of the smallest integer in $S[i \\dots j]$. It is well known that the problem can be solved with a succinct data structure of size $2n + o(n)$ and constant query-time. In this paper we show how to preprocess $S$ into a compressed representation that allows fast range minimum queries. This allows for sublinear size data structures with logarithmic query time. The most natural approach is to use string compression and construct a data structure for answering range minimum queries directly on t"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1902.04427","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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1902.04427","created_at":"2026-05-17T23:44:47.558267+00:00"},{"alias_kind":"arxiv_version","alias_value":"1902.04427v2","created_at":"2026-05-17T23:44:47.558267+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1902.04427","created_at":"2026-05-17T23:44:47.558267+00:00"},{"alias_kind":"pith_short_12","alias_value":"REP3XHDLGISV","created_at":"2026-05-18T12:33:27.125529+00:00"},{"alias_kind":"pith_short_16","alias_value":"REP3XHDLGISV46MW","created_at":"2026-05-18T12:33:27.125529+00:00"},{"alias_kind":"pith_short_8","alias_value":"REP3XHDL","created_at":"2026-05-18T12:33:27.125529+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/REP3XHDLGISV46MWSR73WXP27M","json":"https://pith.science/pith/REP3XHDLGISV46MWSR73WXP27M.json","graph_json":"https://pith.science/api/pith-number/REP3XHDLGISV46MWSR73WXP27M/graph.json","events_json":"https://pith.science/api/pith-number/REP3XHDLGISV46MWSR73WXP27M/events.json","paper":"https://pith.science/paper/REP3XHDL"},"agent_actions":{"view_html":"https://pith.science/pith/REP3XHDLGISV46MWSR73WXP27M","download_json":"https://pith.science/pith/REP3XHDLGISV46MWSR73WXP27M.json","view_paper":"https://pith.science/paper/REP3XHDL","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1902.04427&json=true","fetch_graph":"https://pith.science/api/pith-number/REP3XHDLGISV46MWSR73WXP27M/graph.json","fetch_events":"https://pith.science/api/pith-number/REP3XHDLGISV46MWSR73WXP27M/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/REP3XHDLGISV46MWSR73WXP27M/action/timestamp_anchor","attest_storage":"https://pith.science/pith/REP3XHDLGISV46MWSR73WXP27M/action/storage_attestation","attest_author":"https://pith.science/pith/REP3XHDLGISV46MWSR73WXP27M/action/author_attestation","sign_citation":"https://pith.science/pith/REP3XHDLGISV46MWSR73WXP27M/action/citation_signature","submit_replication":"https://pith.science/pith/REP3XHDLGISV46MWSR73WXP27M/action/replication_record"}},"created_at":"2026-05-17T23:44:47.558267+00:00","updated_at":"2026-05-17T23:44:47.558267+00:00"}