{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:7XM67IWG24POORVHAFGSXI6DEV","short_pith_number":"pith:7XM67IWG","canonical_record":{"source":{"id":"1504.04049","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2015-04-15T20:52:24Z","cross_cats_sorted":["math.IT","math.OC"],"title_canon_sha256":"66ffa540ac022b1f75ad48cd74ff5e254f3383d5df5fc4172e530104e9155d6b","abstract_canon_sha256":"541c700dba65ea3ecf31bbe63c96e6d34d560ceec6853c6b1b7a4901ee7e729a"},"schema_version":"1.0"},"canonical_sha256":"fdd9efa2c6d71ee746a7014d2ba3c3255fa867decaf2fd2808a704012e7c1ca9","source":{"kind":"arxiv","id":"1504.04049","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"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:7XM67IWG24POORVHAFGSXI6DEV","target":"record","payload":{"canonical_record":{"source":{"id":"1504.04049","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2015-04-15T20:52:24Z","cross_cats_sorted":["math.IT","math.OC"],"title_canon_sha256":"66ffa540ac022b1f75ad48cd74ff5e254f3383d5df5fc4172e530104e9155d6b","abstract_canon_sha256":"541c700dba65ea3ecf31bbe63c96e6d34d560ceec6853c6b1b7a4901ee7e729a"},"schema_version":"1.0"},"canonical_sha256":"fdd9efa2c6d71ee746a7014d2ba3c3255fa867decaf2fd2808a704012e7c1ca9","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:08:13.391497Z","signature_b64":"O3F6pB+LaIOTu7DxzOVsmXlp1lSe/w0jFFbZcjzA5xwwPzO88aTZiPIEZjyUaIavBkJ5g4vq2lkbL74M6DngBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"fdd9efa2c6d71ee746a7014d2ba3c3255fa867decaf2fd2808a704012e7c1ca9","last_reissued_at":"2026-05-18T01:08:13.391000Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:08:13.391000Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1504.04049","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-05-18T01:08:13Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"SvDoShuSleHqi0QAbaMkQpnA/srfj0bWdVvBHp8ETqRIL5LisT0XGcjcMdZMvUGIlOzBbZx8tHcNGTVg8B5UDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-20T01:09:57.782685Z"},"content_sha256":"1e62152c16b6008d4d64d299f6ad591379e68761e03ffd0106a6f1c267744ff0","schema_version":"1.0","event_id":"sha256:1e62152c16b6008d4d64d299f6ad591379e68761e03ffd0106a6f1c267744ff0"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:7XM67IWG24POORVHAFGSXI6DEV","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Distributed Gradient Methods with Variable Number of Working Nodes","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT","math.OC"],"primary_cat":"cs.IT","authors_text":"Dragana Bajovic, Dusan Jakovetic, Natasa Krejic, Natasa Krklec-Jerinkic","submitted_at":"2015-04-15T20:52:24Z","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; "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1504.04049","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":""},"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-18T01:08:13Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"8cigTJfqUeg7NwZXjxK+rNK5FJlnIi+6SW0WdPBoAxbyTSE1LUfbDirFPQzX1njA+9GRdEhrWi473pLLUI6YCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-20T01:09:57.783244Z"},"content_sha256":"548d318867c00ae4846e6cc8f91ea4211c6d80a5e39577d592e9786981b20462","schema_version":"1.0","event_id":"sha256:548d318867c00ae4846e6cc8f91ea4211c6d80a5e39577d592e9786981b20462"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/7XM67IWG24POORVHAFGSXI6DEV/bundle.json","state_url":"https://pith.science/pith/7XM67IWG24POORVHAFGSXI6DEV/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/7XM67IWG24POORVHAFGSXI6DEV/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-20T01:09:57Z","links":{"resolver":"https://pith.science/pith/7XM67IWG24POORVHAFGSXI6DEV","bundle":"https://pith.science/pith/7XM67IWG24POORVHAFGSXI6DEV/bundle.json","state":"https://pith.science/pith/7XM67IWG24POORVHAFGSXI6DEV/state.json","well_known_bundle":"https://pith.science/.well-known/pith/7XM67IWG24POORVHAFGSXI6DEV/bundle.json"},"state":{"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"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"KFuPQ76Su116hwiCTeEiDi4gavU6K+v9AXhOlcUjoUd224iHczilrN8kKm9IF15KPDq28wD12EzpKHcbCIvXAw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-20T01:09:57.786610Z","bundle_sha256":"d50098ef1c785fb6728dcbac8df5afa8c8af44590625b06383ab3bb2dba329a8"}}