{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2019:DLHUZJF7TFVCRCRK7DRQ4WMA5E","short_pith_number":"pith:DLHUZJF7","canonical_record":{"source":{"id":"1906.01736","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2019-06-04T21:48:50Z","cross_cats_sorted":["cs.DC","math.OC","stat.ML"],"title_canon_sha256":"963a404aae2ef6ca26f87f92bdad755f77213ae33ef48f419e288dbbe7c12691","abstract_canon_sha256":"781940c280fa86f1881b2a3e3bf4b2a61e09dc5a4244a758d44377559f532630"},"schema_version":"1.0"},"canonical_sha256":"1acf4ca4bf996a288a2af8e30e5980e9352a5b78201e5d654ba897c6cb1b4df0","source":{"kind":"arxiv","id":"1906.01736","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1906.01736","created_at":"2026-05-17T23:44:01Z"},{"alias_kind":"arxiv_version","alias_value":"1906.01736v2","created_at":"2026-05-17T23:44:01Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1906.01736","created_at":"2026-05-17T23:44:01Z"},{"alias_kind":"pith_short_12","alias_value":"DLHUZJF7TFVC","created_at":"2026-05-18T12:33:15Z"},{"alias_kind":"pith_short_16","alias_value":"DLHUZJF7TFVCRCRK","created_at":"2026-05-18T12:33:15Z"},{"alias_kind":"pith_short_8","alias_value":"DLHUZJF7","created_at":"2026-05-18T12:33:15Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2019:DLHUZJF7TFVCRCRK7DRQ4WMA5E","target":"record","payload":{"canonical_record":{"source":{"id":"1906.01736","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2019-06-04T21:48:50Z","cross_cats_sorted":["cs.DC","math.OC","stat.ML"],"title_canon_sha256":"963a404aae2ef6ca26f87f92bdad755f77213ae33ef48f419e288dbbe7c12691","abstract_canon_sha256":"781940c280fa86f1881b2a3e3bf4b2a61e09dc5a4244a758d44377559f532630"},"schema_version":"1.0"},"canonical_sha256":"1acf4ca4bf996a288a2af8e30e5980e9352a5b78201e5d654ba897c6cb1b4df0","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:44:01.994016Z","signature_b64":"MzF5vt/G1DFq/3l0YVNFHmvTNTXC9sgQc0Nc468umWB9Qx04CleU7Yxvd8bNvPZRBut4VapMl5dEXaJxGyAXAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"1acf4ca4bf996a288a2af8e30e5980e9352a5b78201e5d654ba897c6cb1b4df0","last_reissued_at":"2026-05-17T23:44:01.993494Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:44:01.993494Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1906.01736","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-05-17T23:44:01Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"46j6YB3Pk76H7jnOA7a7JA9D09KOpXc6cyYMkJZ19ADCbMle75R7YUAPU8CtCFQNGAX4Cs28Bgcpo6TZVqdBCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T02:35:44.476819Z"},"content_sha256":"63154f919e375f61cec5e01b9c5342f0448f17e61ee719ad41b090df08b9f116","schema_version":"1.0","event_id":"sha256:63154f919e375f61cec5e01b9c5342f0448f17e61ee719ad41b090df08b9f116"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2019:DLHUZJF7TFVCRCRK7DRQ4WMA5E","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Distributed Training with Heterogeneous Data: Bridging Median- and Mean-Based Algorithms","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DC","math.OC","stat.ML"],"primary_cat":"cs.LG","authors_text":"Haoran Sun, Mingyi Hong, Tiancong Chen, Xiangyi Chen, Zhiwei Steven Wu","submitted_at":"2019-06-04T21:48:50Z","abstract_excerpt":"Recently, there is a growing interest in the study of median-based algorithms for distributed non-convex optimization. Two prominent such algorithms include signSGD with majority vote, an effective approach for communication reduction via 1-bit compression on the local gradients, and medianSGD, an algorithm recently proposed to ensure robustness against Byzantine workers. The convergence analyses for these algorithms critically rely on the assumption that all the distributed data are drawn iid from the same distribution. However, in applications such as Federated Learning, the data across diff"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1906.01736","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":""},"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-05-17T23:44:01Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"BJEGaBdWt7uuOLG68HJ44VBd0g97uekB8xSm32JXHNdMW0eXJDDXU/558PHaSKzh8aOY2cEhagaCt4q41l1jBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T02:35:44.477586Z"},"content_sha256":"552a326eaa69d2645b1deba4b2d42e0cc14b8fe0041dd75b1d39b83495272c68","schema_version":"1.0","event_id":"sha256:552a326eaa69d2645b1deba4b2d42e0cc14b8fe0041dd75b1d39b83495272c68"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/DLHUZJF7TFVCRCRK7DRQ4WMA5E/bundle.json","state_url":"https://pith.science/pith/DLHUZJF7TFVCRCRK7DRQ4WMA5E/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/DLHUZJF7TFVCRCRK7DRQ4WMA5E/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-05-26T02:35:44Z","links":{"resolver":"https://pith.science/pith/DLHUZJF7TFVCRCRK7DRQ4WMA5E","bundle":"https://pith.science/pith/DLHUZJF7TFVCRCRK7DRQ4WMA5E/bundle.json","state":"https://pith.science/pith/DLHUZJF7TFVCRCRK7DRQ4WMA5E/state.json","well_known_bundle":"https://pith.science/.well-known/pith/DLHUZJF7TFVCRCRK7DRQ4WMA5E/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2019:DLHUZJF7TFVCRCRK7DRQ4WMA5E","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":"781940c280fa86f1881b2a3e3bf4b2a61e09dc5a4244a758d44377559f532630","cross_cats_sorted":["cs.DC","math.OC","stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2019-06-04T21:48:50Z","title_canon_sha256":"963a404aae2ef6ca26f87f92bdad755f77213ae33ef48f419e288dbbe7c12691"},"schema_version":"1.0","source":{"id":"1906.01736","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1906.01736","created_at":"2026-05-17T23:44:01Z"},{"alias_kind":"arxiv_version","alias_value":"1906.01736v2","created_at":"2026-05-17T23:44:01Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1906.01736","created_at":"2026-05-17T23:44:01Z"},{"alias_kind":"pith_short_12","alias_value":"DLHUZJF7TFVC","created_at":"2026-05-18T12:33:15Z"},{"alias_kind":"pith_short_16","alias_value":"DLHUZJF7TFVCRCRK","created_at":"2026-05-18T12:33:15Z"},{"alias_kind":"pith_short_8","alias_value":"DLHUZJF7","created_at":"2026-05-18T12:33:15Z"}],"graph_snapshots":[{"event_id":"sha256:552a326eaa69d2645b1deba4b2d42e0cc14b8fe0041dd75b1d39b83495272c68","target":"graph","created_at":"2026-05-17T23:44:01Z","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"},"paper":{"abstract_excerpt":"Recently, there is a growing interest in the study of median-based algorithms for distributed non-convex optimization. Two prominent such algorithms include signSGD with majority vote, an effective approach for communication reduction via 1-bit compression on the local gradients, and medianSGD, an algorithm recently proposed to ensure robustness against Byzantine workers. The convergence analyses for these algorithms critically rely on the assumption that all the distributed data are drawn iid from the same distribution. However, in applications such as Federated Learning, the data across diff","authors_text":"Haoran Sun, Mingyi Hong, Tiancong Chen, Xiangyi Chen, Zhiwei Steven Wu","cross_cats":["cs.DC","math.OC","stat.ML"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2019-06-04T21:48:50Z","title":"Distributed Training with Heterogeneous Data: Bridging Median- and Mean-Based Algorithms"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1906.01736","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:63154f919e375f61cec5e01b9c5342f0448f17e61ee719ad41b090df08b9f116","target":"record","created_at":"2026-05-17T23:44:01Z","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":"781940c280fa86f1881b2a3e3bf4b2a61e09dc5a4244a758d44377559f532630","cross_cats_sorted":["cs.DC","math.OC","stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2019-06-04T21:48:50Z","title_canon_sha256":"963a404aae2ef6ca26f87f92bdad755f77213ae33ef48f419e288dbbe7c12691"},"schema_version":"1.0","source":{"id":"1906.01736","kind":"arxiv","version":2}},"canonical_sha256":"1acf4ca4bf996a288a2af8e30e5980e9352a5b78201e5d654ba897c6cb1b4df0","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"1acf4ca4bf996a288a2af8e30e5980e9352a5b78201e5d654ba897c6cb1b4df0","first_computed_at":"2026-05-17T23:44:01.993494Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:44:01.993494Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"MzF5vt/G1DFq/3l0YVNFHmvTNTXC9sgQc0Nc468umWB9Qx04CleU7Yxvd8bNvPZRBut4VapMl5dEXaJxGyAXAg==","signature_status":"signed_v1","signed_at":"2026-05-17T23:44:01.994016Z","signed_message":"canonical_sha256_bytes"},"source_id":"1906.01736","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:63154f919e375f61cec5e01b9c5342f0448f17e61ee719ad41b090df08b9f116","sha256:552a326eaa69d2645b1deba4b2d42e0cc14b8fe0041dd75b1d39b83495272c68"],"state_sha256":"bbe42ebc88bd68cf6a8474a8a62fe24e4c2a4a21e8781c9ecf08284773e7defe"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Y9PmeQ16/zmMpjhLH612Ps2pYdPnfv8gE1zaXX2/ld33UgPsgeQhuWSv3S+nxWzwVn7RHlMLmCbalq4na3TeBw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-26T02:35:44.481061Z","bundle_sha256":"5f3dd1bcbce7ffbcb9b6c986efc17dd53209fc5d40d42c2c1bf3a28f8527be40"}}