{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2012:KVFEY726BJTJFBTP3TYRWYQPUY","short_pith_number":"pith:KVFEY726","canonical_record":{"source":{"id":"1207.6226","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2012-07-26T10:19:21Z","cross_cats_sorted":[],"title_canon_sha256":"2d12fc72eaaac96ee84266ddeb1af041852c3b525091049f8027d8a33bcd0047","abstract_canon_sha256":"2e5ec01100dbc2bba1f9376df77d392be358bf48323ff95ab4f1a11c01fabf37"},"schema_version":"1.0"},"canonical_sha256":"554a4c7f5e0a6692866fdcf11b620fa611ffc9dd6e4f8db77d321f07db5d2942","source":{"kind":"arxiv","id":"1207.6226","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1207.6226","created_at":"2026-05-18T03:50:08Z"},{"alias_kind":"arxiv_version","alias_value":"1207.6226v1","created_at":"2026-05-18T03:50:08Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1207.6226","created_at":"2026-05-18T03:50:08Z"},{"alias_kind":"pith_short_12","alias_value":"KVFEY726BJTJ","created_at":"2026-05-18T12:27:11Z"},{"alias_kind":"pith_short_16","alias_value":"KVFEY726BJTJFBTP","created_at":"2026-05-18T12:27:11Z"},{"alias_kind":"pith_short_8","alias_value":"KVFEY726","created_at":"2026-05-18T12:27:11Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2012:KVFEY726BJTJFBTP3TYRWYQPUY","target":"record","payload":{"canonical_record":{"source":{"id":"1207.6226","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2012-07-26T10:19:21Z","cross_cats_sorted":[],"title_canon_sha256":"2d12fc72eaaac96ee84266ddeb1af041852c3b525091049f8027d8a33bcd0047","abstract_canon_sha256":"2e5ec01100dbc2bba1f9376df77d392be358bf48323ff95ab4f1a11c01fabf37"},"schema_version":"1.0"},"canonical_sha256":"554a4c7f5e0a6692866fdcf11b620fa611ffc9dd6e4f8db77d321f07db5d2942","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:50:08.441811Z","signature_b64":"0MrUSjcHjfUPVjQNJE15Gg8jrk13MwvRbg65SSloBZk+7c8y6YwppRmrV5msAztvtP80fHpwK32Jfm2F8abpDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"554a4c7f5e0a6692866fdcf11b620fa611ffc9dd6e4f8db77d321f07db5d2942","last_reissued_at":"2026-05-18T03:50:08.441000Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:50:08.441000Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1207.6226","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:50:08Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"tCm5pP01uf70mATQCX39IPd/FqpvADi4A+JQu+boVihtkx/WC3XdTWNz6W5zqiVpnheTgf0LSmUuBUgTp+KcAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T01:30:11.197402Z"},"content_sha256":"dc5129b7c4bcc34a02e839db58ac9caf26fed536d1b28b6537396437c9b09aad","schema_version":"1.0","event_id":"sha256:dc5129b7c4bcc34a02e839db58ac9caf26fed536d1b28b6537396437c9b09aad"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2012:KVFEY726BJTJFBTP3TYRWYQPUY","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Distributed Random Convex Programming via Constraints Consensus","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Francesco Bullo, Giuseppe Calafiore, Luca Carlone, Vaibhav Srivastava","submitted_at":"2012-07-26T10:19:21Z","abstract_excerpt":"This paper discusses distributed approaches for the solution of random convex programs (RCP). RCPs are convex optimization problems with a (usually large) number N of randomly extracted constraints; they arise in several applicative areas, especially in the context of decision under uncertainty, see [2],[3]. We here consider a setup in which instances of the random constraints (the scenario) are not held by a single centralized processing unit, but are distributed among different nodes of a network. Each node \"sees\" only a small subset of the constraints, and may communicate with neighbors. Th"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1207.6226","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:50:08Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"UXSkj4oCH3OVr20gKoXyW5/yJzN74hsvLoPbvhI0kibe+JXOTnea1tF96bNMRD9GSof9VLu3X4qdRLqyAURqCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T01:30:11.197846Z"},"content_sha256":"5282919c64ae937ea7081fedaceec8f42048fd2c657659cc145534f851b3c6dc","schema_version":"1.0","event_id":"sha256:5282919c64ae937ea7081fedaceec8f42048fd2c657659cc145534f851b3c6dc"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/KVFEY726BJTJFBTP3TYRWYQPUY/bundle.json","state_url":"https://pith.science/pith/KVFEY726BJTJFBTP3TYRWYQPUY/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/KVFEY726BJTJFBTP3TYRWYQPUY/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-27T01:30:11Z","links":{"resolver":"https://pith.science/pith/KVFEY726BJTJFBTP3TYRWYQPUY","bundle":"https://pith.science/pith/KVFEY726BJTJFBTP3TYRWYQPUY/bundle.json","state":"https://pith.science/pith/KVFEY726BJTJFBTP3TYRWYQPUY/state.json","well_known_bundle":"https://pith.science/.well-known/pith/KVFEY726BJTJFBTP3TYRWYQPUY/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2012:KVFEY726BJTJFBTP3TYRWYQPUY","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":"2e5ec01100dbc2bba1f9376df77d392be358bf48323ff95ab4f1a11c01fabf37","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2012-07-26T10:19:21Z","title_canon_sha256":"2d12fc72eaaac96ee84266ddeb1af041852c3b525091049f8027d8a33bcd0047"},"schema_version":"1.0","source":{"id":"1207.6226","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1207.6226","created_at":"2026-05-18T03:50:08Z"},{"alias_kind":"arxiv_version","alias_value":"1207.6226v1","created_at":"2026-05-18T03:50:08Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1207.6226","created_at":"2026-05-18T03:50:08Z"},{"alias_kind":"pith_short_12","alias_value":"KVFEY726BJTJ","created_at":"2026-05-18T12:27:11Z"},{"alias_kind":"pith_short_16","alias_value":"KVFEY726BJTJFBTP","created_at":"2026-05-18T12:27:11Z"},{"alias_kind":"pith_short_8","alias_value":"KVFEY726","created_at":"2026-05-18T12:27:11Z"}],"graph_snapshots":[{"event_id":"sha256:5282919c64ae937ea7081fedaceec8f42048fd2c657659cc145534f851b3c6dc","target":"graph","created_at":"2026-05-18T03:50: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 discusses distributed approaches for the solution of random convex programs (RCP). RCPs are convex optimization problems with a (usually large) number N of randomly extracted constraints; they arise in several applicative areas, especially in the context of decision under uncertainty, see [2],[3]. We here consider a setup in which instances of the random constraints (the scenario) are not held by a single centralized processing unit, but are distributed among different nodes of a network. Each node \"sees\" only a small subset of the constraints, and may communicate with neighbors. Th","authors_text":"Francesco Bullo, Giuseppe Calafiore, Luca Carlone, Vaibhav Srivastava","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2012-07-26T10:19:21Z","title":"Distributed Random Convex Programming via Constraints Consensus"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1207.6226","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:dc5129b7c4bcc34a02e839db58ac9caf26fed536d1b28b6537396437c9b09aad","target":"record","created_at":"2026-05-18T03:50: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":"2e5ec01100dbc2bba1f9376df77d392be358bf48323ff95ab4f1a11c01fabf37","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2012-07-26T10:19:21Z","title_canon_sha256":"2d12fc72eaaac96ee84266ddeb1af041852c3b525091049f8027d8a33bcd0047"},"schema_version":"1.0","source":{"id":"1207.6226","kind":"arxiv","version":1}},"canonical_sha256":"554a4c7f5e0a6692866fdcf11b620fa611ffc9dd6e4f8db77d321f07db5d2942","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"554a4c7f5e0a6692866fdcf11b620fa611ffc9dd6e4f8db77d321f07db5d2942","first_computed_at":"2026-05-18T03:50:08.441000Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:50:08.441000Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"0MrUSjcHjfUPVjQNJE15Gg8jrk13MwvRbg65SSloBZk+7c8y6YwppRmrV5msAztvtP80fHpwK32Jfm2F8abpDg==","signature_status":"signed_v1","signed_at":"2026-05-18T03:50:08.441811Z","signed_message":"canonical_sha256_bytes"},"source_id":"1207.6226","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:dc5129b7c4bcc34a02e839db58ac9caf26fed536d1b28b6537396437c9b09aad","sha256:5282919c64ae937ea7081fedaceec8f42048fd2c657659cc145534f851b3c6dc"],"state_sha256":"c6cd02c79618ac0f3f97c0ba5236d7b4b16ab6e6a3526f5669340f280e59c1cb"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"mNtnGQpoTz//xtjrWr+RdZ9Y47gYHTH2mbGoKvDGsCHLZ9T1sneW/YnzUY/On8hAHHqdlmWi9SmuBnnLM5m5Ag==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-27T01:30:11.200409Z","bundle_sha256":"384192e1657034533c142c587b76e3c9d56a0b4f77a48f57645086b27b601433"}}