{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2025:GC66EG3MIEPVJNOKGYMK3ZJUO3","short_pith_number":"pith:GC66EG3M","schema_version":"1.0","canonical_sha256":"30bde21b6c411f54b5ca3618ade53476fecbe8d245aafbd4d539f8df5d4a3d9b","source":{"kind":"arxiv","id":"2503.13427","version":1},"attestation_state":"computed","paper":{"title":"xLSTM 7B: A Recurrent LLM for Fast and Efficient Inference","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.AI","cs.CL"],"primary_cat":"cs.LG","authors_text":"G\\\"unter Klambauer, Korbinian P\\\"oppel, Maximilian Beck, Patrick M. Blies, Phillip Lippe, Richard Kurle, Sebastian B\\\"ock, Sepp Hochreiter","submitted_at":"2025-03-17T17:54:55Z","abstract_excerpt":"Recent breakthroughs in solving reasoning, math and coding problems with Large Language Models (LLMs) have been enabled by investing substantial computation budgets at inference time. Therefore, inference speed is one of the most critical properties of LLM architectures, and there is a growing need for LLMs that are efficient and fast at inference. Recently, LLMs built on the xLSTM architecture have emerged as a powerful alternative to Transformers, offering linear compute scaling with sequence length and constant memory usage, both highly desirable properties for efficient inference. However,"},"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":"2503.13427","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2025-03-17T17:54:55Z","cross_cats_sorted":["cs.AI","cs.CL"],"title_canon_sha256":"dfa1ebdb890d543b2ea091f387acd4799ccb4020b3fd4630944be6f5d5e6c83f","abstract_canon_sha256":"aa91c0fc81ec6160ca828f50bb4864b4b909800bc183e94849ae34d4c4c3c3b9"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T10:33:00.489126Z","signature_b64":"8wbPSq6a49FfPKHoX+hXW9HYHwTGeQEWGJcWiJgY4MjQmNQKLvA0T8db1c8lWxkL96GI0stMGYk3KKaK4wQGAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"30bde21b6c411f54b5ca3618ade53476fecbe8d245aafbd4d539f8df5d4a3d9b","last_reissued_at":"2026-07-05T10:33:00.488196Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T10:33:00.488196Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"xLSTM 7B: A Recurrent LLM for Fast and Efficient Inference","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.AI","cs.CL"],"primary_cat":"cs.LG","authors_text":"G\\\"unter Klambauer, Korbinian P\\\"oppel, Maximilian Beck, Patrick M. Blies, Phillip Lippe, Richard Kurle, Sebastian B\\\"ock, Sepp Hochreiter","submitted_at":"2025-03-17T17:54:55Z","abstract_excerpt":"Recent breakthroughs in solving reasoning, math and coding problems with Large Language Models (LLMs) have been enabled by investing substantial computation budgets at inference time. Therefore, inference speed is one of the most critical properties of LLM architectures, and there is a growing need for LLMs that are efficient and fast at inference. Recently, LLMs built on the xLSTM architecture have emerged as a powerful alternative to Transformers, offering linear compute scaling with sequence length and constant memory usage, both highly desirable properties for efficient inference. However,"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2503.13427","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/2503.13427/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":"2503.13427","created_at":"2026-07-05T10:33:00.488329+00:00"},{"alias_kind":"arxiv_version","alias_value":"2503.13427v1","created_at":"2026-07-05T10:33:00.488329+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2503.13427","created_at":"2026-07-05T10:33:00.488329+00:00"},{"alias_kind":"pith_short_12","alias_value":"GC66EG3MIEPV","created_at":"2026-07-05T10:33:00.488329+00:00"},{"alias_kind":"pith_short_16","alias_value":"GC66EG3MIEPVJNOK","created_at":"2026-07-05T10:33:00.488329+00:00"},{"alias_kind":"pith_short_8","alias_value":"GC66EG3M","created_at":"2026-07-05T10:33:00.488329+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2505.07793","citing_title":"Overflow Prevention Enhances Long-Context Recurrent LLMs","ref_index":9,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/GC66EG3MIEPVJNOKGYMK3ZJUO3","json":"https://pith.science/pith/GC66EG3MIEPVJNOKGYMK3ZJUO3.json","graph_json":"https://pith.science/api/pith-number/GC66EG3MIEPVJNOKGYMK3ZJUO3/graph.json","events_json":"https://pith.science/api/pith-number/GC66EG3MIEPVJNOKGYMK3ZJUO3/events.json","paper":"https://pith.science/paper/GC66EG3M"},"agent_actions":{"view_html":"https://pith.science/pith/GC66EG3MIEPVJNOKGYMK3ZJUO3","download_json":"https://pith.science/pith/GC66EG3MIEPVJNOKGYMK3ZJUO3.json","view_paper":"https://pith.science/paper/GC66EG3M","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2503.13427&json=true","fetch_graph":"https://pith.science/api/pith-number/GC66EG3MIEPVJNOKGYMK3ZJUO3/graph.json","fetch_events":"https://pith.science/api/pith-number/GC66EG3MIEPVJNOKGYMK3ZJUO3/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/GC66EG3MIEPVJNOKGYMK3ZJUO3/action/timestamp_anchor","attest_storage":"https://pith.science/pith/GC66EG3MIEPVJNOKGYMK3ZJUO3/action/storage_attestation","attest_author":"https://pith.science/pith/GC66EG3MIEPVJNOKGYMK3ZJUO3/action/author_attestation","sign_citation":"https://pith.science/pith/GC66EG3MIEPVJNOKGYMK3ZJUO3/action/citation_signature","submit_replication":"https://pith.science/pith/GC66EG3MIEPVJNOKGYMK3ZJUO3/action/replication_record"}},"created_at":"2026-07-05T10:33:00.488329+00:00","updated_at":"2026-07-05T10:33:00.488329+00:00"}