{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:RYSTYPK3NW564S3SGNE7D4RA37","short_pith_number":"pith:RYSTYPK3","canonical_record":{"source":{"id":"1607.05507","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2016-07-19T10:24:46Z","cross_cats_sorted":["cs.SY"],"title_canon_sha256":"b1cf46fc3353a33a045dd7728564a599b0d4ece3cee7bfb2bf2ceb1636a41332","abstract_canon_sha256":"01b56edde797401a5e4e1f3a6dffa802f7e2299ed9cf535768e2aec9e23daf63"},"schema_version":"1.0"},"canonical_sha256":"8e253c3d5b6dbbee4b723349f1f220dfe8e7831c71c4f2eb6fcf065ae5c5b52a","source":{"kind":"arxiv","id":"1607.05507","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1607.05507","created_at":"2026-05-18T00:26:08Z"},{"alias_kind":"arxiv_version","alias_value":"1607.05507v2","created_at":"2026-05-18T00:26:08Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1607.05507","created_at":"2026-05-18T00:26:08Z"},{"alias_kind":"pith_short_12","alias_value":"RYSTYPK3NW56","created_at":"2026-05-18T12:30:41Z"},{"alias_kind":"pith_short_16","alias_value":"RYSTYPK3NW564S3S","created_at":"2026-05-18T12:30:41Z"},{"alias_kind":"pith_short_8","alias_value":"RYSTYPK3","created_at":"2026-05-18T12:30:41Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:RYSTYPK3NW564S3SGNE7D4RA37","target":"record","payload":{"canonical_record":{"source":{"id":"1607.05507","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2016-07-19T10:24:46Z","cross_cats_sorted":["cs.SY"],"title_canon_sha256":"b1cf46fc3353a33a045dd7728564a599b0d4ece3cee7bfb2bf2ceb1636a41332","abstract_canon_sha256":"01b56edde797401a5e4e1f3a6dffa802f7e2299ed9cf535768e2aec9e23daf63"},"schema_version":"1.0"},"canonical_sha256":"8e253c3d5b6dbbee4b723349f1f220dfe8e7831c71c4f2eb6fcf065ae5c5b52a","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:26:08.703698Z","signature_b64":"g112b7fIB4VnHc6O4imySdFWVg0XMFMvTMuiDNttANWOBU4eGEFHcoCvAZBHyzJtjw4pu5jow5SgqsQKYKcUAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"8e253c3d5b6dbbee4b723349f1f220dfe8e7831c71c4f2eb6fcf065ae5c5b52a","last_reissued_at":"2026-05-18T00:26:08.703012Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:26:08.703012Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1607.05507","source_version":2,"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-18T00:26:08Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"c/IDum8bro6hP8pDvuyj1PlRp2Bgnx7862LdAtLrk7QkMZ98y9j7RAcPvddBozIBakA/DuZR/2cisUB/oi2rCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T01:43:10.876300Z"},"content_sha256":"ae46ed79a8d9505fcbcbd1d06ae06e2de9adc37091f704aa835e36666e251bf4","schema_version":"1.0","event_id":"sha256:ae46ed79a8d9505fcbcbd1d06ae06e2de9adc37091f704aa835e36666e251bf4"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:RYSTYPK3NW564S3SGNE7D4RA37","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Distributed Algorithms for Robust Convex Optimization via the Scenario Approach","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.SY"],"primary_cat":"cs.DC","authors_text":"Keyou You, Pei Xie, Roberto Tempo","submitted_at":"2016-07-19T10:24:46Z","abstract_excerpt":"This paper proposes distributed algorithms to solve robust convex optimization (RCO) when the constraints are affected by nonlinear uncertainty. We adopt a scenario approach by randomly sampling the uncertainty set. To facilitate the computational task, instead of using a single centralized processor to obtain a \"global solution\" of the scenario problem (SP), we resort to {\\it multiple interconnected processors} that are distributed among different nodes of a network to simultaneously solve the SP. Then, we propose a primal-dual sub-gradient algorithm and a random projection algorithm to distr"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1607.05507","kind":"arxiv","version":2},"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-18T00:26:08Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"X2+cOUDUjYzX/onF6XUiCBptQ2JBY2Qz+rvgRA1Jt5k8IielHfG0fbA3XQPLtPPH2fPS8aBgee5E/iAViLBhDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T01:43:10.877235Z"},"content_sha256":"dea6a621ffabb2a2717344e0ad0af89a271e9ae72e98aede0c5cfd1d659ae868","schema_version":"1.0","event_id":"sha256:dea6a621ffabb2a2717344e0ad0af89a271e9ae72e98aede0c5cfd1d659ae868"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/RYSTYPK3NW564S3SGNE7D4RA37/bundle.json","state_url":"https://pith.science/pith/RYSTYPK3NW564S3SGNE7D4RA37/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/RYSTYPK3NW564S3SGNE7D4RA37/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-26T01:43:10Z","links":{"resolver":"https://pith.science/pith/RYSTYPK3NW564S3SGNE7D4RA37","bundle":"https://pith.science/pith/RYSTYPK3NW564S3SGNE7D4RA37/bundle.json","state":"https://pith.science/pith/RYSTYPK3NW564S3SGNE7D4RA37/state.json","well_known_bundle":"https://pith.science/.well-known/pith/RYSTYPK3NW564S3SGNE7D4RA37/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:RYSTYPK3NW564S3SGNE7D4RA37","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":"01b56edde797401a5e4e1f3a6dffa802f7e2299ed9cf535768e2aec9e23daf63","cross_cats_sorted":["cs.SY"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2016-07-19T10:24:46Z","title_canon_sha256":"b1cf46fc3353a33a045dd7728564a599b0d4ece3cee7bfb2bf2ceb1636a41332"},"schema_version":"1.0","source":{"id":"1607.05507","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1607.05507","created_at":"2026-05-18T00:26:08Z"},{"alias_kind":"arxiv_version","alias_value":"1607.05507v2","created_at":"2026-05-18T00:26:08Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1607.05507","created_at":"2026-05-18T00:26:08Z"},{"alias_kind":"pith_short_12","alias_value":"RYSTYPK3NW56","created_at":"2026-05-18T12:30:41Z"},{"alias_kind":"pith_short_16","alias_value":"RYSTYPK3NW564S3S","created_at":"2026-05-18T12:30:41Z"},{"alias_kind":"pith_short_8","alias_value":"RYSTYPK3","created_at":"2026-05-18T12:30:41Z"}],"graph_snapshots":[{"event_id":"sha256:dea6a621ffabb2a2717344e0ad0af89a271e9ae72e98aede0c5cfd1d659ae868","target":"graph","created_at":"2026-05-18T00:26:08Z","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":"This paper proposes distributed algorithms to solve robust convex optimization (RCO) when the constraints are affected by nonlinear uncertainty. We adopt a scenario approach by randomly sampling the uncertainty set. To facilitate the computational task, instead of using a single centralized processor to obtain a \"global solution\" of the scenario problem (SP), we resort to {\\it multiple interconnected processors} that are distributed among different nodes of a network to simultaneously solve the SP. Then, we propose a primal-dual sub-gradient algorithm and a random projection algorithm to distr","authors_text":"Keyou You, Pei Xie, Roberto Tempo","cross_cats":["cs.SY"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2016-07-19T10:24:46Z","title":"Distributed Algorithms for Robust Convex Optimization via the Scenario Approach"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1607.05507","kind":"arxiv","version":2},"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:ae46ed79a8d9505fcbcbd1d06ae06e2de9adc37091f704aa835e36666e251bf4","target":"record","created_at":"2026-05-18T00:26:08Z","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":"01b56edde797401a5e4e1f3a6dffa802f7e2299ed9cf535768e2aec9e23daf63","cross_cats_sorted":["cs.SY"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2016-07-19T10:24:46Z","title_canon_sha256":"b1cf46fc3353a33a045dd7728564a599b0d4ece3cee7bfb2bf2ceb1636a41332"},"schema_version":"1.0","source":{"id":"1607.05507","kind":"arxiv","version":2}},"canonical_sha256":"8e253c3d5b6dbbee4b723349f1f220dfe8e7831c71c4f2eb6fcf065ae5c5b52a","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"8e253c3d5b6dbbee4b723349f1f220dfe8e7831c71c4f2eb6fcf065ae5c5b52a","first_computed_at":"2026-05-18T00:26:08.703012Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:26:08.703012Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"g112b7fIB4VnHc6O4imySdFWVg0XMFMvTMuiDNttANWOBU4eGEFHcoCvAZBHyzJtjw4pu5jow5SgqsQKYKcUAw==","signature_status":"signed_v1","signed_at":"2026-05-18T00:26:08.703698Z","signed_message":"canonical_sha256_bytes"},"source_id":"1607.05507","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:ae46ed79a8d9505fcbcbd1d06ae06e2de9adc37091f704aa835e36666e251bf4","sha256:dea6a621ffabb2a2717344e0ad0af89a271e9ae72e98aede0c5cfd1d659ae868"],"state_sha256":"0b6c965754ad64ac69f89f9184e27e8b3dd35ca3378f343f850e46acdaaed9b5"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"OmhO8iQ/BWnxq92ciRWBldeeC1aIuw8EWwffEC/vzo1INjTfVqx+PWZg1QGQE43C1ATqKUU3QwLa4F6EOp/LDg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-26T01:43:10.881042Z","bundle_sha256":"ea24fe069d829f36e6d6a5af5572376eb56ffbf278dd8db1a6cb9518e3010a2a"}}