{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:KKKGVSE2GMN2NRJ57WX7A2KTGU","short_pith_number":"pith:KKKGVSE2","canonical_record":{"source":{"id":"1610.02967","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2016-10-07T12:59:46Z","cross_cats_sorted":["cs.LG","cs.NA","stat.ML"],"title_canon_sha256":"b5a1df4a75a6ab83c8501a19f5308c68543f11d0d83e8873135759b69e2cb949","abstract_canon_sha256":"ba83bc9e6a359e79a0988f8c6d0b1fbad0ea486233832e0358b1a85820bddb57"},"schema_version":"1.0"},"canonical_sha256":"52946ac89a331ba6c53dfdaff06953350f639bf59e282066a608ffdd742c0bc4","source":{"kind":"arxiv","id":"1610.02967","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1610.02967","created_at":"2026-05-18T00:19:09Z"},{"alias_kind":"arxiv_version","alias_value":"1610.02967v2","created_at":"2026-05-18T00:19:09Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1610.02967","created_at":"2026-05-18T00:19:09Z"},{"alias_kind":"pith_short_12","alias_value":"KKKGVSE2GMN2","created_at":"2026-05-18T12:30:25Z"},{"alias_kind":"pith_short_16","alias_value":"KKKGVSE2GMN2NRJ5","created_at":"2026-05-18T12:30:25Z"},{"alias_kind":"pith_short_8","alias_value":"KKKGVSE2","created_at":"2026-05-18T12:30:25Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:KKKGVSE2GMN2NRJ57WX7A2KTGU","target":"record","payload":{"canonical_record":{"source":{"id":"1610.02967","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2016-10-07T12:59:46Z","cross_cats_sorted":["cs.LG","cs.NA","stat.ML"],"title_canon_sha256":"b5a1df4a75a6ab83c8501a19f5308c68543f11d0d83e8873135759b69e2cb949","abstract_canon_sha256":"ba83bc9e6a359e79a0988f8c6d0b1fbad0ea486233832e0358b1a85820bddb57"},"schema_version":"1.0"},"canonical_sha256":"52946ac89a331ba6c53dfdaff06953350f639bf59e282066a608ffdd742c0bc4","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:19:09.131392Z","signature_b64":"qKUlhvo4yxh5i8yUpIneflcyfMSnnnU9AETlxrXGgZ5f9JO6YfJ9XvlzkC4hBmMIPkcUipRD+h0cpFzqb05gDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"52946ac89a331ba6c53dfdaff06953350f639bf59e282066a608ffdd742c0bc4","last_reissued_at":"2026-05-18T00:19:09.130874Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:19:09.130874Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1610.02967","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:19:09Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"/z4qFGepFIJZDCd6iaHLZK3ezX53uzJc6mzw7GB50E3Q9o6frWso3XjvXR6DhxfMZvhgmP3/XnRBlIP3y65BBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-19T18:25:49.097418Z"},"content_sha256":"e3f6cfd00e870d90786f31e0386744ad516e99d66093c8cf93c0e23c8ffbd793","schema_version":"1.0","event_id":"sha256:e3f6cfd00e870d90786f31e0386744ad516e99d66093c8cf93c0e23c8ffbd793"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:KKKGVSE2GMN2NRJ57WX7A2KTGU","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Distributed Convex Optimization with Many Convex Constraints","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG","cs.NA","stat.ML"],"primary_cat":"math.OC","authors_text":"Joachim Giesen, S\\\"oren Laue","submitted_at":"2016-10-07T12:59:46Z","abstract_excerpt":"We address the problem of solving convex optimization problems with many convex constraints in a distributed setting. Our approach is based on an extension of the alternating direction method of multipliers (ADMM) that recently gained a lot of attention in the Big Data context. Although it has been invented decades ago, ADMM so far can be applied only to unconstrained problems and problems with linear equality or inequality constraints. Our extension can handle arbitrary inequality constraints directly. It combines the ability of ADMM to solve convex optimization problems in a distributed sett"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1610.02967","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:19:09Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"rD8DrvgfErubD5PnhmEbBUl17MyYbtR/UU/KwMZT4J24VUm6/CqTQfK5qrA0MSSGqbXHyGVECeDzEatzmQ1pDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-19T18:25:49.098332Z"},"content_sha256":"224e9cd944a7735d8ef81a36b19bb6dee021ae40112ad921677a20ccc0524b13","schema_version":"1.0","event_id":"sha256:224e9cd944a7735d8ef81a36b19bb6dee021ae40112ad921677a20ccc0524b13"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/KKKGVSE2GMN2NRJ57WX7A2KTGU/bundle.json","state_url":"https://pith.science/pith/KKKGVSE2GMN2NRJ57WX7A2KTGU/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/KKKGVSE2GMN2NRJ57WX7A2KTGU/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-08-19T18:25:49Z","links":{"resolver":"https://pith.science/pith/KKKGVSE2GMN2NRJ57WX7A2KTGU","bundle":"https://pith.science/pith/KKKGVSE2GMN2NRJ57WX7A2KTGU/bundle.json","state":"https://pith.science/pith/KKKGVSE2GMN2NRJ57WX7A2KTGU/state.json","well_known_bundle":"https://pith.science/.well-known/pith/KKKGVSE2GMN2NRJ57WX7A2KTGU/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:KKKGVSE2GMN2NRJ57WX7A2KTGU","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":"ba83bc9e6a359e79a0988f8c6d0b1fbad0ea486233832e0358b1a85820bddb57","cross_cats_sorted":["cs.LG","cs.NA","stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2016-10-07T12:59:46Z","title_canon_sha256":"b5a1df4a75a6ab83c8501a19f5308c68543f11d0d83e8873135759b69e2cb949"},"schema_version":"1.0","source":{"id":"1610.02967","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1610.02967","created_at":"2026-05-18T00:19:09Z"},{"alias_kind":"arxiv_version","alias_value":"1610.02967v2","created_at":"2026-05-18T00:19:09Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1610.02967","created_at":"2026-05-18T00:19:09Z"},{"alias_kind":"pith_short_12","alias_value":"KKKGVSE2GMN2","created_at":"2026-05-18T12:30:25Z"},{"alias_kind":"pith_short_16","alias_value":"KKKGVSE2GMN2NRJ5","created_at":"2026-05-18T12:30:25Z"},{"alias_kind":"pith_short_8","alias_value":"KKKGVSE2","created_at":"2026-05-18T12:30:25Z"}],"graph_snapshots":[{"event_id":"sha256:224e9cd944a7735d8ef81a36b19bb6dee021ae40112ad921677a20ccc0524b13","target":"graph","created_at":"2026-05-18T00:19:09Z","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 address the problem of solving convex optimization problems with many convex constraints in a distributed setting. Our approach is based on an extension of the alternating direction method of multipliers (ADMM) that recently gained a lot of attention in the Big Data context. Although it has been invented decades ago, ADMM so far can be applied only to unconstrained problems and problems with linear equality or inequality constraints. Our extension can handle arbitrary inequality constraints directly. It combines the ability of ADMM to solve convex optimization problems in a distributed sett","authors_text":"Joachim Giesen, S\\\"oren Laue","cross_cats":["cs.LG","cs.NA","stat.ML"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2016-10-07T12:59:46Z","title":"Distributed Convex Optimization with Many Convex Constraints"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1610.02967","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:e3f6cfd00e870d90786f31e0386744ad516e99d66093c8cf93c0e23c8ffbd793","target":"record","created_at":"2026-05-18T00:19:09Z","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":"ba83bc9e6a359e79a0988f8c6d0b1fbad0ea486233832e0358b1a85820bddb57","cross_cats_sorted":["cs.LG","cs.NA","stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2016-10-07T12:59:46Z","title_canon_sha256":"b5a1df4a75a6ab83c8501a19f5308c68543f11d0d83e8873135759b69e2cb949"},"schema_version":"1.0","source":{"id":"1610.02967","kind":"arxiv","version":2}},"canonical_sha256":"52946ac89a331ba6c53dfdaff06953350f639bf59e282066a608ffdd742c0bc4","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"52946ac89a331ba6c53dfdaff06953350f639bf59e282066a608ffdd742c0bc4","first_computed_at":"2026-05-18T00:19:09.130874Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:19:09.130874Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"qKUlhvo4yxh5i8yUpIneflcyfMSnnnU9AETlxrXGgZ5f9JO6YfJ9XvlzkC4hBmMIPkcUipRD+h0cpFzqb05gDg==","signature_status":"signed_v1","signed_at":"2026-05-18T00:19:09.131392Z","signed_message":"canonical_sha256_bytes"},"source_id":"1610.02967","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:e3f6cfd00e870d90786f31e0386744ad516e99d66093c8cf93c0e23c8ffbd793","sha256:224e9cd944a7735d8ef81a36b19bb6dee021ae40112ad921677a20ccc0524b13"],"state_sha256":"7769c06559ef9c88f363ff85f886d6e878980915975a792a539f08cc963af8e5"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"vKDxs6i4TzhRzbuLLHKbBKsfBKIUbe3y7s3b8caeKfkAP1H0dAii5JkMXFoTPxtiexBTZTEw5IR/pak1vBCqAg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-19T18:25:49.104082Z","bundle_sha256":"2caac6f6c4c3d51e0e5edafdc6fd9da76744cec2e2218492d454a8156004089b"}}