{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:CNZQSLX6TZUPKY27YUYQDQTU5I","short_pith_number":"pith:CNZQSLX6","canonical_record":{"source":{"id":"1604.04052","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NA","submitted_at":"2016-04-14T07:19:28Z","cross_cats_sorted":[],"title_canon_sha256":"97d87e5670f9758d240312cc43c4bcbf1b4164f484a15b008005b9f9f7525ebc","abstract_canon_sha256":"f99a3c53be5190529589db67a6a1e49827b78529959992e72c705c083b815291"},"schema_version":"1.0"},"canonical_sha256":"1373092efe9e68f5635fc53101c274ea03cc046587e6df067da81704de118f55","source":{"kind":"arxiv","id":"1604.04052","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1604.04052","created_at":"2026-05-18T01:17:06Z"},{"alias_kind":"arxiv_version","alias_value":"1604.04052v1","created_at":"2026-05-18T01:17:06Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1604.04052","created_at":"2026-05-18T01:17:06Z"},{"alias_kind":"pith_short_12","alias_value":"CNZQSLX6TZUP","created_at":"2026-05-18T12:30:09Z"},{"alias_kind":"pith_short_16","alias_value":"CNZQSLX6TZUPKY27","created_at":"2026-05-18T12:30:09Z"},{"alias_kind":"pith_short_8","alias_value":"CNZQSLX6","created_at":"2026-05-18T12:30:09Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:CNZQSLX6TZUPKY27YUYQDQTU5I","target":"record","payload":{"canonical_record":{"source":{"id":"1604.04052","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NA","submitted_at":"2016-04-14T07:19:28Z","cross_cats_sorted":[],"title_canon_sha256":"97d87e5670f9758d240312cc43c4bcbf1b4164f484a15b008005b9f9f7525ebc","abstract_canon_sha256":"f99a3c53be5190529589db67a6a1e49827b78529959992e72c705c083b815291"},"schema_version":"1.0"},"canonical_sha256":"1373092efe9e68f5635fc53101c274ea03cc046587e6df067da81704de118f55","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:17:06.840006Z","signature_b64":"hkMHiNxS06MtUn9emB7+NPYs0ffzhP4BV3AxId3j/rdNe2eCwhvxnt+0Vhb3ecLcnl4sxm0Y3pG0L0MR2ZvoAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"1373092efe9e68f5635fc53101c274ea03cc046587e6df067da81704de118f55","last_reissued_at":"2026-05-18T01:17:06.839271Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:17:06.839271Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1604.04052","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-18T01:17:06Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"2fuOz68SCLBHLmwMbkKWAGMrjGO62GcxCfbeyqofTsVB5uZfyVVHXwmabqQrQWpieZJOenkyLUoeZ6uWefNUDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-09T19:42:38.818094Z"},"content_sha256":"c7ce3fb69aa515aad0b744a0d52a0864bf71b101a78e091a44b2b7498289e039","schema_version":"1.0","event_id":"sha256:c7ce3fb69aa515aad0b744a0d52a0864bf71b101a78e091a44b2b7498289e039"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:CNZQSLX6TZUPKY27YUYQDQTU5I","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Memory-efficient recycling of large Krylov-subspaces for sequences of Hermitian linear systems","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.NA","authors_text":"Martin Peter Neuenhofen, Sven Gro{\\ss}","submitted_at":"2016-04-14T07:19:28Z","abstract_excerpt":"We present a new short-recurrence reaidual-optimal Krylov subspace recycling method for sequences of Hermitian systems of linear equations with a fixed system matrix and changing right-hand sides. Such sequences of linear systems occur while solving, e.g., discretized time-dependent partial differential equations. With this new method it is possible to recycle large-dimensional Krylov-subspaces with smaller computational overhead and storage requirements compared to current Krylov subspace recycling methods as e.g. R-MINRES. In this paper we derive the method from the residual-optimal precondi"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1604.04052","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-18T01:17:06Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"etL+W1yaumb/uutSB1hQ9LuQ+FWUWu4JYl9uc/LwhxXjO662BD9p4l2Mm0Wvyfh8brxnIFYL/sz2kYXMkUX8AQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-09T19:42:38.818833Z"},"content_sha256":"5b94ae5d58bfc8305120cf2fb9605afc3c9f6526e2fd8d5b0e2806c24fee9328","schema_version":"1.0","event_id":"sha256:5b94ae5d58bfc8305120cf2fb9605afc3c9f6526e2fd8d5b0e2806c24fee9328"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/CNZQSLX6TZUPKY27YUYQDQTU5I/bundle.json","state_url":"https://pith.science/pith/CNZQSLX6TZUPKY27YUYQDQTU5I/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/CNZQSLX6TZUPKY27YUYQDQTU5I/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-09T19:42:38Z","links":{"resolver":"https://pith.science/pith/CNZQSLX6TZUPKY27YUYQDQTU5I","bundle":"https://pith.science/pith/CNZQSLX6TZUPKY27YUYQDQTU5I/bundle.json","state":"https://pith.science/pith/CNZQSLX6TZUPKY27YUYQDQTU5I/state.json","well_known_bundle":"https://pith.science/.well-known/pith/CNZQSLX6TZUPKY27YUYQDQTU5I/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:CNZQSLX6TZUPKY27YUYQDQTU5I","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":"f99a3c53be5190529589db67a6a1e49827b78529959992e72c705c083b815291","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NA","submitted_at":"2016-04-14T07:19:28Z","title_canon_sha256":"97d87e5670f9758d240312cc43c4bcbf1b4164f484a15b008005b9f9f7525ebc"},"schema_version":"1.0","source":{"id":"1604.04052","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1604.04052","created_at":"2026-05-18T01:17:06Z"},{"alias_kind":"arxiv_version","alias_value":"1604.04052v1","created_at":"2026-05-18T01:17:06Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1604.04052","created_at":"2026-05-18T01:17:06Z"},{"alias_kind":"pith_short_12","alias_value":"CNZQSLX6TZUP","created_at":"2026-05-18T12:30:09Z"},{"alias_kind":"pith_short_16","alias_value":"CNZQSLX6TZUPKY27","created_at":"2026-05-18T12:30:09Z"},{"alias_kind":"pith_short_8","alias_value":"CNZQSLX6","created_at":"2026-05-18T12:30:09Z"}],"graph_snapshots":[{"event_id":"sha256:5b94ae5d58bfc8305120cf2fb9605afc3c9f6526e2fd8d5b0e2806c24fee9328","target":"graph","created_at":"2026-05-18T01:17:06Z","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 present a new short-recurrence reaidual-optimal Krylov subspace recycling method for sequences of Hermitian systems of linear equations with a fixed system matrix and changing right-hand sides. Such sequences of linear systems occur while solving, e.g., discretized time-dependent partial differential equations. With this new method it is possible to recycle large-dimensional Krylov-subspaces with smaller computational overhead and storage requirements compared to current Krylov subspace recycling methods as e.g. R-MINRES. In this paper we derive the method from the residual-optimal precondi","authors_text":"Martin Peter Neuenhofen, Sven Gro{\\ss}","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NA","submitted_at":"2016-04-14T07:19:28Z","title":"Memory-efficient recycling of large Krylov-subspaces for sequences of Hermitian linear systems"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1604.04052","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:c7ce3fb69aa515aad0b744a0d52a0864bf71b101a78e091a44b2b7498289e039","target":"record","created_at":"2026-05-18T01:17:06Z","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":"f99a3c53be5190529589db67a6a1e49827b78529959992e72c705c083b815291","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NA","submitted_at":"2016-04-14T07:19:28Z","title_canon_sha256":"97d87e5670f9758d240312cc43c4bcbf1b4164f484a15b008005b9f9f7525ebc"},"schema_version":"1.0","source":{"id":"1604.04052","kind":"arxiv","version":1}},"canonical_sha256":"1373092efe9e68f5635fc53101c274ea03cc046587e6df067da81704de118f55","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"1373092efe9e68f5635fc53101c274ea03cc046587e6df067da81704de118f55","first_computed_at":"2026-05-18T01:17:06.839271Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:17:06.839271Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"hkMHiNxS06MtUn9emB7+NPYs0ffzhP4BV3AxId3j/rdNe2eCwhvxnt+0Vhb3ecLcnl4sxm0Y3pG0L0MR2ZvoAQ==","signature_status":"signed_v1","signed_at":"2026-05-18T01:17:06.840006Z","signed_message":"canonical_sha256_bytes"},"source_id":"1604.04052","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:c7ce3fb69aa515aad0b744a0d52a0864bf71b101a78e091a44b2b7498289e039","sha256:5b94ae5d58bfc8305120cf2fb9605afc3c9f6526e2fd8d5b0e2806c24fee9328"],"state_sha256":"829a15d7d0ce0752313563d96e412cd28f7df681516914b4cb7fedf505ad61b6"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"v1AI2IYuy48Mk7YiWkR20Rzt94I7FwF4Dxd5aTsGRkJEeTqqITSm1Iec2kh3kir/W5XMUf4ovS/4Jq/f7y7+DA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-09T19:42:38.823154Z","bundle_sha256":"6b14f6f6bf33c790fd907b8b3e162ef2356e72fd55061344bb561e73c5a67d9c"}}