{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2013:NBLPB7LW2YAKE5M2RUBI7PFORU","short_pith_number":"pith:NBLPB7LW","schema_version":"1.0","canonical_sha256":"6856f0fd76d600a2759a8d028fbcae8d12f9f9648185d2c7e090d066476f366a","source":{"kind":"arxiv","id":"1306.6807","version":1},"attestation_state":"computed","paper":{"title":"Distributed Solutions for Loosely Coupled Feasibility Problems Using Proximal Splitting Methods","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Anders Hansson, Martin S. Andersen, Sina Khoshfetrat Pakazad","submitted_at":"2013-06-28T12:13:58Z","abstract_excerpt":"In this paper, we consider convex feasibility problems where the underlying sets are loosely coupled, and we propose several algorithms to solve such problems in a distributed manner. These algorithms are obtained by applying proximal splitting methods to convex minimization reformulations of convex feasibility problems. We also put forth distributed convergence tests which enable us to establish feasibility or infeasibility of the problem distributedly, and we provide convergence rate results. Under the assumption that the problem is feasible and boundedly linearly regular, these convergence "},"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":"1306.6807","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2013-06-28T12:13:58Z","cross_cats_sorted":[],"title_canon_sha256":"738484f45157a79e8f94435deda69c99a9de1b1f363f491bbefd2787b5375ec5","abstract_canon_sha256":"462cce7718ddcd70e954a516705e9997937bb47587cb12560fceab645b388b4f"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:19:42.911878Z","signature_b64":"y0TWrPn9zscAENfFhuww19noUfvFpesiVia6V0+9ICjwt81TN3CFsjAI1UR1URwxhJN4AUEe8O+c3erF4eb+BA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"6856f0fd76d600a2759a8d028fbcae8d12f9f9648185d2c7e090d066476f366a","last_reissued_at":"2026-05-18T03:19:42.911361Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:19:42.911361Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Distributed Solutions for Loosely Coupled Feasibility Problems Using Proximal Splitting Methods","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Anders Hansson, Martin S. Andersen, Sina Khoshfetrat Pakazad","submitted_at":"2013-06-28T12:13:58Z","abstract_excerpt":"In this paper, we consider convex feasibility problems where the underlying sets are loosely coupled, and we propose several algorithms to solve such problems in a distributed manner. These algorithms are obtained by applying proximal splitting methods to convex minimization reformulations of convex feasibility problems. We also put forth distributed convergence tests which enable us to establish feasibility or infeasibility of the problem distributedly, and we provide convergence rate results. Under the assumption that the problem is feasible and boundedly linearly regular, these convergence "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1306.6807","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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1306.6807","created_at":"2026-05-18T03:19:42.911430+00:00"},{"alias_kind":"arxiv_version","alias_value":"1306.6807v1","created_at":"2026-05-18T03:19:42.911430+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1306.6807","created_at":"2026-05-18T03:19:42.911430+00:00"},{"alias_kind":"pith_short_12","alias_value":"NBLPB7LW2YAK","created_at":"2026-05-18T12:27:52.871228+00:00"},{"alias_kind":"pith_short_16","alias_value":"NBLPB7LW2YAKE5M2","created_at":"2026-05-18T12:27:52.871228+00:00"},{"alias_kind":"pith_short_8","alias_value":"NBLPB7LW","created_at":"2026-05-18T12:27:52.871228+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/NBLPB7LW2YAKE5M2RUBI7PFORU","json":"https://pith.science/pith/NBLPB7LW2YAKE5M2RUBI7PFORU.json","graph_json":"https://pith.science/api/pith-number/NBLPB7LW2YAKE5M2RUBI7PFORU/graph.json","events_json":"https://pith.science/api/pith-number/NBLPB7LW2YAKE5M2RUBI7PFORU/events.json","paper":"https://pith.science/paper/NBLPB7LW"},"agent_actions":{"view_html":"https://pith.science/pith/NBLPB7LW2YAKE5M2RUBI7PFORU","download_json":"https://pith.science/pith/NBLPB7LW2YAKE5M2RUBI7PFORU.json","view_paper":"https://pith.science/paper/NBLPB7LW","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1306.6807&json=true","fetch_graph":"https://pith.science/api/pith-number/NBLPB7LW2YAKE5M2RUBI7PFORU/graph.json","fetch_events":"https://pith.science/api/pith-number/NBLPB7LW2YAKE5M2RUBI7PFORU/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/NBLPB7LW2YAKE5M2RUBI7PFORU/action/timestamp_anchor","attest_storage":"https://pith.science/pith/NBLPB7LW2YAKE5M2RUBI7PFORU/action/storage_attestation","attest_author":"https://pith.science/pith/NBLPB7LW2YAKE5M2RUBI7PFORU/action/author_attestation","sign_citation":"https://pith.science/pith/NBLPB7LW2YAKE5M2RUBI7PFORU/action/citation_signature","submit_replication":"https://pith.science/pith/NBLPB7LW2YAKE5M2RUBI7PFORU/action/replication_record"}},"created_at":"2026-05-18T03:19:42.911430+00:00","updated_at":"2026-05-18T03:19:42.911430+00:00"}