{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2026:RO74UKHZVPD5NPVZBEX5P44SAD","merge_version":"pith-open-graph-merge-v1","event_count":3,"valid_event_count":3,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"3b3564fcbf8767b073cb5c086ee7b2a5f3ff3643dc0e2b0cb57d5b39d9b724aa","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2026-07-05T21:19:21Z","title_canon_sha256":"8e5b4514a9513e09a7b4b5f5c90acaf68f3798091837c5c98216599a76977f3e"},"schema_version":"1.0","source":{"id":"2607.04509","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2607.04509","created_at":"2026-07-07T02:19:22Z"},{"alias_kind":"arxiv_version","alias_value":"2607.04509v1","created_at":"2026-07-07T02:19:22Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2607.04509","created_at":"2026-07-07T02:19:22Z"},{"alias_kind":"pith_short_12","alias_value":"RO74UKHZVPD5","created_at":"2026-07-07T02:19:22Z"},{"alias_kind":"pith_short_16","alias_value":"RO74UKHZVPD5NPVZ","created_at":"2026-07-07T02:19:22Z"},{"alias_kind":"pith_short_8","alias_value":"RO74UKHZ","created_at":"2026-07-07T02:19:22Z"}],"graph_snapshots":[{"event_id":"sha256:ed4e69261d9ab0d67adb4a9f43203ef7815e31df2fc5fbb40a8868848e0b9028","target":"graph","created_at":"2026-07-07T02:19:22Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2607.04509/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"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","authors_text":"Adam G\\'orkiewicz, Pawe{\\l} Gawrychowski, Srinivasa Rao Satti","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2026-07-05T21:19:21Z","title":"Near-Optimal and Efficient Encoding for Two-Dimensional Range Minimum Queries"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2607.04509","kind":"arxiv","version":1},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:ac625ab1f3dc786b8a58febf924b8698bb59d01d73513872ad01e239db4e1372","target":"record","created_at":"2026-07-07T02:19:22Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"3b3564fcbf8767b073cb5c086ee7b2a5f3ff3643dc0e2b0cb57d5b39d9b724aa","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2026-07-05T21:19:21Z","title_canon_sha256":"8e5b4514a9513e09a7b4b5f5c90acaf68f3798091837c5c98216599a76977f3e"},"schema_version":"1.0","source":{"id":"2607.04509","kind":"arxiv","version":1}},"canonical_sha256":"8bbfca28f9abc7d6beb9092fd7f39200ee8fd2a1a630363a29ae6ee72b7a2da5","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"8bbfca28f9abc7d6beb9092fd7f39200ee8fd2a1a630363a29ae6ee72b7a2da5","first_computed_at":"2026-07-07T02:19:22.580018Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-07T02:19:22.580018Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"8wPaZ+yNxNBSnikh2tpDJJGkdexakhrU/CYYdnbfrfSW28YNTnwV9tCKB8APgx5hMWLGCGqzVX9a+S/OvVfDDw==","signature_status":"signed_v1","signed_at":"2026-07-07T02:19:22.580724Z","signed_message":"canonical_sha256_bytes"},"source_id":"2607.04509","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:ac625ab1f3dc786b8a58febf924b8698bb59d01d73513872ad01e239db4e1372","sha256:ed4e69261d9ab0d67adb4a9f43203ef7815e31df2fc5fbb40a8868848e0b9028","sha256:6347266fa20e8e0fe6a5c615f0a9f02bc6eaac257df55dc7e16fcc63c59fcc48"],"state_sha256":"5d6d06c0340ae5709379fda517fac3893ec0015033c15defcec63f096da7d94f"}