{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2013:WI4YSTGP3WP7FSHNB6YPC7QS57","short_pith_number":"pith:WI4YSTGP","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"},"canonical_sha256":"b239894ccfdd9ff2c8ed0fb0f17e12eff6eb28f2495f21c2b0d00f4df015d860","source":{"kind":"arxiv","id":"1311.6093","version":6},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1311.6093","created_at":"2026-05-18T01:09:55Z"},{"alias_kind":"arxiv_version","alias_value":"1311.6093v6","created_at":"2026-05-18T01:09:55Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1311.6093","created_at":"2026-05-18T01:09:55Z"},{"alias_kind":"pith_short_12","alias_value":"WI4YSTGP3WP7","created_at":"2026-05-18T12:28:04Z"},{"alias_kind":"pith_short_16","alias_value":"WI4YSTGP3WP7FSHN","created_at":"2026-05-18T12:28:04Z"},{"alias_kind":"pith_short_8","alias_value":"WI4YSTGP","created_at":"2026-05-18T12:28:04Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2013:WI4YSTGP3WP7FSHNB6YPC7QS57","target":"record","payload":{"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"},"canonical_sha256":"b239894ccfdd9ff2c8ed0fb0f17e12eff6eb28f2495f21c2b0d00f4df015d860","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"},"source_kind":"arxiv","source_id":"1311.6093","source_version":6,"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-18T01:09:55Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"9g0BMGSeg8uzVM8Os3cUZQqC6UY5yazFvKkJNBEjULy4b5btTgVeC4Gk7nljNgDYbZ80sCJLBThhuL73lgk/Dg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-22T06:41:11.000483Z"},"content_sha256":"f78e58bdec7656346be0d554d7cf61a1df1e8e1c9a3d8413151985d1e9a46421","schema_version":"1.0","event_id":"sha256:f78e58bdec7656346be0d554d7cf61a1df1e8e1c9a3d8413151985d1e9a46421"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2013:WI4YSTGP3WP7FSHNB6YPC7QS57","target":"graph","payload":{"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"},"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-18T01:09:55Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"uW3sg9TA8UkyZYwcOB7eqIi3sWokhH8pAkBf9hxKoEzcUVGsXiVKh6kaDeTCKNJANG6rPTY/VDgTW/44PsNVAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-22T06:41:11.000937Z"},"content_sha256":"c7abc68368bf3373851dc7b9f716648e2fae18c0edfca21e7aea7dd685acfd7b","schema_version":"1.0","event_id":"sha256:c7abc68368bf3373851dc7b9f716648e2fae18c0edfca21e7aea7dd685acfd7b"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/WI4YSTGP3WP7FSHNB6YPC7QS57/bundle.json","state_url":"https://pith.science/pith/WI4YSTGP3WP7FSHNB6YPC7QS57/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/WI4YSTGP3WP7FSHNB6YPC7QS57/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-08-22T06:41:11Z","links":{"resolver":"https://pith.science/pith/WI4YSTGP3WP7FSHNB6YPC7QS57","bundle":"https://pith.science/pith/WI4YSTGP3WP7FSHNB6YPC7QS57/bundle.json","state":"https://pith.science/pith/WI4YSTGP3WP7FSHNB6YPC7QS57/state.json","well_known_bundle":"https://pith.science/.well-known/pith/WI4YSTGP3WP7FSHNB6YPC7QS57/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2013:WI4YSTGP3WP7FSHNB6YPC7QS57","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":"73483dc373ed4158a4895e7e8fc4d05acdff3ebe9e1c92372650a83de2bd1bdc","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2013-11-24T08:18:04Z","title_canon_sha256":"e64db4ff029027eeac29aad0b3602a1930c313ff5e167f47b0b766ae09f75857"},"schema_version":"1.0","source":{"id":"1311.6093","kind":"arxiv","version":6}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1311.6093","created_at":"2026-05-18T01:09:55Z"},{"alias_kind":"arxiv_version","alias_value":"1311.6093v6","created_at":"2026-05-18T01:09:55Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1311.6093","created_at":"2026-05-18T01:09:55Z"},{"alias_kind":"pith_short_12","alias_value":"WI4YSTGP3WP7","created_at":"2026-05-18T12:28:04Z"},{"alias_kind":"pith_short_16","alias_value":"WI4YSTGP3WP7FSHN","created_at":"2026-05-18T12:28:04Z"},{"alias_kind":"pith_short_8","alias_value":"WI4YSTGP","created_at":"2026-05-18T12:28:04Z"}],"graph_snapshots":[{"event_id":"sha256:c7abc68368bf3373851dc7b9f716648e2fae18c0edfca21e7aea7dd685acfd7b","target":"graph","created_at":"2026-05-18T01:09:55Z","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":"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-","authors_text":"Pushkar Mishra","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2013-11-24T08:18:04Z","title":"A New Algorithm for Updating and Querying Sub-arrays of Multidimensional Arrays"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1311.6093","kind":"arxiv","version":6},"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:f78e58bdec7656346be0d554d7cf61a1df1e8e1c9a3d8413151985d1e9a46421","target":"record","created_at":"2026-05-18T01:09:55Z","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":"73483dc373ed4158a4895e7e8fc4d05acdff3ebe9e1c92372650a83de2bd1bdc","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2013-11-24T08:18:04Z","title_canon_sha256":"e64db4ff029027eeac29aad0b3602a1930c313ff5e167f47b0b766ae09f75857"},"schema_version":"1.0","source":{"id":"1311.6093","kind":"arxiv","version":6}},"canonical_sha256":"b239894ccfdd9ff2c8ed0fb0f17e12eff6eb28f2495f21c2b0d00f4df015d860","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"b239894ccfdd9ff2c8ed0fb0f17e12eff6eb28f2495f21c2b0d00f4df015d860","first_computed_at":"2026-05-18T01:09:55.561929Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:09:55.561929Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"/UqUrnFQ4n6MGgj3KAXaM1Q6tVCkdO8CZ/cWMgB5zTiL5jG8HqQYfvVlIoxf7VFiT+Och06Q+qJ5jN7ev1D4AA==","signature_status":"signed_v1","signed_at":"2026-05-18T01:09:55.562693Z","signed_message":"canonical_sha256_bytes"},"source_id":"1311.6093","source_kind":"arxiv","source_version":6}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:f78e58bdec7656346be0d554d7cf61a1df1e8e1c9a3d8413151985d1e9a46421","sha256:c7abc68368bf3373851dc7b9f716648e2fae18c0edfca21e7aea7dd685acfd7b"],"state_sha256":"36e61e2c980cc281c0e60941d650d197ace30df42380de02752b5fc63dfbd271"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"I0oF23gF8rUdbx2TCYF8D26bLIXOTPHRFRct3HRdT3C7FBxyY6d95Uu69YRYKuKm0L4XyhXRWzA3T5j/i9JzDQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-22T06:41:11.005571Z","bundle_sha256":"c9bff136ec97475c7e9a5ae4207bbea5c14fdebc0b00003096a7d17cbae71d31"}}