{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:QWPXXY6SRIRNHUBJDXJBLU6HQT","short_pith_number":"pith:QWPXXY6S","canonical_record":{"source":{"id":"1705.02469","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2017-05-06T09:51:13Z","cross_cats_sorted":[],"title_canon_sha256":"11d0cf9c873ca58d9b8626d8de6461e2705aecfc9f641af07c3c7dbc7503864c","abstract_canon_sha256":"fa0b2cf03ed6fa65fd9f0cc83c75314142ff9f88763ba1ef4f51e679343fe9d0"},"schema_version":"1.0"},"canonical_sha256":"859f7be3d28a22d3d0291dd215d3c784fd68389772dd2a0858d640478705dc45","source":{"kind":"arxiv","id":"1705.02469","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1705.02469","created_at":"2026-05-18T00:44:43Z"},{"alias_kind":"arxiv_version","alias_value":"1705.02469v2","created_at":"2026-05-18T00:44:43Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1705.02469","created_at":"2026-05-18T00:44:43Z"},{"alias_kind":"pith_short_12","alias_value":"QWPXXY6SRIRN","created_at":"2026-05-18T12:31:39Z"},{"alias_kind":"pith_short_16","alias_value":"QWPXXY6SRIRNHUBJ","created_at":"2026-05-18T12:31:39Z"},{"alias_kind":"pith_short_8","alias_value":"QWPXXY6S","created_at":"2026-05-18T12:31:39Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:QWPXXY6SRIRNHUBJDXJBLU6HQT","target":"record","payload":{"canonical_record":{"source":{"id":"1705.02469","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2017-05-06T09:51:13Z","cross_cats_sorted":[],"title_canon_sha256":"11d0cf9c873ca58d9b8626d8de6461e2705aecfc9f641af07c3c7dbc7503864c","abstract_canon_sha256":"fa0b2cf03ed6fa65fd9f0cc83c75314142ff9f88763ba1ef4f51e679343fe9d0"},"schema_version":"1.0"},"canonical_sha256":"859f7be3d28a22d3d0291dd215d3c784fd68389772dd2a0858d640478705dc45","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:44:43.873415Z","signature_b64":"NP1UJKEao3YRM6f+Q+A0J9Nu791lI3HzfXpei/V42bLJ0vzoK5ghkmOpqPo3otNX9JLqDhGdpxdtxbHwmOfyDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"859f7be3d28a22d3d0291dd215d3c784fd68389772dd2a0858d640478705dc45","last_reissued_at":"2026-05-18T00:44:43.872880Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:44:43.872880Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1705.02469","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:44:43Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"3rPGKX/sEzey74EwNoBpjB/xL0ed8Rbcd1ImKRa4n03xe6sflOpKpyGNCTBlq0nKNP2832IkGGERqo6CuDIcCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-09T05:09:22.225581Z"},"content_sha256":"79485c6ee51bed1b1b4cc3f6ad8ffe3f09d293175b97c536dc0843aae2b43522","schema_version":"1.0","event_id":"sha256:79485c6ee51bed1b1b4cc3f6ad8ffe3f09d293175b97c536dc0843aae2b43522"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:QWPXXY6SRIRNHUBJDXJBLU6HQT","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Distributed, scalable and gossip-free consensus optimization with application to data analysis","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Anders Hansson, Christian A. Naesseth, Fredrik Lindsten, Sina Khoshfetrat Pakazad","submitted_at":"2017-05-06T09:51:13Z","abstract_excerpt":"Distributed algorithms for solving additive or consensus optimization problems commonly rely on first-order or proximal splitting methods. These algorithms generally come with restrictive assumptions and at best enjoy a linear convergence rate. Hence, they can require many iterations or communications among agents to converge. In many cases, however, we do not seek a highly accurate solution for consensus problems. Based on this we propose a controlled relaxation of the coupling in the problem which allows us to compute an approximate solution, where the accuracy of the approximation can be co"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1705.02469","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:44:43Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"WEeB58/6QQKTPOIXRfUGyzfFOjNgEZsq8gNxvvXI0VYGL75M9GZoKOp8JKGn1wSzmTGTAKgtRJ1pomixmTSMBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-09T05:09:22.226297Z"},"content_sha256":"79acac718f32d58f217b7d9d890f053f50030b8ba1e8899870c42ec822b2efb3","schema_version":"1.0","event_id":"sha256:79acac718f32d58f217b7d9d890f053f50030b8ba1e8899870c42ec822b2efb3"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/QWPXXY6SRIRNHUBJDXJBLU6HQT/bundle.json","state_url":"https://pith.science/pith/QWPXXY6SRIRNHUBJDXJBLU6HQT/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/QWPXXY6SRIRNHUBJDXJBLU6HQT/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-09T05:09:22Z","links":{"resolver":"https://pith.science/pith/QWPXXY6SRIRNHUBJDXJBLU6HQT","bundle":"https://pith.science/pith/QWPXXY6SRIRNHUBJDXJBLU6HQT/bundle.json","state":"https://pith.science/pith/QWPXXY6SRIRNHUBJDXJBLU6HQT/state.json","well_known_bundle":"https://pith.science/.well-known/pith/QWPXXY6SRIRNHUBJDXJBLU6HQT/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:QWPXXY6SRIRNHUBJDXJBLU6HQT","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":"fa0b2cf03ed6fa65fd9f0cc83c75314142ff9f88763ba1ef4f51e679343fe9d0","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2017-05-06T09:51:13Z","title_canon_sha256":"11d0cf9c873ca58d9b8626d8de6461e2705aecfc9f641af07c3c7dbc7503864c"},"schema_version":"1.0","source":{"id":"1705.02469","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1705.02469","created_at":"2026-05-18T00:44:43Z"},{"alias_kind":"arxiv_version","alias_value":"1705.02469v2","created_at":"2026-05-18T00:44:43Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1705.02469","created_at":"2026-05-18T00:44:43Z"},{"alias_kind":"pith_short_12","alias_value":"QWPXXY6SRIRN","created_at":"2026-05-18T12:31:39Z"},{"alias_kind":"pith_short_16","alias_value":"QWPXXY6SRIRNHUBJ","created_at":"2026-05-18T12:31:39Z"},{"alias_kind":"pith_short_8","alias_value":"QWPXXY6S","created_at":"2026-05-18T12:31:39Z"}],"graph_snapshots":[{"event_id":"sha256:79acac718f32d58f217b7d9d890f053f50030b8ba1e8899870c42ec822b2efb3","target":"graph","created_at":"2026-05-18T00:44:43Z","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":"Distributed algorithms for solving additive or consensus optimization problems commonly rely on first-order or proximal splitting methods. These algorithms generally come with restrictive assumptions and at best enjoy a linear convergence rate. Hence, they can require many iterations or communications among agents to converge. In many cases, however, we do not seek a highly accurate solution for consensus problems. Based on this we propose a controlled relaxation of the coupling in the problem which allows us to compute an approximate solution, where the accuracy of the approximation can be co","authors_text":"Anders Hansson, Christian A. Naesseth, Fredrik Lindsten, Sina Khoshfetrat Pakazad","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2017-05-06T09:51:13Z","title":"Distributed, scalable and gossip-free consensus optimization with application to data analysis"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1705.02469","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:79485c6ee51bed1b1b4cc3f6ad8ffe3f09d293175b97c536dc0843aae2b43522","target":"record","created_at":"2026-05-18T00:44:43Z","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":"fa0b2cf03ed6fa65fd9f0cc83c75314142ff9f88763ba1ef4f51e679343fe9d0","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2017-05-06T09:51:13Z","title_canon_sha256":"11d0cf9c873ca58d9b8626d8de6461e2705aecfc9f641af07c3c7dbc7503864c"},"schema_version":"1.0","source":{"id":"1705.02469","kind":"arxiv","version":2}},"canonical_sha256":"859f7be3d28a22d3d0291dd215d3c784fd68389772dd2a0858d640478705dc45","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"859f7be3d28a22d3d0291dd215d3c784fd68389772dd2a0858d640478705dc45","first_computed_at":"2026-05-18T00:44:43.872880Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:44:43.872880Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"NP1UJKEao3YRM6f+Q+A0J9Nu791lI3HzfXpei/V42bLJ0vzoK5ghkmOpqPo3otNX9JLqDhGdpxdtxbHwmOfyDg==","signature_status":"signed_v1","signed_at":"2026-05-18T00:44:43.873415Z","signed_message":"canonical_sha256_bytes"},"source_id":"1705.02469","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:79485c6ee51bed1b1b4cc3f6ad8ffe3f09d293175b97c536dc0843aae2b43522","sha256:79acac718f32d58f217b7d9d890f053f50030b8ba1e8899870c42ec822b2efb3"],"state_sha256":"d780be76c6273f0b13d8720a05298f1f5d28dd41815fc1c854e779f548e001f7"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"BDku4JwyWwqjJRrBuf6Fmo0Fy5IvxrP3z15DBivbJjTLt1bfdISxgojQ3twSHJk6PIWruD+Wp7oKKqL13KJDBA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-09T05:09:22.230355Z","bundle_sha256":"2c8cb77efe4de82c4ab51faeec2311b291b4d8ea8def11750dce3e46dda09ccf"}}