{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2013:JZYLR5RB7KIOSYUNJTYJNO2II6","short_pith_number":"pith:JZYLR5RB","schema_version":"1.0","canonical_sha256":"4e70b8f621fa90e9628d4cf096bb484795dafd28c0e2d774d410ded0203fee6e","source":{"kind":"arxiv","id":"1301.2130","version":2},"attestation_state":"computed","paper":{"title":"Distributed soft thresholding for sparse signal recovery","license":"http://creativecommons.org/licenses/by/3.0/","headline":"","cross_cats":["cs.DC","math.IT","math.OC"],"primary_cat":"cs.IT","authors_text":"Chiara Ravazzi, Enrico Magli, Sophie M. Fosson","submitted_at":"2013-01-10T14:16:33Z","abstract_excerpt":"In this paper, we address the problem of distributed sparse recovery of signals acquired via compressed measurements in a sensor network. We propose a new class of distributed algorithms to solve Lasso regression problems, when the communication to a fusion center is not possible, e.g., due to communication cost or privacy reasons. More precisely, we introduce a distributed iterative soft thresholding algorithm (DISTA) that consists of three steps: an averaging step, a gradient step, and a soft thresholding operation. We prove the convergence of DISTA in networks represented by regular graphs,"},"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":"1301.2130","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by/3.0/","primary_cat":"cs.IT","submitted_at":"2013-01-10T14:16:33Z","cross_cats_sorted":["cs.DC","math.IT","math.OC"],"title_canon_sha256":"255ffc2350013d9e8bc2b0fd927cf37db55b75874dd3056a23dad375ba4eafaf","abstract_canon_sha256":"42c9a3439113982abd0e685ab2c94e04a4bc833a21ee040491d15524f94214c8"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:10:37.124448Z","signature_b64":"7OTOx+mO693ymgB1Zo30M9g1s6QVQK/LgyD/jJVH03vHVzvLPHbsaNh0vnftkU5wt+20vbD+DVln0UVmrUy4BA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"4e70b8f621fa90e9628d4cf096bb484795dafd28c0e2d774d410ded0203fee6e","last_reissued_at":"2026-05-18T03:10:37.123778Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:10:37.123778Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Distributed soft thresholding for sparse signal recovery","license":"http://creativecommons.org/licenses/by/3.0/","headline":"","cross_cats":["cs.DC","math.IT","math.OC"],"primary_cat":"cs.IT","authors_text":"Chiara Ravazzi, Enrico Magli, Sophie M. Fosson","submitted_at":"2013-01-10T14:16:33Z","abstract_excerpt":"In this paper, we address the problem of distributed sparse recovery of signals acquired via compressed measurements in a sensor network. We propose a new class of distributed algorithms to solve Lasso regression problems, when the communication to a fusion center is not possible, e.g., due to communication cost or privacy reasons. More precisely, we introduce a distributed iterative soft thresholding algorithm (DISTA) that consists of three steps: an averaging step, a gradient step, and a soft thresholding operation. We prove the convergence of DISTA in networks represented by regular graphs,"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1301.2130","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":"1301.2130","created_at":"2026-05-18T03:10:37.123899+00:00"},{"alias_kind":"arxiv_version","alias_value":"1301.2130v2","created_at":"2026-05-18T03:10:37.123899+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1301.2130","created_at":"2026-05-18T03:10:37.123899+00:00"},{"alias_kind":"pith_short_12","alias_value":"JZYLR5RB7KIO","created_at":"2026-05-18T12:27:49.015174+00:00"},{"alias_kind":"pith_short_16","alias_value":"JZYLR5RB7KIOSYUN","created_at":"2026-05-18T12:27:49.015174+00:00"},{"alias_kind":"pith_short_8","alias_value":"JZYLR5RB","created_at":"2026-05-18T12:27:49.015174+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/JZYLR5RB7KIOSYUNJTYJNO2II6","json":"https://pith.science/pith/JZYLR5RB7KIOSYUNJTYJNO2II6.json","graph_json":"https://pith.science/api/pith-number/JZYLR5RB7KIOSYUNJTYJNO2II6/graph.json","events_json":"https://pith.science/api/pith-number/JZYLR5RB7KIOSYUNJTYJNO2II6/events.json","paper":"https://pith.science/paper/JZYLR5RB"},"agent_actions":{"view_html":"https://pith.science/pith/JZYLR5RB7KIOSYUNJTYJNO2II6","download_json":"https://pith.science/pith/JZYLR5RB7KIOSYUNJTYJNO2II6.json","view_paper":"https://pith.science/paper/JZYLR5RB","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1301.2130&json=true","fetch_graph":"https://pith.science/api/pith-number/JZYLR5RB7KIOSYUNJTYJNO2II6/graph.json","fetch_events":"https://pith.science/api/pith-number/JZYLR5RB7KIOSYUNJTYJNO2II6/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/JZYLR5RB7KIOSYUNJTYJNO2II6/action/timestamp_anchor","attest_storage":"https://pith.science/pith/JZYLR5RB7KIOSYUNJTYJNO2II6/action/storage_attestation","attest_author":"https://pith.science/pith/JZYLR5RB7KIOSYUNJTYJNO2II6/action/author_attestation","sign_citation":"https://pith.science/pith/JZYLR5RB7KIOSYUNJTYJNO2II6/action/citation_signature","submit_replication":"https://pith.science/pith/JZYLR5RB7KIOSYUNJTYJNO2II6/action/replication_record"}},"created_at":"2026-05-18T03:10:37.123899+00:00","updated_at":"2026-05-18T03:10:37.123899+00:00"}