{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:7XM67IWG24POORVHAFGSXI6DEV","short_pith_number":"pith:7XM67IWG","schema_version":"1.0","canonical_sha256":"fdd9efa2c6d71ee746a7014d2ba3c3255fa867decaf2fd2808a704012e7c1ca9","source":{"kind":"arxiv","id":"1504.04049","version":3},"attestation_state":"computed","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; "},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"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"},"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"},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1504.04049","created_at":"2026-05-18T01:08:13.391073+00:00"},{"alias_kind":"arxiv_version","alias_value":"1504.04049v3","created_at":"2026-05-18T01:08:13.391073+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1504.04049","created_at":"2026-05-18T01:08:13.391073+00:00"},{"alias_kind":"pith_short_12","alias_value":"7XM67IWG24PO","created_at":"2026-05-18T12:29:10.953037+00:00"},{"alias_kind":"pith_short_16","alias_value":"7XM67IWG24POORVH","created_at":"2026-05-18T12:29:10.953037+00:00"},{"alias_kind":"pith_short_8","alias_value":"7XM67IWG","created_at":"2026-05-18T12:29:10.953037+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/7XM67IWG24POORVHAFGSXI6DEV","json":"https://pith.science/pith/7XM67IWG24POORVHAFGSXI6DEV.json","graph_json":"https://pith.science/api/pith-number/7XM67IWG24POORVHAFGSXI6DEV/graph.json","events_json":"https://pith.science/api/pith-number/7XM67IWG24POORVHAFGSXI6DEV/events.json","paper":"https://pith.science/paper/7XM67IWG"},"agent_actions":{"view_html":"https://pith.science/pith/7XM67IWG24POORVHAFGSXI6DEV","download_json":"https://pith.science/pith/7XM67IWG24POORVHAFGSXI6DEV.json","view_paper":"https://pith.science/paper/7XM67IWG","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1504.04049&json=true","fetch_graph":"https://pith.science/api/pith-number/7XM67IWG24POORVHAFGSXI6DEV/graph.json","fetch_events":"https://pith.science/api/pith-number/7XM67IWG24POORVHAFGSXI6DEV/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/7XM67IWG24POORVHAFGSXI6DEV/action/timestamp_anchor","attest_storage":"https://pith.science/pith/7XM67IWG24POORVHAFGSXI6DEV/action/storage_attestation","attest_author":"https://pith.science/pith/7XM67IWG24POORVHAFGSXI6DEV/action/author_attestation","sign_citation":"https://pith.science/pith/7XM67IWG24POORVHAFGSXI6DEV/action/citation_signature","submit_replication":"https://pith.science/pith/7XM67IWG24POORVHAFGSXI6DEV/action/replication_record"}},"created_at":"2026-05-18T01:08:13.391073+00:00","updated_at":"2026-05-18T01:08:13.391073+00:00"}