{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:OJOWKBQJNHLZVJDMHAYFLF7GUR","short_pith_number":"pith:OJOWKBQJ","canonical_record":{"source":{"id":"1809.06574","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NA","submitted_at":"2018-09-18T07:57:09Z","cross_cats_sorted":[],"title_canon_sha256":"0726996b59ec42b1fdb6d8fdb4771d560bbab80890e1c1be3691aa343fe2c323","abstract_canon_sha256":"f24cbabe468bf05b674ce47d477aaa96299a9b37027591e457e5f31aa0028dbc"},"schema_version":"1.0"},"canonical_sha256":"725d65060969d79aa46c38305597e6a4538fdf486af4a7b8fbda2efe44fcd655","source":{"kind":"arxiv","id":"1809.06574","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1809.06574","created_at":"2026-05-18T00:05:25Z"},{"alias_kind":"arxiv_version","alias_value":"1809.06574v1","created_at":"2026-05-18T00:05:25Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1809.06574","created_at":"2026-05-18T00:05:25Z"},{"alias_kind":"pith_short_12","alias_value":"OJOWKBQJNHLZ","created_at":"2026-05-18T12:32:43Z"},{"alias_kind":"pith_short_16","alias_value":"OJOWKBQJNHLZVJDM","created_at":"2026-05-18T12:32:43Z"},{"alias_kind":"pith_short_8","alias_value":"OJOWKBQJ","created_at":"2026-05-18T12:32:43Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:OJOWKBQJNHLZVJDMHAYFLF7GUR","target":"record","payload":{"canonical_record":{"source":{"id":"1809.06574","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NA","submitted_at":"2018-09-18T07:57:09Z","cross_cats_sorted":[],"title_canon_sha256":"0726996b59ec42b1fdb6d8fdb4771d560bbab80890e1c1be3691aa343fe2c323","abstract_canon_sha256":"f24cbabe468bf05b674ce47d477aaa96299a9b37027591e457e5f31aa0028dbc"},"schema_version":"1.0"},"canonical_sha256":"725d65060969d79aa46c38305597e6a4538fdf486af4a7b8fbda2efe44fcd655","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:05:25.315183Z","signature_b64":"ZuCGskDM7VpIDvBFxW434mp1CinG/2BCdcmGY8WHli4EmE5VcniiItdrZ+L9OHzWHpMI2r4HrMW7bjm5S1NxCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"725d65060969d79aa46c38305597e6a4538fdf486af4a7b8fbda2efe44fcd655","last_reissued_at":"2026-05-18T00:05:25.314673Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:05:25.314673Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1809.06574","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:05:25Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"BDS2jeJjtvq6DupEnp/ZhkYedvu3XguP1hx9pPUS/6yfSAhlo0drM03r4mu2j7iVTBYvdk0XBjRlIPqYcF/WAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-05T14:39:32.788939Z"},"content_sha256":"1b057f31afcd814361c9a3f0aa655244e5622777e520a4f29102f7239b34610c","schema_version":"1.0","event_id":"sha256:1b057f31afcd814361c9a3f0aa655244e5622777e520a4f29102f7239b34610c"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:OJOWKBQJNHLZVJDMHAYFLF7GUR","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Preconditioned Linear Solves for Parametric Model Order Reduction","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.NA","authors_text":"Kapil Ahuja, Navneet Pratap Singh","submitted_at":"2018-09-18T07:57:09Z","abstract_excerpt":"The main computational cost of algorithms for computing reduced-order models of parametric dynamical systems is in solving sequences of very large and sparse linear systems. We focus on efficiently solving these linear systems, arising while reducing second-order linear dynamical systems, by iterative methods with appropriate preconditioners.\n  We propose that the choice of underlying iterative solver is problem dependent. We propose the use of block variant of the underlying iterative method because often all right-hand-side are available together. Since, Sparse Approximate Inverse (SPAI) pre"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1809.06574","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:05:25Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"NWFEjBiujS2Vq6ASb3Ge/1AbUOMGbXqdylcVDOL1qSWLitT9kW6ZFIcmO5B81CzCInQ34JYD6CISJ7hnW70QBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-05T14:39:32.789562Z"},"content_sha256":"c3aec80280f3465d660e55add9858d7596bddc92848891ac495f10663bcf6277","schema_version":"1.0","event_id":"sha256:c3aec80280f3465d660e55add9858d7596bddc92848891ac495f10663bcf6277"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/OJOWKBQJNHLZVJDMHAYFLF7GUR/bundle.json","state_url":"https://pith.science/pith/OJOWKBQJNHLZVJDMHAYFLF7GUR/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/OJOWKBQJNHLZVJDMHAYFLF7GUR/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-07-05T14:39:32Z","links":{"resolver":"https://pith.science/pith/OJOWKBQJNHLZVJDMHAYFLF7GUR","bundle":"https://pith.science/pith/OJOWKBQJNHLZVJDMHAYFLF7GUR/bundle.json","state":"https://pith.science/pith/OJOWKBQJNHLZVJDMHAYFLF7GUR/state.json","well_known_bundle":"https://pith.science/.well-known/pith/OJOWKBQJNHLZVJDMHAYFLF7GUR/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:OJOWKBQJNHLZVJDMHAYFLF7GUR","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":"f24cbabe468bf05b674ce47d477aaa96299a9b37027591e457e5f31aa0028dbc","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NA","submitted_at":"2018-09-18T07:57:09Z","title_canon_sha256":"0726996b59ec42b1fdb6d8fdb4771d560bbab80890e1c1be3691aa343fe2c323"},"schema_version":"1.0","source":{"id":"1809.06574","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1809.06574","created_at":"2026-05-18T00:05:25Z"},{"alias_kind":"arxiv_version","alias_value":"1809.06574v1","created_at":"2026-05-18T00:05:25Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1809.06574","created_at":"2026-05-18T00:05:25Z"},{"alias_kind":"pith_short_12","alias_value":"OJOWKBQJNHLZ","created_at":"2026-05-18T12:32:43Z"},{"alias_kind":"pith_short_16","alias_value":"OJOWKBQJNHLZVJDM","created_at":"2026-05-18T12:32:43Z"},{"alias_kind":"pith_short_8","alias_value":"OJOWKBQJ","created_at":"2026-05-18T12:32:43Z"}],"graph_snapshots":[{"event_id":"sha256:c3aec80280f3465d660e55add9858d7596bddc92848891ac495f10663bcf6277","target":"graph","created_at":"2026-05-18T00:05:25Z","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":"The main computational cost of algorithms for computing reduced-order models of parametric dynamical systems is in solving sequences of very large and sparse linear systems. We focus on efficiently solving these linear systems, arising while reducing second-order linear dynamical systems, by iterative methods with appropriate preconditioners.\n  We propose that the choice of underlying iterative solver is problem dependent. We propose the use of block variant of the underlying iterative method because often all right-hand-side are available together. Since, Sparse Approximate Inverse (SPAI) pre","authors_text":"Kapil Ahuja, Navneet Pratap Singh","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NA","submitted_at":"2018-09-18T07:57:09Z","title":"Preconditioned Linear Solves for Parametric Model Order Reduction"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1809.06574","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:1b057f31afcd814361c9a3f0aa655244e5622777e520a4f29102f7239b34610c","target":"record","created_at":"2026-05-18T00:05:25Z","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":"f24cbabe468bf05b674ce47d477aaa96299a9b37027591e457e5f31aa0028dbc","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NA","submitted_at":"2018-09-18T07:57:09Z","title_canon_sha256":"0726996b59ec42b1fdb6d8fdb4771d560bbab80890e1c1be3691aa343fe2c323"},"schema_version":"1.0","source":{"id":"1809.06574","kind":"arxiv","version":1}},"canonical_sha256":"725d65060969d79aa46c38305597e6a4538fdf486af4a7b8fbda2efe44fcd655","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"725d65060969d79aa46c38305597e6a4538fdf486af4a7b8fbda2efe44fcd655","first_computed_at":"2026-05-18T00:05:25.314673Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:05:25.314673Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"ZuCGskDM7VpIDvBFxW434mp1CinG/2BCdcmGY8WHli4EmE5VcniiItdrZ+L9OHzWHpMI2r4HrMW7bjm5S1NxCQ==","signature_status":"signed_v1","signed_at":"2026-05-18T00:05:25.315183Z","signed_message":"canonical_sha256_bytes"},"source_id":"1809.06574","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:1b057f31afcd814361c9a3f0aa655244e5622777e520a4f29102f7239b34610c","sha256:c3aec80280f3465d660e55add9858d7596bddc92848891ac495f10663bcf6277"],"state_sha256":"8adfbf086ce97737c8fd2ce8b825518d391757bd4589b6381516880f97f12b03"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"DvxIyZUCMjkqPegGDX+FoC8cItS5VZTJhuTax9m8pQ9Ia08b/Dn6jGtoMHzB3NAzSX6ZFsoONSPEAAjP2rPMCg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-07-05T14:39:32.792727Z","bundle_sha256":"74b77ee1f1828d0d65b2490c6e948132a607ff4cb36a724f763cb61e9ded4e35"}}