{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2019:IFNN72Q7D7P77EA4NKNXVX7TCU","short_pith_number":"pith:IFNN72Q7","canonical_record":{"source":{"id":"1903.06996","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2019-03-16T22:25:20Z","cross_cats_sorted":["cs.DC","stat.ML"],"title_canon_sha256":"b61e1705b1e9e8694708f761f7dc8c5add6e82fe3c8f50efd080d2b5edb5abc6","abstract_canon_sha256":"a3e95e1cff4f78d8f1a63a6c5e75bd19073c612ab3eb05f92c528eee8671aca3"},"schema_version":"1.0"},"canonical_sha256":"415adfea1f1fdfff901c6a9b7adff3150c33816f4271a6df52ac2c32b21ff1cc","source":{"kind":"arxiv","id":"1903.06996","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1903.06996","created_at":"2026-07-05T00:09:14Z"},{"alias_kind":"arxiv_version","alias_value":"1903.06996v3","created_at":"2026-07-05T00:09:14Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1903.06996","created_at":"2026-07-05T00:09:14Z"},{"alias_kind":"pith_short_12","alias_value":"IFNN72Q7D7P7","created_at":"2026-07-05T00:09:14Z"},{"alias_kind":"pith_short_16","alias_value":"IFNN72Q7D7P77EA4","created_at":"2026-07-05T00:09:14Z"},{"alias_kind":"pith_short_8","alias_value":"IFNN72Q7","created_at":"2026-07-05T00:09:14Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2019:IFNN72Q7D7P77EA4NKNXVX7TCU","target":"record","payload":{"canonical_record":{"source":{"id":"1903.06996","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2019-03-16T22:25:20Z","cross_cats_sorted":["cs.DC","stat.ML"],"title_canon_sha256":"b61e1705b1e9e8694708f761f7dc8c5add6e82fe3c8f50efd080d2b5edb5abc6","abstract_canon_sha256":"a3e95e1cff4f78d8f1a63a6c5e75bd19073c612ab3eb05f92c528eee8671aca3"},"schema_version":"1.0"},"canonical_sha256":"415adfea1f1fdfff901c6a9b7adff3150c33816f4271a6df52ac2c32b21ff1cc","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T00:09:14.132627Z","signature_b64":"32NTI8oVNXp8cErkBgkdh/BDOT7STqe47WJBa/zw1r5KGPsmFdL0oUliWQke77bF/rV2Z/PmuzdHrpav4kkUAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"415adfea1f1fdfff901c6a9b7adff3150c33816f4271a6df52ac2c32b21ff1cc","last_reissued_at":"2026-07-05T00:09:14.132186Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T00:09:14.132186Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1903.06996","source_version":3,"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-05T00:09:14Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"e7/2I4R4CCN5TA5sy+R2hVlk966nhmDOm2Qo2CqDuVBZWPdubHvHCnzZLKWM5S1Hnuee6AAqzJMHxfGxUwaWDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-07T08:10:53.760433Z"},"content_sha256":"64f81e49b639fbe08490d3074c875a347e8f28b6cae9131d397383a0f489d572","schema_version":"1.0","event_id":"sha256:64f81e49b639fbe08490d3074c875a347e8f28b6cae9131d397383a0f489d572"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2019:IFNN72Q7D7P77EA4NKNXVX7TCU","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"SLSGD: Secure and Efficient Distributed On-device Machine Learning","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DC","stat.ML"],"primary_cat":"cs.LG","authors_text":"Cong Xie, Indranil Gupta, Sanmi Koyejo","submitted_at":"2019-03-16T22:25:20Z","abstract_excerpt":"We consider distributed on-device learning with limited communication and security requirements. We propose a new robust distributed optimization algorithm with efficient communication and attack tolerance. The proposed algorithm has provable convergence and robustness under non-IID settings. Empirical results show that the proposed algorithm stabilizes the convergence and tolerates data poisoning on a small number of workers."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1903.06996","kind":"arxiv","version":3},"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/1903.06996/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-05T00:09:14Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"N1lyxiVkNaJ82YOMQajE9lbh/+72/LliGdrYdeL/eZeeWFL4i+P2zzH6C3OZ2iNSUU7neSs00HwDhHmnq+VjAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-07T08:10:53.761029Z"},"content_sha256":"82ba632366ad563591f5f6f040769fbeb62d9744ac26879100eadf89e351d47c","schema_version":"1.0","event_id":"sha256:82ba632366ad563591f5f6f040769fbeb62d9744ac26879100eadf89e351d47c"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/IFNN72Q7D7P77EA4NKNXVX7TCU/bundle.json","state_url":"https://pith.science/pith/IFNN72Q7D7P77EA4NKNXVX7TCU/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/IFNN72Q7D7P77EA4NKNXVX7TCU/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-07T08:10:53Z","links":{"resolver":"https://pith.science/pith/IFNN72Q7D7P77EA4NKNXVX7TCU","bundle":"https://pith.science/pith/IFNN72Q7D7P77EA4NKNXVX7TCU/bundle.json","state":"https://pith.science/pith/IFNN72Q7D7P77EA4NKNXVX7TCU/state.json","well_known_bundle":"https://pith.science/.well-known/pith/IFNN72Q7D7P77EA4NKNXVX7TCU/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2019:IFNN72Q7D7P77EA4NKNXVX7TCU","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":"a3e95e1cff4f78d8f1a63a6c5e75bd19073c612ab3eb05f92c528eee8671aca3","cross_cats_sorted":["cs.DC","stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2019-03-16T22:25:20Z","title_canon_sha256":"b61e1705b1e9e8694708f761f7dc8c5add6e82fe3c8f50efd080d2b5edb5abc6"},"schema_version":"1.0","source":{"id":"1903.06996","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1903.06996","created_at":"2026-07-05T00:09:14Z"},{"alias_kind":"arxiv_version","alias_value":"1903.06996v3","created_at":"2026-07-05T00:09:14Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1903.06996","created_at":"2026-07-05T00:09:14Z"},{"alias_kind":"pith_short_12","alias_value":"IFNN72Q7D7P7","created_at":"2026-07-05T00:09:14Z"},{"alias_kind":"pith_short_16","alias_value":"IFNN72Q7D7P77EA4","created_at":"2026-07-05T00:09:14Z"},{"alias_kind":"pith_short_8","alias_value":"IFNN72Q7","created_at":"2026-07-05T00:09:14Z"}],"graph_snapshots":[{"event_id":"sha256:82ba632366ad563591f5f6f040769fbeb62d9744ac26879100eadf89e351d47c","target":"graph","created_at":"2026-07-05T00:09:14Z","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/1903.06996/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"We consider distributed on-device learning with limited communication and security requirements. We propose a new robust distributed optimization algorithm with efficient communication and attack tolerance. The proposed algorithm has provable convergence and robustness under non-IID settings. Empirical results show that the proposed algorithm stabilizes the convergence and tolerates data poisoning on a small number of workers.","authors_text":"Cong Xie, Indranil Gupta, Sanmi Koyejo","cross_cats":["cs.DC","stat.ML"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2019-03-16T22:25:20Z","title":"SLSGD: Secure and Efficient Distributed On-device Machine Learning"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1903.06996","kind":"arxiv","version":3},"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:64f81e49b639fbe08490d3074c875a347e8f28b6cae9131d397383a0f489d572","target":"record","created_at":"2026-07-05T00:09:14Z","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":"a3e95e1cff4f78d8f1a63a6c5e75bd19073c612ab3eb05f92c528eee8671aca3","cross_cats_sorted":["cs.DC","stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2019-03-16T22:25:20Z","title_canon_sha256":"b61e1705b1e9e8694708f761f7dc8c5add6e82fe3c8f50efd080d2b5edb5abc6"},"schema_version":"1.0","source":{"id":"1903.06996","kind":"arxiv","version":3}},"canonical_sha256":"415adfea1f1fdfff901c6a9b7adff3150c33816f4271a6df52ac2c32b21ff1cc","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"415adfea1f1fdfff901c6a9b7adff3150c33816f4271a6df52ac2c32b21ff1cc","first_computed_at":"2026-07-05T00:09:14.132186Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T00:09:14.132186Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"32NTI8oVNXp8cErkBgkdh/BDOT7STqe47WJBa/zw1r5KGPsmFdL0oUliWQke77bF/rV2Z/PmuzdHrpav4kkUAw==","signature_status":"signed_v1","signed_at":"2026-07-05T00:09:14.132627Z","signed_message":"canonical_sha256_bytes"},"source_id":"1903.06996","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:64f81e49b639fbe08490d3074c875a347e8f28b6cae9131d397383a0f489d572","sha256:82ba632366ad563591f5f6f040769fbeb62d9744ac26879100eadf89e351d47c"],"state_sha256":"3cb98fd859640465063c41316f9c81629f7211ca788f7f6d78dac2306731da78"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"sPiEvbhYBzHYTYgkPwgM1vLi9R6UgmZRz5yrQvRUKjEV8vzjAbbEEYMMlKes/P6u0KPx6mjw6LU7HpZYBXVmCg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-07T08:10:53.769333Z","bundle_sha256":"4dcbc1db56844d620cca4b4caea91e9dcb8061fa74aca22d545e1f26dfb13e60"}}