{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2011:YHUC67CAPB7FOKWSJJDAPJL7QL","short_pith_number":"pith:YHUC67CA","schema_version":"1.0","canonical_sha256":"c1e82f7c40787e572ad24a4607a57f82e6c214ea876a12dca3e7f5e743c788fb","source":{"kind":"arxiv","id":"1109.2885","version":2},"attestation_state":"computed","paper":{"title":"Encoding 2-D Range Maximum Queries","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Danny Krizanc, John Iacono, Mordecai J. Golin, Rajeev Raman, S. Srinivasa Rao, Sunil Shende","submitted_at":"2011-09-13T19:04:03Z","abstract_excerpt":"We consider the \\emph{two-dimensional range maximum query (2D-RMQ)} problem: given an array $A$ of ordered values, to pre-process it so that we can find the position of the smallest element in the sub-matrix defined by a (user-specified) range of rows and range of columns. We focus on determining the \\emph{effective} entropy of 2D-RMQ, i.e., how many bits are needed to encode $A$ so that 2D-RMQ queries can be answered \\emph{without} access to $A$. We give tight upper and lower bounds on the expected effective entropy for the case when $A$ contains independent identically-distributed random val"},"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":"1109.2885","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2011-09-13T19:04:03Z","cross_cats_sorted":[],"title_canon_sha256":"79f34240256af7d7e2622eec5324a74fdc1e5581183ef21f8b03494599c37baf","abstract_canon_sha256":"f0aca7060bcd21a9cb34df877f6c2627e09b366e32701c316cba1a4b31d5680d"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:57:12.759274Z","signature_b64":"QlcVtfWtGM3pu/GMKZOxL/aGbgUsCS5CW6TXdaO2nQSekSGwz0vd66S2iscLU0QJnq5wdFK9M1JefN6Zyri3AA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"c1e82f7c40787e572ad24a4607a57f82e6c214ea876a12dca3e7f5e743c788fb","last_reissued_at":"2026-05-18T03:57:12.758830Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:57:12.758830Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Encoding 2-D Range Maximum Queries","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Danny Krizanc, John Iacono, Mordecai J. Golin, Rajeev Raman, S. Srinivasa Rao, Sunil Shende","submitted_at":"2011-09-13T19:04:03Z","abstract_excerpt":"We consider the \\emph{two-dimensional range maximum query (2D-RMQ)} problem: given an array $A$ of ordered values, to pre-process it so that we can find the position of the smallest element in the sub-matrix defined by a (user-specified) range of rows and range of columns. We focus on determining the \\emph{effective} entropy of 2D-RMQ, i.e., how many bits are needed to encode $A$ so that 2D-RMQ queries can be answered \\emph{without} access to $A$. We give tight upper and lower bounds on the expected effective entropy for the case when $A$ contains independent identically-distributed random val"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1109.2885","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":"1109.2885","created_at":"2026-05-18T03:57:12.758894+00:00"},{"alias_kind":"arxiv_version","alias_value":"1109.2885v2","created_at":"2026-05-18T03:57:12.758894+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1109.2885","created_at":"2026-05-18T03:57:12.758894+00:00"},{"alias_kind":"pith_short_12","alias_value":"YHUC67CAPB7F","created_at":"2026-05-18T12:26:47.523578+00:00"},{"alias_kind":"pith_short_16","alias_value":"YHUC67CAPB7FOKWS","created_at":"2026-05-18T12:26:47.523578+00:00"},{"alias_kind":"pith_short_8","alias_value":"YHUC67CA","created_at":"2026-05-18T12:26:47.523578+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/YHUC67CAPB7FOKWSJJDAPJL7QL","json":"https://pith.science/pith/YHUC67CAPB7FOKWSJJDAPJL7QL.json","graph_json":"https://pith.science/api/pith-number/YHUC67CAPB7FOKWSJJDAPJL7QL/graph.json","events_json":"https://pith.science/api/pith-number/YHUC67CAPB7FOKWSJJDAPJL7QL/events.json","paper":"https://pith.science/paper/YHUC67CA"},"agent_actions":{"view_html":"https://pith.science/pith/YHUC67CAPB7FOKWSJJDAPJL7QL","download_json":"https://pith.science/pith/YHUC67CAPB7FOKWSJJDAPJL7QL.json","view_paper":"https://pith.science/paper/YHUC67CA","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1109.2885&json=true","fetch_graph":"https://pith.science/api/pith-number/YHUC67CAPB7FOKWSJJDAPJL7QL/graph.json","fetch_events":"https://pith.science/api/pith-number/YHUC67CAPB7FOKWSJJDAPJL7QL/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/YHUC67CAPB7FOKWSJJDAPJL7QL/action/timestamp_anchor","attest_storage":"https://pith.science/pith/YHUC67CAPB7FOKWSJJDAPJL7QL/action/storage_attestation","attest_author":"https://pith.science/pith/YHUC67CAPB7FOKWSJJDAPJL7QL/action/author_attestation","sign_citation":"https://pith.science/pith/YHUC67CAPB7FOKWSJJDAPJL7QL/action/citation_signature","submit_replication":"https://pith.science/pith/YHUC67CAPB7FOKWSJJDAPJL7QL/action/replication_record"}},"created_at":"2026-05-18T03:57:12.758894+00:00","updated_at":"2026-05-18T03:57:12.758894+00:00"}