{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2022:5PCCMXUHIFJYU5D4MAQ3UTYHZ4","short_pith_number":"pith:5PCCMXUH","schema_version":"1.0","canonical_sha256":"ebc4265e8741538a747c6021ba4f07cf1ad974fc6188f033fb33945b045a8058","source":{"kind":"arxiv","id":"2211.04076","version":1},"attestation_state":"computed","paper":{"title":"Linear Self-Attention Approximation via Trainable Feedforward Kernel","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.AI"],"primary_cat":"cs.LG","authors_text":"Alexander Kovalenko, Uladzislau Yorsh","submitted_at":"2022-11-08T08:14:11Z","abstract_excerpt":"In pursuit of faster computation, Efficient Transformers demonstrate an impressive variety of approaches -- models attaining sub-quadratic attention complexity can utilize a notion of sparsity or a low-rank approximation of inputs to reduce the number of attended keys; other ways to reduce complexity include locality-sensitive hashing, key pooling, additional memory to store information in compacted or hybridization with other architectures, such as CNN. Often based on a strong mathematical basis, kernelized approaches allow for the approximation of attention with linear complexity while retai"},"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":"2211.04076","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2022-11-08T08:14:11Z","cross_cats_sorted":["cs.AI"],"title_canon_sha256":"09dc3a31185e2623035693c8a992c148945f36d60aecdcc19469ab912ee64152","abstract_canon_sha256":"5485b443c90008e269f6a8ee75620763c00ec9205eeb1bef6d2851843ea7b263"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T05:14:01.749919Z","signature_b64":"ebK+ZfSoj2ZcOP0P8i0OfGrOHUvIGGP9kVg+K484DvAm5I7+44SmDb/ylKYgl7/GvuoRG9UMj0jZ1k3nBIo9Cw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"ebc4265e8741538a747c6021ba4f07cf1ad974fc6188f033fb33945b045a8058","last_reissued_at":"2026-07-05T05:14:01.749482Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T05:14:01.749482Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Linear Self-Attention Approximation via Trainable Feedforward Kernel","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.AI"],"primary_cat":"cs.LG","authors_text":"Alexander Kovalenko, Uladzislau Yorsh","submitted_at":"2022-11-08T08:14:11Z","abstract_excerpt":"In pursuit of faster computation, Efficient Transformers demonstrate an impressive variety of approaches -- models attaining sub-quadratic attention complexity can utilize a notion of sparsity or a low-rank approximation of inputs to reduce the number of attended keys; other ways to reduce complexity include locality-sensitive hashing, key pooling, additional memory to store information in compacted or hybridization with other architectures, such as CNN. Often based on a strong mathematical basis, kernelized approaches allow for the approximation of attention with linear complexity while retai"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2211.04076","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/2211.04076/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":"2211.04076","created_at":"2026-07-05T05:14:01.749546+00:00"},{"alias_kind":"arxiv_version","alias_value":"2211.04076v1","created_at":"2026-07-05T05:14:01.749546+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2211.04076","created_at":"2026-07-05T05:14:01.749546+00:00"},{"alias_kind":"pith_short_12","alias_value":"5PCCMXUHIFJY","created_at":"2026-07-05T05:14:01.749546+00:00"},{"alias_kind":"pith_short_16","alias_value":"5PCCMXUHIFJYU5D4","created_at":"2026-07-05T05:14:01.749546+00:00"},{"alias_kind":"pith_short_8","alias_value":"5PCCMXUH","created_at":"2026-07-05T05:14:01.749546+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/5PCCMXUHIFJYU5D4MAQ3UTYHZ4","json":"https://pith.science/pith/5PCCMXUHIFJYU5D4MAQ3UTYHZ4.json","graph_json":"https://pith.science/api/pith-number/5PCCMXUHIFJYU5D4MAQ3UTYHZ4/graph.json","events_json":"https://pith.science/api/pith-number/5PCCMXUHIFJYU5D4MAQ3UTYHZ4/events.json","paper":"https://pith.science/paper/5PCCMXUH"},"agent_actions":{"view_html":"https://pith.science/pith/5PCCMXUHIFJYU5D4MAQ3UTYHZ4","download_json":"https://pith.science/pith/5PCCMXUHIFJYU5D4MAQ3UTYHZ4.json","view_paper":"https://pith.science/paper/5PCCMXUH","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2211.04076&json=true","fetch_graph":"https://pith.science/api/pith-number/5PCCMXUHIFJYU5D4MAQ3UTYHZ4/graph.json","fetch_events":"https://pith.science/api/pith-number/5PCCMXUHIFJYU5D4MAQ3UTYHZ4/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/5PCCMXUHIFJYU5D4MAQ3UTYHZ4/action/timestamp_anchor","attest_storage":"https://pith.science/pith/5PCCMXUHIFJYU5D4MAQ3UTYHZ4/action/storage_attestation","attest_author":"https://pith.science/pith/5PCCMXUHIFJYU5D4MAQ3UTYHZ4/action/author_attestation","sign_citation":"https://pith.science/pith/5PCCMXUHIFJYU5D4MAQ3UTYHZ4/action/citation_signature","submit_replication":"https://pith.science/pith/5PCCMXUHIFJYU5D4MAQ3UTYHZ4/action/replication_record"}},"created_at":"2026-07-05T05:14:01.749546+00:00","updated_at":"2026-07-05T05:14:01.749546+00:00"}