{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2005:7WLA6WHCIGHEJ4ZJX3LS2EZPF4","short_pith_number":"pith:7WLA6WHC","schema_version":"1.0","canonical_sha256":"fd960f58e2418e44f329bed72d132f2f22fb1cf26819782b545630fcbd3b3d3b","source":{"kind":"arxiv","id":"math/0504461","version":1},"attestation_state":"computed","paper":{"title":"Fast and oblivious convolution quadrature","license":"","headline":"","cross_cats":[],"primary_cat":"math.NA","authors_text":"Achim Sch\\\"adle, Christian Lubich, Mar\\'ia L\\'opez-Fern\\'andez","submitted_at":"2005-04-22T12:56:36Z","abstract_excerpt":"We give an algorithm to compute $N$ steps of a convolution quadrature approximation to a continuous temporal convolution using only $O(N \\log N)$ multiplications and $O(\\log N)$ active memory. The method does not require evaluations of the convolution kernel, but instead $O(\\log N)$ evaluations of its Laplace transform, which is assumed sectorial.\n  The algorithm can be used for the stable numerical solution with quasi-optimal complexity of linear and nonlinear integral and integro-differential equations of convolution type. In a numerical example we apply it to solve a subdiffusion equation w"},"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":"math/0504461","kind":"arxiv","version":1},"metadata":{"license":"","primary_cat":"math.NA","submitted_at":"2005-04-22T12:56:36Z","cross_cats_sorted":[],"title_canon_sha256":"26fea0a93f8eac6dfc60509e62f90b5073b03ac9e572e1e61116c47042e51d02","abstract_canon_sha256":"61c494aef1bf20094d173f74ec67cc8049c61efed6e8dcac810523559d1029eb"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:08:35.715417Z","signature_b64":"cfM32unj4ALi0v/XKRZVYBGfW2rL/ljcX6MIqTNMq0ccMKnKZZcvhftPNMvx/6rkBxR+wXQQyPxcGchCkspDBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"fd960f58e2418e44f329bed72d132f2f22fb1cf26819782b545630fcbd3b3d3b","last_reissued_at":"2026-05-18T04:08:35.714888Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:08:35.714888Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Fast and oblivious convolution quadrature","license":"","headline":"","cross_cats":[],"primary_cat":"math.NA","authors_text":"Achim Sch\\\"adle, Christian Lubich, Mar\\'ia L\\'opez-Fern\\'andez","submitted_at":"2005-04-22T12:56:36Z","abstract_excerpt":"We give an algorithm to compute $N$ steps of a convolution quadrature approximation to a continuous temporal convolution using only $O(N \\log N)$ multiplications and $O(\\log N)$ active memory. The method does not require evaluations of the convolution kernel, but instead $O(\\log N)$ evaluations of its Laplace transform, which is assumed sectorial.\n  The algorithm can be used for the stable numerical solution with quasi-optimal complexity of linear and nonlinear integral and integro-differential equations of convolution type. In a numerical example we apply it to solve a subdiffusion equation w"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"math/0504461","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":"math/0504461","created_at":"2026-05-18T04:08:35.714971+00:00"},{"alias_kind":"arxiv_version","alias_value":"math/0504461v1","created_at":"2026-05-18T04:08:35.714971+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.math/0504461","created_at":"2026-05-18T04:08:35.714971+00:00"},{"alias_kind":"pith_short_12","alias_value":"7WLA6WHCIGHE","created_at":"2026-05-18T12:25:53.335082+00:00"},{"alias_kind":"pith_short_16","alias_value":"7WLA6WHCIGHEJ4ZJ","created_at":"2026-05-18T12:25:53.335082+00:00"},{"alias_kind":"pith_short_8","alias_value":"7WLA6WHC","created_at":"2026-05-18T12:25:53.335082+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/7WLA6WHCIGHEJ4ZJX3LS2EZPF4","json":"https://pith.science/pith/7WLA6WHCIGHEJ4ZJX3LS2EZPF4.json","graph_json":"https://pith.science/api/pith-number/7WLA6WHCIGHEJ4ZJX3LS2EZPF4/graph.json","events_json":"https://pith.science/api/pith-number/7WLA6WHCIGHEJ4ZJX3LS2EZPF4/events.json","paper":"https://pith.science/paper/7WLA6WHC"},"agent_actions":{"view_html":"https://pith.science/pith/7WLA6WHCIGHEJ4ZJX3LS2EZPF4","download_json":"https://pith.science/pith/7WLA6WHCIGHEJ4ZJX3LS2EZPF4.json","view_paper":"https://pith.science/paper/7WLA6WHC","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=math/0504461&json=true","fetch_graph":"https://pith.science/api/pith-number/7WLA6WHCIGHEJ4ZJX3LS2EZPF4/graph.json","fetch_events":"https://pith.science/api/pith-number/7WLA6WHCIGHEJ4ZJX3LS2EZPF4/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/7WLA6WHCIGHEJ4ZJX3LS2EZPF4/action/timestamp_anchor","attest_storage":"https://pith.science/pith/7WLA6WHCIGHEJ4ZJX3LS2EZPF4/action/storage_attestation","attest_author":"https://pith.science/pith/7WLA6WHCIGHEJ4ZJX3LS2EZPF4/action/author_attestation","sign_citation":"https://pith.science/pith/7WLA6WHCIGHEJ4ZJX3LS2EZPF4/action/citation_signature","submit_replication":"https://pith.science/pith/7WLA6WHCIGHEJ4ZJX3LS2EZPF4/action/replication_record"}},"created_at":"2026-05-18T04:08:35.714971+00:00","updated_at":"2026-05-18T04:08:35.714971+00:00"}