{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:7XM67IWG24POORVHAFGSXI6DEV","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":"541c700dba65ea3ecf31bbe63c96e6d34d560ceec6853c6b1b7a4901ee7e729a","cross_cats_sorted":["math.IT","math.OC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2015-04-15T20:52:24Z","title_canon_sha256":"66ffa540ac022b1f75ad48cd74ff5e254f3383d5df5fc4172e530104e9155d6b"},"schema_version":"1.0","source":{"id":"1504.04049","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1504.04049","created_at":"2026-05-18T01:08:13Z"},{"alias_kind":"arxiv_version","alias_value":"1504.04049v3","created_at":"2026-05-18T01:08:13Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1504.04049","created_at":"2026-05-18T01:08:13Z"},{"alias_kind":"pith_short_12","alias_value":"7XM67IWG24PO","created_at":"2026-05-18T12:29:10Z"},{"alias_kind":"pith_short_16","alias_value":"7XM67IWG24POORVH","created_at":"2026-05-18T12:29:10Z"},{"alias_kind":"pith_short_8","alias_value":"7XM67IWG","created_at":"2026-05-18T12:29:10Z"}],"graph_snapshots":[{"event_id":"sha256:548d318867c00ae4846e6cc8f91ea4211c6d80a5e39577d592e9786981b20462","target":"graph","created_at":"2026-05-18T01:08:13Z","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":"We consider distributed optimization where $N$ nodes in a connected network minimize the sum of their local costs subject to a common constraint set. We propose a distributed projected gradient method where each node, at each iteration $k$, performs an update (is active) with probability $p_k$, and stays idle (is inactive) with probability $1-p_k$. Whenever active, each node performs an update by weight-averaging its solution estimate with the estimates of its active neighbors, taking a negative gradient step with respect to its local cost, and performing a projection onto the constraint set; ","authors_text":"Dragana Bajovic, Dusan Jakovetic, Natasa Krejic, Natasa Krklec-Jerinkic","cross_cats":["math.IT","math.OC"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2015-04-15T20:52:24Z","title":"Distributed Gradient Methods with Variable Number of Working Nodes"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1504.04049","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:1e62152c16b6008d4d64d299f6ad591379e68761e03ffd0106a6f1c267744ff0","target":"record","created_at":"2026-05-18T01:08:13Z","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":"541c700dba65ea3ecf31bbe63c96e6d34d560ceec6853c6b1b7a4901ee7e729a","cross_cats_sorted":["math.IT","math.OC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2015-04-15T20:52:24Z","title_canon_sha256":"66ffa540ac022b1f75ad48cd74ff5e254f3383d5df5fc4172e530104e9155d6b"},"schema_version":"1.0","source":{"id":"1504.04049","kind":"arxiv","version":3}},"canonical_sha256":"fdd9efa2c6d71ee746a7014d2ba3c3255fa867decaf2fd2808a704012e7c1ca9","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"fdd9efa2c6d71ee746a7014d2ba3c3255fa867decaf2fd2808a704012e7c1ca9","first_computed_at":"2026-05-18T01:08:13.391000Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:08:13.391000Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"O3F6pB+LaIOTu7DxzOVsmXlp1lSe/w0jFFbZcjzA5xwwPzO88aTZiPIEZjyUaIavBkJ5g4vq2lkbL74M6DngBg==","signature_status":"signed_v1","signed_at":"2026-05-18T01:08:13.391497Z","signed_message":"canonical_sha256_bytes"},"source_id":"1504.04049","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:1e62152c16b6008d4d64d299f6ad591379e68761e03ffd0106a6f1c267744ff0","sha256:548d318867c00ae4846e6cc8f91ea4211c6d80a5e39577d592e9786981b20462"],"state_sha256":"6499f6e2cdbcc0c873fdb793db30ae561f86744c7ed3f35b42ac45beee82d144"}