{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2024:7IAITW6FIXJ7OWU4PU6AFN6JBK","short_pith_number":"pith:7IAITW6F","schema_version":"1.0","canonical_sha256":"fa0089dbc545d3f75a9c7d3c02b7c90a83a300185ade14ed1297eef851e59633","source":{"kind":"arxiv","id":"2411.17729","version":3},"attestation_state":"computed","paper":{"title":"Fast convolution algorithm for state space models","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI","cs.NA"],"primary_cat":"math.NA","authors_text":"Gregory Beylkin","submitted_at":"2024-11-22T05:30:03Z","abstract_excerpt":"We present an unconditionally stable algorithm for applying matrix transfer function of a linear time invariant system (LTI) in time domain. The state matrix of an LTI system used for modeling long range dependencies in state space models (SSMs) has eigenvalues close to $1$. The standard recursion defining LTI system becomes unstable if the $m\\times m$ state matrix has just one eigenvalue with absolute value even slightly greater than 1. This may occur when approximating a state matrix by a structured matrix to reduce the cost of matrix-vector multiplication from $\\mathcal{O}\\left(m^{2}\\right)"},"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":"2411.17729","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NA","submitted_at":"2024-11-22T05:30:03Z","cross_cats_sorted":["cs.AI","cs.NA"],"title_canon_sha256":"f619cb0a4108ffc8eddac3bcfc3e352ef1301b1366e33e724ad59a7fe66bea13","abstract_canon_sha256":"47bfa475f84633b17a8ac95efa29a5d3435479eeeedddba33deef46979d01e03"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T10:47:33.909735Z","signature_b64":"4BRmECORz0dCF+MEpk2GjPMa1rq5+csBheL0zIYEpL/wXQiTux6L36RTwDfD1JKtlF7drxmNZN1gWjr58aJvAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"fa0089dbc545d3f75a9c7d3c02b7c90a83a300185ade14ed1297eef851e59633","last_reissued_at":"2026-07-05T10:47:33.909267Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T10:47:33.909267Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Fast convolution algorithm for state space models","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI","cs.NA"],"primary_cat":"math.NA","authors_text":"Gregory Beylkin","submitted_at":"2024-11-22T05:30:03Z","abstract_excerpt":"We present an unconditionally stable algorithm for applying matrix transfer function of a linear time invariant system (LTI) in time domain. The state matrix of an LTI system used for modeling long range dependencies in state space models (SSMs) has eigenvalues close to $1$. The standard recursion defining LTI system becomes unstable if the $m\\times m$ state matrix has just one eigenvalue with absolute value even slightly greater than 1. This may occur when approximating a state matrix by a structured matrix to reduce the cost of matrix-vector multiplication from $\\mathcal{O}\\left(m^{2}\\right)"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2411.17729","kind":"arxiv","version":3},"verdict":{"id":null,"model_set":{},"created_at":null,"strongest_claim":"","one_line_summary":"","pipeline_version":null,"weakest_assumption":"","pith_extraction_headline":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2411.17729/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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":"2411.17729","created_at":"2026-07-05T10:47:33.909323+00:00"},{"alias_kind":"arxiv_version","alias_value":"2411.17729v3","created_at":"2026-07-05T10:47:33.909323+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2411.17729","created_at":"2026-07-05T10:47:33.909323+00:00"},{"alias_kind":"pith_short_12","alias_value":"7IAITW6FIXJ7","created_at":"2026-07-05T10:47:33.909323+00:00"},{"alias_kind":"pith_short_16","alias_value":"7IAITW6FIXJ7OWU4","created_at":"2026-07-05T10:47:33.909323+00:00"},{"alias_kind":"pith_short_8","alias_value":"7IAITW6F","created_at":"2026-07-05T10:47:33.909323+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/7IAITW6FIXJ7OWU4PU6AFN6JBK","json":"https://pith.science/pith/7IAITW6FIXJ7OWU4PU6AFN6JBK.json","graph_json":"https://pith.science/api/pith-number/7IAITW6FIXJ7OWU4PU6AFN6JBK/graph.json","events_json":"https://pith.science/api/pith-number/7IAITW6FIXJ7OWU4PU6AFN6JBK/events.json","paper":"https://pith.science/paper/7IAITW6F"},"agent_actions":{"view_html":"https://pith.science/pith/7IAITW6FIXJ7OWU4PU6AFN6JBK","download_json":"https://pith.science/pith/7IAITW6FIXJ7OWU4PU6AFN6JBK.json","view_paper":"https://pith.science/paper/7IAITW6F","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2411.17729&json=true","fetch_graph":"https://pith.science/api/pith-number/7IAITW6FIXJ7OWU4PU6AFN6JBK/graph.json","fetch_events":"https://pith.science/api/pith-number/7IAITW6FIXJ7OWU4PU6AFN6JBK/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/7IAITW6FIXJ7OWU4PU6AFN6JBK/action/timestamp_anchor","attest_storage":"https://pith.science/pith/7IAITW6FIXJ7OWU4PU6AFN6JBK/action/storage_attestation","attest_author":"https://pith.science/pith/7IAITW6FIXJ7OWU4PU6AFN6JBK/action/author_attestation","sign_citation":"https://pith.science/pith/7IAITW6FIXJ7OWU4PU6AFN6JBK/action/citation_signature","submit_replication":"https://pith.science/pith/7IAITW6FIXJ7OWU4PU6AFN6JBK/action/replication_record"}},"created_at":"2026-07-05T10:47:33.909323+00:00","updated_at":"2026-07-05T10:47:33.909323+00:00"}