{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2020:2RYDRCVJODMSTUMIUGCIHCJINI","short_pith_number":"pith:2RYDRCVJ","canonical_record":{"source":{"id":"2004.07470","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by-sa/4.0/","primary_cat":"cs.DS","submitted_at":"2020-04-16T06:02:37Z","cross_cats_sorted":[],"title_canon_sha256":"9d031b069ed7542a2bb2b445df85401ccc740886d7c377e34db801ccd07f3f2a","abstract_canon_sha256":"194a6ee7f8ab47c8e909a4c45fc3cc684cb38bccc465f499fb2e9ae80455c826"},"schema_version":"1.0"},"canonical_sha256":"d470388aa970d929d188a1848389286a2b9a2ec1f7a4f3f0ea1a6be5a53d4762","source":{"kind":"arxiv","id":"2004.07470","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2004.07470","created_at":"2026-07-05T00:55:33Z"},{"alias_kind":"arxiv_version","alias_value":"2004.07470v1","created_at":"2026-07-05T00:55:33Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2004.07470","created_at":"2026-07-05T00:55:33Z"},{"alias_kind":"pith_short_12","alias_value":"2RYDRCVJODMS","created_at":"2026-07-05T00:55:33Z"},{"alias_kind":"pith_short_16","alias_value":"2RYDRCVJODMSTUMI","created_at":"2026-07-05T00:55:33Z"},{"alias_kind":"pith_short_8","alias_value":"2RYDRCVJ","created_at":"2026-07-05T00:55:33Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2020:2RYDRCVJODMSTUMIUGCIHCJINI","target":"record","payload":{"canonical_record":{"source":{"id":"2004.07470","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by-sa/4.0/","primary_cat":"cs.DS","submitted_at":"2020-04-16T06:02:37Z","cross_cats_sorted":[],"title_canon_sha256":"9d031b069ed7542a2bb2b445df85401ccc740886d7c377e34db801ccd07f3f2a","abstract_canon_sha256":"194a6ee7f8ab47c8e909a4c45fc3cc684cb38bccc465f499fb2e9ae80455c826"},"schema_version":"1.0"},"canonical_sha256":"d470388aa970d929d188a1848389286a2b9a2ec1f7a4f3f0ea1a6be5a53d4762","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T00:55:33.481040Z","signature_b64":"g+se8s3Wwap15Ga8IfV7FIuI9ndXav+US7L8LoIBMct9JjzM/Yu3TCTkOJhQfQXBoGd3dHMecKupwth77JtFBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"d470388aa970d929d188a1848389286a2b9a2ec1f7a4f3f0ea1a6be5a53d4762","last_reissued_at":"2026-07-05T00:55:33.480419Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T00:55:33.480419Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2004.07470","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-05T00:55:33Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"y1mG4IG9SnTR2KyD9ukzuXbxcRm00HR/fwYzLyLJy9hSdt4lOdtgyPs3R2qciSQsBpEPdlOCuW2d9fpbwMCYAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-15T23:50:42.737501Z"},"content_sha256":"88616c101284ccccda74283e529f7c66e4e77c23599549fbe4187f952ff2c085","schema_version":"1.0","event_id":"sha256:88616c101284ccccda74283e529f7c66e4e77c23599549fbe4187f952ff2c085"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2020:2RYDRCVJODMSTUMIUGCIHCJINI","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Faster Dynamic Matrix Inverse for Faster LPs","license":"http://creativecommons.org/licenses/by-sa/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Hengjie Zhang, Omri Weinstein, Shunhua Jiang, Zhao Song","submitted_at":"2020-04-16T06:02:37Z","abstract_excerpt":"Motivated by recent Linear Programming solvers, we design dynamic data structures for maintaining the inverse of an $n\\times n$ real matrix under $\\textit{low-rank}$ updates, with polynomially faster amortized running time. Our data structure is based on a recursive application of the Woodbury-Morrison identity for implementing $\\textit{cascading}$ low-rank updates, combined with recent sketching technology. Our techniques and amortized analysis of multi-level partial updates, may be of broader interest to dynamic matrix problems.\n  This data structure leads to the fastest known LP solver for "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2004.07470","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/2004.07470/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-05T00:55:33Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"LsDCcltqOmcR6+9EOjwU94QgzvU11jPUWOVwz291UgqTSRym9vFulCwXglHcTLiXOBWqaqQDHCOjJXCu15LTCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-15T23:50:42.738008Z"},"content_sha256":"8dae4ccfaad46a7e81e4f529005769e8b4af2d6b9cb1e1a376dbce7faadfbf7a","schema_version":"1.0","event_id":"sha256:8dae4ccfaad46a7e81e4f529005769e8b4af2d6b9cb1e1a376dbce7faadfbf7a"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/2RYDRCVJODMSTUMIUGCIHCJINI/bundle.json","state_url":"https://pith.science/pith/2RYDRCVJODMSTUMIUGCIHCJINI/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/2RYDRCVJODMSTUMIUGCIHCJINI/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-15T23:50:42Z","links":{"resolver":"https://pith.science/pith/2RYDRCVJODMSTUMIUGCIHCJINI","bundle":"https://pith.science/pith/2RYDRCVJODMSTUMIUGCIHCJINI/bundle.json","state":"https://pith.science/pith/2RYDRCVJODMSTUMIUGCIHCJINI/state.json","well_known_bundle":"https://pith.science/.well-known/pith/2RYDRCVJODMSTUMIUGCIHCJINI/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2020:2RYDRCVJODMSTUMIUGCIHCJINI","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":"194a6ee7f8ab47c8e909a4c45fc3cc684cb38bccc465f499fb2e9ae80455c826","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by-sa/4.0/","primary_cat":"cs.DS","submitted_at":"2020-04-16T06:02:37Z","title_canon_sha256":"9d031b069ed7542a2bb2b445df85401ccc740886d7c377e34db801ccd07f3f2a"},"schema_version":"1.0","source":{"id":"2004.07470","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2004.07470","created_at":"2026-07-05T00:55:33Z"},{"alias_kind":"arxiv_version","alias_value":"2004.07470v1","created_at":"2026-07-05T00:55:33Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2004.07470","created_at":"2026-07-05T00:55:33Z"},{"alias_kind":"pith_short_12","alias_value":"2RYDRCVJODMS","created_at":"2026-07-05T00:55:33Z"},{"alias_kind":"pith_short_16","alias_value":"2RYDRCVJODMSTUMI","created_at":"2026-07-05T00:55:33Z"},{"alias_kind":"pith_short_8","alias_value":"2RYDRCVJ","created_at":"2026-07-05T00:55:33Z"}],"graph_snapshots":[{"event_id":"sha256:8dae4ccfaad46a7e81e4f529005769e8b4af2d6b9cb1e1a376dbce7faadfbf7a","target":"graph","created_at":"2026-07-05T00:55:33Z","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/2004.07470/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Motivated by recent Linear Programming solvers, we design dynamic data structures for maintaining the inverse of an $n\\times n$ real matrix under $\\textit{low-rank}$ updates, with polynomially faster amortized running time. Our data structure is based on a recursive application of the Woodbury-Morrison identity for implementing $\\textit{cascading}$ low-rank updates, combined with recent sketching technology. Our techniques and amortized analysis of multi-level partial updates, may be of broader interest to dynamic matrix problems.\n  This data structure leads to the fastest known LP solver for ","authors_text":"Hengjie Zhang, Omri Weinstein, Shunhua Jiang, Zhao Song","cross_cats":[],"headline":"","license":"http://creativecommons.org/licenses/by-sa/4.0/","primary_cat":"cs.DS","submitted_at":"2020-04-16T06:02:37Z","title":"Faster Dynamic Matrix Inverse for Faster LPs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2004.07470","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:88616c101284ccccda74283e529f7c66e4e77c23599549fbe4187f952ff2c085","target":"record","created_at":"2026-07-05T00:55:33Z","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":"194a6ee7f8ab47c8e909a4c45fc3cc684cb38bccc465f499fb2e9ae80455c826","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by-sa/4.0/","primary_cat":"cs.DS","submitted_at":"2020-04-16T06:02:37Z","title_canon_sha256":"9d031b069ed7542a2bb2b445df85401ccc740886d7c377e34db801ccd07f3f2a"},"schema_version":"1.0","source":{"id":"2004.07470","kind":"arxiv","version":1}},"canonical_sha256":"d470388aa970d929d188a1848389286a2b9a2ec1f7a4f3f0ea1a6be5a53d4762","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"d470388aa970d929d188a1848389286a2b9a2ec1f7a4f3f0ea1a6be5a53d4762","first_computed_at":"2026-07-05T00:55:33.480419Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T00:55:33.480419Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"g+se8s3Wwap15Ga8IfV7FIuI9ndXav+US7L8LoIBMct9JjzM/Yu3TCTkOJhQfQXBoGd3dHMecKupwth77JtFBw==","signature_status":"signed_v1","signed_at":"2026-07-05T00:55:33.481040Z","signed_message":"canonical_sha256_bytes"},"source_id":"2004.07470","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:88616c101284ccccda74283e529f7c66e4e77c23599549fbe4187f952ff2c085","sha256:8dae4ccfaad46a7e81e4f529005769e8b4af2d6b9cb1e1a376dbce7faadfbf7a"],"state_sha256":"289b8f57b59bcf3f3d8f974097687cefdae9b8413726b16dac2ae1604b50f4bd"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"K/2lJ9WRK8Yv1sAGvihvNm3Iet63OuAcoBHxVud6nuEP0h5GHHM5z/Db1RDmHqs6X7BolOWmYwCRPAEoSoKiAw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-15T23:50:42.741734Z","bundle_sha256":"8d05b691add4cc459f1430dfe905b1d5f75682158fd05c21c90f7c66dcd58f16"}}