{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2013:Y5XRZHTBRNBKA3OXJ32TVY4FT3","short_pith_number":"pith:Y5XRZHTB","canonical_record":{"source":{"id":"1307.2313","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2013-07-09T01:14:48Z","cross_cats_sorted":[],"title_canon_sha256":"ff6c90da9d308666e1d2db0750028164d5202e20cb3108be3c7397f6575fd225","abstract_canon_sha256":"f4aa846de80277fdab5acfef40f2f9eceedf080f6113395c3e22f443e196ba35"},"schema_version":"1.0"},"canonical_sha256":"c76f1c9e618b42a06dd74ef53ae3859eebe15062b8bcf2567dbd43a11f04fffd","source":{"kind":"arxiv","id":"1307.2313","version":4},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1307.2313","created_at":"2026-05-18T00:33:04Z"},{"alias_kind":"arxiv_version","alias_value":"1307.2313v4","created_at":"2026-05-18T00:33:04Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1307.2313","created_at":"2026-05-18T00:33:04Z"},{"alias_kind":"pith_short_12","alias_value":"Y5XRZHTBRNBK","created_at":"2026-05-18T12:28:06Z"},{"alias_kind":"pith_short_16","alias_value":"Y5XRZHTBRNBKA3OX","created_at":"2026-05-18T12:28:06Z"},{"alias_kind":"pith_short_8","alias_value":"Y5XRZHTB","created_at":"2026-05-18T12:28:06Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2013:Y5XRZHTBRNBKA3OXJ32TVY4FT3","target":"record","payload":{"canonical_record":{"source":{"id":"1307.2313","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2013-07-09T01:14:48Z","cross_cats_sorted":[],"title_canon_sha256":"ff6c90da9d308666e1d2db0750028164d5202e20cb3108be3c7397f6575fd225","abstract_canon_sha256":"f4aa846de80277fdab5acfef40f2f9eceedf080f6113395c3e22f443e196ba35"},"schema_version":"1.0"},"canonical_sha256":"c76f1c9e618b42a06dd74ef53ae3859eebe15062b8bcf2567dbd43a11f04fffd","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:33:04.558426Z","signature_b64":"Crm3moNGQlxOPGxX7XyJSZfDp6lhPKedg6HFEiwreIo9qPUcYdO/26POnSjSPSOnO8ISeGUHCWlvsSngphyPBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"c76f1c9e618b42a06dd74ef53ae3859eebe15062b8bcf2567dbd43a11f04fffd","last_reissued_at":"2026-05-18T00:33:04.557904Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:33:04.557904Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1307.2313","source_version":4,"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-18T00:33:04Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Xawvyrx5HrCLmEgdjtDZQT8g/lYQeNuFFStZ3SvBDQseFNI9I6xLr92al0PAiHx+c+IyON+RbNay3wY12ngXDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-25T19:55:19.604998Z"},"content_sha256":"ca7432ea3767248becf55604fba419db55de7cf9884c700f2520c6b1c7e43c60","schema_version":"1.0","event_id":"sha256:ca7432ea3767248becf55604fba419db55de7cf9884c700f2520c6b1c7e43c60"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2013:Y5XRZHTBRNBKA3OXJ32TVY4FT3","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Improved Submatrix Maximum Queries in Monge Matrices","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Oren Weimann, Pawel Gawrychowski, Shay Mozes","submitted_at":"2013-07-09T01:14:48Z","abstract_excerpt":"We present efficient data structures for submatrix maximum queries in Monge matrices and Monge partial matrices. For $n\\times n$ Monge matrices, we give a data structure that requires O(n) space and answers submatrix maximum queries in $O(\\log n)$ time. The best previous data structure [Kaplan et al., SODA`12] required $O(n \\log n)$ space and $O(\\log^2 n)$ query time. We also give an alternative data structure with constant query-time and $ O(n^{1+\\varepsilon})$ construction time and space for any fixed $\\varepsilon<1$. For $n\\times n$ {\\em partial} Monge matrices we obtain a data structure wi"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1307.2313","kind":"arxiv","version":4},"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-18T00:33:04Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"sJCmU31zisyUlRrxt8rVghhE2CXvdgHXugi0S6vqZ9BNirXXlanoVMRnlDdM/82+1gsHnG8f0T70IekyI+Y0Aw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-25T19:55:19.605696Z"},"content_sha256":"1e293c221a86e79bf33546edfd3e475e119cc5fe1d0fa662e81fd1999645cce9","schema_version":"1.0","event_id":"sha256:1e293c221a86e79bf33546edfd3e475e119cc5fe1d0fa662e81fd1999645cce9"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/Y5XRZHTBRNBKA3OXJ32TVY4FT3/bundle.json","state_url":"https://pith.science/pith/Y5XRZHTBRNBKA3OXJ32TVY4FT3/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/Y5XRZHTBRNBKA3OXJ32TVY4FT3/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-25T19:55:19Z","links":{"resolver":"https://pith.science/pith/Y5XRZHTBRNBKA3OXJ32TVY4FT3","bundle":"https://pith.science/pith/Y5XRZHTBRNBKA3OXJ32TVY4FT3/bundle.json","state":"https://pith.science/pith/Y5XRZHTBRNBKA3OXJ32TVY4FT3/state.json","well_known_bundle":"https://pith.science/.well-known/pith/Y5XRZHTBRNBKA3OXJ32TVY4FT3/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2013:Y5XRZHTBRNBKA3OXJ32TVY4FT3","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":"f4aa846de80277fdab5acfef40f2f9eceedf080f6113395c3e22f443e196ba35","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2013-07-09T01:14:48Z","title_canon_sha256":"ff6c90da9d308666e1d2db0750028164d5202e20cb3108be3c7397f6575fd225"},"schema_version":"1.0","source":{"id":"1307.2313","kind":"arxiv","version":4}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1307.2313","created_at":"2026-05-18T00:33:04Z"},{"alias_kind":"arxiv_version","alias_value":"1307.2313v4","created_at":"2026-05-18T00:33:04Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1307.2313","created_at":"2026-05-18T00:33:04Z"},{"alias_kind":"pith_short_12","alias_value":"Y5XRZHTBRNBK","created_at":"2026-05-18T12:28:06Z"},{"alias_kind":"pith_short_16","alias_value":"Y5XRZHTBRNBKA3OX","created_at":"2026-05-18T12:28:06Z"},{"alias_kind":"pith_short_8","alias_value":"Y5XRZHTB","created_at":"2026-05-18T12:28:06Z"}],"graph_snapshots":[{"event_id":"sha256:1e293c221a86e79bf33546edfd3e475e119cc5fe1d0fa662e81fd1999645cce9","target":"graph","created_at":"2026-05-18T00:33:04Z","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 present efficient data structures for submatrix maximum queries in Monge matrices and Monge partial matrices. For $n\\times n$ Monge matrices, we give a data structure that requires O(n) space and answers submatrix maximum queries in $O(\\log n)$ time. The best previous data structure [Kaplan et al., SODA`12] required $O(n \\log n)$ space and $O(\\log^2 n)$ query time. We also give an alternative data structure with constant query-time and $ O(n^{1+\\varepsilon})$ construction time and space for any fixed $\\varepsilon<1$. For $n\\times n$ {\\em partial} Monge matrices we obtain a data structure wi","authors_text":"Oren Weimann, Pawel Gawrychowski, Shay Mozes","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2013-07-09T01:14:48Z","title":"Improved Submatrix Maximum Queries in Monge Matrices"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1307.2313","kind":"arxiv","version":4},"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:ca7432ea3767248becf55604fba419db55de7cf9884c700f2520c6b1c7e43c60","target":"record","created_at":"2026-05-18T00:33:04Z","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":"f4aa846de80277fdab5acfef40f2f9eceedf080f6113395c3e22f443e196ba35","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2013-07-09T01:14:48Z","title_canon_sha256":"ff6c90da9d308666e1d2db0750028164d5202e20cb3108be3c7397f6575fd225"},"schema_version":"1.0","source":{"id":"1307.2313","kind":"arxiv","version":4}},"canonical_sha256":"c76f1c9e618b42a06dd74ef53ae3859eebe15062b8bcf2567dbd43a11f04fffd","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"c76f1c9e618b42a06dd74ef53ae3859eebe15062b8bcf2567dbd43a11f04fffd","first_computed_at":"2026-05-18T00:33:04.557904Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:33:04.557904Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"Crm3moNGQlxOPGxX7XyJSZfDp6lhPKedg6HFEiwreIo9qPUcYdO/26POnSjSPSOnO8ISeGUHCWlvsSngphyPBw==","signature_status":"signed_v1","signed_at":"2026-05-18T00:33:04.558426Z","signed_message":"canonical_sha256_bytes"},"source_id":"1307.2313","source_kind":"arxiv","source_version":4}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:ca7432ea3767248becf55604fba419db55de7cf9884c700f2520c6b1c7e43c60","sha256:1e293c221a86e79bf33546edfd3e475e119cc5fe1d0fa662e81fd1999645cce9"],"state_sha256":"522b42e0f6eeefd64c9494994b5ee6135386a9a61b8559fcbd61c9c7e4c30f64"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"yPXPOVfoX1dM1/GhSBeAlDsRl7hdZaLUAmdDVX9EcgnchtcjatBALDdtP0szkXQzA5zryJ/ESqQlmNb3FMRfBw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-25T19:55:19.610842Z","bundle_sha256":"aa707bfdbb870b0a78fc5ebcaac68b2763b56149d83a5e554aed539395a6b418"}}