{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2021:OHSEAYOVH6ED3QLELYLJUKSDST","short_pith_number":"pith:OHSEAYOV","canonical_record":{"source":{"id":"2112.05682","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2021-12-10T17:25:07Z","cross_cats_sorted":[],"title_canon_sha256":"4a74d97c2cd794faace0b2c0a955a6d0351edbe12ce9cf67b2bc16343efea63c","abstract_canon_sha256":"35316aaeba440f33505455b8a078881aefec635db694106a894e67d7073e5fe8"},"schema_version":"1.0"},"canonical_sha256":"71e44061d53f883dc1645e169a2a4394ca7af0034d6288581189ad8342b9a3c3","source":{"kind":"arxiv","id":"2112.05682","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2112.05682","created_at":"2026-07-05T05:04:46Z"},{"alias_kind":"arxiv_version","alias_value":"2112.05682v3","created_at":"2026-07-05T05:04:46Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2112.05682","created_at":"2026-07-05T05:04:46Z"},{"alias_kind":"pith_short_12","alias_value":"OHSEAYOVH6ED","created_at":"2026-07-05T05:04:46Z"},{"alias_kind":"pith_short_16","alias_value":"OHSEAYOVH6ED3QLE","created_at":"2026-07-05T05:04:46Z"},{"alias_kind":"pith_short_8","alias_value":"OHSEAYOV","created_at":"2026-07-05T05:04:46Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2021:OHSEAYOVH6ED3QLELYLJUKSDST","target":"record","payload":{"canonical_record":{"source":{"id":"2112.05682","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2021-12-10T17:25:07Z","cross_cats_sorted":[],"title_canon_sha256":"4a74d97c2cd794faace0b2c0a955a6d0351edbe12ce9cf67b2bc16343efea63c","abstract_canon_sha256":"35316aaeba440f33505455b8a078881aefec635db694106a894e67d7073e5fe8"},"schema_version":"1.0"},"canonical_sha256":"71e44061d53f883dc1645e169a2a4394ca7af0034d6288581189ad8342b9a3c3","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T05:04:46.475691Z","signature_b64":"zSv3VxSy7ovFo/J5++GZYo0suIn8US5f2LvTbfvwRLO+Htv7gRk1xmkWn/jNMYHYMRJ6xHvn3qeXjKcfOiwLCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"71e44061d53f883dc1645e169a2a4394ca7af0034d6288581189ad8342b9a3c3","last_reissued_at":"2026-07-05T05:04:46.475181Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T05:04:46.475181Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2112.05682","source_version":3,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-07-05T05:04:46Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"hAoUxUc3ZRaEOhGti+ahsi1o/Z0H1FLfrNCIIxT3KDaxTKQxdi7Tykv8p4nlissMcYzskUlBMWtFDYENVWBnDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-06T01:12:55.280467Z"},"content_sha256":"d383a9ad78f0fdd4eecf2f6ab1f445629404ee5142f9df0023426406777b6c80","schema_version":"1.0","event_id":"sha256:d383a9ad78f0fdd4eecf2f6ab1f445629404ee5142f9df0023426406777b6c80"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2021:OHSEAYOVH6ED3QLELYLJUKSDST","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Self-attention Does Not Need $O(n^2)$ Memory","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.LG","authors_text":"Charles Staats, Markus N. Rabe","submitted_at":"2021-12-10T17:25:07Z","abstract_excerpt":"We present a very simple algorithm for attention that requires $O(1)$ memory with respect to sequence length and an extension to self-attention that requires $O(\\log n)$ memory. This is in contrast with the frequently stated belief that self-attention requires $O(n^2)$ memory. While the time complexity is still $O(n^2)$, device memory rather than compute capability is often the limiting factor on modern accelerators. Thus, reducing the memory requirements of attention allows processing of longer sequences than might otherwise be feasible. We provide a practical implementation for accelerators "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2112.05682","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/2112.05682/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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-07-05T05:04:46Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"PtuZFUnFZNo6/H+hIWwvRklOsSZE5EdMQiyQxmcHKCgPLFHzvEXuO+RvbJqWN5GoxAVImliVyvShGKSFKMAdDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-06T01:12:55.281672Z"},"content_sha256":"2ba1fe9c0fdc0d55c30dc7e1b151f847573bab04256e4cba9df0292b2a25ed14","schema_version":"1.0","event_id":"sha256:2ba1fe9c0fdc0d55c30dc7e1b151f847573bab04256e4cba9df0292b2a25ed14"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/OHSEAYOVH6ED3QLELYLJUKSDST/bundle.json","state_url":"https://pith.science/pith/OHSEAYOVH6ED3QLELYLJUKSDST/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/OHSEAYOVH6ED3QLELYLJUKSDST/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-08-06T01:12:55Z","links":{"resolver":"https://pith.science/pith/OHSEAYOVH6ED3QLELYLJUKSDST","bundle":"https://pith.science/pith/OHSEAYOVH6ED3QLELYLJUKSDST/bundle.json","state":"https://pith.science/pith/OHSEAYOVH6ED3QLELYLJUKSDST/state.json","well_known_bundle":"https://pith.science/.well-known/pith/OHSEAYOVH6ED3QLELYLJUKSDST/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2021:OHSEAYOVH6ED3QLELYLJUKSDST","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"35316aaeba440f33505455b8a078881aefec635db694106a894e67d7073e5fe8","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2021-12-10T17:25:07Z","title_canon_sha256":"4a74d97c2cd794faace0b2c0a955a6d0351edbe12ce9cf67b2bc16343efea63c"},"schema_version":"1.0","source":{"id":"2112.05682","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2112.05682","created_at":"2026-07-05T05:04:46Z"},{"alias_kind":"arxiv_version","alias_value":"2112.05682v3","created_at":"2026-07-05T05:04:46Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2112.05682","created_at":"2026-07-05T05:04:46Z"},{"alias_kind":"pith_short_12","alias_value":"OHSEAYOVH6ED","created_at":"2026-07-05T05:04:46Z"},{"alias_kind":"pith_short_16","alias_value":"OHSEAYOVH6ED3QLE","created_at":"2026-07-05T05:04:46Z"},{"alias_kind":"pith_short_8","alias_value":"OHSEAYOV","created_at":"2026-07-05T05:04:46Z"}],"graph_snapshots":[{"event_id":"sha256:2ba1fe9c0fdc0d55c30dc7e1b151f847573bab04256e4cba9df0292b2a25ed14","target":"graph","created_at":"2026-07-05T05:04:46Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2112.05682/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"We present a very simple algorithm for attention that requires $O(1)$ memory with respect to sequence length and an extension to self-attention that requires $O(\\log n)$ memory. This is in contrast with the frequently stated belief that self-attention requires $O(n^2)$ memory. While the time complexity is still $O(n^2)$, device memory rather than compute capability is often the limiting factor on modern accelerators. Thus, reducing the memory requirements of attention allows processing of longer sequences than might otherwise be feasible. We provide a practical implementation for accelerators ","authors_text":"Charles Staats, Markus N. Rabe","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2021-12-10T17:25:07Z","title":"Self-attention Does Not Need $O(n^2)$ Memory"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2112.05682","kind":"arxiv","version":3},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:d383a9ad78f0fdd4eecf2f6ab1f445629404ee5142f9df0023426406777b6c80","target":"record","created_at":"2026-07-05T05:04:46Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"35316aaeba440f33505455b8a078881aefec635db694106a894e67d7073e5fe8","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2021-12-10T17:25:07Z","title_canon_sha256":"4a74d97c2cd794faace0b2c0a955a6d0351edbe12ce9cf67b2bc16343efea63c"},"schema_version":"1.0","source":{"id":"2112.05682","kind":"arxiv","version":3}},"canonical_sha256":"71e44061d53f883dc1645e169a2a4394ca7af0034d6288581189ad8342b9a3c3","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"71e44061d53f883dc1645e169a2a4394ca7af0034d6288581189ad8342b9a3c3","first_computed_at":"2026-07-05T05:04:46.475181Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T05:04:46.475181Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"zSv3VxSy7ovFo/J5++GZYo0suIn8US5f2LvTbfvwRLO+Htv7gRk1xmkWn/jNMYHYMRJ6xHvn3qeXjKcfOiwLCA==","signature_status":"signed_v1","signed_at":"2026-07-05T05:04:46.475691Z","signed_message":"canonical_sha256_bytes"},"source_id":"2112.05682","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:d383a9ad78f0fdd4eecf2f6ab1f445629404ee5142f9df0023426406777b6c80","sha256:2ba1fe9c0fdc0d55c30dc7e1b151f847573bab04256e4cba9df0292b2a25ed14"],"state_sha256":"1ae868d885ef2ce7d179a8a22540282aa0a772d6cab9dcd5b10c6b7ff9613eb4"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ASmVYdpQJiuJ0w6Tvvw353Zz/XZiq2Cm0eDBi//FTzym1CHUpKBgUYJxIln0RI4m/lKHseblGzne4GVfH9ecCw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-06T01:12:55.290078Z","bundle_sha256":"5ad606421f0112ef8914488513f961c97556c996b33d0aa854cda7534fb53a98"}}