{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2026:XTCPMDZC7R3PWBSWFDPULYXSXI","short_pith_number":"pith:XTCPMDZC","schema_version":"1.0","canonical_sha256":"bcc4f60f22fc76fb065628df45e2f2ba34bc1b980907b6fb97b977d3b9b3a16a","source":{"kind":"arxiv","id":"2605.19150","version":1},"attestation_state":"computed","paper":{"title":"Flash PD-SSM: Memory-Optimized Structured Sparse State-Space Models","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.AI"],"primary_cat":"cs.LG","authors_text":"Abbas Rahimi, Aleksandar Terzi\\'c, Francesco Carzaniga, Michael Hersche, Nicolas Menet, Thomas Hofmann, Yannick Biehl","submitted_at":"2026-05-18T22:06:33Z","abstract_excerpt":"State-space models (SSMs) face a fundamental trade-off between efficiency and expressivity that is mainly dictated by the structure of the model's transition matrix. Unstructured transition matrices enable maximal expressivity, as measured by their ability to model finite-state automaton (FSA) transitions, but come at a prohibitively high compute and memory cost. In contrast, most structured transition matrix forms are highly efficient both in runtime and memory consumption, but suffer from limited expressivity. Building on recent work on structured sparse SSMs, we propose Flash PD-SSM, a nove"},"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":"2605.19150","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2026-05-18T22:06:33Z","cross_cats_sorted":["cs.AI"],"title_canon_sha256":"4a92fe16a46916a055c41493ce19f023231629150f17aacd1e89a0bc85e59524","abstract_canon_sha256":"bd97a8c36cd1a72e61739d0145d81823df2c1dff5d4df3ee64f2a488ffa322d3"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-20T01:05:29.649160Z","signature_b64":"NVlGAyB6E0ls53OboPNYE2GqoeNDalTwF/tLHyEG7D83hGWhkoI6hNmx7e/BTj8kJW34TPMW14AbojLabX6MDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"bcc4f60f22fc76fb065628df45e2f2ba34bc1b980907b6fb97b977d3b9b3a16a","last_reissued_at":"2026-05-20T01:05:29.648290Z","signature_status":"signed_v1","first_computed_at":"2026-05-20T01:05:29.648290Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Flash PD-SSM: Memory-Optimized Structured Sparse State-Space Models","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.AI"],"primary_cat":"cs.LG","authors_text":"Abbas Rahimi, Aleksandar Terzi\\'c, Francesco Carzaniga, Michael Hersche, Nicolas Menet, Thomas Hofmann, Yannick Biehl","submitted_at":"2026-05-18T22:06:33Z","abstract_excerpt":"State-space models (SSMs) face a fundamental trade-off between efficiency and expressivity that is mainly dictated by the structure of the model's transition matrix. Unstructured transition matrices enable maximal expressivity, as measured by their ability to model finite-state automaton (FSA) transitions, but come at a prohibitively high compute and memory cost. In contrast, most structured transition matrix forms are highly efficient both in runtime and memory consumption, but suffer from limited expressivity. Building on recent work on structured sparse SSMs, we propose Flash PD-SSM, a nove"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2605.19150","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2605.19150/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":"2605.19150","created_at":"2026-05-20T01:05:29.648455+00:00"},{"alias_kind":"arxiv_version","alias_value":"2605.19150v1","created_at":"2026-05-20T01:05:29.648455+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2605.19150","created_at":"2026-05-20T01:05:29.648455+00:00"},{"alias_kind":"pith_short_12","alias_value":"XTCPMDZC7R3P","created_at":"2026-05-20T01:05:29.648455+00:00"},{"alias_kind":"pith_short_16","alias_value":"XTCPMDZC7R3PWBSW","created_at":"2026-05-20T01:05:29.648455+00:00"},{"alias_kind":"pith_short_8","alias_value":"XTCPMDZC","created_at":"2026-05-20T01:05:29.648455+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/XTCPMDZC7R3PWBSWFDPULYXSXI","json":"https://pith.science/pith/XTCPMDZC7R3PWBSWFDPULYXSXI.json","graph_json":"https://pith.science/api/pith-number/XTCPMDZC7R3PWBSWFDPULYXSXI/graph.json","events_json":"https://pith.science/api/pith-number/XTCPMDZC7R3PWBSWFDPULYXSXI/events.json","paper":"https://pith.science/paper/XTCPMDZC"},"agent_actions":{"view_html":"https://pith.science/pith/XTCPMDZC7R3PWBSWFDPULYXSXI","download_json":"https://pith.science/pith/XTCPMDZC7R3PWBSWFDPULYXSXI.json","view_paper":"https://pith.science/paper/XTCPMDZC","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2605.19150&json=true","fetch_graph":"https://pith.science/api/pith-number/XTCPMDZC7R3PWBSWFDPULYXSXI/graph.json","fetch_events":"https://pith.science/api/pith-number/XTCPMDZC7R3PWBSWFDPULYXSXI/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/XTCPMDZC7R3PWBSWFDPULYXSXI/action/timestamp_anchor","attest_storage":"https://pith.science/pith/XTCPMDZC7R3PWBSWFDPULYXSXI/action/storage_attestation","attest_author":"https://pith.science/pith/XTCPMDZC7R3PWBSWFDPULYXSXI/action/author_attestation","sign_citation":"https://pith.science/pith/XTCPMDZC7R3PWBSWFDPULYXSXI/action/citation_signature","submit_replication":"https://pith.science/pith/XTCPMDZC7R3PWBSWFDPULYXSXI/action/replication_record"}},"created_at":"2026-05-20T01:05:29.648455+00:00","updated_at":"2026-05-20T01:05:29.648455+00:00"}