{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:RYSTYPK3NW564S3SGNE7D4RA37","short_pith_number":"pith:RYSTYPK3","schema_version":"1.0","canonical_sha256":"8e253c3d5b6dbbee4b723349f1f220dfe8e7831c71c4f2eb6fcf065ae5c5b52a","source":{"kind":"arxiv","id":"1607.05507","version":2},"attestation_state":"computed","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"},"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":"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"},"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"},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1607.05507","created_at":"2026-05-18T00:26:08.703133+00:00"},{"alias_kind":"arxiv_version","alias_value":"1607.05507v2","created_at":"2026-05-18T00:26:08.703133+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1607.05507","created_at":"2026-05-18T00:26:08.703133+00:00"},{"alias_kind":"pith_short_12","alias_value":"RYSTYPK3NW56","created_at":"2026-05-18T12:30:41.710351+00:00"},{"alias_kind":"pith_short_16","alias_value":"RYSTYPK3NW564S3S","created_at":"2026-05-18T12:30:41.710351+00:00"},{"alias_kind":"pith_short_8","alias_value":"RYSTYPK3","created_at":"2026-05-18T12:30:41.710351+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/RYSTYPK3NW564S3SGNE7D4RA37","json":"https://pith.science/pith/RYSTYPK3NW564S3SGNE7D4RA37.json","graph_json":"https://pith.science/api/pith-number/RYSTYPK3NW564S3SGNE7D4RA37/graph.json","events_json":"https://pith.science/api/pith-number/RYSTYPK3NW564S3SGNE7D4RA37/events.json","paper":"https://pith.science/paper/RYSTYPK3"},"agent_actions":{"view_html":"https://pith.science/pith/RYSTYPK3NW564S3SGNE7D4RA37","download_json":"https://pith.science/pith/RYSTYPK3NW564S3SGNE7D4RA37.json","view_paper":"https://pith.science/paper/RYSTYPK3","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1607.05507&json=true","fetch_graph":"https://pith.science/api/pith-number/RYSTYPK3NW564S3SGNE7D4RA37/graph.json","fetch_events":"https://pith.science/api/pith-number/RYSTYPK3NW564S3SGNE7D4RA37/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/RYSTYPK3NW564S3SGNE7D4RA37/action/timestamp_anchor","attest_storage":"https://pith.science/pith/RYSTYPK3NW564S3SGNE7D4RA37/action/storage_attestation","attest_author":"https://pith.science/pith/RYSTYPK3NW564S3SGNE7D4RA37/action/author_attestation","sign_citation":"https://pith.science/pith/RYSTYPK3NW564S3SGNE7D4RA37/action/citation_signature","submit_replication":"https://pith.science/pith/RYSTYPK3NW564S3SGNE7D4RA37/action/replication_record"}},"created_at":"2026-05-18T00:26:08.703133+00:00","updated_at":"2026-05-18T00:26:08.703133+00:00"}