{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2019:NUGERDM4SYNX4JQT5O2S2S4QHI","short_pith_number":"pith:NUGERDM4","schema_version":"1.0","canonical_sha256":"6d0c488d9c961b7e2613ebb52d4b903a103b1b1c63af011554625076853a1e6a","source":{"kind":"arxiv","id":"1910.04940","version":1},"attestation_state":"computed","paper":{"title":"Blink: Fast and Generic Collectives for Distributed ML","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG"],"primary_cat":"cs.DC","authors_text":"Amar Phanishayee, Guanhua Wang, Ion Stoica, Jorgen Thelin, Nikhil Devanur, Shivaram Venkataraman","submitted_at":"2019-10-11T02:13:34Z","abstract_excerpt":"Model parameter synchronization across GPUs introduces high overheads for data-parallel training at scale. Existing parameter synchronization protocols cannot effectively leverage available network resources in the face of ever increasing hardware heterogeneity. To address this, we propose Blink, a collective communication library that dynamically generates optimal communication primitives by packing spanning trees. We propose techniques to minimize the number of trees generated and extend Blink to leverage heterogeneous communication channels for faster data transfers. Evaluations show that c"},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"canonical_record":{"source":{"id":"1910.04940","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2019-10-11T02:13:34Z","cross_cats_sorted":["cs.LG"],"title_canon_sha256":"ce727b1a9ee056b7252dd66a455948fc531e07ecc7da895aa78daa1d0785218c","abstract_canon_sha256":"f1dab1dab82aa1da1ff54c1e59f2d38eac122ffa953eb55dc3ab9b1384e1243b"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T00:11:23.996121Z","signature_b64":"GyB1rsqpW9igoZ2S56leOVyPzOFP8D5c+1Y+DSCZoCgjMWm+fnR2nYC9iVhi2UC5yaQUPmRE7QndMVJNv1DcBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"6d0c488d9c961b7e2613ebb52d4b903a103b1b1c63af011554625076853a1e6a","last_reissued_at":"2026-07-05T00:11:23.995700Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T00:11:23.995700Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Blink: Fast and Generic Collectives for Distributed ML","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG"],"primary_cat":"cs.DC","authors_text":"Amar Phanishayee, Guanhua Wang, Ion Stoica, Jorgen Thelin, Nikhil Devanur, Shivaram Venkataraman","submitted_at":"2019-10-11T02:13:34Z","abstract_excerpt":"Model parameter synchronization across GPUs introduces high overheads for data-parallel training at scale. Existing parameter synchronization protocols cannot effectively leverage available network resources in the face of ever increasing hardware heterogeneity. To address this, we propose Blink, a collective communication library that dynamically generates optimal communication primitives by packing spanning trees. We propose techniques to minimize the number of trees generated and extend Blink to leverage heterogeneous communication channels for faster data transfers. Evaluations show that c"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1910.04940","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/1910.04940/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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1910.04940","created_at":"2026-07-05T00:11:23.995752+00:00"},{"alias_kind":"arxiv_version","alias_value":"1910.04940v1","created_at":"2026-07-05T00:11:23.995752+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1910.04940","created_at":"2026-07-05T00:11:23.995752+00:00"},{"alias_kind":"pith_short_12","alias_value":"NUGERDM4SYNX","created_at":"2026-07-05T00:11:23.995752+00:00"},{"alias_kind":"pith_short_16","alias_value":"NUGERDM4SYNX4JQT","created_at":"2026-07-05T00:11:23.995752+00:00"},{"alias_kind":"pith_short_8","alias_value":"NUGERDM4","created_at":"2026-07-05T00:11:23.995752+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":2,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2409.09874","citing_title":"The Landscape of GPU-Centric Communication","ref_index":123,"is_internal_anchor":false},{"citing_arxiv_id":"2006.15704","citing_title":"PyTorch Distributed: Experiences on Accelerating Data Parallel Training","ref_index":47,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/NUGERDM4SYNX4JQT5O2S2S4QHI","json":"https://pith.science/pith/NUGERDM4SYNX4JQT5O2S2S4QHI.json","graph_json":"https://pith.science/api/pith-number/NUGERDM4SYNX4JQT5O2S2S4QHI/graph.json","events_json":"https://pith.science/api/pith-number/NUGERDM4SYNX4JQT5O2S2S4QHI/events.json","paper":"https://pith.science/paper/NUGERDM4"},"agent_actions":{"view_html":"https://pith.science/pith/NUGERDM4SYNX4JQT5O2S2S4QHI","download_json":"https://pith.science/pith/NUGERDM4SYNX4JQT5O2S2S4QHI.json","view_paper":"https://pith.science/paper/NUGERDM4","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1910.04940&json=true","fetch_graph":"https://pith.science/api/pith-number/NUGERDM4SYNX4JQT5O2S2S4QHI/graph.json","fetch_events":"https://pith.science/api/pith-number/NUGERDM4SYNX4JQT5O2S2S4QHI/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/NUGERDM4SYNX4JQT5O2S2S4QHI/action/timestamp_anchor","attest_storage":"https://pith.science/pith/NUGERDM4SYNX4JQT5O2S2S4QHI/action/storage_attestation","attest_author":"https://pith.science/pith/NUGERDM4SYNX4JQT5O2S2S4QHI/action/author_attestation","sign_citation":"https://pith.science/pith/NUGERDM4SYNX4JQT5O2S2S4QHI/action/citation_signature","submit_replication":"https://pith.science/pith/NUGERDM4SYNX4JQT5O2S2S4QHI/action/replication_record"}},"created_at":"2026-07-05T00:11:23.995752+00:00","updated_at":"2026-07-05T00:11:23.995752+00:00"}