{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:MW5KKFGMZJRORFVAR4O24MQ6ZR","short_pith_number":"pith:MW5KKFGM","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"},"canonical_sha256":"65baa514ccca62e896a08f1dae321ecc61616753695f6f91a54508cb700f50d7","source":{"kind":"arxiv","id":"1701.03458","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1701.03458","created_at":"2026-05-18T00:52:54Z"},{"alias_kind":"arxiv_version","alias_value":"1701.03458v1","created_at":"2026-05-18T00:52:54Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1701.03458","created_at":"2026-05-18T00:52:54Z"},{"alias_kind":"pith_short_12","alias_value":"MW5KKFGMZJRO","created_at":"2026-05-18T12:31:31Z"},{"alias_kind":"pith_short_16","alias_value":"MW5KKFGMZJRORFVA","created_at":"2026-05-18T12:31:31Z"},{"alias_kind":"pith_short_8","alias_value":"MW5KKFGM","created_at":"2026-05-18T12:31:31Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:MW5KKFGMZJRORFVAR4O24MQ6ZR","target":"record","payload":{"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"},"canonical_sha256":"65baa514ccca62e896a08f1dae321ecc61616753695f6f91a54508cb700f50d7","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"},"source_kind":"arxiv","source_id":"1701.03458","source_version":1,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T00:52:54Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"KJ3bkE/ScGxXxddnQxzCwRnQTb8gl99DUcsq0vpccuIKuFaNzCBIMdmuVXASVoYUgNSvTv4kqQrEnJTGfPYSBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-02T16:31:16.731601Z"},"content_sha256":"ffc9b484bdb6e7d20faac9e877616589efbc4a169f2529c7eef668cbb7dc4202","schema_version":"1.0","event_id":"sha256:ffc9b484bdb6e7d20faac9e877616589efbc4a169f2529c7eef668cbb7dc4202"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:MW5KKFGMZJRORFVAR4O24MQ6ZR","target":"graph","payload":{"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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T00:52:54Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"+j51H27siX7K95UeskeUN1h7Jg5qPdf0exQb9qhn8SlEIwoE8LE3aYrVHM+UWoRmIkFwjQ7or44Aysv2LmrKDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-02T16:31:16.731953Z"},"content_sha256":"bc003c13c25b68c256af7ed905f5f43dbe344b5157d0657634910afb536272a5","schema_version":"1.0","event_id":"sha256:bc003c13c25b68c256af7ed905f5f43dbe344b5157d0657634910afb536272a5"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/MW5KKFGMZJRORFVAR4O24MQ6ZR/bundle.json","state_url":"https://pith.science/pith/MW5KKFGMZJRORFVAR4O24MQ6ZR/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/MW5KKFGMZJRORFVAR4O24MQ6ZR/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-06-02T16:31:16Z","links":{"resolver":"https://pith.science/pith/MW5KKFGMZJRORFVAR4O24MQ6ZR","bundle":"https://pith.science/pith/MW5KKFGMZJRORFVAR4O24MQ6ZR/bundle.json","state":"https://pith.science/pith/MW5KKFGMZJRORFVAR4O24MQ6ZR/state.json","well_known_bundle":"https://pith.science/.well-known/pith/MW5KKFGMZJRORFVAR4O24MQ6ZR/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:MW5KKFGMZJRORFVAR4O24MQ6ZR","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"eed505f85974686f978c3675046d50977fdb613b064a98148cd2f394e530165c","cross_cats_sorted":["cs.DC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2017-01-12T05:14:40Z","title_canon_sha256":"236b788ffaafb9e32607c6cd4a27fae9d3b6a9ba0aae26e79c9c0db6add17e65"},"schema_version":"1.0","source":{"id":"1701.03458","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1701.03458","created_at":"2026-05-18T00:52:54Z"},{"alias_kind":"arxiv_version","alias_value":"1701.03458v1","created_at":"2026-05-18T00:52:54Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1701.03458","created_at":"2026-05-18T00:52:54Z"},{"alias_kind":"pith_short_12","alias_value":"MW5KKFGMZJRO","created_at":"2026-05-18T12:31:31Z"},{"alias_kind":"pith_short_16","alias_value":"MW5KKFGMZJRORFVA","created_at":"2026-05-18T12:31:31Z"},{"alias_kind":"pith_short_8","alias_value":"MW5KKFGM","created_at":"2026-05-18T12:31:31Z"}],"graph_snapshots":[{"event_id":"sha256:bc003c13c25b68c256af7ed905f5f43dbe344b5157d0657634910afb536272a5","target":"graph","created_at":"2026-05-18T00:52:54Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"paper":{"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","authors_text":"Deanna Needell, Tina Woolf","cross_cats":["cs.DC"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2017-01-12T05:14:40Z","title":"An Asynchronous Parallel Approach to Sparse Recovery"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1701.03458","kind":"arxiv","version":1},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:ffc9b484bdb6e7d20faac9e877616589efbc4a169f2529c7eef668cbb7dc4202","target":"record","created_at":"2026-05-18T00:52:54Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"eed505f85974686f978c3675046d50977fdb613b064a98148cd2f394e530165c","cross_cats_sorted":["cs.DC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2017-01-12T05:14:40Z","title_canon_sha256":"236b788ffaafb9e32607c6cd4a27fae9d3b6a9ba0aae26e79c9c0db6add17e65"},"schema_version":"1.0","source":{"id":"1701.03458","kind":"arxiv","version":1}},"canonical_sha256":"65baa514ccca62e896a08f1dae321ecc61616753695f6f91a54508cb700f50d7","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"65baa514ccca62e896a08f1dae321ecc61616753695f6f91a54508cb700f50d7","first_computed_at":"2026-05-18T00:52:54.760135Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:52:54.760135Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"z/SQW8ihiqMheYCaodftKUD0wleG0zjbttDNmlnL12JxOYdMkbfLm68dQN3fa5vkS5rcEXB2p+A4Dy4zhZm/DQ==","signature_status":"signed_v1","signed_at":"2026-05-18T00:52:54.760713Z","signed_message":"canonical_sha256_bytes"},"source_id":"1701.03458","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:ffc9b484bdb6e7d20faac9e877616589efbc4a169f2529c7eef668cbb7dc4202","sha256:bc003c13c25b68c256af7ed905f5f43dbe344b5157d0657634910afb536272a5"],"state_sha256":"433c8520d601dc85ec29bee33389fac656e5153bec64c47796f406a0bb95fa67"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Qeo/xLILY91//8s+O0KA0OZ1My9I0pC9BjLoFTZz4qgacA58tGFUlnurF32+xsRQqtT05JtknXkwZEkodU45Ag==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-02T16:31:16.733873Z","bundle_sha256":"d146e0099e5911fb88fcb2ab867ce50974cc76410b0743430f5ab2780ebdead2"}}