{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:62DAKKGTJWYCUCGR4CX7FTGRFG","short_pith_number":"pith:62DAKKGT","canonical_record":{"source":{"id":"1502.07663","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2015-02-26T18:22:03Z","cross_cats_sorted":[],"title_canon_sha256":"e7baee17fec951fc181677c3ccc9d89a86797a7179c782a385f4d104adc3933c","abstract_canon_sha256":"4ef2dfa15d7a172576e66fea264bb7d2e4975ca2ec2f02b13d107ec9b9a31c69"},"schema_version":"1.0"},"canonical_sha256":"f6860528d34db02a08d1e0aff2ccd129b874f489d013f1ecd99865499d464bcc","source":{"kind":"arxiv","id":"1502.07663","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1502.07663","created_at":"2026-05-18T00:27:22Z"},{"alias_kind":"arxiv_version","alias_value":"1502.07663v3","created_at":"2026-05-18T00:27:22Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1502.07663","created_at":"2026-05-18T00:27:22Z"},{"alias_kind":"pith_short_12","alias_value":"62DAKKGTJWYC","created_at":"2026-05-18T12:29:07Z"},{"alias_kind":"pith_short_16","alias_value":"62DAKKGTJWYCUCGR","created_at":"2026-05-18T12:29:07Z"},{"alias_kind":"pith_short_8","alias_value":"62DAKKGT","created_at":"2026-05-18T12:29:07Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:62DAKKGTJWYCUCGR4CX7FTGRFG","target":"record","payload":{"canonical_record":{"source":{"id":"1502.07663","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2015-02-26T18:22:03Z","cross_cats_sorted":[],"title_canon_sha256":"e7baee17fec951fc181677c3ccc9d89a86797a7179c782a385f4d104adc3933c","abstract_canon_sha256":"4ef2dfa15d7a172576e66fea264bb7d2e4975ca2ec2f02b13d107ec9b9a31c69"},"schema_version":"1.0"},"canonical_sha256":"f6860528d34db02a08d1e0aff2ccd129b874f489d013f1ecd99865499d464bcc","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:27:22.636128Z","signature_b64":"2BaKTzf5YOiV3jXjMmlQ2wFaMjQjW7LP/6OfcjE5xNfYUYynycP/VDz1ITRW30G4ruyN9g6GWx1mPpGnfwoACw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"f6860528d34db02a08d1e0aff2ccd129b874f489d013f1ecd99865499d464bcc","last_reissued_at":"2026-05-18T00:27:22.635346Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:27:22.635346Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1502.07663","source_version":3,"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:27:22Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"cTBpULIma7X8pJR1kbDlbomB9YPrVxpgokRw0g3eZLT8mlc4/KOudX8CHQ+lSCx/p2hS+EOM9mQRgYO6rnojBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T07:09:36.409985Z"},"content_sha256":"ff28f5a9999592d7867961c0f441b2dc127685383ac5ab05371f8b3bb9fbffd2","schema_version":"1.0","event_id":"sha256:ff28f5a9999592d7867961c0f441b2dc127685383ac5ab05371f8b3bb9fbffd2"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:62DAKKGTJWYCUCGR4CX7FTGRFG","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Submatrix Maximum Queries in Monge Matrices are Equivalent to Predecessor Search","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":"2015-02-26T18:22:03Z","abstract_excerpt":"We present an optimal data structure for submatrix maximum queries in n x n Monge matrices. Our result is a two-way reduction showing that the problem is equivalent to the classical predecessor problem in a universe of polynomial size. This gives a data structure of O(n) space that answers submatrix maximum queries in O(loglogn) time. It also gives a matching lower bound, showing that O(loglogn) query-time is optimal for any data structure of size O(n polylog(n)). Our result concludes a line of improvements that started in SODA'12 with O(log^2 n) query-time and continued in ICALP'14 with O(log"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1502.07663","kind":"arxiv","version":3},"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:27:22Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"lhumV8gk1/o2tPLx17U2DM+gouOjlJVdTLVz9VcpL98KsmCjngfK7jtsp3eONKBvcvgwqxpGK2nbistSTg6PDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T07:09:36.410659Z"},"content_sha256":"e1e6c4132cbd03338b86a557f0156bfea476d862c66308911057a048e81c6489","schema_version":"1.0","event_id":"sha256:e1e6c4132cbd03338b86a557f0156bfea476d862c66308911057a048e81c6489"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/62DAKKGTJWYCUCGR4CX7FTGRFG/bundle.json","state_url":"https://pith.science/pith/62DAKKGTJWYCUCGR4CX7FTGRFG/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/62DAKKGTJWYCUCGR4CX7FTGRFG/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-26T07:09:36Z","links":{"resolver":"https://pith.science/pith/62DAKKGTJWYCUCGR4CX7FTGRFG","bundle":"https://pith.science/pith/62DAKKGTJWYCUCGR4CX7FTGRFG/bundle.json","state":"https://pith.science/pith/62DAKKGTJWYCUCGR4CX7FTGRFG/state.json","well_known_bundle":"https://pith.science/.well-known/pith/62DAKKGTJWYCUCGR4CX7FTGRFG/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:62DAKKGTJWYCUCGR4CX7FTGRFG","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":"4ef2dfa15d7a172576e66fea264bb7d2e4975ca2ec2f02b13d107ec9b9a31c69","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2015-02-26T18:22:03Z","title_canon_sha256":"e7baee17fec951fc181677c3ccc9d89a86797a7179c782a385f4d104adc3933c"},"schema_version":"1.0","source":{"id":"1502.07663","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1502.07663","created_at":"2026-05-18T00:27:22Z"},{"alias_kind":"arxiv_version","alias_value":"1502.07663v3","created_at":"2026-05-18T00:27:22Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1502.07663","created_at":"2026-05-18T00:27:22Z"},{"alias_kind":"pith_short_12","alias_value":"62DAKKGTJWYC","created_at":"2026-05-18T12:29:07Z"},{"alias_kind":"pith_short_16","alias_value":"62DAKKGTJWYCUCGR","created_at":"2026-05-18T12:29:07Z"},{"alias_kind":"pith_short_8","alias_value":"62DAKKGT","created_at":"2026-05-18T12:29:07Z"}],"graph_snapshots":[{"event_id":"sha256:e1e6c4132cbd03338b86a557f0156bfea476d862c66308911057a048e81c6489","target":"graph","created_at":"2026-05-18T00:27: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"},"paper":{"abstract_excerpt":"We present an optimal data structure for submatrix maximum queries in n x n Monge matrices. Our result is a two-way reduction showing that the problem is equivalent to the classical predecessor problem in a universe of polynomial size. This gives a data structure of O(n) space that answers submatrix maximum queries in O(loglogn) time. It also gives a matching lower bound, showing that O(loglogn) query-time is optimal for any data structure of size O(n polylog(n)). Our result concludes a line of improvements that started in SODA'12 with O(log^2 n) query-time and continued in ICALP'14 with O(log","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":"2015-02-26T18:22:03Z","title":"Submatrix Maximum Queries in Monge Matrices are Equivalent to Predecessor Search"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1502.07663","kind":"arxiv","version":3},"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:ff28f5a9999592d7867961c0f441b2dc127685383ac5ab05371f8b3bb9fbffd2","target":"record","created_at":"2026-05-18T00:27: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":"4ef2dfa15d7a172576e66fea264bb7d2e4975ca2ec2f02b13d107ec9b9a31c69","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2015-02-26T18:22:03Z","title_canon_sha256":"e7baee17fec951fc181677c3ccc9d89a86797a7179c782a385f4d104adc3933c"},"schema_version":"1.0","source":{"id":"1502.07663","kind":"arxiv","version":3}},"canonical_sha256":"f6860528d34db02a08d1e0aff2ccd129b874f489d013f1ecd99865499d464bcc","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"f6860528d34db02a08d1e0aff2ccd129b874f489d013f1ecd99865499d464bcc","first_computed_at":"2026-05-18T00:27:22.635346Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:27:22.635346Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"2BaKTzf5YOiV3jXjMmlQ2wFaMjQjW7LP/6OfcjE5xNfYUYynycP/VDz1ITRW30G4ruyN9g6GWx1mPpGnfwoACw==","signature_status":"signed_v1","signed_at":"2026-05-18T00:27:22.636128Z","signed_message":"canonical_sha256_bytes"},"source_id":"1502.07663","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:ff28f5a9999592d7867961c0f441b2dc127685383ac5ab05371f8b3bb9fbffd2","sha256:e1e6c4132cbd03338b86a557f0156bfea476d862c66308911057a048e81c6489"],"state_sha256":"4d4116209ac55a2661c7a6f42fbe8ae1e437036a30ea929d784a0e9dda13894a"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ZI2EZh4zmW0s3/ileIvM3iDHgigEdUoAY35Iawp5a+4NgtAIRErhPVlOHPmZa9NpIkhEsxH55F+4zI9uBbTJDQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-26T07:09:36.414552Z","bundle_sha256":"4b69efb0bf2e35acb533007a6e5ff0967f2760a19f9a502cf88c48bd2338e1fd"}}