{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2010:OIFPWYDKGXYZPGLYBDV2PXAR7I","short_pith_number":"pith:OIFPWYDK","schema_version":"1.0","canonical_sha256":"720afb606a35f197997808eba7dc11fa19cd7fe1d7ef8eceaa8001fd8aec7e72","source":{"kind":"arxiv","id":"1009.1128","version":3},"attestation_state":"computed","paper":{"title":"Distributed Basis Pursuit","license":"http://creativecommons.org/licenses/by-nc-sa/3.0/","headline":"","cross_cats":["cs.IT","cs.SY","math.IT"],"primary_cat":"math.OC","authors_text":"Jo\\~ao F. C. Mota, Jo\\~ao M. F. Xavier, Markus P\\\"uschel, Pedro M. Q. Aguiar","submitted_at":"2010-09-06T19:09:50Z","abstract_excerpt":"We propose a distributed algorithm for solving the optimization problem Basis Pursuit (BP). BP finds the least L1-norm solution of the underdetermined linear system Ax = b and is used, for example, in compressed sensing for reconstruction. Our algorithm solves BP on a distributed platform such as a sensor network, and is designed to minimize the communication between nodes. The algorithm only requires the network to be connected, has no notion of a central processing node, and no node has access to the entire matrix A at any time. We consider two scenarios in which either the columns or the ro"},"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":"1009.1128","kind":"arxiv","version":3},"metadata":{"license":"http://creativecommons.org/licenses/by-nc-sa/3.0/","primary_cat":"math.OC","submitted_at":"2010-09-06T19:09:50Z","cross_cats_sorted":["cs.IT","cs.SY","math.IT"],"title_canon_sha256":"ed126e961531209d1a167c33225f611f57f4e55903faa89084a4ad1b952f7820","abstract_canon_sha256":"08be21ad7053041a9ae6cbc20775cf5e2e5c183bd49f778f49a17e0e0c85decd"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:00:13.797704Z","signature_b64":"rvt8/DvIxoSWt9jXsJBuIxmtsPYYRJPyL4OyzwU/tRv+fPNuh20QL3Kt6SvHsSMgjFkZg92EVtBy/v2QEZz0DA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"720afb606a35f197997808eba7dc11fa19cd7fe1d7ef8eceaa8001fd8aec7e72","last_reissued_at":"2026-05-18T04:00:13.796808Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:00:13.796808Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Distributed Basis Pursuit","license":"http://creativecommons.org/licenses/by-nc-sa/3.0/","headline":"","cross_cats":["cs.IT","cs.SY","math.IT"],"primary_cat":"math.OC","authors_text":"Jo\\~ao F. C. Mota, Jo\\~ao M. F. Xavier, Markus P\\\"uschel, Pedro M. Q. Aguiar","submitted_at":"2010-09-06T19:09:50Z","abstract_excerpt":"We propose a distributed algorithm for solving the optimization problem Basis Pursuit (BP). BP finds the least L1-norm solution of the underdetermined linear system Ax = b and is used, for example, in compressed sensing for reconstruction. Our algorithm solves BP on a distributed platform such as a sensor network, and is designed to minimize the communication between nodes. The algorithm only requires the network to be connected, has no notion of a central processing node, and no node has access to the entire matrix A at any time. We consider two scenarios in which either the columns or the ro"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1009.1128","kind":"arxiv","version":3},"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":"1009.1128","created_at":"2026-05-18T04:00:13.796952+00:00"},{"alias_kind":"arxiv_version","alias_value":"1009.1128v3","created_at":"2026-05-18T04:00:13.796952+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1009.1128","created_at":"2026-05-18T04:00:13.796952+00:00"},{"alias_kind":"pith_short_12","alias_value":"OIFPWYDKGXYZ","created_at":"2026-05-18T12:26:12.377268+00:00"},{"alias_kind":"pith_short_16","alias_value":"OIFPWYDKGXYZPGLY","created_at":"2026-05-18T12:26:12.377268+00:00"},{"alias_kind":"pith_short_8","alias_value":"OIFPWYDK","created_at":"2026-05-18T12:26:12.377268+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/OIFPWYDKGXYZPGLYBDV2PXAR7I","json":"https://pith.science/pith/OIFPWYDKGXYZPGLYBDV2PXAR7I.json","graph_json":"https://pith.science/api/pith-number/OIFPWYDKGXYZPGLYBDV2PXAR7I/graph.json","events_json":"https://pith.science/api/pith-number/OIFPWYDKGXYZPGLYBDV2PXAR7I/events.json","paper":"https://pith.science/paper/OIFPWYDK"},"agent_actions":{"view_html":"https://pith.science/pith/OIFPWYDKGXYZPGLYBDV2PXAR7I","download_json":"https://pith.science/pith/OIFPWYDKGXYZPGLYBDV2PXAR7I.json","view_paper":"https://pith.science/paper/OIFPWYDK","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1009.1128&json=true","fetch_graph":"https://pith.science/api/pith-number/OIFPWYDKGXYZPGLYBDV2PXAR7I/graph.json","fetch_events":"https://pith.science/api/pith-number/OIFPWYDKGXYZPGLYBDV2PXAR7I/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/OIFPWYDKGXYZPGLYBDV2PXAR7I/action/timestamp_anchor","attest_storage":"https://pith.science/pith/OIFPWYDKGXYZPGLYBDV2PXAR7I/action/storage_attestation","attest_author":"https://pith.science/pith/OIFPWYDKGXYZPGLYBDV2PXAR7I/action/author_attestation","sign_citation":"https://pith.science/pith/OIFPWYDKGXYZPGLYBDV2PXAR7I/action/citation_signature","submit_replication":"https://pith.science/pith/OIFPWYDKGXYZPGLYBDV2PXAR7I/action/replication_record"}},"created_at":"2026-05-18T04:00:13.796952+00:00","updated_at":"2026-05-18T04:00:13.796952+00:00"}