{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2013:PY7KFN2OLBGXT3SJ67IO7QPTVU","short_pith_number":"pith:PY7KFN2O","canonical_record":{"source":{"id":"1304.1757","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2013-04-05T16:40:03Z","cross_cats_sorted":["cs.SY"],"title_canon_sha256":"c5c729b62219433d75a905a7eb312e8c37543da6f8f90c39c0f46a5c2f73b02a","abstract_canon_sha256":"0c10a9002731fe6a00b0feeb859ca4167841fee3f27245d991a0daf3da3ed19b"},"schema_version":"1.0"},"canonical_sha256":"7e3ea2b74e584d79ee49f7d0efc1f3ad29aaf639a0b3079c894b12b023322ee1","source":{"kind":"arxiv","id":"1304.1757","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1304.1757","created_at":"2026-05-18T03:28:54Z"},{"alias_kind":"arxiv_version","alias_value":"1304.1757v1","created_at":"2026-05-18T03:28:54Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1304.1757","created_at":"2026-05-18T03:28:54Z"},{"alias_kind":"pith_short_12","alias_value":"PY7KFN2OLBGX","created_at":"2026-05-18T12:27:57Z"},{"alias_kind":"pith_short_16","alias_value":"PY7KFN2OLBGXT3SJ","created_at":"2026-05-18T12:27:57Z"},{"alias_kind":"pith_short_8","alias_value":"PY7KFN2O","created_at":"2026-05-18T12:27:57Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2013:PY7KFN2OLBGXT3SJ67IO7QPTVU","target":"record","payload":{"canonical_record":{"source":{"id":"1304.1757","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2013-04-05T16:40:03Z","cross_cats_sorted":["cs.SY"],"title_canon_sha256":"c5c729b62219433d75a905a7eb312e8c37543da6f8f90c39c0f46a5c2f73b02a","abstract_canon_sha256":"0c10a9002731fe6a00b0feeb859ca4167841fee3f27245d991a0daf3da3ed19b"},"schema_version":"1.0"},"canonical_sha256":"7e3ea2b74e584d79ee49f7d0efc1f3ad29aaf639a0b3079c894b12b023322ee1","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:28:54.767910Z","signature_b64":"FPqc/e6Be+f4P5ojWhZ5ZL0pwzKoR/S9wq3ZS+C6YVQ1lrw+0wvpGMJAHyVu2lFeq0VRABMt5IvOT+czAa2UBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"7e3ea2b74e584d79ee49f7d0efc1f3ad29aaf639a0b3079c894b12b023322ee1","last_reissued_at":"2026-05-18T03:28:54.766844Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:28:54.766844Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1304.1757","source_version":1,"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-18T03:28:54Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Q9AFTvgFfkjgsWMh7/wZVEAb2xPf6w2HJDKEH79DEb9kRZriGRFz7FZFAeo4cRoRJOrlH9kKur9J8Ro8ZlM/BA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T03:25:26.878206Z"},"content_sha256":"3d60af9cc7876293ab63aa7f27a85d961e062d38cfd741e015b260b23e984b79","schema_version":"1.0","event_id":"sha256:3d60af9cc7876293ab63aa7f27a85d961e062d38cfd741e015b260b23e984b79"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2013:PY7KFN2OLBGXT3SJ67IO7QPTVU","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Asynchronous Gossip-Based Random Projection Algorithms Over Networks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.SY"],"primary_cat":"math.OC","authors_text":"Angelia Nedich, Soomin Lee","submitted_at":"2013-04-05T16:40:03Z","abstract_excerpt":"We consider a fully distributed constrained convex optimization problem over a multi-agent (no central coordinator) network. We propose an asynchronous gossip-based random projection (GRP) algorithm that solves the distributed problem using only local communications and computations. We analyze the convergence properties of the algorithm for an uncoordinated diminishing stepsize and a constant stepsize. For a diminishing stepsize, we prove that the iterates of all agents converge to the same optimal point with probability 1. For a constant stepsize, we establish an error bound on the expected "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1304.1757","kind":"arxiv","version":1},"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-18T03:28:54Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"TUwrhhKXIkzuxhcI5OA+eBvlL6keqEdlxT7ElA6wMGWCAbW0lkJ/hJHQtx1SMrDf+LTrT4sirn8QRc2bUEMABQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T03:25:26.878570Z"},"content_sha256":"724fbe0945d2b78e3fb6434319b18f191f43312b8db4459fe72f71bf3b1383a0","schema_version":"1.0","event_id":"sha256:724fbe0945d2b78e3fb6434319b18f191f43312b8db4459fe72f71bf3b1383a0"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/PY7KFN2OLBGXT3SJ67IO7QPTVU/bundle.json","state_url":"https://pith.science/pith/PY7KFN2OLBGXT3SJ67IO7QPTVU/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/PY7KFN2OLBGXT3SJ67IO7QPTVU/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-28T03:25:26Z","links":{"resolver":"https://pith.science/pith/PY7KFN2OLBGXT3SJ67IO7QPTVU","bundle":"https://pith.science/pith/PY7KFN2OLBGXT3SJ67IO7QPTVU/bundle.json","state":"https://pith.science/pith/PY7KFN2OLBGXT3SJ67IO7QPTVU/state.json","well_known_bundle":"https://pith.science/.well-known/pith/PY7KFN2OLBGXT3SJ67IO7QPTVU/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2013:PY7KFN2OLBGXT3SJ67IO7QPTVU","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":"0c10a9002731fe6a00b0feeb859ca4167841fee3f27245d991a0daf3da3ed19b","cross_cats_sorted":["cs.SY"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2013-04-05T16:40:03Z","title_canon_sha256":"c5c729b62219433d75a905a7eb312e8c37543da6f8f90c39c0f46a5c2f73b02a"},"schema_version":"1.0","source":{"id":"1304.1757","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1304.1757","created_at":"2026-05-18T03:28:54Z"},{"alias_kind":"arxiv_version","alias_value":"1304.1757v1","created_at":"2026-05-18T03:28:54Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1304.1757","created_at":"2026-05-18T03:28:54Z"},{"alias_kind":"pith_short_12","alias_value":"PY7KFN2OLBGX","created_at":"2026-05-18T12:27:57Z"},{"alias_kind":"pith_short_16","alias_value":"PY7KFN2OLBGXT3SJ","created_at":"2026-05-18T12:27:57Z"},{"alias_kind":"pith_short_8","alias_value":"PY7KFN2O","created_at":"2026-05-18T12:27:57Z"}],"graph_snapshots":[{"event_id":"sha256:724fbe0945d2b78e3fb6434319b18f191f43312b8db4459fe72f71bf3b1383a0","target":"graph","created_at":"2026-05-18T03:28:54Z","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 a fully distributed constrained convex optimization problem over a multi-agent (no central coordinator) network. We propose an asynchronous gossip-based random projection (GRP) algorithm that solves the distributed problem using only local communications and computations. We analyze the convergence properties of the algorithm for an uncoordinated diminishing stepsize and a constant stepsize. For a diminishing stepsize, we prove that the iterates of all agents converge to the same optimal point with probability 1. For a constant stepsize, we establish an error bound on the expected ","authors_text":"Angelia Nedich, Soomin Lee","cross_cats":["cs.SY"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2013-04-05T16:40:03Z","title":"Asynchronous Gossip-Based Random Projection Algorithms Over Networks"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1304.1757","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:3d60af9cc7876293ab63aa7f27a85d961e062d38cfd741e015b260b23e984b79","target":"record","created_at":"2026-05-18T03:28:54Z","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":"0c10a9002731fe6a00b0feeb859ca4167841fee3f27245d991a0daf3da3ed19b","cross_cats_sorted":["cs.SY"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2013-04-05T16:40:03Z","title_canon_sha256":"c5c729b62219433d75a905a7eb312e8c37543da6f8f90c39c0f46a5c2f73b02a"},"schema_version":"1.0","source":{"id":"1304.1757","kind":"arxiv","version":1}},"canonical_sha256":"7e3ea2b74e584d79ee49f7d0efc1f3ad29aaf639a0b3079c894b12b023322ee1","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"7e3ea2b74e584d79ee49f7d0efc1f3ad29aaf639a0b3079c894b12b023322ee1","first_computed_at":"2026-05-18T03:28:54.766844Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:28:54.766844Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"FPqc/e6Be+f4P5ojWhZ5ZL0pwzKoR/S9wq3ZS+C6YVQ1lrw+0wvpGMJAHyVu2lFeq0VRABMt5IvOT+czAa2UBg==","signature_status":"signed_v1","signed_at":"2026-05-18T03:28:54.767910Z","signed_message":"canonical_sha256_bytes"},"source_id":"1304.1757","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:3d60af9cc7876293ab63aa7f27a85d961e062d38cfd741e015b260b23e984b79","sha256:724fbe0945d2b78e3fb6434319b18f191f43312b8db4459fe72f71bf3b1383a0"],"state_sha256":"41c7ecaf688803b9c2dff4b3482fdc0451026b0367919b66dc0233c7a823ba64"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"haiYJcFUMLKfh0KZbO0Guo93RGVlppqa7ZmS3er1ADJcrrhyQu4SekG3p/cNloHNQTacLBnKvUlTQ9YtjY+zCw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-28T03:25:26.880583Z","bundle_sha256":"fb471a48786c9a2969394d21ef5df79f129285ebab6265491cd2a5cede4febb2"}}