{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:LGQRZXTM4II47NCCGFUESHSEMK","short_pith_number":"pith:LGQRZXTM","schema_version":"1.0","canonical_sha256":"59a11cde6ce211cfb4423168491e44628d69c54a860dd2f66282c6eb8cffadb1","source":{"kind":"arxiv","id":"1812.01243","version":10},"attestation_state":"computed","paper":{"title":"Efficient Attention: Attention with Linear Complexities","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI","cs.LG"],"primary_cat":"cs.CV","authors_text":"Haiyu Zhao, Hongsheng Li, Mingyuan Zhang, Shuai Yi, Zhuoran Shen","submitted_at":"2018-12-04T06:41:46Z","abstract_excerpt":"Dot-product attention has wide applications in computer vision and natural language processing. However, its memory and computational costs grow quadratically with the input size. Such growth prohibits its application on high-resolution inputs. To remedy this drawback, this paper proposes a novel efficient attention mechanism equivalent to dot-product attention but with substantially less memory and computational costs. Its resource efficiency allows more widespread and flexible integration of attention modules into a network, which leads to better accuracies. Empirical evaluations demonstrate"},"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":"1812.01243","kind":"arxiv","version":10},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2018-12-04T06:41:46Z","cross_cats_sorted":["cs.AI","cs.LG"],"title_canon_sha256":"83d7d47dcbe84ab42d78867b41ab1b5c75b6cf3926e0e5b77ab88ad4933cd866","abstract_canon_sha256":"b6b712d0d0f4f2b97fb5b2903f4aa64d31d9f60334b3e88dd6505b9bd60d2342"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T07:35:14.697757Z","signature_b64":"JmdTPdqGkJ7QSYQAj7KLg7DeenW3WOOUYUc+0HG1GtrSAZWnPNeugDgHxNoSA+/UCt16P4Tu9LkDCEW8/HeVDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"59a11cde6ce211cfb4423168491e44628d69c54a860dd2f66282c6eb8cffadb1","last_reissued_at":"2026-07-05T07:35:14.697090Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T07:35:14.697090Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Efficient Attention: Attention with Linear Complexities","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI","cs.LG"],"primary_cat":"cs.CV","authors_text":"Haiyu Zhao, Hongsheng Li, Mingyuan Zhang, Shuai Yi, Zhuoran Shen","submitted_at":"2018-12-04T06:41:46Z","abstract_excerpt":"Dot-product attention has wide applications in computer vision and natural language processing. However, its memory and computational costs grow quadratically with the input size. Such growth prohibits its application on high-resolution inputs. To remedy this drawback, this paper proposes a novel efficient attention mechanism equivalent to dot-product attention but with substantially less memory and computational costs. Its resource efficiency allows more widespread and flexible integration of attention modules into a network, which leads to better accuracies. Empirical evaluations demonstrate"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1812.01243","kind":"arxiv","version":10},"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/1812.01243/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":"1812.01243","created_at":"2026-07-05T07:35:14.697159+00:00"},{"alias_kind":"arxiv_version","alias_value":"1812.01243v10","created_at":"2026-07-05T07:35:14.697159+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1812.01243","created_at":"2026-07-05T07:35:14.697159+00:00"},{"alias_kind":"pith_short_12","alias_value":"LGQRZXTM4II4","created_at":"2026-07-05T07:35:14.697159+00:00"},{"alias_kind":"pith_short_16","alias_value":"LGQRZXTM4II47NCC","created_at":"2026-07-05T07:35:14.697159+00:00"},{"alias_kind":"pith_short_8","alias_value":"LGQRZXTM","created_at":"2026-07-05T07:35:14.697159+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":7,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2605.08696","citing_title":"Structured Recurrent Mixers for Massively Parallelized Sequence Generation","ref_index":14,"is_internal_anchor":false},{"citing_arxiv_id":"2404.07143","citing_title":"Leave No Context Behind: Efficient Infinite Context Transformers with Infini-attention","ref_index":26,"is_internal_anchor":false},{"citing_arxiv_id":"2605.08696","citing_title":"Structured Recurrent Mixers for Massively Parallelized Sequence Generation","ref_index":59,"is_internal_anchor":false},{"citing_arxiv_id":"2605.12491","citing_title":"Elastic Attention Cores for Scalable Vision Transformers","ref_index":52,"is_internal_anchor":false},{"citing_arxiv_id":"2009.14794","citing_title":"Rethinking Attention with Performers","ref_index":148,"is_internal_anchor":false},{"citing_arxiv_id":"2605.08696","citing_title":"Structured Recurrent Mixers for Massively Parallelized Sequence Generation","ref_index":59,"is_internal_anchor":false},{"citing_arxiv_id":"2605.06683","citing_title":"Toeplitz MLP Mixers are Low Complexity, Information-Rich Sequence Models","ref_index":48,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/LGQRZXTM4II47NCCGFUESHSEMK","json":"https://pith.science/pith/LGQRZXTM4II47NCCGFUESHSEMK.json","graph_json":"https://pith.science/api/pith-number/LGQRZXTM4II47NCCGFUESHSEMK/graph.json","events_json":"https://pith.science/api/pith-number/LGQRZXTM4II47NCCGFUESHSEMK/events.json","paper":"https://pith.science/paper/LGQRZXTM"},"agent_actions":{"view_html":"https://pith.science/pith/LGQRZXTM4II47NCCGFUESHSEMK","download_json":"https://pith.science/pith/LGQRZXTM4II47NCCGFUESHSEMK.json","view_paper":"https://pith.science/paper/LGQRZXTM","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1812.01243&json=true","fetch_graph":"https://pith.science/api/pith-number/LGQRZXTM4II47NCCGFUESHSEMK/graph.json","fetch_events":"https://pith.science/api/pith-number/LGQRZXTM4II47NCCGFUESHSEMK/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/LGQRZXTM4II47NCCGFUESHSEMK/action/timestamp_anchor","attest_storage":"https://pith.science/pith/LGQRZXTM4II47NCCGFUESHSEMK/action/storage_attestation","attest_author":"https://pith.science/pith/LGQRZXTM4II47NCCGFUESHSEMK/action/author_attestation","sign_citation":"https://pith.science/pith/LGQRZXTM4II47NCCGFUESHSEMK/action/citation_signature","submit_replication":"https://pith.science/pith/LGQRZXTM4II47NCCGFUESHSEMK/action/replication_record"}},"created_at":"2026-07-05T07:35:14.697159+00:00","updated_at":"2026-07-05T07:35:14.697159+00:00"}