{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:MW5KKFGMZJRORFVAR4O24MQ6ZR","short_pith_number":"pith:MW5KKFGM","schema_version":"1.0","canonical_sha256":"65baa514ccca62e896a08f1dae321ecc61616753695f6f91a54508cb700f50d7","source":{"kind":"arxiv","id":"1701.03458","version":1},"attestation_state":"computed","paper":{"title":"An Asynchronous Parallel Approach to Sparse Recovery","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DC"],"primary_cat":"cs.LG","authors_text":"Deanna Needell, Tina Woolf","submitted_at":"2017-01-12T05:14:40Z","abstract_excerpt":"Asynchronous parallel computing and sparse recovery are two areas that have received recent interest. Asynchronous algorithms are often studied to solve optimization problems where the cost function takes the form $\\sum_{i=1}^M f_i(x)$, with a common assumption that each $f_i$ is sparse; that is, each $f_i$ acts only on a small number of components of $x\\in\\mathbb{R}^n$. Sparse recovery problems, such as compressed sensing, can be formulated as optimization problems, however, the cost functions $f_i$ are dense with respect to the components of $x$, and instead the signal $x$ is assumed to be s"},"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":"1701.03458","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2017-01-12T05:14:40Z","cross_cats_sorted":["cs.DC"],"title_canon_sha256":"236b788ffaafb9e32607c6cd4a27fae9d3b6a9ba0aae26e79c9c0db6add17e65","abstract_canon_sha256":"eed505f85974686f978c3675046d50977fdb613b064a98148cd2f394e530165c"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:52:54.760713Z","signature_b64":"z/SQW8ihiqMheYCaodftKUD0wleG0zjbttDNmlnL12JxOYdMkbfLm68dQN3fa5vkS5rcEXB2p+A4Dy4zhZm/DQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"65baa514ccca62e896a08f1dae321ecc61616753695f6f91a54508cb700f50d7","last_reissued_at":"2026-05-18T00:52:54.760135Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:52:54.760135Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"An Asynchronous Parallel Approach to Sparse Recovery","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DC"],"primary_cat":"cs.LG","authors_text":"Deanna Needell, Tina Woolf","submitted_at":"2017-01-12T05:14:40Z","abstract_excerpt":"Asynchronous parallel computing and sparse recovery are two areas that have received recent interest. Asynchronous algorithms are often studied to solve optimization problems where the cost function takes the form $\\sum_{i=1}^M f_i(x)$, with a common assumption that each $f_i$ is sparse; that is, each $f_i$ acts only on a small number of components of $x\\in\\mathbb{R}^n$. Sparse recovery problems, such as compressed sensing, can be formulated as optimization problems, however, the cost functions $f_i$ are dense with respect to the components of $x$, and instead the signal $x$ is assumed to be s"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1701.03458","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":"1701.03458","created_at":"2026-05-18T00:52:54.760225+00:00"},{"alias_kind":"arxiv_version","alias_value":"1701.03458v1","created_at":"2026-05-18T00:52:54.760225+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1701.03458","created_at":"2026-05-18T00:52:54.760225+00:00"},{"alias_kind":"pith_short_12","alias_value":"MW5KKFGMZJRO","created_at":"2026-05-18T12:31:31.346846+00:00"},{"alias_kind":"pith_short_16","alias_value":"MW5KKFGMZJRORFVA","created_at":"2026-05-18T12:31:31.346846+00:00"},{"alias_kind":"pith_short_8","alias_value":"MW5KKFGM","created_at":"2026-05-18T12:31:31.346846+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/MW5KKFGMZJRORFVAR4O24MQ6ZR","json":"https://pith.science/pith/MW5KKFGMZJRORFVAR4O24MQ6ZR.json","graph_json":"https://pith.science/api/pith-number/MW5KKFGMZJRORFVAR4O24MQ6ZR/graph.json","events_json":"https://pith.science/api/pith-number/MW5KKFGMZJRORFVAR4O24MQ6ZR/events.json","paper":"https://pith.science/paper/MW5KKFGM"},"agent_actions":{"view_html":"https://pith.science/pith/MW5KKFGMZJRORFVAR4O24MQ6ZR","download_json":"https://pith.science/pith/MW5KKFGMZJRORFVAR4O24MQ6ZR.json","view_paper":"https://pith.science/paper/MW5KKFGM","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1701.03458&json=true","fetch_graph":"https://pith.science/api/pith-number/MW5KKFGMZJRORFVAR4O24MQ6ZR/graph.json","fetch_events":"https://pith.science/api/pith-number/MW5KKFGMZJRORFVAR4O24MQ6ZR/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/MW5KKFGMZJRORFVAR4O24MQ6ZR/action/timestamp_anchor","attest_storage":"https://pith.science/pith/MW5KKFGMZJRORFVAR4O24MQ6ZR/action/storage_attestation","attest_author":"https://pith.science/pith/MW5KKFGMZJRORFVAR4O24MQ6ZR/action/author_attestation","sign_citation":"https://pith.science/pith/MW5KKFGMZJRORFVAR4O24MQ6ZR/action/citation_signature","submit_replication":"https://pith.science/pith/MW5KKFGMZJRORFVAR4O24MQ6ZR/action/replication_record"}},"created_at":"2026-05-18T00:52:54.760225+00:00","updated_at":"2026-05-18T00:52:54.760225+00:00"}