{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2024:FE7CDMG6Q7QHOHU7RL7M4BNSUQ","short_pith_number":"pith:FE7CDMG6","schema_version":"1.0","canonical_sha256":"293e21b0de87e0771e9f8afece05b2a423e160d176229d2d8b4987622e9dd7c7","source":{"kind":"arxiv","id":"2405.01067","version":2},"attestation_state":"computed","paper":{"title":"AB-Training: A Communication-Efficient Approach for Distributed Low-Rank Learning","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.AI","cs.DC"],"primary_cat":"cs.LG","authors_text":"Achim Streit, Charlotte Debus, Daniel Coquelin, Katherina Fl\\\"ugel, Marie Weiel, Markus G\\\"otz, Muhammed \\\"Oz, Nicholas Kiefer","submitted_at":"2024-05-02T07:49:28Z","abstract_excerpt":"Communication bottlenecks severely hinder the scalability of distributed neural network training, particularly in high-performance computing (HPC) environments. We introduce AB-training, a novel data-parallel method that leverages low-rank representations and independent training groups to significantly reduce communication overhead. Our experiments demonstrate an average reduction in network traffic of approximately 70.31\\% across various scaling scenarios, increasing the training potential of communication-constrained systems and accelerating convergence at scale. AB-training also exhibits a"},"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":"2405.01067","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2024-05-02T07:49:28Z","cross_cats_sorted":["cs.AI","cs.DC"],"title_canon_sha256":"f7c029e26b1c1dec8f50402780c51ae228c1b22196e20624a98d8170129a8793","abstract_canon_sha256":"063b6261d9d62b2c4b30be92d742249421eb0c4991ee86d0f50020552af04937"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T08:38:09.332912Z","signature_b64":"lVPvo/BcpddEsIAiBuESsbQyVkRWvZEWlGAkJTkUMU/Zj39JxpXAL5/wJrKj3o7BLCDuosee5tG2T0sXe2yjCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"293e21b0de87e0771e9f8afece05b2a423e160d176229d2d8b4987622e9dd7c7","last_reissued_at":"2026-07-05T08:38:09.332475Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T08:38:09.332475Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"AB-Training: A Communication-Efficient Approach for Distributed Low-Rank Learning","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.AI","cs.DC"],"primary_cat":"cs.LG","authors_text":"Achim Streit, Charlotte Debus, Daniel Coquelin, Katherina Fl\\\"ugel, Marie Weiel, Markus G\\\"otz, Muhammed \\\"Oz, Nicholas Kiefer","submitted_at":"2024-05-02T07:49:28Z","abstract_excerpt":"Communication bottlenecks severely hinder the scalability of distributed neural network training, particularly in high-performance computing (HPC) environments. We introduce AB-training, a novel data-parallel method that leverages low-rank representations and independent training groups to significantly reduce communication overhead. Our experiments demonstrate an average reduction in network traffic of approximately 70.31\\% across various scaling scenarios, increasing the training potential of communication-constrained systems and accelerating convergence at scale. AB-training also exhibits a"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2405.01067","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/2405.01067/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":"2405.01067","created_at":"2026-07-05T08:38:09.332535+00:00"},{"alias_kind":"arxiv_version","alias_value":"2405.01067v2","created_at":"2026-07-05T08:38:09.332535+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2405.01067","created_at":"2026-07-05T08:38:09.332535+00:00"},{"alias_kind":"pith_short_12","alias_value":"FE7CDMG6Q7QH","created_at":"2026-07-05T08:38:09.332535+00:00"},{"alias_kind":"pith_short_16","alias_value":"FE7CDMG6Q7QHOHU7","created_at":"2026-07-05T08:38:09.332535+00:00"},{"alias_kind":"pith_short_8","alias_value":"FE7CDMG6","created_at":"2026-07-05T08:38:09.332535+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/FE7CDMG6Q7QHOHU7RL7M4BNSUQ","json":"https://pith.science/pith/FE7CDMG6Q7QHOHU7RL7M4BNSUQ.json","graph_json":"https://pith.science/api/pith-number/FE7CDMG6Q7QHOHU7RL7M4BNSUQ/graph.json","events_json":"https://pith.science/api/pith-number/FE7CDMG6Q7QHOHU7RL7M4BNSUQ/events.json","paper":"https://pith.science/paper/FE7CDMG6"},"agent_actions":{"view_html":"https://pith.science/pith/FE7CDMG6Q7QHOHU7RL7M4BNSUQ","download_json":"https://pith.science/pith/FE7CDMG6Q7QHOHU7RL7M4BNSUQ.json","view_paper":"https://pith.science/paper/FE7CDMG6","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2405.01067&json=true","fetch_graph":"https://pith.science/api/pith-number/FE7CDMG6Q7QHOHU7RL7M4BNSUQ/graph.json","fetch_events":"https://pith.science/api/pith-number/FE7CDMG6Q7QHOHU7RL7M4BNSUQ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/FE7CDMG6Q7QHOHU7RL7M4BNSUQ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/FE7CDMG6Q7QHOHU7RL7M4BNSUQ/action/storage_attestation","attest_author":"https://pith.science/pith/FE7CDMG6Q7QHOHU7RL7M4BNSUQ/action/author_attestation","sign_citation":"https://pith.science/pith/FE7CDMG6Q7QHOHU7RL7M4BNSUQ/action/citation_signature","submit_replication":"https://pith.science/pith/FE7CDMG6Q7QHOHU7RL7M4BNSUQ/action/replication_record"}},"created_at":"2026-07-05T08:38:09.332535+00:00","updated_at":"2026-07-05T08:38:09.332535+00:00"}