{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:QES4JHDMF3OQAPFW7F4GBMWR2I","short_pith_number":"pith:QES4JHDM","canonical_record":{"source":{"id":"1707.03045","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NA","submitted_at":"2017-07-10T20:08:48Z","cross_cats_sorted":["cs.SI"],"title_canon_sha256":"6919a52ed2914e09b14408e04807acf47dad8d8ca2d9fe0d5e3e71257cb107a2","abstract_canon_sha256":"aa923e0508ed9893140ccae276def1b33bfdeaa12ada510c56a88e035994c9de"},"schema_version":"1.0"},"canonical_sha256":"8125c49c6c2edd003cb6f97860b2d1d21f3bb4a9fe1e471883b5593a8911fd61","source":{"kind":"arxiv","id":"1707.03045","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1707.03045","created_at":"2026-05-18T00:40:34Z"},{"alias_kind":"arxiv_version","alias_value":"1707.03045v1","created_at":"2026-05-18T00:40:34Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1707.03045","created_at":"2026-05-18T00:40:34Z"},{"alias_kind":"pith_short_12","alias_value":"QES4JHDMF3OQ","created_at":"2026-05-18T12:31:37Z"},{"alias_kind":"pith_short_16","alias_value":"QES4JHDMF3OQAPFW","created_at":"2026-05-18T12:31:37Z"},{"alias_kind":"pith_short_8","alias_value":"QES4JHDM","created_at":"2026-05-18T12:31:37Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:QES4JHDMF3OQAPFW7F4GBMWR2I","target":"record","payload":{"canonical_record":{"source":{"id":"1707.03045","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NA","submitted_at":"2017-07-10T20:08:48Z","cross_cats_sorted":["cs.SI"],"title_canon_sha256":"6919a52ed2914e09b14408e04807acf47dad8d8ca2d9fe0d5e3e71257cb107a2","abstract_canon_sha256":"aa923e0508ed9893140ccae276def1b33bfdeaa12ada510c56a88e035994c9de"},"schema_version":"1.0"},"canonical_sha256":"8125c49c6c2edd003cb6f97860b2d1d21f3bb4a9fe1e471883b5593a8911fd61","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:40:34.508031Z","signature_b64":"KcbG+wq+p7MKUNcbOg9iVoLRdjt84eOysx1fIffsUzv98vUAT6mxKE3QapN6HLs7FO1Y4WKz66Yyqsd58e49BA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"8125c49c6c2edd003cb6f97860b2d1d21f3bb4a9fe1e471883b5593a8911fd61","last_reissued_at":"2026-05-18T00:40:34.507344Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:40:34.507344Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1707.03045","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-05-18T00:40:34Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Tp/tKi1Qmf0YrL1fPeogRQs5+KtVSyOD1/3b4T+rCUTxHOVwWnwGnLmY1r/3Jr0NhZ+ocS4wNUftAklfUp9hCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-21T07:02:18.746570Z"},"content_sha256":"18dfa22a97b71543eb3020e82432aa6a3a5e8121116ed9966174788f4195e268","schema_version":"1.0","event_id":"sha256:18dfa22a97b71543eb3020e82432aa6a3a5e8121116ed9966174788f4195e268"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:QES4JHDMF3OQAPFW7F4GBMWR2I","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Low-rank updates of matrix functions","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.SI"],"primary_cat":"math.NA","authors_text":"Bernhard Beckermann, Daniel Kressner, Marcel Schweitzer","submitted_at":"2017-07-10T20:08:48Z","abstract_excerpt":"We consider the task of updating a matrix function $f(A)$ when the matrix $A\\in{\\mathbb C}^{n \\times n}$ is subject to a low-rank modification. In other words, we aim at approximating $f(A+D)-f(A)$ for a matrix $D$ of rank $k \\ll n$. The approach proposed in this paper attains efficiency by projecting onto tensorized Krylov subspaces produced by matrix-vector multiplications with $A$ and $A^*$. We prove the approximations obtained from $m$ steps of the proposed methods are exact if $f$ is a polynomial of degree at most $m$ and use this as a basis for proving a variety of convergence results, i"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1707.03045","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":""},"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-18T00:40:34Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"8YHt2atQAa2WEFx+p0NsWI2a4kMPjx+yeghyXR4Lxq4/YZI3zrX6DGbqa1GzCeK+3vB8W/HSia5Eo+amuxp3Bw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-21T07:02:18.746927Z"},"content_sha256":"67fcaae3ab99078cbe7b987a6d1605004d21ce6f694b8a9985db2b65e559dec2","schema_version":"1.0","event_id":"sha256:67fcaae3ab99078cbe7b987a6d1605004d21ce6f694b8a9985db2b65e559dec2"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/QES4JHDMF3OQAPFW7F4GBMWR2I/bundle.json","state_url":"https://pith.science/pith/QES4JHDMF3OQAPFW7F4GBMWR2I/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/QES4JHDMF3OQAPFW7F4GBMWR2I/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-06-21T07:02:18Z","links":{"resolver":"https://pith.science/pith/QES4JHDMF3OQAPFW7F4GBMWR2I","bundle":"https://pith.science/pith/QES4JHDMF3OQAPFW7F4GBMWR2I/bundle.json","state":"https://pith.science/pith/QES4JHDMF3OQAPFW7F4GBMWR2I/state.json","well_known_bundle":"https://pith.science/.well-known/pith/QES4JHDMF3OQAPFW7F4GBMWR2I/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:QES4JHDMF3OQAPFW7F4GBMWR2I","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":"aa923e0508ed9893140ccae276def1b33bfdeaa12ada510c56a88e035994c9de","cross_cats_sorted":["cs.SI"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NA","submitted_at":"2017-07-10T20:08:48Z","title_canon_sha256":"6919a52ed2914e09b14408e04807acf47dad8d8ca2d9fe0d5e3e71257cb107a2"},"schema_version":"1.0","source":{"id":"1707.03045","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1707.03045","created_at":"2026-05-18T00:40:34Z"},{"alias_kind":"arxiv_version","alias_value":"1707.03045v1","created_at":"2026-05-18T00:40:34Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1707.03045","created_at":"2026-05-18T00:40:34Z"},{"alias_kind":"pith_short_12","alias_value":"QES4JHDMF3OQ","created_at":"2026-05-18T12:31:37Z"},{"alias_kind":"pith_short_16","alias_value":"QES4JHDMF3OQAPFW","created_at":"2026-05-18T12:31:37Z"},{"alias_kind":"pith_short_8","alias_value":"QES4JHDM","created_at":"2026-05-18T12:31:37Z"}],"graph_snapshots":[{"event_id":"sha256:67fcaae3ab99078cbe7b987a6d1605004d21ce6f694b8a9985db2b65e559dec2","target":"graph","created_at":"2026-05-18T00:40:34Z","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":"We consider the task of updating a matrix function $f(A)$ when the matrix $A\\in{\\mathbb C}^{n \\times n}$ is subject to a low-rank modification. In other words, we aim at approximating $f(A+D)-f(A)$ for a matrix $D$ of rank $k \\ll n$. The approach proposed in this paper attains efficiency by projecting onto tensorized Krylov subspaces produced by matrix-vector multiplications with $A$ and $A^*$. We prove the approximations obtained from $m$ steps of the proposed methods are exact if $f$ is a polynomial of degree at most $m$ and use this as a basis for proving a variety of convergence results, i","authors_text":"Bernhard Beckermann, Daniel Kressner, Marcel Schweitzer","cross_cats":["cs.SI"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NA","submitted_at":"2017-07-10T20:08:48Z","title":"Low-rank updates of matrix functions"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1707.03045","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:18dfa22a97b71543eb3020e82432aa6a3a5e8121116ed9966174788f4195e268","target":"record","created_at":"2026-05-18T00:40:34Z","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":"aa923e0508ed9893140ccae276def1b33bfdeaa12ada510c56a88e035994c9de","cross_cats_sorted":["cs.SI"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NA","submitted_at":"2017-07-10T20:08:48Z","title_canon_sha256":"6919a52ed2914e09b14408e04807acf47dad8d8ca2d9fe0d5e3e71257cb107a2"},"schema_version":"1.0","source":{"id":"1707.03045","kind":"arxiv","version":1}},"canonical_sha256":"8125c49c6c2edd003cb6f97860b2d1d21f3bb4a9fe1e471883b5593a8911fd61","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"8125c49c6c2edd003cb6f97860b2d1d21f3bb4a9fe1e471883b5593a8911fd61","first_computed_at":"2026-05-18T00:40:34.507344Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:40:34.507344Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"KcbG+wq+p7MKUNcbOg9iVoLRdjt84eOysx1fIffsUzv98vUAT6mxKE3QapN6HLs7FO1Y4WKz66Yyqsd58e49BA==","signature_status":"signed_v1","signed_at":"2026-05-18T00:40:34.508031Z","signed_message":"canonical_sha256_bytes"},"source_id":"1707.03045","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:18dfa22a97b71543eb3020e82432aa6a3a5e8121116ed9966174788f4195e268","sha256:67fcaae3ab99078cbe7b987a6d1605004d21ce6f694b8a9985db2b65e559dec2"],"state_sha256":"39fb5e58c2e84e11a20a3027dbdff7deafb301230f212309d55390d80ea40458"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"0WCBITVf7gPHsCjbcSM2vMXdY1wcVJSsD7vzWGaMma7PQBVYK7JI5pW0tOw29w9aevWPHKJBpAk64SUsWavRCg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-21T07:02:18.749238Z","bundle_sha256":"e80775394314f52e33f6f56aac4581c2f83288df085233d7a51ce04492ea0514"}}