{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2020:MRYDOMXTTUHRCBFJCSEIDEEFNI","short_pith_number":"pith:MRYDOMXT","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"},"canonical_sha256":"64703732f39d0f1104a914888190856a2fe8cf0b893a75c9a19ed33bbb6a5cbc","source":{"kind":"arxiv","id":"2010.13180","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2010.13180","created_at":"2026-07-05T01:45:52Z"},{"alias_kind":"arxiv_version","alias_value":"2010.13180v1","created_at":"2026-07-05T01:45:52Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2010.13180","created_at":"2026-07-05T01:45:52Z"},{"alias_kind":"pith_short_12","alias_value":"MRYDOMXTTUHR","created_at":"2026-07-05T01:45:52Z"},{"alias_kind":"pith_short_16","alias_value":"MRYDOMXTTUHRCBFJ","created_at":"2026-07-05T01:45:52Z"},{"alias_kind":"pith_short_8","alias_value":"MRYDOMXT","created_at":"2026-07-05T01:45:52Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2020:MRYDOMXTTUHRCBFJCSEIDEEFNI","target":"record","payload":{"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"},"canonical_sha256":"64703732f39d0f1104a914888190856a2fe8cf0b893a75c9a19ed33bbb6a5cbc","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"},"source_kind":"arxiv","source_id":"2010.13180","source_version":1,"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-07-05T01:45:52Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"gdaCmaXlTykBWOg9AbVDAmYghnjTAqMiVZ3itTZaN38xeNtxWkon6GcPMoYzDOjLjVGC8J6TLZMROevhavq+Cg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-21T22:14:45.693045Z"},"content_sha256":"a69c9f6de32301efb89de252f9200a9d601c4e8dd70c1825e922aaf2f4034a80","schema_version":"1.0","event_id":"sha256:a69c9f6de32301efb89de252f9200a9d601c4e8dd70c1825e922aaf2f4034a80"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2020:MRYDOMXTTUHRCBFJCSEIDEEFNI","target":"graph","payload":{"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"},"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-07-05T01:45:52Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"nT3UqR+LMkeVjvYQByX018fgmLyAiYHbrlZCysqNKbOdEbNtu+a62VRT526YuZU94CGxx1CQqigA9eCEBUvFBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-21T22:14:45.693561Z"},"content_sha256":"555b9df08330deb251dff31c4be9a2fdd20e77b8fffa0b246d739e439f6ab0ed","schema_version":"1.0","event_id":"sha256:555b9df08330deb251dff31c4be9a2fdd20e77b8fffa0b246d739e439f6ab0ed"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/MRYDOMXTTUHRCBFJCSEIDEEFNI/bundle.json","state_url":"https://pith.science/pith/MRYDOMXTTUHRCBFJCSEIDEEFNI/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/MRYDOMXTTUHRCBFJCSEIDEEFNI/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-21T22:14:45Z","links":{"resolver":"https://pith.science/pith/MRYDOMXTTUHRCBFJCSEIDEEFNI","bundle":"https://pith.science/pith/MRYDOMXTTUHRCBFJCSEIDEEFNI/bundle.json","state":"https://pith.science/pith/MRYDOMXTTUHRCBFJCSEIDEEFNI/state.json","well_known_bundle":"https://pith.science/.well-known/pith/MRYDOMXTTUHRCBFJCSEIDEEFNI/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2020:MRYDOMXTTUHRCBFJCSEIDEEFNI","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":"af4d87ca3836c77d81c8cb7e44ecb24e54b7fbbfe1e2bd470f8c35f0f3adaeac","cross_cats_sorted":["cs.CC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2020-10-25T18:17:03Z","title_canon_sha256":"2482fa275e43f44b044a092282731081a167a309d090e8feb57d69e241de2469"},"schema_version":"1.0","source":{"id":"2010.13180","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2010.13180","created_at":"2026-07-05T01:45:52Z"},{"alias_kind":"arxiv_version","alias_value":"2010.13180v1","created_at":"2026-07-05T01:45:52Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2010.13180","created_at":"2026-07-05T01:45:52Z"},{"alias_kind":"pith_short_12","alias_value":"MRYDOMXTTUHR","created_at":"2026-07-05T01:45:52Z"},{"alias_kind":"pith_short_16","alias_value":"MRYDOMXTTUHRCBFJ","created_at":"2026-07-05T01:45:52Z"},{"alias_kind":"pith_short_8","alias_value":"MRYDOMXT","created_at":"2026-07-05T01:45:52Z"}],"graph_snapshots":[{"event_id":"sha256:555b9df08330deb251dff31c4be9a2fdd20e77b8fffa0b246d739e439f6ab0ed","target":"graph","created_at":"2026-07-05T01:45:52Z","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"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2010.13180/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"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","authors_text":"Jason Yang, Jun Wan","cross_cats":["cs.CC"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2020-10-25T18:17:03Z","title":"On Updating and Querying Submatrices"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2010.13180","kind":"arxiv","version":1},"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:a69c9f6de32301efb89de252f9200a9d601c4e8dd70c1825e922aaf2f4034a80","target":"record","created_at":"2026-07-05T01:45:52Z","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":"af4d87ca3836c77d81c8cb7e44ecb24e54b7fbbfe1e2bd470f8c35f0f3adaeac","cross_cats_sorted":["cs.CC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2020-10-25T18:17:03Z","title_canon_sha256":"2482fa275e43f44b044a092282731081a167a309d090e8feb57d69e241de2469"},"schema_version":"1.0","source":{"id":"2010.13180","kind":"arxiv","version":1}},"canonical_sha256":"64703732f39d0f1104a914888190856a2fe8cf0b893a75c9a19ed33bbb6a5cbc","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"64703732f39d0f1104a914888190856a2fe8cf0b893a75c9a19ed33bbb6a5cbc","first_computed_at":"2026-07-05T01:45:52.702623Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T01:45:52.702623Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"RPxfsJ+/szqh1h43pNGa6Pjs2Xc8QeXIoO8pi47xdxMB+TqiVRNLz/7IygoRK7dMFRAErp/I+iNpud2Qv2LhAg==","signature_status":"signed_v1","signed_at":"2026-07-05T01:45:52.703029Z","signed_message":"canonical_sha256_bytes"},"source_id":"2010.13180","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:a69c9f6de32301efb89de252f9200a9d601c4e8dd70c1825e922aaf2f4034a80","sha256:555b9df08330deb251dff31c4be9a2fdd20e77b8fffa0b246d739e439f6ab0ed"],"state_sha256":"b01bbb93f9d4b97911166b80686ef4523b9b0c75134d0c57524f778a4603f4bf"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"/k4+quEAXlThuDHoQe1E3yB9eMS84dD2zKrfjUjN3bqKQoRp+ysO+JqQcqVyFndbKLLpKD1GTy4xGXqztx9dCg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-21T22:14:45.698120Z","bundle_sha256":"84675be59bdbf3181b6a603618895eabca56912c922e22a507542887c0687a9a"}}