{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:FQM6AG3FAZXLMP5UQHSNBF7LBJ","short_pith_number":"pith:FQM6AG3F","schema_version":"1.0","canonical_sha256":"2c19e01b65066eb63fb481e4d097eb0a7169275feaccd699ce30405aa620969b","source":{"kind":"arxiv","id":"1608.02089","version":1},"attestation_state":"computed","paper":{"title":"New efficient substepping methods for exponential timestepping","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.NA","authors_text":"Daniel Stone, Gabriel Lord","submitted_at":"2016-08-06T10:15:55Z","abstract_excerpt":"Exponential integrators are time stepping schemes which exactly solve the linear part of a semilinear ODE system. This class of schemes requires the approxima- tion of a matrix exponential in every step, and one successful modern method is the Krylov subspace projection method. We investigate the effect of breaking down a single timestep into arbitrary multiple substeps, recycling the Krylov subspace to minimise costs. For these recyling based schemes we analyse the lo- cal error, investigate them numerically and show they can be applied to a large system with 106 unknowns. We also propose a n"},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"canonical_record":{"source":{"id":"1608.02089","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NA","submitted_at":"2016-08-06T10:15:55Z","cross_cats_sorted":[],"title_canon_sha256":"a6fb0580fb4dfcbc9f8dde7bb6047a3d7e251831c6da53fd675de38e6441fc52","abstract_canon_sha256":"1164411aeeb2a99a5375a26e5224a123ff7599ec1fa0bc253a9b77e12a6c0554"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:09:40.998965Z","signature_b64":"6terJTGP0rE111E4pQkVXv4LyI4z3KmjN4oxTqmlKrpO6HeLy0m8urC/iilnztlfKtNRiZpQM8RsM3ymppUsDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"2c19e01b65066eb63fb481e4d097eb0a7169275feaccd699ce30405aa620969b","last_reissued_at":"2026-05-18T01:09:40.998398Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:09:40.998398Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"New efficient substepping methods for exponential timestepping","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.NA","authors_text":"Daniel Stone, Gabriel Lord","submitted_at":"2016-08-06T10:15:55Z","abstract_excerpt":"Exponential integrators are time stepping schemes which exactly solve the linear part of a semilinear ODE system. This class of schemes requires the approxima- tion of a matrix exponential in every step, and one successful modern method is the Krylov subspace projection method. We investigate the effect of breaking down a single timestep into arbitrary multiple substeps, recycling the Krylov subspace to minimise costs. For these recyling based schemes we analyse the lo- cal error, investigate them numerically and show they can be applied to a large system with 106 unknowns. We also propose a n"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1608.02089","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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1608.02089","created_at":"2026-05-18T01:09:40.998473+00:00"},{"alias_kind":"arxiv_version","alias_value":"1608.02089v1","created_at":"2026-05-18T01:09:40.998473+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1608.02089","created_at":"2026-05-18T01:09:40.998473+00:00"},{"alias_kind":"pith_short_12","alias_value":"FQM6AG3FAZXL","created_at":"2026-05-18T12:30:15.759754+00:00"},{"alias_kind":"pith_short_16","alias_value":"FQM6AG3FAZXLMP5U","created_at":"2026-05-18T12:30:15.759754+00:00"},{"alias_kind":"pith_short_8","alias_value":"FQM6AG3F","created_at":"2026-05-18T12:30:15.759754+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/FQM6AG3FAZXLMP5UQHSNBF7LBJ","json":"https://pith.science/pith/FQM6AG3FAZXLMP5UQHSNBF7LBJ.json","graph_json":"https://pith.science/api/pith-number/FQM6AG3FAZXLMP5UQHSNBF7LBJ/graph.json","events_json":"https://pith.science/api/pith-number/FQM6AG3FAZXLMP5UQHSNBF7LBJ/events.json","paper":"https://pith.science/paper/FQM6AG3F"},"agent_actions":{"view_html":"https://pith.science/pith/FQM6AG3FAZXLMP5UQHSNBF7LBJ","download_json":"https://pith.science/pith/FQM6AG3FAZXLMP5UQHSNBF7LBJ.json","view_paper":"https://pith.science/paper/FQM6AG3F","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1608.02089&json=true","fetch_graph":"https://pith.science/api/pith-number/FQM6AG3FAZXLMP5UQHSNBF7LBJ/graph.json","fetch_events":"https://pith.science/api/pith-number/FQM6AG3FAZXLMP5UQHSNBF7LBJ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/FQM6AG3FAZXLMP5UQHSNBF7LBJ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/FQM6AG3FAZXLMP5UQHSNBF7LBJ/action/storage_attestation","attest_author":"https://pith.science/pith/FQM6AG3FAZXLMP5UQHSNBF7LBJ/action/author_attestation","sign_citation":"https://pith.science/pith/FQM6AG3FAZXLMP5UQHSNBF7LBJ/action/citation_signature","submit_replication":"https://pith.science/pith/FQM6AG3FAZXLMP5UQHSNBF7LBJ/action/replication_record"}},"created_at":"2026-05-18T01:09:40.998473+00:00","updated_at":"2026-05-18T01:09:40.998473+00:00"}