{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2025:P6B6MKMIZJKB2VN7K3ZOG7T6W2","short_pith_number":"pith:P6B6MKMI","canonical_record":{"source":{"id":"2505.08098","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DC","submitted_at":"2025-05-12T22:09:05Z","cross_cats_sorted":["cs.LG"],"title_canon_sha256":"6478bd18dd9b8ef8c155b592a904e20019be8a970ae5bfbdf01ef6e670c464ec","abstract_canon_sha256":"870aec69dc25fb460839ddd6e1c3ed299d33be7b6cdd32920b993b9058eaf1df"},"schema_version":"1.0"},"canonical_sha256":"7f83e62988ca541d55bf56f2e37e7eb6a67bbf5a0c8285e0423ebc46fd1d0b58","source":{"kind":"arxiv","id":"2505.08098","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2505.08098","created_at":"2026-07-05T11:02:02Z"},{"alias_kind":"arxiv_version","alias_value":"2505.08098v1","created_at":"2026-07-05T11:02:02Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2505.08098","created_at":"2026-07-05T11:02:02Z"},{"alias_kind":"pith_short_12","alias_value":"P6B6MKMIZJKB","created_at":"2026-07-05T11:02:02Z"},{"alias_kind":"pith_short_16","alias_value":"P6B6MKMIZJKB2VN7","created_at":"2026-07-05T11:02:02Z"},{"alias_kind":"pith_short_8","alias_value":"P6B6MKMI","created_at":"2026-07-05T11:02:02Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2025:P6B6MKMIZJKB2VN7K3ZOG7T6W2","target":"record","payload":{"canonical_record":{"source":{"id":"2505.08098","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DC","submitted_at":"2025-05-12T22:09:05Z","cross_cats_sorted":["cs.LG"],"title_canon_sha256":"6478bd18dd9b8ef8c155b592a904e20019be8a970ae5bfbdf01ef6e670c464ec","abstract_canon_sha256":"870aec69dc25fb460839ddd6e1c3ed299d33be7b6cdd32920b993b9058eaf1df"},"schema_version":"1.0"},"canonical_sha256":"7f83e62988ca541d55bf56f2e37e7eb6a67bbf5a0c8285e0423ebc46fd1d0b58","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T11:02:02.611578Z","signature_b64":"GEjji955oQfMORIVPKqVt4PEgVyecK/xSbRdF4i5Ha8xkyIeRMBh8GflZdYMm9leur2WmyHkiypwmQpfmZbrBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"7f83e62988ca541d55bf56f2e37e7eb6a67bbf5a0c8285e0423ebc46fd1d0b58","last_reissued_at":"2026-07-05T11:02:02.611103Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T11:02:02.611103Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2505.08098","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-05T11:02:02Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"KgOIil6L8N228jR9ueyhDJq0JTOJJlDUFeEnbxp0Jln58QIkj7R2xzZDI6lTuBmcLMyG33TIWj9OP1JsZmGVCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-17T21:11:34.285186Z"},"content_sha256":"c38d5f3cc4a19fb6f8ccce45bfba2ead7bf2fd6b156b6bf49b2840a1443b477c","schema_version":"1.0","event_id":"sha256:c38d5f3cc4a19fb6f8ccce45bfba2ead7bf2fd6b156b6bf49b2840a1443b477c"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2025:P6B6MKMIZJKB2VN7K3ZOG7T6W2","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Fused3S: Fast Sparse Attention on Tensor Cores","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.LG"],"primary_cat":"cs.DC","authors_text":"Aparna Chandramowlishwaran, Zitong Li","submitted_at":"2025-05-12T22:09:05Z","abstract_excerpt":"Sparse attention is a core building block in many leading neural network models, from graph-structured learning to sparse sequence modeling. It can be decomposed into a sequence of three sparse matrix operations (3S): sampled dense-dense matrix multiplication (SDDMM), softmax normalization, and sparse matrix multiplication (SpMM). Efficiently executing the 3S computational pattern on modern GPUs remains challenging due to (a) the mismatch between unstructured sparsity and tensor cores optimized for dense operations, and (b) the high cost of data movement. Previous works have optimized these sp"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2505.08098","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/2505.08098/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:02:02Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"UR3fBYeukrUX8Dym5bdlLu6jqVLtnF3dCRd9LKvglJkif4TCgyaaQVlAvrTOxmExq5MzvNCitntPUCjOS8ZwBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-17T21:11:34.358856Z"},"content_sha256":"5008fe424dfb5753198fd48aeeb862e9373761b2f2efed3863b7f9ee7047c045","schema_version":"1.0","event_id":"sha256:5008fe424dfb5753198fd48aeeb862e9373761b2f2efed3863b7f9ee7047c045"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/P6B6MKMIZJKB2VN7K3ZOG7T6W2/bundle.json","state_url":"https://pith.science/pith/P6B6MKMIZJKB2VN7K3ZOG7T6W2/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/P6B6MKMIZJKB2VN7K3ZOG7T6W2/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-17T21:11:34Z","links":{"resolver":"https://pith.science/pith/P6B6MKMIZJKB2VN7K3ZOG7T6W2","bundle":"https://pith.science/pith/P6B6MKMIZJKB2VN7K3ZOG7T6W2/bundle.json","state":"https://pith.science/pith/P6B6MKMIZJKB2VN7K3ZOG7T6W2/state.json","well_known_bundle":"https://pith.science/.well-known/pith/P6B6MKMIZJKB2VN7K3ZOG7T6W2/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2025:P6B6MKMIZJKB2VN7K3ZOG7T6W2","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":"870aec69dc25fb460839ddd6e1c3ed299d33be7b6cdd32920b993b9058eaf1df","cross_cats_sorted":["cs.LG"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DC","submitted_at":"2025-05-12T22:09:05Z","title_canon_sha256":"6478bd18dd9b8ef8c155b592a904e20019be8a970ae5bfbdf01ef6e670c464ec"},"schema_version":"1.0","source":{"id":"2505.08098","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2505.08098","created_at":"2026-07-05T11:02:02Z"},{"alias_kind":"arxiv_version","alias_value":"2505.08098v1","created_at":"2026-07-05T11:02:02Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2505.08098","created_at":"2026-07-05T11:02:02Z"},{"alias_kind":"pith_short_12","alias_value":"P6B6MKMIZJKB","created_at":"2026-07-05T11:02:02Z"},{"alias_kind":"pith_short_16","alias_value":"P6B6MKMIZJKB2VN7","created_at":"2026-07-05T11:02:02Z"},{"alias_kind":"pith_short_8","alias_value":"P6B6MKMI","created_at":"2026-07-05T11:02:02Z"}],"graph_snapshots":[{"event_id":"sha256:5008fe424dfb5753198fd48aeeb862e9373761b2f2efed3863b7f9ee7047c045","target":"graph","created_at":"2026-07-05T11:02:02Z","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/2505.08098/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Sparse attention is a core building block in many leading neural network models, from graph-structured learning to sparse sequence modeling. It can be decomposed into a sequence of three sparse matrix operations (3S): sampled dense-dense matrix multiplication (SDDMM), softmax normalization, and sparse matrix multiplication (SpMM). Efficiently executing the 3S computational pattern on modern GPUs remains challenging due to (a) the mismatch between unstructured sparsity and tensor cores optimized for dense operations, and (b) the high cost of data movement. Previous works have optimized these sp","authors_text":"Aparna Chandramowlishwaran, Zitong Li","cross_cats":["cs.LG"],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DC","submitted_at":"2025-05-12T22:09:05Z","title":"Fused3S: Fast Sparse Attention on Tensor Cores"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2505.08098","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:c38d5f3cc4a19fb6f8ccce45bfba2ead7bf2fd6b156b6bf49b2840a1443b477c","target":"record","created_at":"2026-07-05T11:02:02Z","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":"870aec69dc25fb460839ddd6e1c3ed299d33be7b6cdd32920b993b9058eaf1df","cross_cats_sorted":["cs.LG"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DC","submitted_at":"2025-05-12T22:09:05Z","title_canon_sha256":"6478bd18dd9b8ef8c155b592a904e20019be8a970ae5bfbdf01ef6e670c464ec"},"schema_version":"1.0","source":{"id":"2505.08098","kind":"arxiv","version":1}},"canonical_sha256":"7f83e62988ca541d55bf56f2e37e7eb6a67bbf5a0c8285e0423ebc46fd1d0b58","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"7f83e62988ca541d55bf56f2e37e7eb6a67bbf5a0c8285e0423ebc46fd1d0b58","first_computed_at":"2026-07-05T11:02:02.611103Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T11:02:02.611103Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"GEjji955oQfMORIVPKqVt4PEgVyecK/xSbRdF4i5Ha8xkyIeRMBh8GflZdYMm9leur2WmyHkiypwmQpfmZbrBw==","signature_status":"signed_v1","signed_at":"2026-07-05T11:02:02.611578Z","signed_message":"canonical_sha256_bytes"},"source_id":"2505.08098","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:c38d5f3cc4a19fb6f8ccce45bfba2ead7bf2fd6b156b6bf49b2840a1443b477c","sha256:5008fe424dfb5753198fd48aeeb862e9373761b2f2efed3863b7f9ee7047c045"],"state_sha256":"96689bc6588a2050d907ccd35e4b52d3d6cd588a6bbfd8a311418cb14c5fb96b"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"mdw9TsvvYbmNBrQBoahL5A6h2HdO6E+/EMr4r6QARWTiv6yydeWb5kMwoqajvstwudKIIyzROWIPYB44VvoQDg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-17T21:11:34.377871Z","bundle_sha256":"30b9555827fad5844753ef80a53a8cab24c20f507c18594490f7814a8e83d5e4"}}