{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:HS22CXWFQSAYXNIXYXZBOUUU4M","short_pith_number":"pith:HS22CXWF","canonical_record":{"source":{"id":"1510.05169","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2015-10-17T21:41:22Z","cross_cats_sorted":[],"title_canon_sha256":"93d6c8724d1d507234c2b2b4f0e1eec385bb82bacd113447271b1c194659cd60","abstract_canon_sha256":"98fd87205edec54463dde51f096a3ea41f28d9d93062f9c078e854f6bba88747"},"schema_version":"1.0"},"canonical_sha256":"3cb5a15ec584818bb517c5f2175294e314af77a3e5b41d67e3d16c47a3dd831f","source":{"kind":"arxiv","id":"1510.05169","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1510.05169","created_at":"2026-05-18T01:14:02Z"},{"alias_kind":"arxiv_version","alias_value":"1510.05169v2","created_at":"2026-05-18T01:14:02Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1510.05169","created_at":"2026-05-18T01:14:02Z"},{"alias_kind":"pith_short_12","alias_value":"HS22CXWFQSAY","created_at":"2026-05-18T12:29:25Z"},{"alias_kind":"pith_short_16","alias_value":"HS22CXWFQSAYXNIX","created_at":"2026-05-18T12:29:25Z"},{"alias_kind":"pith_short_8","alias_value":"HS22CXWF","created_at":"2026-05-18T12:29:25Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:HS22CXWFQSAYXNIXYXZBOUUU4M","target":"record","payload":{"canonical_record":{"source":{"id":"1510.05169","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2015-10-17T21:41:22Z","cross_cats_sorted":[],"title_canon_sha256":"93d6c8724d1d507234c2b2b4f0e1eec385bb82bacd113447271b1c194659cd60","abstract_canon_sha256":"98fd87205edec54463dde51f096a3ea41f28d9d93062f9c078e854f6bba88747"},"schema_version":"1.0"},"canonical_sha256":"3cb5a15ec584818bb517c5f2175294e314af77a3e5b41d67e3d16c47a3dd831f","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:14:02.947214Z","signature_b64":"Lcn2R+UI1+4cF095DuciswuDYIPO7uaeA+0ibeV9PJYYhUwgtPaPb4roLdPhJ9s6NoZ6u7+2dmG5BfMyPk3TCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"3cb5a15ec584818bb517c5f2175294e314af77a3e5b41d67e3d16c47a3dd831f","last_reissued_at":"2026-05-18T01:14:02.946472Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:14:02.946472Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1510.05169","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-18T01:14:02Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"+5leeLtEUD+WxdRe4pnblDT+ydZGY4lE2lWShu9ei+OnIPg7DM1zro+bEWWenaPrDeiSut9c/78nBJvZb54GAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-12T09:33:06.573446Z"},"content_sha256":"6beaa36f7138e8f67c61053b3403ab8dd3102aecb895879c4943e4d4bd51318e","schema_version":"1.0","event_id":"sha256:6beaa36f7138e8f67c61053b3403ab8dd3102aecb895879c4943e4d4bd51318e"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:HS22CXWFQSAYXNIXYXZBOUUU4M","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Distributed saddle-point subgradient algorithms with Laplacian averaging","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"David Mateos-N\\'u\\~nez, Jorge Cort\\'es","submitted_at":"2015-10-17T21:41:22Z","abstract_excerpt":"We present distributed subgradient methods for min-max problems with agreement constraints on a subset of the arguments of both the convex and concave parts. Applications include constrained minimization problems where each constraint is a sum of convex functions in the local variables of the agents. In the latter case, the proposed algorithm reduces to primal-dual updates using local subgradients and Laplacian averaging on local copies of the multipliers associated to the global constraints. For the case of general convex-concave saddle-point problems, our analysis establishes the convergence"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1510.05169","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-18T01:14:02Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Ug6Gbis9RGc8EaaMic2GX+Zq1fBmfZMuKM1RRDA7aAkEw3TDhTo0s91zQjuC+VtDZbtrUtUqHBdlac4HfD9OCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-12T09:33:06.573780Z"},"content_sha256":"1e6fe80bf7fbc76f7414ab99e5a76bc9a61443a017be181279c3289a86fcf5a3","schema_version":"1.0","event_id":"sha256:1e6fe80bf7fbc76f7414ab99e5a76bc9a61443a017be181279c3289a86fcf5a3"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/HS22CXWFQSAYXNIXYXZBOUUU4M/bundle.json","state_url":"https://pith.science/pith/HS22CXWFQSAYXNIXYXZBOUUU4M/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/HS22CXWFQSAYXNIXYXZBOUUU4M/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-06-12T09:33:06Z","links":{"resolver":"https://pith.science/pith/HS22CXWFQSAYXNIXYXZBOUUU4M","bundle":"https://pith.science/pith/HS22CXWFQSAYXNIXYXZBOUUU4M/bundle.json","state":"https://pith.science/pith/HS22CXWFQSAYXNIXYXZBOUUU4M/state.json","well_known_bundle":"https://pith.science/.well-known/pith/HS22CXWFQSAYXNIXYXZBOUUU4M/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:HS22CXWFQSAYXNIXYXZBOUUU4M","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":"98fd87205edec54463dde51f096a3ea41f28d9d93062f9c078e854f6bba88747","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2015-10-17T21:41:22Z","title_canon_sha256":"93d6c8724d1d507234c2b2b4f0e1eec385bb82bacd113447271b1c194659cd60"},"schema_version":"1.0","source":{"id":"1510.05169","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1510.05169","created_at":"2026-05-18T01:14:02Z"},{"alias_kind":"arxiv_version","alias_value":"1510.05169v2","created_at":"2026-05-18T01:14:02Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1510.05169","created_at":"2026-05-18T01:14:02Z"},{"alias_kind":"pith_short_12","alias_value":"HS22CXWFQSAY","created_at":"2026-05-18T12:29:25Z"},{"alias_kind":"pith_short_16","alias_value":"HS22CXWFQSAYXNIX","created_at":"2026-05-18T12:29:25Z"},{"alias_kind":"pith_short_8","alias_value":"HS22CXWF","created_at":"2026-05-18T12:29:25Z"}],"graph_snapshots":[{"event_id":"sha256:1e6fe80bf7fbc76f7414ab99e5a76bc9a61443a017be181279c3289a86fcf5a3","target":"graph","created_at":"2026-05-18T01:14:02Z","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 present distributed subgradient methods for min-max problems with agreement constraints on a subset of the arguments of both the convex and concave parts. Applications include constrained minimization problems where each constraint is a sum of convex functions in the local variables of the agents. In the latter case, the proposed algorithm reduces to primal-dual updates using local subgradients and Laplacian averaging on local copies of the multipliers associated to the global constraints. For the case of general convex-concave saddle-point problems, our analysis establishes the convergence","authors_text":"David Mateos-N\\'u\\~nez, Jorge Cort\\'es","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2015-10-17T21:41:22Z","title":"Distributed saddle-point subgradient algorithms with Laplacian averaging"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1510.05169","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:6beaa36f7138e8f67c61053b3403ab8dd3102aecb895879c4943e4d4bd51318e","target":"record","created_at":"2026-05-18T01:14:02Z","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":"98fd87205edec54463dde51f096a3ea41f28d9d93062f9c078e854f6bba88747","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2015-10-17T21:41:22Z","title_canon_sha256":"93d6c8724d1d507234c2b2b4f0e1eec385bb82bacd113447271b1c194659cd60"},"schema_version":"1.0","source":{"id":"1510.05169","kind":"arxiv","version":2}},"canonical_sha256":"3cb5a15ec584818bb517c5f2175294e314af77a3e5b41d67e3d16c47a3dd831f","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"3cb5a15ec584818bb517c5f2175294e314af77a3e5b41d67e3d16c47a3dd831f","first_computed_at":"2026-05-18T01:14:02.946472Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:14:02.946472Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"Lcn2R+UI1+4cF095DuciswuDYIPO7uaeA+0ibeV9PJYYhUwgtPaPb4roLdPhJ9s6NoZ6u7+2dmG5BfMyPk3TCQ==","signature_status":"signed_v1","signed_at":"2026-05-18T01:14:02.947214Z","signed_message":"canonical_sha256_bytes"},"source_id":"1510.05169","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:6beaa36f7138e8f67c61053b3403ab8dd3102aecb895879c4943e4d4bd51318e","sha256:1e6fe80bf7fbc76f7414ab99e5a76bc9a61443a017be181279c3289a86fcf5a3"],"state_sha256":"142b663df7efa1d5fc56b5411df3e4a1a143c481f91928698da878226ab51981"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"lG+h4VCvcGTU6g3hm4hNKXdhegh9MC5h7Qb7BvGnHjICXwoyBWuPH75SGzK2nmVm6qyJ8FfPLQrQAQ/p27y9Dg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-12T09:33:06.575656Z","bundle_sha256":"9cce8386e487fcb8d34c616a3b96d3b6db0661b246cc6c9a3fc631774bb4dd83"}}