{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:QWPXXY6SRIRNHUBJDXJBLU6HQT","short_pith_number":"pith:QWPXXY6S","schema_version":"1.0","canonical_sha256":"859f7be3d28a22d3d0291dd215d3c784fd68389772dd2a0858d640478705dc45","source":{"kind":"arxiv","id":"1705.02469","version":2},"attestation_state":"computed","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"},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"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"},"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"},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1705.02469","created_at":"2026-05-18T00:44:43.872963+00:00"},{"alias_kind":"arxiv_version","alias_value":"1705.02469v2","created_at":"2026-05-18T00:44:43.872963+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1705.02469","created_at":"2026-05-18T00:44:43.872963+00:00"},{"alias_kind":"pith_short_12","alias_value":"QWPXXY6SRIRN","created_at":"2026-05-18T12:31:39.905425+00:00"},{"alias_kind":"pith_short_16","alias_value":"QWPXXY6SRIRNHUBJ","created_at":"2026-05-18T12:31:39.905425+00:00"},{"alias_kind":"pith_short_8","alias_value":"QWPXXY6S","created_at":"2026-05-18T12:31:39.905425+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/QWPXXY6SRIRNHUBJDXJBLU6HQT","json":"https://pith.science/pith/QWPXXY6SRIRNHUBJDXJBLU6HQT.json","graph_json":"https://pith.science/api/pith-number/QWPXXY6SRIRNHUBJDXJBLU6HQT/graph.json","events_json":"https://pith.science/api/pith-number/QWPXXY6SRIRNHUBJDXJBLU6HQT/events.json","paper":"https://pith.science/paper/QWPXXY6S"},"agent_actions":{"view_html":"https://pith.science/pith/QWPXXY6SRIRNHUBJDXJBLU6HQT","download_json":"https://pith.science/pith/QWPXXY6SRIRNHUBJDXJBLU6HQT.json","view_paper":"https://pith.science/paper/QWPXXY6S","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1705.02469&json=true","fetch_graph":"https://pith.science/api/pith-number/QWPXXY6SRIRNHUBJDXJBLU6HQT/graph.json","fetch_events":"https://pith.science/api/pith-number/QWPXXY6SRIRNHUBJDXJBLU6HQT/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/QWPXXY6SRIRNHUBJDXJBLU6HQT/action/timestamp_anchor","attest_storage":"https://pith.science/pith/QWPXXY6SRIRNHUBJDXJBLU6HQT/action/storage_attestation","attest_author":"https://pith.science/pith/QWPXXY6SRIRNHUBJDXJBLU6HQT/action/author_attestation","sign_citation":"https://pith.science/pith/QWPXXY6SRIRNHUBJDXJBLU6HQT/action/citation_signature","submit_replication":"https://pith.science/pith/QWPXXY6SRIRNHUBJDXJBLU6HQT/action/replication_record"}},"created_at":"2026-05-18T00:44:43.872963+00:00","updated_at":"2026-05-18T00:44:43.872963+00:00"}