{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2013:Y5XRZHTBRNBKA3OXJ32TVY4FT3","short_pith_number":"pith:Y5XRZHTB","schema_version":"1.0","canonical_sha256":"c76f1c9e618b42a06dd74ef53ae3859eebe15062b8bcf2567dbd43a11f04fffd","source":{"kind":"arxiv","id":"1307.2313","version":4},"attestation_state":"computed","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"},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"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"},"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"},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1307.2313","created_at":"2026-05-18T00:33:04.557986+00:00"},{"alias_kind":"arxiv_version","alias_value":"1307.2313v4","created_at":"2026-05-18T00:33:04.557986+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1307.2313","created_at":"2026-05-18T00:33:04.557986+00:00"},{"alias_kind":"pith_short_12","alias_value":"Y5XRZHTBRNBK","created_at":"2026-05-18T12:28:06.772260+00:00"},{"alias_kind":"pith_short_16","alias_value":"Y5XRZHTBRNBKA3OX","created_at":"2026-05-18T12:28:06.772260+00:00"},{"alias_kind":"pith_short_8","alias_value":"Y5XRZHTB","created_at":"2026-05-18T12:28:06.772260+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/Y5XRZHTBRNBKA3OXJ32TVY4FT3","json":"https://pith.science/pith/Y5XRZHTBRNBKA3OXJ32TVY4FT3.json","graph_json":"https://pith.science/api/pith-number/Y5XRZHTBRNBKA3OXJ32TVY4FT3/graph.json","events_json":"https://pith.science/api/pith-number/Y5XRZHTBRNBKA3OXJ32TVY4FT3/events.json","paper":"https://pith.science/paper/Y5XRZHTB"},"agent_actions":{"view_html":"https://pith.science/pith/Y5XRZHTBRNBKA3OXJ32TVY4FT3","download_json":"https://pith.science/pith/Y5XRZHTBRNBKA3OXJ32TVY4FT3.json","view_paper":"https://pith.science/paper/Y5XRZHTB","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1307.2313&json=true","fetch_graph":"https://pith.science/api/pith-number/Y5XRZHTBRNBKA3OXJ32TVY4FT3/graph.json","fetch_events":"https://pith.science/api/pith-number/Y5XRZHTBRNBKA3OXJ32TVY4FT3/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/Y5XRZHTBRNBKA3OXJ32TVY4FT3/action/timestamp_anchor","attest_storage":"https://pith.science/pith/Y5XRZHTBRNBKA3OXJ32TVY4FT3/action/storage_attestation","attest_author":"https://pith.science/pith/Y5XRZHTBRNBKA3OXJ32TVY4FT3/action/author_attestation","sign_citation":"https://pith.science/pith/Y5XRZHTBRNBKA3OXJ32TVY4FT3/action/citation_signature","submit_replication":"https://pith.science/pith/Y5XRZHTBRNBKA3OXJ32TVY4FT3/action/replication_record"}},"created_at":"2026-05-18T00:33:04.557986+00:00","updated_at":"2026-05-18T00:33:04.557986+00:00"}