{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:IVHODLAWNWN7FFES7DGTM45KLB","short_pith_number":"pith:IVHODLAW","schema_version":"1.0","canonical_sha256":"454ee1ac166d9bf29492f8cd3673aa586b4a0903f2432a40caa1c9a2ce5413af","source":{"kind":"arxiv","id":"1611.02431","version":1},"attestation_state":"computed","paper":{"title":"Distributed recovery of jointly sparse signals under communication constraints","license":"http://creativecommons.org/publicdomain/zero/1.0/","headline":"","cross_cats":["cs.MA"],"primary_cat":"math.OC","authors_text":"Carles Anton-Haro, Enrico Magli, Javier Matamoros, Sophie M. Fosson","submitted_at":"2016-11-08T08:47:18Z","abstract_excerpt":"The problem of the distributed recovery of jointly sparse signals has attracted much attention recently. Let us assume that the nodes of a network observe different sparse signals with common support; starting from linear, compressed measurements, and exploiting network communication, each node aims at reconstructing the support and the non-zero values of its observed signal. In the literature, distributed greedy algorithms have been proposed to tackle this problem, among which the most reliable ones require a large amount of transmitted data, which barely adapts to realistic network communica"},"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":"1611.02431","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/publicdomain/zero/1.0/","primary_cat":"math.OC","submitted_at":"2016-11-08T08:47:18Z","cross_cats_sorted":["cs.MA"],"title_canon_sha256":"8c7e81cb22548369acaa1f005e8bfa281a65095e06bf31bccd214c55b1ec81f3","abstract_canon_sha256":"c60ce620e3381c842db07b5b3556a36b54514034dc2db34203b9807f40f1b0f1"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:59:18.340083Z","signature_b64":"WX+5ZOY/juyGrNoXNg0MC8BFDUZDwexRH0k93NbL+eNggyzY4pvanW+obReL5yKdPz1ZCrJygy6U5Z+YEaRSAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"454ee1ac166d9bf29492f8cd3673aa586b4a0903f2432a40caa1c9a2ce5413af","last_reissued_at":"2026-05-18T00:59:18.339333Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:59:18.339333Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Distributed recovery of jointly sparse signals under communication constraints","license":"http://creativecommons.org/publicdomain/zero/1.0/","headline":"","cross_cats":["cs.MA"],"primary_cat":"math.OC","authors_text":"Carles Anton-Haro, Enrico Magli, Javier Matamoros, Sophie M. Fosson","submitted_at":"2016-11-08T08:47:18Z","abstract_excerpt":"The problem of the distributed recovery of jointly sparse signals has attracted much attention recently. Let us assume that the nodes of a network observe different sparse signals with common support; starting from linear, compressed measurements, and exploiting network communication, each node aims at reconstructing the support and the non-zero values of its observed signal. In the literature, distributed greedy algorithms have been proposed to tackle this problem, among which the most reliable ones require a large amount of transmitted data, which barely adapts to realistic network communica"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1611.02431","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":"1611.02431","created_at":"2026-05-18T00:59:18.339464+00:00"},{"alias_kind":"arxiv_version","alias_value":"1611.02431v1","created_at":"2026-05-18T00:59:18.339464+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1611.02431","created_at":"2026-05-18T00:59:18.339464+00:00"},{"alias_kind":"pith_short_12","alias_value":"IVHODLAWNWN7","created_at":"2026-05-18T12:30:22.444734+00:00"},{"alias_kind":"pith_short_16","alias_value":"IVHODLAWNWN7FFES","created_at":"2026-05-18T12:30:22.444734+00:00"},{"alias_kind":"pith_short_8","alias_value":"IVHODLAW","created_at":"2026-05-18T12:30:22.444734+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/IVHODLAWNWN7FFES7DGTM45KLB","json":"https://pith.science/pith/IVHODLAWNWN7FFES7DGTM45KLB.json","graph_json":"https://pith.science/api/pith-number/IVHODLAWNWN7FFES7DGTM45KLB/graph.json","events_json":"https://pith.science/api/pith-number/IVHODLAWNWN7FFES7DGTM45KLB/events.json","paper":"https://pith.science/paper/IVHODLAW"},"agent_actions":{"view_html":"https://pith.science/pith/IVHODLAWNWN7FFES7DGTM45KLB","download_json":"https://pith.science/pith/IVHODLAWNWN7FFES7DGTM45KLB.json","view_paper":"https://pith.science/paper/IVHODLAW","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1611.02431&json=true","fetch_graph":"https://pith.science/api/pith-number/IVHODLAWNWN7FFES7DGTM45KLB/graph.json","fetch_events":"https://pith.science/api/pith-number/IVHODLAWNWN7FFES7DGTM45KLB/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/IVHODLAWNWN7FFES7DGTM45KLB/action/timestamp_anchor","attest_storage":"https://pith.science/pith/IVHODLAWNWN7FFES7DGTM45KLB/action/storage_attestation","attest_author":"https://pith.science/pith/IVHODLAWNWN7FFES7DGTM45KLB/action/author_attestation","sign_citation":"https://pith.science/pith/IVHODLAWNWN7FFES7DGTM45KLB/action/citation_signature","submit_replication":"https://pith.science/pith/IVHODLAWNWN7FFES7DGTM45KLB/action/replication_record"}},"created_at":"2026-05-18T00:59:18.339464+00:00","updated_at":"2026-05-18T00:59:18.339464+00:00"}