{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2026:RO74UKHZVPD5NPVZBEX5P44SAD","short_pith_number":"pith:RO74UKHZ","schema_version":"1.0","canonical_sha256":"8bbfca28f9abc7d6beb9092fd7f39200ee8fd2a1a630363a29ae6ee72b7a2da5","source":{"kind":"arxiv","id":"2607.04509","version":1},"attestation_state":"computed","paper":{"title":"Near-Optimal and Efficient Encoding for Two-Dimensional Range Minimum Queries","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Adam G\\'orkiewicz, Pawe{\\l} Gawrychowski, Srinivasa Rao Satti","submitted_at":"2026-07-05T21:19:21Z","abstract_excerpt":"We consider the 2D RMQ encoding problem: given an $m\\times n$ array of $mn$ elements over a total order, encode it such that, for any query rectangle, the position of its maximum element can be reported without accessing the original array. For $m \\le n$, it is known how to encode the array in $O(mn \\min\\{m, \\log n\\})$ bits with $O(1)$-time queries [Brodal et al., Algorithmica 2012], and also how to obtain an asymptotically optimal encoding consisting of $O(mn \\log m)$ bits [Brodal et al., ESA 2013]. However, the latter approach does not prove any guarantee on the query time, and it appears to"},"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":"2607.04509","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2026-07-05T21:19:21Z","cross_cats_sorted":[],"title_canon_sha256":"8e5b4514a9513e09a7b4b5f5c90acaf68f3798091837c5c98216599a76977f3e","abstract_canon_sha256":"3b3564fcbf8767b073cb5c086ee7b2a5f3ff3643dc0e2b0cb57d5b39d9b724aa"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-07T02:19:22.580724Z","signature_b64":"8wPaZ+yNxNBSnikh2tpDJJGkdexakhrU/CYYdnbfrfSW28YNTnwV9tCKB8APgx5hMWLGCGqzVX9a+S/OvVfDDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"8bbfca28f9abc7d6beb9092fd7f39200ee8fd2a1a630363a29ae6ee72b7a2da5","last_reissued_at":"2026-07-07T02:19:22.580018Z","signature_status":"signed_v1","first_computed_at":"2026-07-07T02:19:22.580018Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Near-Optimal and Efficient Encoding for Two-Dimensional Range Minimum Queries","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Adam G\\'orkiewicz, Pawe{\\l} Gawrychowski, Srinivasa Rao Satti","submitted_at":"2026-07-05T21:19:21Z","abstract_excerpt":"We consider the 2D RMQ encoding problem: given an $m\\times n$ array of $mn$ elements over a total order, encode it such that, for any query rectangle, the position of its maximum element can be reported without accessing the original array. For $m \\le n$, it is known how to encode the array in $O(mn \\min\\{m, \\log n\\})$ bits with $O(1)$-time queries [Brodal et al., Algorithmica 2012], and also how to obtain an asymptotically optimal encoding consisting of $O(mn \\log m)$ bits [Brodal et al., ESA 2013]. However, the latter approach does not prove any guarantee on the query time, and it appears to"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2607.04509","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2607.04509/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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":"2607.04509","created_at":"2026-07-07T02:19:22.580121+00:00"},{"alias_kind":"arxiv_version","alias_value":"2607.04509v1","created_at":"2026-07-07T02:19:22.580121+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2607.04509","created_at":"2026-07-07T02:19:22.580121+00:00"},{"alias_kind":"pith_short_12","alias_value":"RO74UKHZVPD5","created_at":"2026-07-07T02:19:22.580121+00:00"},{"alias_kind":"pith_short_16","alias_value":"RO74UKHZVPD5NPVZ","created_at":"2026-07-07T02:19:22.580121+00:00"},{"alias_kind":"pith_short_8","alias_value":"RO74UKHZ","created_at":"2026-07-07T02:19:22.580121+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/RO74UKHZVPD5NPVZBEX5P44SAD","json":"https://pith.science/pith/RO74UKHZVPD5NPVZBEX5P44SAD.json","graph_json":"https://pith.science/api/pith-number/RO74UKHZVPD5NPVZBEX5P44SAD/graph.json","events_json":"https://pith.science/api/pith-number/RO74UKHZVPD5NPVZBEX5P44SAD/events.json","paper":"https://pith.science/paper/RO74UKHZ"},"agent_actions":{"view_html":"https://pith.science/pith/RO74UKHZVPD5NPVZBEX5P44SAD","download_json":"https://pith.science/pith/RO74UKHZVPD5NPVZBEX5P44SAD.json","view_paper":"https://pith.science/paper/RO74UKHZ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2607.04509&json=true","fetch_graph":"https://pith.science/api/pith-number/RO74UKHZVPD5NPVZBEX5P44SAD/graph.json","fetch_events":"https://pith.science/api/pith-number/RO74UKHZVPD5NPVZBEX5P44SAD/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/RO74UKHZVPD5NPVZBEX5P44SAD/action/timestamp_anchor","attest_storage":"https://pith.science/pith/RO74UKHZVPD5NPVZBEX5P44SAD/action/storage_attestation","attest_author":"https://pith.science/pith/RO74UKHZVPD5NPVZBEX5P44SAD/action/author_attestation","sign_citation":"https://pith.science/pith/RO74UKHZVPD5NPVZBEX5P44SAD/action/citation_signature","submit_replication":"https://pith.science/pith/RO74UKHZVPD5NPVZBEX5P44SAD/action/replication_record"}},"created_at":"2026-07-07T02:19:22.580121+00:00","updated_at":"2026-07-07T02:19:22.580121+00:00"}