{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2026:RGZJGFOXTJ5YXDR3FQ3P2GP7Q4","short_pith_number":"pith:RGZJGFOX","canonical_record":{"source":{"id":"2607.04676","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2026-07-06T05:06:37Z","cross_cats_sorted":[],"title_canon_sha256":"1f2f45f337964bb04985a1a624bf9beab0204b806e10f4e9d30924f6c4044858","abstract_canon_sha256":"bbc0beda1007d845322fd8f0314605a4a05e69e68122c6e6bd6a9febf70c00e4"},"schema_version":"1.0"},"canonical_sha256":"89b29315d79a7b8b8e3b2c36fd19ff871349b100aff4afeee854b25c3acab624","source":{"kind":"arxiv","id":"2607.04676","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2607.04676","created_at":"2026-07-07T02:19:31Z"},{"alias_kind":"arxiv_version","alias_value":"2607.04676v1","created_at":"2026-07-07T02:19:31Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2607.04676","created_at":"2026-07-07T02:19:31Z"},{"alias_kind":"pith_short_12","alias_value":"RGZJGFOXTJ5Y","created_at":"2026-07-07T02:19:31Z"},{"alias_kind":"pith_short_16","alias_value":"RGZJGFOXTJ5YXDR3","created_at":"2026-07-07T02:19:31Z"},{"alias_kind":"pith_short_8","alias_value":"RGZJGFOX","created_at":"2026-07-07T02:19:31Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2026:RGZJGFOXTJ5YXDR3FQ3P2GP7Q4","target":"record","payload":{"canonical_record":{"source":{"id":"2607.04676","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2026-07-06T05:06:37Z","cross_cats_sorted":[],"title_canon_sha256":"1f2f45f337964bb04985a1a624bf9beab0204b806e10f4e9d30924f6c4044858","abstract_canon_sha256":"bbc0beda1007d845322fd8f0314605a4a05e69e68122c6e6bd6a9febf70c00e4"},"schema_version":"1.0"},"canonical_sha256":"89b29315d79a7b8b8e3b2c36fd19ff871349b100aff4afeee854b25c3acab624","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-07T02:19:31.625910Z","signature_b64":"7eflHxrdOf+M09RkmfLBA908j2xnB0xdv3hgm+IfCxKidvQIDCUoRsX1uKwpcJY4jS2gfKjlLNSko6lyV5GtBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"89b29315d79a7b8b8e3b2c36fd19ff871349b100aff4afeee854b25c3acab624","last_reissued_at":"2026-07-07T02:19:31.625170Z","signature_status":"signed_v1","first_computed_at":"2026-07-07T02:19:31.625170Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2607.04676","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-07T02:19:31Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"35g+fs8DqH7Hy3XF8oWBdLuZD8aRkMcEVOl7mDMHxwDCc6MMhwT/s6u0eDFPuIbU/5kGtIzKGv1Qj8YiqSxgDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-03T22:32:53.709481Z"},"content_sha256":"0d60506e64618ec0dcc5f9db35a746dfc800ba002f11ede3f93f152f728000db","schema_version":"1.0","event_id":"sha256:0d60506e64618ec0dcc5f9db35a746dfc800ba002f11ede3f93f152f728000db"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2026:RGZJGFOXTJ5YXDR3FQ3P2GP7Q4","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Adaptive Space-efficient Collectives for Dynamic and Unstructured Sparsity on GPU Platforms","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DC","authors_text":"Abhinav Bhatele, Emir Gencer, Hoffmann Muki, Lannie Dalton Hough","submitted_at":"2026-07-06T05:06:37Z","abstract_excerpt":"High-performance collective communication primitives are necessary for a variety of high performance computing (HPC) and machine learning (ML) workloads. State-of-the-art collective communication libraries such as NCCL optimize exclusively for dense data. However, when sending sparse data, we can reduce communication volume by not sending zeros. Unfortunately, explicitly handling sparsity introduces challenges such as format conversion overheads and densification during collectives that involve reductions. In this paper, we introduce sparsity-exploiting algorithms for three collectives that ad"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2607.04676","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/2607.04676/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-07T02:19:31Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ukJ6/4ET668zn3mpapFWE7i906DE4Uvq3ySHca2LX8K9q+0X6ejL7453/tSw6QrfheCfFOFd+9aE0ozLzb33Dg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-03T22:32:53.710009Z"},"content_sha256":"b63b5457e612fd2ea36afc92aedbf5ce20e80c3dbe4ee5068186b876ad6159ec","schema_version":"1.0","event_id":"sha256:b63b5457e612fd2ea36afc92aedbf5ce20e80c3dbe4ee5068186b876ad6159ec"},{"event_type":"integrity_finding","subject_pith_number":"pith:2026:RGZJGFOXTJ5YXDR3FQ3P2GP7Q4","target":"integrity","payload":{"note":"DOI in the printed bibliography is fragmented by whitespace or line breaks. A longer candidate (10.1007/978-3-642-38527-815) was visible in the surrounding text but could not be confirmed against doi.org as printed.","snippet":"D. Zhou, D. G. Andersen, and M. Kaminsky, “Space-efficient, high- performance rank and select structures on uncompressed bit sequences,” inInternational Symposium on Experimental Algorithms. Springer, 2013, pp. 151–163. [Online]. Available:","arxiv_id":"2607.04676","detector":"doi_compliance","evidence":{"ref_index":25,"verdict_class":"incontrovertible","resolved_title":null,"printed_excerpt":"D. Zhou, D. G. Andersen, and M. Kaminsky, “Space-efficient, high- performance rank and select structures on uncompressed bit sequences,” inInternational Symposium on Experimental Algorithms. Springer, 2013, pp. 151–163. [Online]. Available:","reconstructed_doi":"10.1007/978-3-642-38527-815"},"severity":"advisory","ref_index":25,"audited_at":"2026-07-11T15:31:48.958347Z","event_type":"pith.integrity.v1","detected_doi":"10.1007/978-3-642-38527-815","detector_url":"https://pith.science/pith-integrity-protocol#doi_compliance","external_url":null,"finding_type":"recoverable_identifier","evidence_hash":"350843aa190fa3adaa9f0255621abfb9f47893d24af42cc7af7ec953a650e9f3","paper_version":1,"verdict_class":"incontrovertible","resolved_title":null,"detector_version":"1.0.0","detected_arxiv_id":null,"integrity_event_id":12217,"payload_sha256":"6594a4c4f82c7d3ab904bd2681ccaef29e5d9eb56dc0ff7f7780d43ff08ac707","signature_b64":"kTmVGY3Bts44tCtwo4WnN4O3tS9yoOxa09jkNE4RlXNcJzUlS1BfxU53UIlwuKYzQ9ssA7cJ6KIJE41WgbhjBQ==","signing_key_id":"pith-v1-2026-05"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-07-11T15:36:17Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"dPU9OIlFyssMXAYveYZzSsncTL8Pmw3y09cYhhwoDEEZTLf2JUC2tGdhknn4jIr6pM7moKkowRzHfVBZtjumDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-03T22:32:53.760770Z"},"content_sha256":"8b2742e31e65ed3e98e61ebbe9d41967688b7e2601614fe3292d59b7fa74abb1","schema_version":"1.0","event_id":"sha256:8b2742e31e65ed3e98e61ebbe9d41967688b7e2601614fe3292d59b7fa74abb1"},{"event_type":"integrity_finding","subject_pith_number":"pith:2026:RGZJGFOXTJ5YXDR3FQ3P2GP7Q4","target":"integrity","payload":{"note":"DOI in the printed bibliography is fragmented by whitespace or line breaks. A longer candidate (10.1007/978-3-540-24685-51) was visible in the surrounding text but could not be confirmed against doi.org as printed.","snippet":"R. Rabenseifner, “Optimization of collective reduction operations,” in International Conference on Computational Science. Springer, 2004, pp. 1–9. [Online]. Available: https://doi.org/10.1007/978-3-540-24685- 5 1","arxiv_id":"2607.04676","detector":"doi_compliance","evidence":{"ref_index":18,"verdict_class":"incontrovertible","resolved_title":null,"printed_excerpt":"R. Rabenseifner, “Optimization of collective reduction operations,” in International Conference on Computational Science. Springer, 2004, pp. 1–9. [Online]. Available: https://doi.org/10.1007/978-3-540-24685- 5 1","reconstructed_doi":"10.1007/978-3-540-24685-51"},"severity":"advisory","ref_index":18,"audited_at":"2026-07-11T15:31:48.958347Z","event_type":"pith.integrity.v1","detected_doi":"10.1007/978-3-540-24685-51","detector_url":"https://pith.science/pith-integrity-protocol#doi_compliance","external_url":null,"finding_type":"recoverable_identifier","evidence_hash":"9401fe3e9a51aec00204fc6e4a281a290b5beea13b45611a7c0d16b24c2252b0","paper_version":1,"verdict_class":"incontrovertible","resolved_title":null,"detector_version":"1.0.0","detected_arxiv_id":null,"integrity_event_id":12216,"payload_sha256":"4523df4a7cc6dc9e6ccd613855c5789b32dcaf0a9efbb56ccac6272a40b94e2f","signature_b64":"c8QQYvZOOM1q/OyiX0m2CcPIAGKxUQ4DW3r/aRJHcLez27QpHMDHcF2yxBXDlS6juJPyULlOngp5GWHBa63ZCA==","signing_key_id":"pith-v1-2026-05"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-07-11T15:36:17Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"G/MnD8wEMkT7vy/X0Wprb/2j8gmUaQzAHZN7T5uz8nCutEd6Cma+dKrhmMRCLEZRDzWYj7F3zjcnhDWLcUjmCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-03T22:32:53.761162Z"},"content_sha256":"a8d40c0badc8177627e46c246e6873b67ab7fbb2a3b62b01864b03211861b8ad","schema_version":"1.0","event_id":"sha256:a8d40c0badc8177627e46c246e6873b67ab7fbb2a3b62b01864b03211861b8ad"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/RGZJGFOXTJ5YXDR3FQ3P2GP7Q4/bundle.json","state_url":"https://pith.science/pith/RGZJGFOXTJ5YXDR3FQ3P2GP7Q4/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/RGZJGFOXTJ5YXDR3FQ3P2GP7Q4/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-03T22:32:53Z","links":{"resolver":"https://pith.science/pith/RGZJGFOXTJ5YXDR3FQ3P2GP7Q4","bundle":"https://pith.science/pith/RGZJGFOXTJ5YXDR3FQ3P2GP7Q4/bundle.json","state":"https://pith.science/pith/RGZJGFOXTJ5YXDR3FQ3P2GP7Q4/state.json","well_known_bundle":"https://pith.science/.well-known/pith/RGZJGFOXTJ5YXDR3FQ3P2GP7Q4/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2026:RGZJGFOXTJ5YXDR3FQ3P2GP7Q4","merge_version":"pith-open-graph-merge-v1","event_count":4,"valid_event_count":4,"invalid_event_count":0,"equivocation_count":1,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"bbc0beda1007d845322fd8f0314605a4a05e69e68122c6e6bd6a9febf70c00e4","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2026-07-06T05:06:37Z","title_canon_sha256":"1f2f45f337964bb04985a1a624bf9beab0204b806e10f4e9d30924f6c4044858"},"schema_version":"1.0","source":{"id":"2607.04676","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2607.04676","created_at":"2026-07-07T02:19:31Z"},{"alias_kind":"arxiv_version","alias_value":"2607.04676v1","created_at":"2026-07-07T02:19:31Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2607.04676","created_at":"2026-07-07T02:19:31Z"},{"alias_kind":"pith_short_12","alias_value":"RGZJGFOXTJ5Y","created_at":"2026-07-07T02:19:31Z"},{"alias_kind":"pith_short_16","alias_value":"RGZJGFOXTJ5YXDR3","created_at":"2026-07-07T02:19:31Z"},{"alias_kind":"pith_short_8","alias_value":"RGZJGFOX","created_at":"2026-07-07T02:19:31Z"}],"graph_snapshots":[{"event_id":"sha256:b63b5457e612fd2ea36afc92aedbf5ce20e80c3dbe4ee5068186b876ad6159ec","target":"graph","created_at":"2026-07-07T02:19:31Z","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/2607.04676/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"High-performance collective communication primitives are necessary for a variety of high performance computing (HPC) and machine learning (ML) workloads. State-of-the-art collective communication libraries such as NCCL optimize exclusively for dense data. However, when sending sparse data, we can reduce communication volume by not sending zeros. Unfortunately, explicitly handling sparsity introduces challenges such as format conversion overheads and densification during collectives that involve reductions. In this paper, we introduce sparsity-exploiting algorithms for three collectives that ad","authors_text":"Abhinav Bhatele, Emir Gencer, Hoffmann Muki, Lannie Dalton Hough","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2026-07-06T05:06:37Z","title":"Adaptive Space-efficient Collectives for Dynamic and Unstructured Sparsity on GPU Platforms"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2607.04676","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:0d60506e64618ec0dcc5f9db35a746dfc800ba002f11ede3f93f152f728000db","target":"record","created_at":"2026-07-07T02:19:31Z","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":"bbc0beda1007d845322fd8f0314605a4a05e69e68122c6e6bd6a9febf70c00e4","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2026-07-06T05:06:37Z","title_canon_sha256":"1f2f45f337964bb04985a1a624bf9beab0204b806e10f4e9d30924f6c4044858"},"schema_version":"1.0","source":{"id":"2607.04676","kind":"arxiv","version":1}},"canonical_sha256":"89b29315d79a7b8b8e3b2c36fd19ff871349b100aff4afeee854b25c3acab624","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"89b29315d79a7b8b8e3b2c36fd19ff871349b100aff4afeee854b25c3acab624","first_computed_at":"2026-07-07T02:19:31.625170Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-07T02:19:31.625170Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"7eflHxrdOf+M09RkmfLBA908j2xnB0xdv3hgm+IfCxKidvQIDCUoRsX1uKwpcJY4jS2gfKjlLNSko6lyV5GtBA==","signature_status":"signed_v1","signed_at":"2026-07-07T02:19:31.625910Z","signed_message":"canonical_sha256_bytes"},"source_id":"2607.04676","source_kind":"arxiv","source_version":1}}},"equivocations":[{"signer_id":"pith.science","event_type":"integrity_finding","target":"integrity","event_ids":["sha256:8b2742e31e65ed3e98e61ebbe9d41967688b7e2601614fe3292d59b7fa74abb1","sha256:a8d40c0badc8177627e46c246e6873b67ab7fbb2a3b62b01864b03211861b8ad"]}],"invalid_events":[],"applied_event_ids":["sha256:0d60506e64618ec0dcc5f9db35a746dfc800ba002f11ede3f93f152f728000db","sha256:b63b5457e612fd2ea36afc92aedbf5ce20e80c3dbe4ee5068186b876ad6159ec"],"state_sha256":"ef3e12980a0caaf7eaa0570ef02767769ead3698ca36d28d0ddaf61b50aa3357"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"NMbD+jIWVPC4KnirV9tEgourJIAYAIMmXKq6cSr3o3imTzP2Lx2Z8Q8S71MNr4Etv118YmyDKXhsgSDzkUeMDQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-03T22:32:53.763823Z","bundle_sha256":"632ab3658de40b34627dd3b69d760246c5cf21ee6fdfcb2a29467173697a8811"}}