{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2025:T4XGT3RV7P5JXRN2GYZEECNJHI","short_pith_number":"pith:T4XGT3RV","canonical_record":{"source":{"id":"2501.07526","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DC","submitted_at":"2025-01-13T17:56:39Z","cross_cats_sorted":["stat.ML"],"title_canon_sha256":"565686d34581bb344d4e753cc92f6efbdd67244b4c00f5606b4f257a0fe48abf","abstract_canon_sha256":"4b72b56b8969c98a0843800cf9eaaf25c7cd2818c40ed576e951478f76c40fb9"},"schema_version":"1.0"},"canonical_sha256":"9f2e69ee35fbfa9bc5ba36324209a93a36a5ce8ccf2ba806e525a551a250cadd","source":{"kind":"arxiv","id":"2501.07526","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2501.07526","created_at":"2026-06-26T01:15:43Z"},{"alias_kind":"arxiv_version","alias_value":"2501.07526v2","created_at":"2026-06-26T01:15:43Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2501.07526","created_at":"2026-06-26T01:15:43Z"},{"alias_kind":"pith_short_12","alias_value":"T4XGT3RV7P5J","created_at":"2026-06-26T01:15:43Z"},{"alias_kind":"pith_short_16","alias_value":"T4XGT3RV7P5JXRN2","created_at":"2026-06-26T01:15:43Z"},{"alias_kind":"pith_short_8","alias_value":"T4XGT3RV","created_at":"2026-06-26T01:15:43Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2025:T4XGT3RV7P5JXRN2GYZEECNJHI","target":"record","payload":{"canonical_record":{"source":{"id":"2501.07526","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DC","submitted_at":"2025-01-13T17:56:39Z","cross_cats_sorted":["stat.ML"],"title_canon_sha256":"565686d34581bb344d4e753cc92f6efbdd67244b4c00f5606b4f257a0fe48abf","abstract_canon_sha256":"4b72b56b8969c98a0843800cf9eaaf25c7cd2818c40ed576e951478f76c40fb9"},"schema_version":"1.0"},"canonical_sha256":"9f2e69ee35fbfa9bc5ba36324209a93a36a5ce8ccf2ba806e525a551a250cadd","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-06-26T01:15:43.213015Z","signature_b64":"/D42AXm41W/UmmIxeVkUw5AcDW56y1lUHGAXk5zA4TXJBiBJvKJ+ouZRfwGHN4stARbjqEJWrpKgo8zJa1KeAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"9f2e69ee35fbfa9bc5ba36324209a93a36a5ce8ccf2ba806e525a551a250cadd","last_reissued_at":"2026-06-26T01:15:43.212582Z","signature_status":"signed_v1","first_computed_at":"2026-06-26T01:15:43.212582Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2501.07526","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-06-26T01:15:43Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"22yUGTfNQhnk4u6PuoxHYE0/T6yAuD7CrGbdvx70xDkvr3nWl7mbbqfF+a5q9FslZdEYOPzBgVBsf0d+1GqRBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-28T00:47:19.988194Z"},"content_sha256":"1cd1a82fe43dc6b00f44c2333e63e6d267e0eff8a5eeedf67615f75ce6f3bbc6","schema_version":"1.0","event_id":"sha256:1cd1a82fe43dc6b00f44c2333e63e6d267e0eff8a5eeedf67615f75ce6f3bbc6"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2025:T4XGT3RV7P5JXRN2GYZEECNJHI","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Communication-Efficient, 2D Parallel Stochastic Gradient Descent for Distributed-Memory Optimization","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["stat.ML"],"primary_cat":"cs.DC","authors_text":"Aditya Devarakonda, Ramakrishnan Kannan","submitted_at":"2025-01-13T17:56:39Z","abstract_excerpt":"Distributed-memory implementations of numerical optimization algorithm, such as stochastic gradient descent (SGD), require interprocessor communication at every iteration of the algorithm. On modern distributed-memory clusters where communication is more expensive than computation, the scalability and performance of these algorithms are limited by communication cost. This work generalizes prior work on 1D $s$-step SGD and 1D Federated SGD with Averaging (FedAvg) to yield a 2D parallel SGD method (HybridSGD) which attains a continuous performance trade off between the two baseline algorithms. W"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2501.07526","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/2501.07526/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-06-26T01:15:43Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"82/BkU9wrtU0b4nS/4OfQTJhGGGYifyx539n5Ait5gkWS6kHXFjQ0RowN3xS+yMiBNd9NUErNEiv31/TdK42DQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-28T00:47:19.988586Z"},"content_sha256":"36e95ab28c8840f5113f502c593802b370a99b0c515d498ca52248c6e372850e","schema_version":"1.0","event_id":"sha256:36e95ab28c8840f5113f502c593802b370a99b0c515d498ca52248c6e372850e"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/T4XGT3RV7P5JXRN2GYZEECNJHI/bundle.json","state_url":"https://pith.science/pith/T4XGT3RV7P5JXRN2GYZEECNJHI/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/T4XGT3RV7P5JXRN2GYZEECNJHI/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-06-28T00:47:19Z","links":{"resolver":"https://pith.science/pith/T4XGT3RV7P5JXRN2GYZEECNJHI","bundle":"https://pith.science/pith/T4XGT3RV7P5JXRN2GYZEECNJHI/bundle.json","state":"https://pith.science/pith/T4XGT3RV7P5JXRN2GYZEECNJHI/state.json","well_known_bundle":"https://pith.science/.well-known/pith/T4XGT3RV7P5JXRN2GYZEECNJHI/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2025:T4XGT3RV7P5JXRN2GYZEECNJHI","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":"4b72b56b8969c98a0843800cf9eaaf25c7cd2818c40ed576e951478f76c40fb9","cross_cats_sorted":["stat.ML"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DC","submitted_at":"2025-01-13T17:56:39Z","title_canon_sha256":"565686d34581bb344d4e753cc92f6efbdd67244b4c00f5606b4f257a0fe48abf"},"schema_version":"1.0","source":{"id":"2501.07526","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2501.07526","created_at":"2026-06-26T01:15:43Z"},{"alias_kind":"arxiv_version","alias_value":"2501.07526v2","created_at":"2026-06-26T01:15:43Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2501.07526","created_at":"2026-06-26T01:15:43Z"},{"alias_kind":"pith_short_12","alias_value":"T4XGT3RV7P5J","created_at":"2026-06-26T01:15:43Z"},{"alias_kind":"pith_short_16","alias_value":"T4XGT3RV7P5JXRN2","created_at":"2026-06-26T01:15:43Z"},{"alias_kind":"pith_short_8","alias_value":"T4XGT3RV","created_at":"2026-06-26T01:15:43Z"}],"graph_snapshots":[{"event_id":"sha256:36e95ab28c8840f5113f502c593802b370a99b0c515d498ca52248c6e372850e","target":"graph","created_at":"2026-06-26T01:15:43Z","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/2501.07526/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Distributed-memory implementations of numerical optimization algorithm, such as stochastic gradient descent (SGD), require interprocessor communication at every iteration of the algorithm. On modern distributed-memory clusters where communication is more expensive than computation, the scalability and performance of these algorithms are limited by communication cost. This work generalizes prior work on 1D $s$-step SGD and 1D Federated SGD with Averaging (FedAvg) to yield a 2D parallel SGD method (HybridSGD) which attains a continuous performance trade off between the two baseline algorithms. W","authors_text":"Aditya Devarakonda, Ramakrishnan Kannan","cross_cats":["stat.ML"],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DC","submitted_at":"2025-01-13T17:56:39Z","title":"Communication-Efficient, 2D Parallel Stochastic Gradient Descent for Distributed-Memory Optimization"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2501.07526","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:1cd1a82fe43dc6b00f44c2333e63e6d267e0eff8a5eeedf67615f75ce6f3bbc6","target":"record","created_at":"2026-06-26T01:15:43Z","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":"4b72b56b8969c98a0843800cf9eaaf25c7cd2818c40ed576e951478f76c40fb9","cross_cats_sorted":["stat.ML"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DC","submitted_at":"2025-01-13T17:56:39Z","title_canon_sha256":"565686d34581bb344d4e753cc92f6efbdd67244b4c00f5606b4f257a0fe48abf"},"schema_version":"1.0","source":{"id":"2501.07526","kind":"arxiv","version":2}},"canonical_sha256":"9f2e69ee35fbfa9bc5ba36324209a93a36a5ce8ccf2ba806e525a551a250cadd","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"9f2e69ee35fbfa9bc5ba36324209a93a36a5ce8ccf2ba806e525a551a250cadd","first_computed_at":"2026-06-26T01:15:43.212582Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-06-26T01:15:43.212582Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"/D42AXm41W/UmmIxeVkUw5AcDW56y1lUHGAXk5zA4TXJBiBJvKJ+ouZRfwGHN4stARbjqEJWrpKgo8zJa1KeAA==","signature_status":"signed_v1","signed_at":"2026-06-26T01:15:43.213015Z","signed_message":"canonical_sha256_bytes"},"source_id":"2501.07526","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:1cd1a82fe43dc6b00f44c2333e63e6d267e0eff8a5eeedf67615f75ce6f3bbc6","sha256:36e95ab28c8840f5113f502c593802b370a99b0c515d498ca52248c6e372850e"],"state_sha256":"118375113e1091df37fe9474194baaa4cc422cdfccced9fb38daad7524e5a233"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"zPcRtytETjd+KIpMaOwb0yQTWRYJOn9qy0F34qUR7NGQ3L9zjt15czjUfOp14hivMIAUKBYPao2x8apWQyE9DQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-28T00:47:19.990514Z","bundle_sha256":"10ba12401a804ba15b3fba9c3d20122193ba3e1a343e0b5dbad0c56f7e8c751f"}}