{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2024:BQDSYDBBK4O5A5VPW6RA6UDI3D","short_pith_number":"pith:BQDSYDBB","canonical_record":{"source":{"id":"2406.16747","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.CL","submitted_at":"2024-06-24T15:55:59Z","cross_cats_sorted":["cs.LG"],"title_canon_sha256":"3b732979ff46c062500ae0e99a0954353df3cec9dfe377f8f6d8301f01d55c8d","abstract_canon_sha256":"19911dcd8433f97316fb98f1965026cbe2c12198ebb62a4c99909096d02a5fd3"},"schema_version":"1.0"},"canonical_sha256":"0c072c0c21571dd076afb7a20f5068d8dfdd2db723929f0a76c546d8197768ae","source":{"kind":"arxiv","id":"2406.16747","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2406.16747","created_at":"2026-07-05T08:36:03Z"},{"alias_kind":"arxiv_version","alias_value":"2406.16747v1","created_at":"2026-07-05T08:36:03Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2406.16747","created_at":"2026-07-05T08:36:03Z"},{"alias_kind":"pith_short_12","alias_value":"BQDSYDBBK4O5","created_at":"2026-07-05T08:36:03Z"},{"alias_kind":"pith_short_16","alias_value":"BQDSYDBBK4O5A5VP","created_at":"2026-07-05T08:36:03Z"},{"alias_kind":"pith_short_8","alias_value":"BQDSYDBB","created_at":"2026-07-05T08:36:03Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2024:BQDSYDBBK4O5A5VPW6RA6UDI3D","target":"record","payload":{"canonical_record":{"source":{"id":"2406.16747","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.CL","submitted_at":"2024-06-24T15:55:59Z","cross_cats_sorted":["cs.LG"],"title_canon_sha256":"3b732979ff46c062500ae0e99a0954353df3cec9dfe377f8f6d8301f01d55c8d","abstract_canon_sha256":"19911dcd8433f97316fb98f1965026cbe2c12198ebb62a4c99909096d02a5fd3"},"schema_version":"1.0"},"canonical_sha256":"0c072c0c21571dd076afb7a20f5068d8dfdd2db723929f0a76c546d8197768ae","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T08:36:03.147272Z","signature_b64":"uEcQ3dmegf8tMFW8Z7wn2bDJRVlXX0i651V3x/eFR8RZAZlzvBpRR5JkBIxh9IZnGbtjXhCRmWrWxeDs41jLCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"0c072c0c21571dd076afb7a20f5068d8dfdd2db723929f0a76c546d8197768ae","last_reissued_at":"2026-07-05T08:36:03.146838Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T08:36:03.146838Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2406.16747","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-05T08:36:03Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"5XnAhg5cg+IGsGlM/f4dkYjw87xXbpmrsYiroUaIcmCPbPGoMRrwcf/f1ocXyzm7SAbrkRWeyGxnEd+C3jmMAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-06T14:49:22.048617Z"},"content_sha256":"123747b2492f3074c04d83aaa7a25a1a3a3b448cbaf28e7a0e7ac3c4c842b20d","schema_version":"1.0","event_id":"sha256:123747b2492f3074c04d83aaa7a25a1a3a3b448cbaf28e7a0e7ac3c4c842b20d"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2024:BQDSYDBBK4O5A5VPW6RA6UDI3D","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Sparser is Faster and Less is More: Efficient Sparse Attention for Long-Range Transformers","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.LG"],"primary_cat":"cs.CL","authors_text":"Chao Lou, Kewei Tu, Zilong Zheng, Zixia Jia","submitted_at":"2024-06-24T15:55:59Z","abstract_excerpt":"Accommodating long sequences efficiently in autoregressive Transformers, especially within an extended context window, poses significant challenges due to the quadratic computational complexity and substantial KV memory requirements inherent in self-attention mechanisms. In this work, we introduce SPARSEK Attention, a novel sparse attention mechanism designed to overcome these computational and memory obstacles while maintaining performance. Our approach integrates a scoring network and a differentiable top-k mask operator, SPARSEK, to select a constant number of KV pairs for each query, there"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2406.16747","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/2406.16747/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-05T08:36:03Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"AlrquyvVuzTBhVDEkPHzrcSy9TmHmBnoof2axyQBwn8mUtz0vC4kiVPymbeigZbtt9MS3ToEK5sKEmPqqD8XDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-06T14:49:22.049209Z"},"content_sha256":"73157816b3dfdc3e26311894c367686ec890b36cf7fa3b1982f72b9cbc3efa4e","schema_version":"1.0","event_id":"sha256:73157816b3dfdc3e26311894c367686ec890b36cf7fa3b1982f72b9cbc3efa4e"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/BQDSYDBBK4O5A5VPW6RA6UDI3D/bundle.json","state_url":"https://pith.science/pith/BQDSYDBBK4O5A5VPW6RA6UDI3D/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/BQDSYDBBK4O5A5VPW6RA6UDI3D/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-06T14:49:22Z","links":{"resolver":"https://pith.science/pith/BQDSYDBBK4O5A5VPW6RA6UDI3D","bundle":"https://pith.science/pith/BQDSYDBBK4O5A5VPW6RA6UDI3D/bundle.json","state":"https://pith.science/pith/BQDSYDBBK4O5A5VPW6RA6UDI3D/state.json","well_known_bundle":"https://pith.science/.well-known/pith/BQDSYDBBK4O5A5VPW6RA6UDI3D/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2024:BQDSYDBBK4O5A5VPW6RA6UDI3D","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":"19911dcd8433f97316fb98f1965026cbe2c12198ebb62a4c99909096d02a5fd3","cross_cats_sorted":["cs.LG"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.CL","submitted_at":"2024-06-24T15:55:59Z","title_canon_sha256":"3b732979ff46c062500ae0e99a0954353df3cec9dfe377f8f6d8301f01d55c8d"},"schema_version":"1.0","source":{"id":"2406.16747","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2406.16747","created_at":"2026-07-05T08:36:03Z"},{"alias_kind":"arxiv_version","alias_value":"2406.16747v1","created_at":"2026-07-05T08:36:03Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2406.16747","created_at":"2026-07-05T08:36:03Z"},{"alias_kind":"pith_short_12","alias_value":"BQDSYDBBK4O5","created_at":"2026-07-05T08:36:03Z"},{"alias_kind":"pith_short_16","alias_value":"BQDSYDBBK4O5A5VP","created_at":"2026-07-05T08:36:03Z"},{"alias_kind":"pith_short_8","alias_value":"BQDSYDBB","created_at":"2026-07-05T08:36:03Z"}],"graph_snapshots":[{"event_id":"sha256:73157816b3dfdc3e26311894c367686ec890b36cf7fa3b1982f72b9cbc3efa4e","target":"graph","created_at":"2026-07-05T08:36:03Z","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/2406.16747/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Accommodating long sequences efficiently in autoregressive Transformers, especially within an extended context window, poses significant challenges due to the quadratic computational complexity and substantial KV memory requirements inherent in self-attention mechanisms. In this work, we introduce SPARSEK Attention, a novel sparse attention mechanism designed to overcome these computational and memory obstacles while maintaining performance. Our approach integrates a scoring network and a differentiable top-k mask operator, SPARSEK, to select a constant number of KV pairs for each query, there","authors_text":"Chao Lou, Kewei Tu, Zilong Zheng, Zixia Jia","cross_cats":["cs.LG"],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.CL","submitted_at":"2024-06-24T15:55:59Z","title":"Sparser is Faster and Less is More: Efficient Sparse Attention for Long-Range Transformers"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2406.16747","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:123747b2492f3074c04d83aaa7a25a1a3a3b448cbaf28e7a0e7ac3c4c842b20d","target":"record","created_at":"2026-07-05T08:36:03Z","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":"19911dcd8433f97316fb98f1965026cbe2c12198ebb62a4c99909096d02a5fd3","cross_cats_sorted":["cs.LG"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.CL","submitted_at":"2024-06-24T15:55:59Z","title_canon_sha256":"3b732979ff46c062500ae0e99a0954353df3cec9dfe377f8f6d8301f01d55c8d"},"schema_version":"1.0","source":{"id":"2406.16747","kind":"arxiv","version":1}},"canonical_sha256":"0c072c0c21571dd076afb7a20f5068d8dfdd2db723929f0a76c546d8197768ae","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"0c072c0c21571dd076afb7a20f5068d8dfdd2db723929f0a76c546d8197768ae","first_computed_at":"2026-07-05T08:36:03.146838Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T08:36:03.146838Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"uEcQ3dmegf8tMFW8Z7wn2bDJRVlXX0i651V3x/eFR8RZAZlzvBpRR5JkBIxh9IZnGbtjXhCRmWrWxeDs41jLCQ==","signature_status":"signed_v1","signed_at":"2026-07-05T08:36:03.147272Z","signed_message":"canonical_sha256_bytes"},"source_id":"2406.16747","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:123747b2492f3074c04d83aaa7a25a1a3a3b448cbaf28e7a0e7ac3c4c842b20d","sha256:73157816b3dfdc3e26311894c367686ec890b36cf7fa3b1982f72b9cbc3efa4e"],"state_sha256":"4f9a00f1668ca7332557602048ed3b0b9cb8313040f0ec81f7b124b56732086b"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Dcf3I0ZwbetqxHwqMJKaGUcL+ZbpaUEYEYp/VDGdbkCf2bJNPog38bPI9KERCRXG62Y+/WcaQhiMM3WFkBIRDQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-06T14:49:22.057050Z","bundle_sha256":"0f1dc2274f6482218a6d8226a743a52a7540f6914d4289b58a838b6dc97b18ec"}}