{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:TY5XU2QPCGDFVCCOVK4J4HZI7Q","short_pith_number":"pith:TY5XU2QP","canonical_record":{"source":{"id":"1609.05713","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2016-09-19T13:26:05Z","cross_cats_sorted":["cs.DC"],"title_canon_sha256":"2658a0e8c4c4ec3311de2f9ca85a85275be05334550c196030dac46bf21c1764","abstract_canon_sha256":"2d6ee822eedcc51c7bedf89e67503ddbe68cfbaff460037da0c868aac7eb71f0"},"schema_version":"1.0"},"canonical_sha256":"9e3b7a6a0f11865a884eaab89e1f28fc3f8e479c61e959a7fc25a56520c12dca","source":{"kind":"arxiv","id":"1609.05713","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1609.05713","created_at":"2026-05-18T01:04:25Z"},{"alias_kind":"arxiv_version","alias_value":"1609.05713v1","created_at":"2026-05-18T01:04:25Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1609.05713","created_at":"2026-05-18T01:04:25Z"},{"alias_kind":"pith_short_12","alias_value":"TY5XU2QPCGDF","created_at":"2026-05-18T12:30:46Z"},{"alias_kind":"pith_short_16","alias_value":"TY5XU2QPCGDFVCCO","created_at":"2026-05-18T12:30:46Z"},{"alias_kind":"pith_short_8","alias_value":"TY5XU2QP","created_at":"2026-05-18T12:30:46Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:TY5XU2QPCGDFVCCOVK4J4HZI7Q","target":"record","payload":{"canonical_record":{"source":{"id":"1609.05713","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2016-09-19T13:26:05Z","cross_cats_sorted":["cs.DC"],"title_canon_sha256":"2658a0e8c4c4ec3311de2f9ca85a85275be05334550c196030dac46bf21c1764","abstract_canon_sha256":"2d6ee822eedcc51c7bedf89e67503ddbe68cfbaff460037da0c868aac7eb71f0"},"schema_version":"1.0"},"canonical_sha256":"9e3b7a6a0f11865a884eaab89e1f28fc3f8e479c61e959a7fc25a56520c12dca","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:04:25.575776Z","signature_b64":"r8LOPokbQF8SNa3JUuRfUwLaiLm3ahelZkQsH3Y3WefAuqAuG0eOsxzI03X1nMkBT5GlqQSVqWbVAijS8QpXDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"9e3b7a6a0f11865a884eaab89e1f28fc3f8e479c61e959a7fc25a56520c12dca","last_reissued_at":"2026-05-18T01:04:25.575080Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:04:25.575080Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1609.05713","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-18T01:04:25Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"oR5AZHoD9cV1e+13Bn7wo7Ac8RCq0q4n6JEXayzSakpP1GhKVWVWIwLEW2zi76cAlJQ6UVbKlGRy3yHx5gloCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-08T19:01:55.955489Z"},"content_sha256":"66e63eb6e55f644155019faf1b4b49efff1af07769b66940859a34b05f85dd08","schema_version":"1.0","event_id":"sha256:66e63eb6e55f644155019faf1b4b49efff1af07769b66940859a34b05f85dd08"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:TY5XU2QPCGDFVCCOVK4J4HZI7Q","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Randomized dual proximal gradient for large-scale distributed optimization","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DC"],"primary_cat":"math.OC","authors_text":"Giuseppe Notarstefano, Ivano Notarnicola","submitted_at":"2016-09-19T13:26:05Z","abstract_excerpt":"In this paper we consider distributed optimization problems in which the cost function is separable (i.e., a sum of possibly non-smooth functions all sharing a common variable) and can be split into a strongly convex term and a convex one. The second term is typically used to encode constraints or to regularize the solution. We propose an asynchronous, distributed optimization algorithm over an undirected topology, based on a proximal gradient update on the dual problem. We show that by means of a proper choice of primal variables, the dual problem is separable and the dual variables can be st"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1609.05713","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-18T01:04:25Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"HdY6Q0K6xRR4BLztZ36KZyVmTnPq5dxUSx4YQp6YVZ7A+Xj4OPbYjGXNsmw7kAN6KrbzSZ2iTBWiMRWih4JNDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-08T19:01:55.956233Z"},"content_sha256":"6f3a318aa7907bb399882a4533084b0efda49ddcf5f800ac833d34f010e2b091","schema_version":"1.0","event_id":"sha256:6f3a318aa7907bb399882a4533084b0efda49ddcf5f800ac833d34f010e2b091"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/TY5XU2QPCGDFVCCOVK4J4HZI7Q/bundle.json","state_url":"https://pith.science/pith/TY5XU2QPCGDFVCCOVK4J4HZI7Q/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/TY5XU2QPCGDFVCCOVK4J4HZI7Q/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-08T19:01:55Z","links":{"resolver":"https://pith.science/pith/TY5XU2QPCGDFVCCOVK4J4HZI7Q","bundle":"https://pith.science/pith/TY5XU2QPCGDFVCCOVK4J4HZI7Q/bundle.json","state":"https://pith.science/pith/TY5XU2QPCGDFVCCOVK4J4HZI7Q/state.json","well_known_bundle":"https://pith.science/.well-known/pith/TY5XU2QPCGDFVCCOVK4J4HZI7Q/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:TY5XU2QPCGDFVCCOVK4J4HZI7Q","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":"2d6ee822eedcc51c7bedf89e67503ddbe68cfbaff460037da0c868aac7eb71f0","cross_cats_sorted":["cs.DC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2016-09-19T13:26:05Z","title_canon_sha256":"2658a0e8c4c4ec3311de2f9ca85a85275be05334550c196030dac46bf21c1764"},"schema_version":"1.0","source":{"id":"1609.05713","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1609.05713","created_at":"2026-05-18T01:04:25Z"},{"alias_kind":"arxiv_version","alias_value":"1609.05713v1","created_at":"2026-05-18T01:04:25Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1609.05713","created_at":"2026-05-18T01:04:25Z"},{"alias_kind":"pith_short_12","alias_value":"TY5XU2QPCGDF","created_at":"2026-05-18T12:30:46Z"},{"alias_kind":"pith_short_16","alias_value":"TY5XU2QPCGDFVCCO","created_at":"2026-05-18T12:30:46Z"},{"alias_kind":"pith_short_8","alias_value":"TY5XU2QP","created_at":"2026-05-18T12:30:46Z"}],"graph_snapshots":[{"event_id":"sha256:6f3a318aa7907bb399882a4533084b0efda49ddcf5f800ac833d34f010e2b091","target":"graph","created_at":"2026-05-18T01:04:25Z","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":"In this paper we consider distributed optimization problems in which the cost function is separable (i.e., a sum of possibly non-smooth functions all sharing a common variable) and can be split into a strongly convex term and a convex one. The second term is typically used to encode constraints or to regularize the solution. We propose an asynchronous, distributed optimization algorithm over an undirected topology, based on a proximal gradient update on the dual problem. We show that by means of a proper choice of primal variables, the dual problem is separable and the dual variables can be st","authors_text":"Giuseppe Notarstefano, Ivano Notarnicola","cross_cats":["cs.DC"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2016-09-19T13:26:05Z","title":"Randomized dual proximal gradient for large-scale distributed optimization"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1609.05713","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:66e63eb6e55f644155019faf1b4b49efff1af07769b66940859a34b05f85dd08","target":"record","created_at":"2026-05-18T01:04:25Z","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":"2d6ee822eedcc51c7bedf89e67503ddbe68cfbaff460037da0c868aac7eb71f0","cross_cats_sorted":["cs.DC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2016-09-19T13:26:05Z","title_canon_sha256":"2658a0e8c4c4ec3311de2f9ca85a85275be05334550c196030dac46bf21c1764"},"schema_version":"1.0","source":{"id":"1609.05713","kind":"arxiv","version":1}},"canonical_sha256":"9e3b7a6a0f11865a884eaab89e1f28fc3f8e479c61e959a7fc25a56520c12dca","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"9e3b7a6a0f11865a884eaab89e1f28fc3f8e479c61e959a7fc25a56520c12dca","first_computed_at":"2026-05-18T01:04:25.575080Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:04:25.575080Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"r8LOPokbQF8SNa3JUuRfUwLaiLm3ahelZkQsH3Y3WefAuqAuG0eOsxzI03X1nMkBT5GlqQSVqWbVAijS8QpXDg==","signature_status":"signed_v1","signed_at":"2026-05-18T01:04:25.575776Z","signed_message":"canonical_sha256_bytes"},"source_id":"1609.05713","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:66e63eb6e55f644155019faf1b4b49efff1af07769b66940859a34b05f85dd08","sha256:6f3a318aa7907bb399882a4533084b0efda49ddcf5f800ac833d34f010e2b091"],"state_sha256":"a8f64f83a080b7c4c88696dd0000520e6c8373b38b1002d1c5bad2352df1622b"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"WIYT7O+7pqSb09+KLier2xe8y6JeM10ZB2M85Ddg4zfjY03bgwqA/zy4x1aPTvBP9LQu5So7jwmWDJ8b9M2UDg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-08T19:01:55.960019Z","bundle_sha256":"af4977158f227d01ce61858fe9436a02aa7ecbc11c6f724f26b4481f4c85ac73"}}