{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2013:WI4YSTGP3WP7FSHNB6YPC7QS57","short_pith_number":"pith:WI4YSTGP","schema_version":"1.0","canonical_sha256":"b239894ccfdd9ff2c8ed0fb0f17e12eff6eb28f2495f21c2b0d00f4df015d860","source":{"kind":"arxiv","id":"1311.6093","version":6},"attestation_state":"computed","paper":{"title":"A New Algorithm for Updating and Querying Sub-arrays of Multidimensional Arrays","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Pushkar Mishra","submitted_at":"2013-11-24T08:18:04Z","abstract_excerpt":"Given a $d$-dimensional array $A$, an update operation adds a given constant $C$ to each element within a continuous sub-array of $A$. A query operation computes the sum of all the elements within a continuous sub-array of $A$. The one-dimensional update and query handling problem has been studied intensively and is usually solved using segment trees with lazy propagation technique. In this paper, we present a new algorithm incorporating Binary Indexed Trees and Inclusion-Exclusion Principle to accomplish the same task. We extend the algorithm to update and query sub-matrices of matrices (two-"},"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":"1311.6093","kind":"arxiv","version":6},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2013-11-24T08:18:04Z","cross_cats_sorted":[],"title_canon_sha256":"e64db4ff029027eeac29aad0b3602a1930c313ff5e167f47b0b766ae09f75857","abstract_canon_sha256":"73483dc373ed4158a4895e7e8fc4d05acdff3ebe9e1c92372650a83de2bd1bdc"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:09:55.562693Z","signature_b64":"/UqUrnFQ4n6MGgj3KAXaM1Q6tVCkdO8CZ/cWMgB5zTiL5jG8HqQYfvVlIoxf7VFiT+Och06Q+qJ5jN7ev1D4AA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"b239894ccfdd9ff2c8ed0fb0f17e12eff6eb28f2495f21c2b0d00f4df015d860","last_reissued_at":"2026-05-18T01:09:55.561929Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:09:55.561929Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A New Algorithm for Updating and Querying Sub-arrays of Multidimensional Arrays","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Pushkar Mishra","submitted_at":"2013-11-24T08:18:04Z","abstract_excerpt":"Given a $d$-dimensional array $A$, an update operation adds a given constant $C$ to each element within a continuous sub-array of $A$. A query operation computes the sum of all the elements within a continuous sub-array of $A$. The one-dimensional update and query handling problem has been studied intensively and is usually solved using segment trees with lazy propagation technique. In this paper, we present a new algorithm incorporating Binary Indexed Trees and Inclusion-Exclusion Principle to accomplish the same task. We extend the algorithm to update and query sub-matrices of matrices (two-"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1311.6093","kind":"arxiv","version":6},"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":"1311.6093","created_at":"2026-05-18T01:09:55.562044+00:00"},{"alias_kind":"arxiv_version","alias_value":"1311.6093v6","created_at":"2026-05-18T01:09:55.562044+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1311.6093","created_at":"2026-05-18T01:09:55.562044+00:00"},{"alias_kind":"pith_short_12","alias_value":"WI4YSTGP3WP7","created_at":"2026-05-18T12:28:04.890932+00:00"},{"alias_kind":"pith_short_16","alias_value":"WI4YSTGP3WP7FSHN","created_at":"2026-05-18T12:28:04.890932+00:00"},{"alias_kind":"pith_short_8","alias_value":"WI4YSTGP","created_at":"2026-05-18T12:28:04.890932+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":41,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/WI4YSTGP3WP7FSHNB6YPC7QS57","json":"https://pith.science/pith/WI4YSTGP3WP7FSHNB6YPC7QS57.json","graph_json":"https://pith.science/api/pith-number/WI4YSTGP3WP7FSHNB6YPC7QS57/graph.json","events_json":"https://pith.science/api/pith-number/WI4YSTGP3WP7FSHNB6YPC7QS57/events.json","paper":"https://pith.science/paper/WI4YSTGP"},"agent_actions":{"view_html":"https://pith.science/pith/WI4YSTGP3WP7FSHNB6YPC7QS57","download_json":"https://pith.science/pith/WI4YSTGP3WP7FSHNB6YPC7QS57.json","view_paper":"https://pith.science/paper/WI4YSTGP","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1311.6093&json=true","fetch_graph":"https://pith.science/api/pith-number/WI4YSTGP3WP7FSHNB6YPC7QS57/graph.json","fetch_events":"https://pith.science/api/pith-number/WI4YSTGP3WP7FSHNB6YPC7QS57/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/WI4YSTGP3WP7FSHNB6YPC7QS57/action/timestamp_anchor","attest_storage":"https://pith.science/pith/WI4YSTGP3WP7FSHNB6YPC7QS57/action/storage_attestation","attest_author":"https://pith.science/pith/WI4YSTGP3WP7FSHNB6YPC7QS57/action/author_attestation","sign_citation":"https://pith.science/pith/WI4YSTGP3WP7FSHNB6YPC7QS57/action/citation_signature","submit_replication":"https://pith.science/pith/WI4YSTGP3WP7FSHNB6YPC7QS57/action/replication_record"}},"created_at":"2026-05-18T01:09:55.562044+00:00","updated_at":"2026-05-18T01:09:55.562044+00:00"}