{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2020:MRYDOMXTTUHRCBFJCSEIDEEFNI","short_pith_number":"pith:MRYDOMXT","schema_version":"1.0","canonical_sha256":"64703732f39d0f1104a914888190856a2fe8cf0b893a75c9a19ed33bbb6a5cbc","source":{"kind":"arxiv","id":"2010.13180","version":1},"attestation_state":"computed","paper":{"title":"On Updating and Querying Submatrices","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CC"],"primary_cat":"cs.DS","authors_text":"Jason Yang, Jun Wan","submitted_at":"2020-10-25T18:17:03Z","abstract_excerpt":"In this paper, we study the $d$-dimensional update-query problem. We provide lower bounds on update and query running times, assuming a long-standing conjecture on min-plus matrix multiplication, as well as algorithms that are close to the lower bounds. Given a $d$-dimensional matrix, an \\textit{update} changes each element in a given submatrix from $x$ to $x\\bigtriangledown v$, where $v$ is a given constant. A \\textit{query} returns the $\\bigtriangleup$ of all elements in a given submatrix. We study the cases where $\\bigtriangledown$ and $\\bigtriangleup$ are both commutative and associative b"},"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":"2010.13180","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2020-10-25T18:17:03Z","cross_cats_sorted":["cs.CC"],"title_canon_sha256":"2482fa275e43f44b044a092282731081a167a309d090e8feb57d69e241de2469","abstract_canon_sha256":"af4d87ca3836c77d81c8cb7e44ecb24e54b7fbbfe1e2bd470f8c35f0f3adaeac"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T01:45:52.703029Z","signature_b64":"RPxfsJ+/szqh1h43pNGa6Pjs2Xc8QeXIoO8pi47xdxMB+TqiVRNLz/7IygoRK7dMFRAErp/I+iNpud2Qv2LhAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"64703732f39d0f1104a914888190856a2fe8cf0b893a75c9a19ed33bbb6a5cbc","last_reissued_at":"2026-07-05T01:45:52.702623Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T01:45:52.702623Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"On Updating and Querying Submatrices","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CC"],"primary_cat":"cs.DS","authors_text":"Jason Yang, Jun Wan","submitted_at":"2020-10-25T18:17:03Z","abstract_excerpt":"In this paper, we study the $d$-dimensional update-query problem. We provide lower bounds on update and query running times, assuming a long-standing conjecture on min-plus matrix multiplication, as well as algorithms that are close to the lower bounds. Given a $d$-dimensional matrix, an \\textit{update} changes each element in a given submatrix from $x$ to $x\\bigtriangledown v$, where $v$ is a given constant. A \\textit{query} returns the $\\bigtriangleup$ of all elements in a given submatrix. We study the cases where $\\bigtriangledown$ and $\\bigtriangleup$ are both commutative and associative b"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2010.13180","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/2010.13180/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"},"aliases":[{"alias_kind":"arxiv","alias_value":"2010.13180","created_at":"2026-07-05T01:45:52.702682+00:00"},{"alias_kind":"arxiv_version","alias_value":"2010.13180v1","created_at":"2026-07-05T01:45:52.702682+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2010.13180","created_at":"2026-07-05T01:45:52.702682+00:00"},{"alias_kind":"pith_short_12","alias_value":"MRYDOMXTTUHR","created_at":"2026-07-05T01:45:52.702682+00:00"},{"alias_kind":"pith_short_16","alias_value":"MRYDOMXTTUHRCBFJ","created_at":"2026-07-05T01:45:52.702682+00:00"},{"alias_kind":"pith_short_8","alias_value":"MRYDOMXT","created_at":"2026-07-05T01:45:52.702682+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2411.08972","citing_title":"Designing Automated Market Makers for Combinatorial Securities: A Geometric Viewpoint","ref_index":55,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/MRYDOMXTTUHRCBFJCSEIDEEFNI","json":"https://pith.science/pith/MRYDOMXTTUHRCBFJCSEIDEEFNI.json","graph_json":"https://pith.science/api/pith-number/MRYDOMXTTUHRCBFJCSEIDEEFNI/graph.json","events_json":"https://pith.science/api/pith-number/MRYDOMXTTUHRCBFJCSEIDEEFNI/events.json","paper":"https://pith.science/paper/MRYDOMXT"},"agent_actions":{"view_html":"https://pith.science/pith/MRYDOMXTTUHRCBFJCSEIDEEFNI","download_json":"https://pith.science/pith/MRYDOMXTTUHRCBFJCSEIDEEFNI.json","view_paper":"https://pith.science/paper/MRYDOMXT","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2010.13180&json=true","fetch_graph":"https://pith.science/api/pith-number/MRYDOMXTTUHRCBFJCSEIDEEFNI/graph.json","fetch_events":"https://pith.science/api/pith-number/MRYDOMXTTUHRCBFJCSEIDEEFNI/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/MRYDOMXTTUHRCBFJCSEIDEEFNI/action/timestamp_anchor","attest_storage":"https://pith.science/pith/MRYDOMXTTUHRCBFJCSEIDEEFNI/action/storage_attestation","attest_author":"https://pith.science/pith/MRYDOMXTTUHRCBFJCSEIDEEFNI/action/author_attestation","sign_citation":"https://pith.science/pith/MRYDOMXTTUHRCBFJCSEIDEEFNI/action/citation_signature","submit_replication":"https://pith.science/pith/MRYDOMXTTUHRCBFJCSEIDEEFNI/action/replication_record"}},"created_at":"2026-07-05T01:45:52.702682+00:00","updated_at":"2026-07-05T01:45:52.702682+00:00"}