{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2020:ZRDOIJNWNJPFUGR5U435UXNDCK","short_pith_number":"pith:ZRDOIJNW","canonical_record":{"source":{"id":"2010.05315","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2020-10-11T18:49:17Z","cross_cats_sorted":[],"title_canon_sha256":"899e0947a55f8fe5fafc314db98eaea06e1c422ec9ece317a6416506e4aa7133","abstract_canon_sha256":"9a95d8bf3326323a69b01c5878e6e2a632a5ff43aa780cb50e84fb52ca379642"},"schema_version":"1.0"},"canonical_sha256":"cc46e425b66a5e5a1a3da737da5da312a0b9759a58451b9179d48c7660862d48","source":{"kind":"arxiv","id":"2010.05315","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2010.05315","created_at":"2026-07-05T01:42:05Z"},{"alias_kind":"arxiv_version","alias_value":"2010.05315v1","created_at":"2026-07-05T01:42:05Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2010.05315","created_at":"2026-07-05T01:42:05Z"},{"alias_kind":"pith_short_12","alias_value":"ZRDOIJNWNJPF","created_at":"2026-07-05T01:42:05Z"},{"alias_kind":"pith_short_16","alias_value":"ZRDOIJNWNJPFUGR5","created_at":"2026-07-05T01:42:05Z"},{"alias_kind":"pith_short_8","alias_value":"ZRDOIJNW","created_at":"2026-07-05T01:42:05Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2020:ZRDOIJNWNJPFUGR5U435UXNDCK","target":"record","payload":{"canonical_record":{"source":{"id":"2010.05315","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2020-10-11T18:49:17Z","cross_cats_sorted":[],"title_canon_sha256":"899e0947a55f8fe5fafc314db98eaea06e1c422ec9ece317a6416506e4aa7133","abstract_canon_sha256":"9a95d8bf3326323a69b01c5878e6e2a632a5ff43aa780cb50e84fb52ca379642"},"schema_version":"1.0"},"canonical_sha256":"cc46e425b66a5e5a1a3da737da5da312a0b9759a58451b9179d48c7660862d48","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T01:42:05.060733Z","signature_b64":"eyQpReAWvp8TMgeTFofgPr9XxAi0NkMjGUmeEJAes8ptiqCYyzZDYg8/AQBerZK0TvpKeJ3nWTjGXmMnh0mjCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"cc46e425b66a5e5a1a3da737da5da312a0b9759a58451b9179d48c7660862d48","last_reissued_at":"2026-07-05T01:42:05.060386Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T01:42:05.060386Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2010.05315","source_version":1,"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-05T01:42:05Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"OoLrUwWY2dBU1L5bZLZkUOXHqvVA7YDB13gHSYNuih5h0ply8X2BmeK13l6Jy8LQ50RwCux/tnkOLHeP2BXqDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-08T20:27:07.320549Z"},"content_sha256":"88191517080ae775214c0b09535f8e80b8cfb96ed47b98ef28221b2a365c2e17","schema_version":"1.0","event_id":"sha256:88191517080ae775214c0b09535f8e80b8cfb96ed47b98ef28221b2a365c2e17"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2020:ZRDOIJNWNJPFUGR5U435UXNDCK","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"SMYRF: Efficient Attention using Asymmetric Clustering","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.LG","authors_text":"Alexandros G. Dimakis, Augustus Odena, Giannis Daras, Nikita Kitaev","submitted_at":"2020-10-11T18:49:17Z","abstract_excerpt":"We propose a novel type of balanced clustering algorithm to approximate attention. Attention complexity is reduced from $O(N^2)$ to $O(N \\log N)$, where $N$ is the sequence length. Our algorithm, SMYRF, uses Locality Sensitive Hashing (LSH) in a novel way by defining new Asymmetric transformations and an adaptive scheme that produces balanced clusters. The biggest advantage of SMYRF is that it can be used as a drop-in replacement for dense attention layers without any retraining. On the contrary, prior fast attention methods impose constraints (e.g. queries and keys share the same vector repre"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2010.05315","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/2010.05315/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-05T01:42:05Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"7R2U2ddvrTYtHCon4x0bpp5Itd9xqP1+0ODlxKQqtre4iFBNJaVlmxr3cQ+nPqcJ7CRdRGU7hJF//o1ni6drAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-08T20:27:07.321028Z"},"content_sha256":"37dd230f215cd513bbf0598e6dc6da22d862b7bdc664ee5cd5ed7ffb6d45d035","schema_version":"1.0","event_id":"sha256:37dd230f215cd513bbf0598e6dc6da22d862b7bdc664ee5cd5ed7ffb6d45d035"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/ZRDOIJNWNJPFUGR5U435UXNDCK/bundle.json","state_url":"https://pith.science/pith/ZRDOIJNWNJPFUGR5U435UXNDCK/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/ZRDOIJNWNJPFUGR5U435UXNDCK/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-08T20:27:07Z","links":{"resolver":"https://pith.science/pith/ZRDOIJNWNJPFUGR5U435UXNDCK","bundle":"https://pith.science/pith/ZRDOIJNWNJPFUGR5U435UXNDCK/bundle.json","state":"https://pith.science/pith/ZRDOIJNWNJPFUGR5U435UXNDCK/state.json","well_known_bundle":"https://pith.science/.well-known/pith/ZRDOIJNWNJPFUGR5U435UXNDCK/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2020:ZRDOIJNWNJPFUGR5U435UXNDCK","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":"9a95d8bf3326323a69b01c5878e6e2a632a5ff43aa780cb50e84fb52ca379642","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2020-10-11T18:49:17Z","title_canon_sha256":"899e0947a55f8fe5fafc314db98eaea06e1c422ec9ece317a6416506e4aa7133"},"schema_version":"1.0","source":{"id":"2010.05315","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2010.05315","created_at":"2026-07-05T01:42:05Z"},{"alias_kind":"arxiv_version","alias_value":"2010.05315v1","created_at":"2026-07-05T01:42:05Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2010.05315","created_at":"2026-07-05T01:42:05Z"},{"alias_kind":"pith_short_12","alias_value":"ZRDOIJNWNJPF","created_at":"2026-07-05T01:42:05Z"},{"alias_kind":"pith_short_16","alias_value":"ZRDOIJNWNJPFUGR5","created_at":"2026-07-05T01:42:05Z"},{"alias_kind":"pith_short_8","alias_value":"ZRDOIJNW","created_at":"2026-07-05T01:42:05Z"}],"graph_snapshots":[{"event_id":"sha256:37dd230f215cd513bbf0598e6dc6da22d862b7bdc664ee5cd5ed7ffb6d45d035","target":"graph","created_at":"2026-07-05T01:42:05Z","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/2010.05315/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"We propose a novel type of balanced clustering algorithm to approximate attention. Attention complexity is reduced from $O(N^2)$ to $O(N \\log N)$, where $N$ is the sequence length. Our algorithm, SMYRF, uses Locality Sensitive Hashing (LSH) in a novel way by defining new Asymmetric transformations and an adaptive scheme that produces balanced clusters. The biggest advantage of SMYRF is that it can be used as a drop-in replacement for dense attention layers without any retraining. On the contrary, prior fast attention methods impose constraints (e.g. queries and keys share the same vector repre","authors_text":"Alexandros G. Dimakis, Augustus Odena, Giannis Daras, Nikita Kitaev","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2020-10-11T18:49:17Z","title":"SMYRF: Efficient Attention using Asymmetric Clustering"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2010.05315","kind":"arxiv","version":1},"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:88191517080ae775214c0b09535f8e80b8cfb96ed47b98ef28221b2a365c2e17","target":"record","created_at":"2026-07-05T01:42:05Z","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":"9a95d8bf3326323a69b01c5878e6e2a632a5ff43aa780cb50e84fb52ca379642","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2020-10-11T18:49:17Z","title_canon_sha256":"899e0947a55f8fe5fafc314db98eaea06e1c422ec9ece317a6416506e4aa7133"},"schema_version":"1.0","source":{"id":"2010.05315","kind":"arxiv","version":1}},"canonical_sha256":"cc46e425b66a5e5a1a3da737da5da312a0b9759a58451b9179d48c7660862d48","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"cc46e425b66a5e5a1a3da737da5da312a0b9759a58451b9179d48c7660862d48","first_computed_at":"2026-07-05T01:42:05.060386Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T01:42:05.060386Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"eyQpReAWvp8TMgeTFofgPr9XxAi0NkMjGUmeEJAes8ptiqCYyzZDYg8/AQBerZK0TvpKeJ3nWTjGXmMnh0mjCw==","signature_status":"signed_v1","signed_at":"2026-07-05T01:42:05.060733Z","signed_message":"canonical_sha256_bytes"},"source_id":"2010.05315","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:88191517080ae775214c0b09535f8e80b8cfb96ed47b98ef28221b2a365c2e17","sha256:37dd230f215cd513bbf0598e6dc6da22d862b7bdc664ee5cd5ed7ffb6d45d035"],"state_sha256":"9869bd991305ef45c24c6883581613001cc023100427d298f638198c7d07c712"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"S+D79IYqihvUsUBiJGTUCf2uFBxDSEdZPp0hdqSNYCDcApg1XtypQM2lq7bXrNxfn82MGZfkq/3wyvihFOX0Bg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-08T20:27:07.324521Z","bundle_sha256":"b08cb704c0169dd5fdab9d9b1d2bfc9d7ea30a39744fef7611ca165f7eccf2bd"}}