{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2026:RO74UKHZVPD5NPVZBEX5P44SAD","short_pith_number":"pith:RO74UKHZ","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"},"canonical_sha256":"8bbfca28f9abc7d6beb9092fd7f39200ee8fd2a1a630363a29ae6ee72b7a2da5","source":{"kind":"arxiv","id":"2607.04509","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"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2026:RO74UKHZVPD5NPVZBEX5P44SAD","target":"record","payload":{"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"},"canonical_sha256":"8bbfca28f9abc7d6beb9092fd7f39200ee8fd2a1a630363a29ae6ee72b7a2da5","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"},"source_kind":"arxiv","source_id":"2607.04509","source_version":1,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-07-07T02:19:22Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"umDaNaDY0X05L8Z7AbUGYHjNsfwpmYhIwm/wrRuSSKGbtQR4Q2384xe8c/YkHoyF6oHr6ebQxjMp/bFweMmNAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-16T09:34:56.413459Z"},"content_sha256":"ac625ab1f3dc786b8a58febf924b8698bb59d01d73513872ad01e239db4e1372","schema_version":"1.0","event_id":"sha256:ac625ab1f3dc786b8a58febf924b8698bb59d01d73513872ad01e239db4e1372"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2026:RO74UKHZVPD5NPVZBEX5P44SAD","target":"graph","payload":{"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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-07-07T02:19:22Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"e9hW9TijsSqNEcKr3Hyxs/K7dtiO9lOIH7+g997xm9cRVio0eNPsyJlEKXz0dRwmf45ggidHWfGnp57b0oD9Bw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-16T09:34:56.413834Z"},"content_sha256":"ed4e69261d9ab0d67adb4a9f43203ef7815e31df2fc5fbb40a8868848e0b9028","schema_version":"1.0","event_id":"sha256:ed4e69261d9ab0d67adb4a9f43203ef7815e31df2fc5fbb40a8868848e0b9028"},{"event_type":"integrity_finding","subject_pith_number":"pith:2026:RO74UKHZVPD5NPVZBEX5P44SAD","target":"integrity","payload":{"note":"DOI in the printed bibliography is fragmented by whitespace or line breaks. A longer candidate (10.1007/978-3-540-31856-9\\_31) was visible in the surrounding text but could not be confirmed against doi.org as printed.","snippet":"Prosenjit Bose, Evangelos Kranakis, Pat Morin, and Yihui Tang. Approximate range mode and range median queries. In Volker Diekert and Bruno Durand, editors,STACS 2005, 22nd Annual Symposium on Theoretical Aspects of Computer Science, Stuttg","arxiv_id":"2607.04509","detector":"doi_compliance","evidence":{"ref_index":6,"verdict_class":"incontrovertible","resolved_title":null,"printed_excerpt":"Prosenjit Bose, Evangelos Kranakis, Pat Morin, and Yihui Tang. Approximate range mode and range median queries. In Volker Diekert and Bruno Durand, editors,STACS 2005, 22nd Annual Symposium on Theoretical Aspects of Computer Science, Stuttg","reconstructed_doi":"10.1007/978-3-540-31856-9\\_31"},"severity":"advisory","ref_index":6,"audited_at":"2026-07-11T18:33:50.324199Z","event_type":"pith.integrity.v1","detected_doi":"10.1007/978-3-540-31856-9\\_31","detector_url":"https://pith.science/pith-integrity-protocol#doi_compliance","external_url":null,"finding_type":"recoverable_identifier","evidence_hash":"b9fd42827aa52f6f30281cb1a5d24784536c28a9d3d3aed316768e97edf06a74","paper_version":1,"verdict_class":"incontrovertible","resolved_title":null,"detector_version":"1.0.0","detected_arxiv_id":null,"integrity_event_id":12242,"payload_sha256":"26da6005c27cc903f90a3c7c62b95574ba5ec86669fc46f58d4c201fa2ba7f5a","signature_b64":"/HfT2IsO0X1aDGmCAjbkcydHGEOSneydJP7WEOdGxtLP7+nnWuWDHgY+MheCNFsUCOKoEy28PV8x/4aU/kydDQ==","signing_key_id":"pith-v1-2026-05"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-07-11T18:36:27Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"SQw8EE5VLJU156kPHQEYsfKZzflse5GTecE4hGgoDqjlupb0QCa5ouAJ5s9j7AskfYrgARmKiHePi1dRgGoIDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-16T09:34:56.415219Z"},"content_sha256":"6347266fa20e8e0fe6a5c615f0a9f02bc6eaac257df55dc7e16fcc63c59fcc48","schema_version":"1.0","event_id":"sha256:6347266fa20e8e0fe6a5c615f0a9f02bc6eaac257df55dc7e16fcc63c59fcc48"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/RO74UKHZVPD5NPVZBEX5P44SAD/bundle.json","state_url":"https://pith.science/pith/RO74UKHZVPD5NPVZBEX5P44SAD/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/RO74UKHZVPD5NPVZBEX5P44SAD/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-07-16T09:34:56Z","links":{"resolver":"https://pith.science/pith/RO74UKHZVPD5NPVZBEX5P44SAD","bundle":"https://pith.science/pith/RO74UKHZVPD5NPVZBEX5P44SAD/bundle.json","state":"https://pith.science/pith/RO74UKHZVPD5NPVZBEX5P44SAD/state.json","well_known_bundle":"https://pith.science/.well-known/pith/RO74UKHZVPD5NPVZBEX5P44SAD/bundle.json"},"state":{"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"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"DKiOBIQ7cZYG6md8fVdAfE8lXN7FdBaWuls2qx8ttFz0VoloBDCqU234oV33e917C8T5V2vdBsBbdC8DD6sjAA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-07-16T09:34:56.416620Z","bundle_sha256":"6579095ff3b7982fea7289648be2351e0c52b8489fb97e2523ee0ea17a5b7616"}}