{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2019:WUHODREBTL6Y5LOT4PPRX4JURX","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":"c1aafd8334fb3e7c971a99e93f8eab8c9d409ae4abf1c616e253fdc71652f84a","cross_cats_sorted":["cs.LG"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2019-03-16T03:04:21Z","title_canon_sha256":"6fb14e519b26d55b7d7c1c8effe5888d84d51119295a11e875ab9ce59e3574e7"},"schema_version":"1.0","source":{"id":"1903.06871","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1903.06871","created_at":"2026-07-05T01:18:34Z"},{"alias_kind":"arxiv_version","alias_value":"1903.06871v1","created_at":"2026-07-05T01:18:34Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1903.06871","created_at":"2026-07-05T01:18:34Z"},{"alias_kind":"pith_short_12","alias_value":"WUHODREBTL6Y","created_at":"2026-07-05T01:18:34Z"},{"alias_kind":"pith_short_16","alias_value":"WUHODREBTL6Y5LOT","created_at":"2026-07-05T01:18:34Z"},{"alias_kind":"pith_short_8","alias_value":"WUHODREB","created_at":"2026-07-05T01:18:34Z"}],"graph_snapshots":[{"event_id":"sha256:8e6fcfab31be4fcf26716c9179961ae85e341295f958480e2b59d554868e9333","target":"graph","created_at":"2026-07-05T01:18:34Z","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.06871/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"This paper proposes and analyzes a communication-efficient distributed optimization framework for general nonconvex nonsmooth signal processing and machine learning problems under an asynchronous protocol. At each iteration, worker machines compute gradients of a known empirical loss function using their own local data, and a master machine solves a related minimization problem to update the current estimate. We prove that for nonconvex nonsmooth problems, the proposed algorithm converges with a sublinear rate over the number of communication rounds, coinciding with the best theoretical rate t","authors_text":"Jarvis Haupt, Jineng Ren","cross_cats":["cs.LG"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2019-03-16T03:04:21Z","title":"A Provably Communication-Efficient Asynchronous Distributed Inference Method for Convex and Nonconvex Problems"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1903.06871","kind":"arxiv","version":1},"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:6eef3cde4a9e253b959fc6aaefc0f3deee921cfccde4686240d6e4dce084f5f7","target":"record","created_at":"2026-07-05T01:18:34Z","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":"c1aafd8334fb3e7c971a99e93f8eab8c9d409ae4abf1c616e253fdc71652f84a","cross_cats_sorted":["cs.LG"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2019-03-16T03:04:21Z","title_canon_sha256":"6fb14e519b26d55b7d7c1c8effe5888d84d51119295a11e875ab9ce59e3574e7"},"schema_version":"1.0","source":{"id":"1903.06871","kind":"arxiv","version":1}},"canonical_sha256":"b50ee1c4819afd8eadd3e3df1bf1348dd9919a953d1ffadf3e7002e04adfc648","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"b50ee1c4819afd8eadd3e3df1bf1348dd9919a953d1ffadf3e7002e04adfc648","first_computed_at":"2026-07-05T01:18:34.203347Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T01:18:34.203347Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"p8wPsM5zrMFHsOTEpojSL6+v54bQ43kV/j04xuIqDPgvsoqS9XOhy9m0FnGMgfi4g0jfHdiHntqPHdCI0oE3AQ==","signature_status":"signed_v1","signed_at":"2026-07-05T01:18:34.203774Z","signed_message":"canonical_sha256_bytes"},"source_id":"1903.06871","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:6eef3cde4a9e253b959fc6aaefc0f3deee921cfccde4686240d6e4dce084f5f7","sha256:8e6fcfab31be4fcf26716c9179961ae85e341295f958480e2b59d554868e9333"],"state_sha256":"5b54ffeff0894535eb15dc33b1b390c88761ff2929f2c2594058b27a11347845"}