{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2011:YHUC67CAPB7FOKWSJJDAPJL7QL","short_pith_number":"pith:YHUC67CA","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"},"canonical_sha256":"c1e82f7c40787e572ad24a4607a57f82e6c214ea876a12dca3e7f5e743c788fb","source":{"kind":"arxiv","id":"1109.2885","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1109.2885","created_at":"2026-05-18T03:57:12Z"},{"alias_kind":"arxiv_version","alias_value":"1109.2885v2","created_at":"2026-05-18T03:57:12Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1109.2885","created_at":"2026-05-18T03:57:12Z"},{"alias_kind":"pith_short_12","alias_value":"YHUC67CAPB7F","created_at":"2026-05-18T12:26:47Z"},{"alias_kind":"pith_short_16","alias_value":"YHUC67CAPB7FOKWS","created_at":"2026-05-18T12:26:47Z"},{"alias_kind":"pith_short_8","alias_value":"YHUC67CA","created_at":"2026-05-18T12:26:47Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2011:YHUC67CAPB7FOKWSJJDAPJL7QL","target":"record","payload":{"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"},"canonical_sha256":"c1e82f7c40787e572ad24a4607a57f82e6c214ea876a12dca3e7f5e743c788fb","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"},"source_kind":"arxiv","source_id":"1109.2885","source_version":2,"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-05-18T03:57:12Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"NCs9nDkEX1ogxG+OE93m7/e7aG9CUo9X1/U1364OEvOv0uy4KPEsN4X5CrpIqfWctdZICCoaFEK8Ad20Mhp1BA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-22T17:27:32.209955Z"},"content_sha256":"80aa2287c9e8abd83789ae6b49be441488abe00e586a3f1ec72eb229b0255227","schema_version":"1.0","event_id":"sha256:80aa2287c9e8abd83789ae6b49be441488abe00e586a3f1ec72eb229b0255227"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2011:YHUC67CAPB7FOKWSJJDAPJL7QL","target":"graph","payload":{"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"},"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-05-18T03:57:12Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Bob2QBz/g5iScKG3iLeB2MKPZYvNSoBuCVIbzgm23sG9WXuF//rPRbx4HnDa+FU0TrqIOafVexnRNWRXcAcOAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-22T17:27:32.210628Z"},"content_sha256":"ae716234c03e3bd02431ff7aa66e27dcc316842c6fa8a9ccf366535ec8c8edd5","schema_version":"1.0","event_id":"sha256:ae716234c03e3bd02431ff7aa66e27dcc316842c6fa8a9ccf366535ec8c8edd5"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/YHUC67CAPB7FOKWSJJDAPJL7QL/bundle.json","state_url":"https://pith.science/pith/YHUC67CAPB7FOKWSJJDAPJL7QL/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/YHUC67CAPB7FOKWSJJDAPJL7QL/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-05-22T17:27:32Z","links":{"resolver":"https://pith.science/pith/YHUC67CAPB7FOKWSJJDAPJL7QL","bundle":"https://pith.science/pith/YHUC67CAPB7FOKWSJJDAPJL7QL/bundle.json","state":"https://pith.science/pith/YHUC67CAPB7FOKWSJJDAPJL7QL/state.json","well_known_bundle":"https://pith.science/.well-known/pith/YHUC67CAPB7FOKWSJJDAPJL7QL/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2011:YHUC67CAPB7FOKWSJJDAPJL7QL","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"f0aca7060bcd21a9cb34df877f6c2627e09b366e32701c316cba1a4b31d5680d","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2011-09-13T19:04:03Z","title_canon_sha256":"79f34240256af7d7e2622eec5324a74fdc1e5581183ef21f8b03494599c37baf"},"schema_version":"1.0","source":{"id":"1109.2885","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1109.2885","created_at":"2026-05-18T03:57:12Z"},{"alias_kind":"arxiv_version","alias_value":"1109.2885v2","created_at":"2026-05-18T03:57:12Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1109.2885","created_at":"2026-05-18T03:57:12Z"},{"alias_kind":"pith_short_12","alias_value":"YHUC67CAPB7F","created_at":"2026-05-18T12:26:47Z"},{"alias_kind":"pith_short_16","alias_value":"YHUC67CAPB7FOKWS","created_at":"2026-05-18T12:26:47Z"},{"alias_kind":"pith_short_8","alias_value":"YHUC67CA","created_at":"2026-05-18T12:26:47Z"}],"graph_snapshots":[{"event_id":"sha256:ae716234c03e3bd02431ff7aa66e27dcc316842c6fa8a9ccf366535ec8c8edd5","target":"graph","created_at":"2026-05-18T03:57:12Z","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"},"paper":{"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","authors_text":"Danny Krizanc, John Iacono, Mordecai J. Golin, Rajeev Raman, S. Srinivasa Rao, Sunil Shende","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2011-09-13T19:04:03Z","title":"Encoding 2-D Range Maximum Queries"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1109.2885","kind":"arxiv","version":2},"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:80aa2287c9e8abd83789ae6b49be441488abe00e586a3f1ec72eb229b0255227","target":"record","created_at":"2026-05-18T03:57:12Z","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":"f0aca7060bcd21a9cb34df877f6c2627e09b366e32701c316cba1a4b31d5680d","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2011-09-13T19:04:03Z","title_canon_sha256":"79f34240256af7d7e2622eec5324a74fdc1e5581183ef21f8b03494599c37baf"},"schema_version":"1.0","source":{"id":"1109.2885","kind":"arxiv","version":2}},"canonical_sha256":"c1e82f7c40787e572ad24a4607a57f82e6c214ea876a12dca3e7f5e743c788fb","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"c1e82f7c40787e572ad24a4607a57f82e6c214ea876a12dca3e7f5e743c788fb","first_computed_at":"2026-05-18T03:57:12.758830Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:57:12.758830Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"QlcVtfWtGM3pu/GMKZOxL/aGbgUsCS5CW6TXdaO2nQSekSGwz0vd66S2iscLU0QJnq5wdFK9M1JefN6Zyri3AA==","signature_status":"signed_v1","signed_at":"2026-05-18T03:57:12.759274Z","signed_message":"canonical_sha256_bytes"},"source_id":"1109.2885","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:80aa2287c9e8abd83789ae6b49be441488abe00e586a3f1ec72eb229b0255227","sha256:ae716234c03e3bd02431ff7aa66e27dcc316842c6fa8a9ccf366535ec8c8edd5"],"state_sha256":"3bde7c462a44a7ba8215017d2e4b610c2ff4908a64980d3587fe2f52ce6b70dc"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"VRqy+G68zXEKDuKhbbJTkbdvZ3D+iRdJ0jSrjtDqN+/eAjKEINOsnAdCDrwLxASIOm5RTqx3SYZtkqrTTeFhDg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-22T17:27:32.214236Z","bundle_sha256":"94e54c1260d02a2c7e906aafd4ca67a3fd99e202abc35cca9092548a30e586a4"}}