{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2012:QI62SBW4XLFDCWITQS7O75BVVX","short_pith_number":"pith:QI62SBW4","canonical_record":{"source":{"id":"1211.5611","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2012-11-23T21:22:56Z","cross_cats_sorted":["cs.SY"],"title_canon_sha256":"1a675e6fd1c4f0e7931a8d334d13e004ec1a5073c1638879b6da653482affaa4","abstract_canon_sha256":"875f0df5d4e01f8a7f7290074ec844ab69a980352adeb48308e1c0b3c3da8359"},"schema_version":"1.0"},"canonical_sha256":"823da906dcbaca31591384beeff435ade1ce46399d113548dc47a229482cde12","source":{"kind":"arxiv","id":"1211.5611","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1211.5611","created_at":"2026-05-18T03:26:42Z"},{"alias_kind":"arxiv_version","alias_value":"1211.5611v3","created_at":"2026-05-18T03:26:42Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1211.5611","created_at":"2026-05-18T03:26:42Z"},{"alias_kind":"pith_short_12","alias_value":"QI62SBW4XLFD","created_at":"2026-05-18T12:27:18Z"},{"alias_kind":"pith_short_16","alias_value":"QI62SBW4XLFDCWIT","created_at":"2026-05-18T12:27:18Z"},{"alias_kind":"pith_short_8","alias_value":"QI62SBW4","created_at":"2026-05-18T12:27:18Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2012:QI62SBW4XLFDCWITQS7O75BVVX","target":"record","payload":{"canonical_record":{"source":{"id":"1211.5611","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2012-11-23T21:22:56Z","cross_cats_sorted":["cs.SY"],"title_canon_sha256":"1a675e6fd1c4f0e7931a8d334d13e004ec1a5073c1638879b6da653482affaa4","abstract_canon_sha256":"875f0df5d4e01f8a7f7290074ec844ab69a980352adeb48308e1c0b3c3da8359"},"schema_version":"1.0"},"canonical_sha256":"823da906dcbaca31591384beeff435ade1ce46399d113548dc47a229482cde12","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:26:42.666772Z","signature_b64":"fPevEgRJn0lp+qZQ/lrL36lwf7ccEJNyLd1L3njRrDyknNDqA6R4pktp6RIZzH8mxSqI4F7clP1OR5BZSjvlBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"823da906dcbaca31591384beeff435ade1ce46399d113548dc47a229482cde12","last_reissued_at":"2026-05-18T03:26:42.666210Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:26:42.666210Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1211.5611","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-18T03:26:42Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"H9758NCUUfiidhtejoVEWIPAQXx45wGZoQv9KKPPdVUiHvB+0Pc6qZkYyZ8W2gBCxC5lTG+E0klR8pu16Q1xBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T11:10:58.878978Z"},"content_sha256":"90cfd7864b3c42e924da5e7840491a618c49898fecb44c3b130c07dfb68d6a24","schema_version":"1.0","event_id":"sha256:90cfd7864b3c42e924da5e7840491a618c49898fecb44c3b130c07dfb68d6a24"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2012:QI62SBW4XLFDCWITQS7O75BVVX","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Distributed Random Projection Algorithm for Convex Optimization","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":"2012-11-23T21:22:56Z","abstract_excerpt":"Random projection algorithm is an iterative gradient method with random projections. Such an algorithm is of interest for constrained optimization when the constraint set is not known in advance or the projection operation on the whole constraint set is computationally prohibitive. This paper presents a distributed random projection (DRP) algorithm for fully distributed constrained convex optimization problems that can be used by multiple agents connected over a time-varying network, where each agent has its own objective function and its own constrained set. With reasonable assumptions, we pr"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1211.5611","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-18T03:26:42Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"z0h8rDlSJzpbqTBeOvm+Q63hSfqDzdNOqfxglwrfGNtsuDu61+uY3yYGEJK4UVeCC17BdR5T97e0qBPsdsXzCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T11:10:58.879358Z"},"content_sha256":"59c65e4ca19ac2599fa62c814f31813e98011d0005ebed5820824dd3ed5c88db","schema_version":"1.0","event_id":"sha256:59c65e4ca19ac2599fa62c814f31813e98011d0005ebed5820824dd3ed5c88db"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/QI62SBW4XLFDCWITQS7O75BVVX/bundle.json","state_url":"https://pith.science/pith/QI62SBW4XLFDCWITQS7O75BVVX/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/QI62SBW4XLFDCWITQS7O75BVVX/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-28T11:10:58Z","links":{"resolver":"https://pith.science/pith/QI62SBW4XLFDCWITQS7O75BVVX","bundle":"https://pith.science/pith/QI62SBW4XLFDCWITQS7O75BVVX/bundle.json","state":"https://pith.science/pith/QI62SBW4XLFDCWITQS7O75BVVX/state.json","well_known_bundle":"https://pith.science/.well-known/pith/QI62SBW4XLFDCWITQS7O75BVVX/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2012:QI62SBW4XLFDCWITQS7O75BVVX","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":"875f0df5d4e01f8a7f7290074ec844ab69a980352adeb48308e1c0b3c3da8359","cross_cats_sorted":["cs.SY"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2012-11-23T21:22:56Z","title_canon_sha256":"1a675e6fd1c4f0e7931a8d334d13e004ec1a5073c1638879b6da653482affaa4"},"schema_version":"1.0","source":{"id":"1211.5611","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1211.5611","created_at":"2026-05-18T03:26:42Z"},{"alias_kind":"arxiv_version","alias_value":"1211.5611v3","created_at":"2026-05-18T03:26:42Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1211.5611","created_at":"2026-05-18T03:26:42Z"},{"alias_kind":"pith_short_12","alias_value":"QI62SBW4XLFD","created_at":"2026-05-18T12:27:18Z"},{"alias_kind":"pith_short_16","alias_value":"QI62SBW4XLFDCWIT","created_at":"2026-05-18T12:27:18Z"},{"alias_kind":"pith_short_8","alias_value":"QI62SBW4","created_at":"2026-05-18T12:27:18Z"}],"graph_snapshots":[{"event_id":"sha256:59c65e4ca19ac2599fa62c814f31813e98011d0005ebed5820824dd3ed5c88db","target":"graph","created_at":"2026-05-18T03:26:42Z","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":"Random projection algorithm is an iterative gradient method with random projections. Such an algorithm is of interest for constrained optimization when the constraint set is not known in advance or the projection operation on the whole constraint set is computationally prohibitive. This paper presents a distributed random projection (DRP) algorithm for fully distributed constrained convex optimization problems that can be used by multiple agents connected over a time-varying network, where each agent has its own objective function and its own constrained set. With reasonable assumptions, we pr","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":"2012-11-23T21:22:56Z","title":"Distributed Random Projection Algorithm for Convex Optimization"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1211.5611","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:90cfd7864b3c42e924da5e7840491a618c49898fecb44c3b130c07dfb68d6a24","target":"record","created_at":"2026-05-18T03:26:42Z","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":"875f0df5d4e01f8a7f7290074ec844ab69a980352adeb48308e1c0b3c3da8359","cross_cats_sorted":["cs.SY"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2012-11-23T21:22:56Z","title_canon_sha256":"1a675e6fd1c4f0e7931a8d334d13e004ec1a5073c1638879b6da653482affaa4"},"schema_version":"1.0","source":{"id":"1211.5611","kind":"arxiv","version":3}},"canonical_sha256":"823da906dcbaca31591384beeff435ade1ce46399d113548dc47a229482cde12","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"823da906dcbaca31591384beeff435ade1ce46399d113548dc47a229482cde12","first_computed_at":"2026-05-18T03:26:42.666210Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:26:42.666210Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"fPevEgRJn0lp+qZQ/lrL36lwf7ccEJNyLd1L3njRrDyknNDqA6R4pktp6RIZzH8mxSqI4F7clP1OR5BZSjvlBg==","signature_status":"signed_v1","signed_at":"2026-05-18T03:26:42.666772Z","signed_message":"canonical_sha256_bytes"},"source_id":"1211.5611","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:90cfd7864b3c42e924da5e7840491a618c49898fecb44c3b130c07dfb68d6a24","sha256:59c65e4ca19ac2599fa62c814f31813e98011d0005ebed5820824dd3ed5c88db"],"state_sha256":"6c748c46c646dcc2f4b5df7a4c01ed3166eea60b3e97180bf7c68d7ce3b54118"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"e4WL5tfQI4SXfp+szGIzOyWtkPAm69qNrGPFC+x4OqTJyv23454XsOYzb2NUv7kGjlyJX5hm+dXBqQQiSSQNBw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-28T11:10:58.881297Z","bundle_sha256":"bda627d439cd2aae3c4748b1f0564ac7effe7324bf1eff251e33f6a5b95148da"}}