{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2025:7FEYZMGWNZCCNKIX2XJ5VP5HS2","short_pith_number":"pith:7FEYZMGW","canonical_record":{"source":{"id":"2502.12082","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.CL","submitted_at":"2025-02-17T17:56:23Z","cross_cats_sorted":["cs.LG"],"title_canon_sha256":"eea646a48bc8ecd2a67683b45c53f0f33f210cf23210036a54e276f918e25b5f","abstract_canon_sha256":"55e3e475eb79fa92a1f28b5e4f8cf4899b04d860317b7c3d245adea94f5918b8"},"schema_version":"1.0"},"canonical_sha256":"f9498cb0d66e4426a917d5d3dabfa7968bcb1a97dad45409563f634cafb6efc4","source":{"kind":"arxiv","id":"2502.12082","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2502.12082","created_at":"2026-07-05T11:17:41Z"},{"alias_kind":"arxiv_version","alias_value":"2502.12082v2","created_at":"2026-07-05T11:17:41Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2502.12082","created_at":"2026-07-05T11:17:41Z"},{"alias_kind":"pith_short_12","alias_value":"7FEYZMGWNZCC","created_at":"2026-07-05T11:17:41Z"},{"alias_kind":"pith_short_16","alias_value":"7FEYZMGWNZCCNKIX","created_at":"2026-07-05T11:17:41Z"},{"alias_kind":"pith_short_8","alias_value":"7FEYZMGW","created_at":"2026-07-05T11:17:41Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2025:7FEYZMGWNZCCNKIX2XJ5VP5HS2","target":"record","payload":{"canonical_record":{"source":{"id":"2502.12082","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.CL","submitted_at":"2025-02-17T17:56:23Z","cross_cats_sorted":["cs.LG"],"title_canon_sha256":"eea646a48bc8ecd2a67683b45c53f0f33f210cf23210036a54e276f918e25b5f","abstract_canon_sha256":"55e3e475eb79fa92a1f28b5e4f8cf4899b04d860317b7c3d245adea94f5918b8"},"schema_version":"1.0"},"canonical_sha256":"f9498cb0d66e4426a917d5d3dabfa7968bcb1a97dad45409563f634cafb6efc4","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T11:17:41.423740Z","signature_b64":"gDNB0Blp+7Jc7KmBK0BuupXjyOElXYP5tNNnjN8TS8MbBpB6jTi9n5uP6JSOh/luNnRtd9nFQPv8VsgJa0SrCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"f9498cb0d66e4426a917d5d3dabfa7968bcb1a97dad45409563f634cafb6efc4","last_reissued_at":"2026-07-05T11:17:41.423237Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T11:17:41.423237Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2502.12082","source_version":2,"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-05T11:17:41Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"hXjIQLbmrMgms8eXxHhQTcoje7vWlH8GN+S6fuNYH3Mri8WOLe74JiD3he0XpGaouudFLRDczBOPnDxCUatQBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-07T17:58:00.550479Z"},"content_sha256":"3dcb29cb303dd55b47543222423d8e57754f2ef05b9f510103e6c02b2aa29f3a","schema_version":"1.0","event_id":"sha256:3dcb29cb303dd55b47543222423d8e57754f2ef05b9f510103e6c02b2aa29f3a"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2025:7FEYZMGWNZCCNKIX2XJ5VP5HS2","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"AdaSplash: Adaptive Sparse Flash Attention","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.LG"],"primary_cat":"cs.CL","authors_text":"Andr\\'e F. T. Martins, Marcos Treviso, Nuno Gon\\c{c}alves","submitted_at":"2025-02-17T17:56:23Z","abstract_excerpt":"The computational cost of softmax-based attention in transformers limits their applicability to long-context tasks. Adaptive sparsity, of which $\\alpha$-entmax attention is an example, offers a flexible data-dependent alternative, but existing implementations are inefficient and do not leverage the sparsity to obtain runtime and memory gains. In this work, we propose AdaSplash, which combines the efficiency of GPU-optimized algorithms with the sparsity benefits of $\\alpha$-entmax. We first introduce a hybrid Halley-bisection algorithm, resulting in a 7-fold reduction in the number of iteration"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2502.12082","kind":"arxiv","version":2},"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/2502.12082/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-05T11:17:41Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"1Kbn+Do1iKKyJa31+vQa6QAuMcY46+zSAXiU+in+KWXpDxRf64cW6LQAgcXLePtfbJ0Cf8JBG+SkIxLTQ19PAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-07T17:58:00.551466Z"},"content_sha256":"ba48953275752b63b39748a6fb04c284bcc5d49aee07f08b4701b166adc58a66","schema_version":"1.0","event_id":"sha256:ba48953275752b63b39748a6fb04c284bcc5d49aee07f08b4701b166adc58a66"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/7FEYZMGWNZCCNKIX2XJ5VP5HS2/bundle.json","state_url":"https://pith.science/pith/7FEYZMGWNZCCNKIX2XJ5VP5HS2/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/7FEYZMGWNZCCNKIX2XJ5VP5HS2/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-07T17:58:00Z","links":{"resolver":"https://pith.science/pith/7FEYZMGWNZCCNKIX2XJ5VP5HS2","bundle":"https://pith.science/pith/7FEYZMGWNZCCNKIX2XJ5VP5HS2/bundle.json","state":"https://pith.science/pith/7FEYZMGWNZCCNKIX2XJ5VP5HS2/state.json","well_known_bundle":"https://pith.science/.well-known/pith/7FEYZMGWNZCCNKIX2XJ5VP5HS2/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2025:7FEYZMGWNZCCNKIX2XJ5VP5HS2","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":"55e3e475eb79fa92a1f28b5e4f8cf4899b04d860317b7c3d245adea94f5918b8","cross_cats_sorted":["cs.LG"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.CL","submitted_at":"2025-02-17T17:56:23Z","title_canon_sha256":"eea646a48bc8ecd2a67683b45c53f0f33f210cf23210036a54e276f918e25b5f"},"schema_version":"1.0","source":{"id":"2502.12082","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2502.12082","created_at":"2026-07-05T11:17:41Z"},{"alias_kind":"arxiv_version","alias_value":"2502.12082v2","created_at":"2026-07-05T11:17:41Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2502.12082","created_at":"2026-07-05T11:17:41Z"},{"alias_kind":"pith_short_12","alias_value":"7FEYZMGWNZCC","created_at":"2026-07-05T11:17:41Z"},{"alias_kind":"pith_short_16","alias_value":"7FEYZMGWNZCCNKIX","created_at":"2026-07-05T11:17:41Z"},{"alias_kind":"pith_short_8","alias_value":"7FEYZMGW","created_at":"2026-07-05T11:17:41Z"}],"graph_snapshots":[{"event_id":"sha256:ba48953275752b63b39748a6fb04c284bcc5d49aee07f08b4701b166adc58a66","target":"graph","created_at":"2026-07-05T11:17:41Z","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/2502.12082/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"The computational cost of softmax-based attention in transformers limits their applicability to long-context tasks. Adaptive sparsity, of which $\\alpha$-entmax attention is an example, offers a flexible data-dependent alternative, but existing implementations are inefficient and do not leverage the sparsity to obtain runtime and memory gains. In this work, we propose AdaSplash, which combines the efficiency of GPU-optimized algorithms with the sparsity benefits of $\\alpha$-entmax. We first introduce a hybrid Halley-bisection algorithm, resulting in a 7-fold reduction in the number of iteration","authors_text":"Andr\\'e F. T. Martins, Marcos Treviso, Nuno Gon\\c{c}alves","cross_cats":["cs.LG"],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.CL","submitted_at":"2025-02-17T17:56:23Z","title":"AdaSplash: Adaptive Sparse Flash Attention"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2502.12082","kind":"arxiv","version":2},"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:3dcb29cb303dd55b47543222423d8e57754f2ef05b9f510103e6c02b2aa29f3a","target":"record","created_at":"2026-07-05T11:17:41Z","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":"55e3e475eb79fa92a1f28b5e4f8cf4899b04d860317b7c3d245adea94f5918b8","cross_cats_sorted":["cs.LG"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.CL","submitted_at":"2025-02-17T17:56:23Z","title_canon_sha256":"eea646a48bc8ecd2a67683b45c53f0f33f210cf23210036a54e276f918e25b5f"},"schema_version":"1.0","source":{"id":"2502.12082","kind":"arxiv","version":2}},"canonical_sha256":"f9498cb0d66e4426a917d5d3dabfa7968bcb1a97dad45409563f634cafb6efc4","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"f9498cb0d66e4426a917d5d3dabfa7968bcb1a97dad45409563f634cafb6efc4","first_computed_at":"2026-07-05T11:17:41.423237Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T11:17:41.423237Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"gDNB0Blp+7Jc7KmBK0BuupXjyOElXYP5tNNnjN8TS8MbBpB6jTi9n5uP6JSOh/luNnRtd9nFQPv8VsgJa0SrCQ==","signature_status":"signed_v1","signed_at":"2026-07-05T11:17:41.423740Z","signed_message":"canonical_sha256_bytes"},"source_id":"2502.12082","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:3dcb29cb303dd55b47543222423d8e57754f2ef05b9f510103e6c02b2aa29f3a","sha256:ba48953275752b63b39748a6fb04c284bcc5d49aee07f08b4701b166adc58a66"],"state_sha256":"d2ddc59ee2159c67388145f9a6ff35e7bf23e4fbcbebe1ab289c99ea350404cc"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"QFyyAfHnqgP/gZgVkEHDVDFXEl9un1Vz2nHLWExMpPnaUY6X3Eqd9eC5dQuoJAcq5eHuUfnxIVNnL4UV34zuDg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-07T17:58:00.558561Z","bundle_sha256":"ce4ab5c50f2b54dae41d3a60e88b601915918e71b5bc63708a97c2d4367218d1"}}