{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2025:56WUOENRW3QFY6QEPY36PSOGFX","short_pith_number":"pith:56WUOENR","canonical_record":{"source":{"id":"2503.16123","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","primary_cat":"math.OC","submitted_at":"2025-03-20T13:11:44Z","cross_cats_sorted":["cs.LG"],"title_canon_sha256":"fa60d1296c9fd7dbcc3db693a38158c5fdd55be546dc20e3c14790d3f2e35967","abstract_canon_sha256":"79b8ce20d0946438e463e3c809da7b4e2fea2235e69c4d5ef749cd7cb53254b3"},"schema_version":"1.0"},"canonical_sha256":"efad4711b1b6e05c7a047e37e7c9c62ddb29b65a423adbdfc0e5f7ccc4b6480e","source":{"kind":"arxiv","id":"2503.16123","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2503.16123","created_at":"2026-07-05T11:44:02Z"},{"alias_kind":"arxiv_version","alias_value":"2503.16123v2","created_at":"2026-07-05T11:44:02Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2503.16123","created_at":"2026-07-05T11:44:02Z"},{"alias_kind":"pith_short_12","alias_value":"56WUOENRW3QF","created_at":"2026-07-05T11:44:02Z"},{"alias_kind":"pith_short_16","alias_value":"56WUOENRW3QFY6QE","created_at":"2026-07-05T11:44:02Z"},{"alias_kind":"pith_short_8","alias_value":"56WUOENR","created_at":"2026-07-05T11:44:02Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2025:56WUOENRW3QFY6QEPY36PSOGFX","target":"record","payload":{"canonical_record":{"source":{"id":"2503.16123","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","primary_cat":"math.OC","submitted_at":"2025-03-20T13:11:44Z","cross_cats_sorted":["cs.LG"],"title_canon_sha256":"fa60d1296c9fd7dbcc3db693a38158c5fdd55be546dc20e3c14790d3f2e35967","abstract_canon_sha256":"79b8ce20d0946438e463e3c809da7b4e2fea2235e69c4d5ef749cd7cb53254b3"},"schema_version":"1.0"},"canonical_sha256":"efad4711b1b6e05c7a047e37e7c9c62ddb29b65a423adbdfc0e5f7ccc4b6480e","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T11:44:02.935093Z","signature_b64":"MGk9kmHGM/sfCNhCivLvjqtmfzzwdrNGeUrIm8v1aJn/9NiPB6NsKnKb1gkX66qN55ppsQ3zc58fJqA+Maz7AQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"efad4711b1b6e05c7a047e37e7c9c62ddb29b65a423adbdfc0e5f7ccc4b6480e","last_reissued_at":"2026-07-05T11:44:02.934681Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T11:44:02.934681Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2503.16123","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-07-05T11:44:02Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"TAXRQ5EJLxOC2Gn82l0XqoTheolVwZKt+9UwcZKm41mppFXGiKpeX9tOevZVkOdwrPfao7MMBaqO9BAVWXd9Dg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-08T15:52:02.048351Z"},"content_sha256":"213c8c1a67a8ece75047a628b6ac25cf90c0f6ac6d5a8d4d067ec2da73e36eed","schema_version":"1.0","event_id":"sha256:213c8c1a67a8ece75047a628b6ac25cf90c0f6ac6d5a8d4d067ec2da73e36eed"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2025:56WUOENRW3QFY6QEPY36PSOGFX","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Distributed Learning over Arbitrary Topology: Linear Speed-Up with Polynomial Transient Time","license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","headline":"","cross_cats":["cs.LG"],"primary_cat":"math.OC","authors_text":"Runze You, Shi Pu","submitted_at":"2025-03-20T13:11:44Z","abstract_excerpt":"We study a distributed learning problem in which $n$ agents, each with potentially heterogeneous local data, collaboratively minimize the sum of their local cost functions via peer-to-peer communication. We propose a novel algorithm, \\emph{Spanning Tree Push-Pull} (STPP), which employs two spanning trees extracted from a general communication graph to distribute both model parameters and stochastic gradients. Unlike prior approaches that rely heavily on spectral gap properties, STPP leverages a more flexible topological characterization, enabling robust information flow and efficient updates. "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2503.16123","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/2503.16123/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:44:02Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"36e8Tawx6mEfU4ie2i9EM5pdXv7j0tA+LCaSVzTPua2Xy9Je6o1+7aukXXjiL9gGe/jdXv5bfC1yuMgHtyzXDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-08T15:52:02.048928Z"},"content_sha256":"44101e568acb9726c612685566a15024b7c372a33335dbf240fff5db01783001","schema_version":"1.0","event_id":"sha256:44101e568acb9726c612685566a15024b7c372a33335dbf240fff5db01783001"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/56WUOENRW3QFY6QEPY36PSOGFX/bundle.json","state_url":"https://pith.science/pith/56WUOENRW3QFY6QEPY36PSOGFX/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/56WUOENRW3QFY6QEPY36PSOGFX/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-08T15:52:02Z","links":{"resolver":"https://pith.science/pith/56WUOENRW3QFY6QEPY36PSOGFX","bundle":"https://pith.science/pith/56WUOENRW3QFY6QEPY36PSOGFX/bundle.json","state":"https://pith.science/pith/56WUOENRW3QFY6QEPY36PSOGFX/state.json","well_known_bundle":"https://pith.science/.well-known/pith/56WUOENRW3QFY6QEPY36PSOGFX/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2025:56WUOENRW3QFY6QEPY36PSOGFX","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":"79b8ce20d0946438e463e3c809da7b4e2fea2235e69c4d5ef749cd7cb53254b3","cross_cats_sorted":["cs.LG"],"license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","primary_cat":"math.OC","submitted_at":"2025-03-20T13:11:44Z","title_canon_sha256":"fa60d1296c9fd7dbcc3db693a38158c5fdd55be546dc20e3c14790d3f2e35967"},"schema_version":"1.0","source":{"id":"2503.16123","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2503.16123","created_at":"2026-07-05T11:44:02Z"},{"alias_kind":"arxiv_version","alias_value":"2503.16123v2","created_at":"2026-07-05T11:44:02Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2503.16123","created_at":"2026-07-05T11:44:02Z"},{"alias_kind":"pith_short_12","alias_value":"56WUOENRW3QF","created_at":"2026-07-05T11:44:02Z"},{"alias_kind":"pith_short_16","alias_value":"56WUOENRW3QFY6QE","created_at":"2026-07-05T11:44:02Z"},{"alias_kind":"pith_short_8","alias_value":"56WUOENR","created_at":"2026-07-05T11:44:02Z"}],"graph_snapshots":[{"event_id":"sha256:44101e568acb9726c612685566a15024b7c372a33335dbf240fff5db01783001","target":"graph","created_at":"2026-07-05T11:44: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/2503.16123/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"We study a distributed learning problem in which $n$ agents, each with potentially heterogeneous local data, collaboratively minimize the sum of their local cost functions via peer-to-peer communication. We propose a novel algorithm, \\emph{Spanning Tree Push-Pull} (STPP), which employs two spanning trees extracted from a general communication graph to distribute both model parameters and stochastic gradients. Unlike prior approaches that rely heavily on spectral gap properties, STPP leverages a more flexible topological characterization, enabling robust information flow and efficient updates. ","authors_text":"Runze You, Shi Pu","cross_cats":["cs.LG"],"headline":"","license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","primary_cat":"math.OC","submitted_at":"2025-03-20T13:11:44Z","title":"Distributed Learning over Arbitrary Topology: Linear Speed-Up with Polynomial Transient Time"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2503.16123","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:213c8c1a67a8ece75047a628b6ac25cf90c0f6ac6d5a8d4d067ec2da73e36eed","target":"record","created_at":"2026-07-05T11:44: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":"79b8ce20d0946438e463e3c809da7b4e2fea2235e69c4d5ef749cd7cb53254b3","cross_cats_sorted":["cs.LG"],"license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","primary_cat":"math.OC","submitted_at":"2025-03-20T13:11:44Z","title_canon_sha256":"fa60d1296c9fd7dbcc3db693a38158c5fdd55be546dc20e3c14790d3f2e35967"},"schema_version":"1.0","source":{"id":"2503.16123","kind":"arxiv","version":2}},"canonical_sha256":"efad4711b1b6e05c7a047e37e7c9c62ddb29b65a423adbdfc0e5f7ccc4b6480e","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"efad4711b1b6e05c7a047e37e7c9c62ddb29b65a423adbdfc0e5f7ccc4b6480e","first_computed_at":"2026-07-05T11:44:02.934681Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T11:44:02.934681Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"MGk9kmHGM/sfCNhCivLvjqtmfzzwdrNGeUrIm8v1aJn/9NiPB6NsKnKb1gkX66qN55ppsQ3zc58fJqA+Maz7AQ==","signature_status":"signed_v1","signed_at":"2026-07-05T11:44:02.935093Z","signed_message":"canonical_sha256_bytes"},"source_id":"2503.16123","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:213c8c1a67a8ece75047a628b6ac25cf90c0f6ac6d5a8d4d067ec2da73e36eed","sha256:44101e568acb9726c612685566a15024b7c372a33335dbf240fff5db01783001"],"state_sha256":"b0e2e512f50264138c14295dd30cf7891e9b9789566ae4f31a1163877e0ee771"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Pa9WNYKnsue3V7F4TJ8wkqojPzxgy+6PVwRlSTTedTPMiPaJK+C7AYjbD0JmlMSjZAxzV7D4P8pwBjXvkaibAw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-08T15:52:02.052879Z","bundle_sha256":"a8bd386b667f12098b8902a31bc1a3ad6f2ed4421fba10bcc79f36ce7b6858e4"}}