{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:ZF5BLYARQXIQD5OXKFPH5MA6K2","short_pith_number":"pith:ZF5BLYAR","canonical_record":{"source":{"id":"1508.01256","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NA","submitted_at":"2015-08-06T01:37:46Z","cross_cats_sorted":["cs.IT","math.CO","math.IT"],"title_canon_sha256":"1f144d3102907a174f69ada0207870f5205a9eba080a50422b56aa46f24fecde","abstract_canon_sha256":"6abb471e2eda8d82f723273613f8e9d8ab214226b3f40ef89e8247c702f90c12"},"schema_version":"1.0"},"canonical_sha256":"c97a15e01185d101f5d7515e7eb01e568ec3203a97a6e2b4de820a68c39274e0","source":{"kind":"arxiv","id":"1508.01256","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1508.01256","created_at":"2026-05-18T01:35:43Z"},{"alias_kind":"arxiv_version","alias_value":"1508.01256v1","created_at":"2026-05-18T01:35:43Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1508.01256","created_at":"2026-05-18T01:35:43Z"},{"alias_kind":"pith_short_12","alias_value":"ZF5BLYARQXIQ","created_at":"2026-05-18T12:29:52Z"},{"alias_kind":"pith_short_16","alias_value":"ZF5BLYARQXIQD5OX","created_at":"2026-05-18T12:29:52Z"},{"alias_kind":"pith_short_8","alias_value":"ZF5BLYAR","created_at":"2026-05-18T12:29:52Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:ZF5BLYARQXIQD5OXKFPH5MA6K2","target":"record","payload":{"canonical_record":{"source":{"id":"1508.01256","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NA","submitted_at":"2015-08-06T01:37:46Z","cross_cats_sorted":["cs.IT","math.CO","math.IT"],"title_canon_sha256":"1f144d3102907a174f69ada0207870f5205a9eba080a50422b56aa46f24fecde","abstract_canon_sha256":"6abb471e2eda8d82f723273613f8e9d8ab214226b3f40ef89e8247c702f90c12"},"schema_version":"1.0"},"canonical_sha256":"c97a15e01185d101f5d7515e7eb01e568ec3203a97a6e2b4de820a68c39274e0","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:35:43.055729Z","signature_b64":"BIjxgr1/OnwWo0UBSlTyya9RmqzXBBKepGvpb8cdRUKfdVm2ZsLlyTU3DDsPw1XQo9EXVjhiz+qgxXMKbzuEDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"c97a15e01185d101f5d7515e7eb01e568ec3203a97a6e2b4de820a68c39274e0","last_reissued_at":"2026-05-18T01:35:43.055258Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:35:43.055258Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1508.01256","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-18T01:35:43Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"K33k5kqaE+LMzfElHrYqcZNRXewowgbi1qs6rySHGObxHP/TKMA/zrst0D/adkiDkzItMrRzvhfynHXbiE/hCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-23T12:51:51.919990Z"},"content_sha256":"db29182f37daab77f701180e1c1081655243a942c693656d628c9ad446610047","schema_version":"1.0","event_id":"sha256:db29182f37daab77f701180e1c1081655243a942c693656d628c9ad446610047"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:ZF5BLYARQXIQD5OXKFPH5MA6K2","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Expander $\\ell_0$-Decoding","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.IT","math.CO","math.IT"],"primary_cat":"math.NA","authors_text":"Jared Tanner, Rodrigo Mendoza-Smith","submitted_at":"2015-08-06T01:37:46Z","abstract_excerpt":"We introduce two new algorithms, Serial-$\\ell_0$ and Parallel-$\\ell_0$ for solving a large underdetermined linear system of equations $y = Ax \\in \\mathbb{R}^m$ when it is known that $x \\in \\mathbb{R}^n$ has at most $k < m$ nonzero entries and that $A$ is the adjacency matrix of an unbalanced left $d$-regular expander graph. The matrices in this class are sparse and allow a highly efficient implementation. A number of algorithms have been designed to work exclusively under this setting, composing the branch of combinatorial compressed-sensing (CCS).\n  Serial-$\\ell_0$ and Parallel-$\\ell_0$ itera"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1508.01256","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-18T01:35:43Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"C38NPDO1a/Lhs/O2Cvql6MFvfU2YoHZOMg8IPZ2JGBLuwdFXz+HPuR79M0JS9KoohBC9tb459u3AYAAx/4bWAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-23T12:51:51.920350Z"},"content_sha256":"839516788f9988266b6c444a8ef1159144f99678bacfe81fc030b2914aa6bd04","schema_version":"1.0","event_id":"sha256:839516788f9988266b6c444a8ef1159144f99678bacfe81fc030b2914aa6bd04"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/ZF5BLYARQXIQD5OXKFPH5MA6K2/bundle.json","state_url":"https://pith.science/pith/ZF5BLYARQXIQD5OXKFPH5MA6K2/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/ZF5BLYARQXIQD5OXKFPH5MA6K2/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-23T12:51:51Z","links":{"resolver":"https://pith.science/pith/ZF5BLYARQXIQD5OXKFPH5MA6K2","bundle":"https://pith.science/pith/ZF5BLYARQXIQD5OXKFPH5MA6K2/bundle.json","state":"https://pith.science/pith/ZF5BLYARQXIQD5OXKFPH5MA6K2/state.json","well_known_bundle":"https://pith.science/.well-known/pith/ZF5BLYARQXIQD5OXKFPH5MA6K2/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:ZF5BLYARQXIQD5OXKFPH5MA6K2","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":"6abb471e2eda8d82f723273613f8e9d8ab214226b3f40ef89e8247c702f90c12","cross_cats_sorted":["cs.IT","math.CO","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NA","submitted_at":"2015-08-06T01:37:46Z","title_canon_sha256":"1f144d3102907a174f69ada0207870f5205a9eba080a50422b56aa46f24fecde"},"schema_version":"1.0","source":{"id":"1508.01256","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1508.01256","created_at":"2026-05-18T01:35:43Z"},{"alias_kind":"arxiv_version","alias_value":"1508.01256v1","created_at":"2026-05-18T01:35:43Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1508.01256","created_at":"2026-05-18T01:35:43Z"},{"alias_kind":"pith_short_12","alias_value":"ZF5BLYARQXIQ","created_at":"2026-05-18T12:29:52Z"},{"alias_kind":"pith_short_16","alias_value":"ZF5BLYARQXIQD5OX","created_at":"2026-05-18T12:29:52Z"},{"alias_kind":"pith_short_8","alias_value":"ZF5BLYAR","created_at":"2026-05-18T12:29:52Z"}],"graph_snapshots":[{"event_id":"sha256:839516788f9988266b6c444a8ef1159144f99678bacfe81fc030b2914aa6bd04","target":"graph","created_at":"2026-05-18T01:35:43Z","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":"We introduce two new algorithms, Serial-$\\ell_0$ and Parallel-$\\ell_0$ for solving a large underdetermined linear system of equations $y = Ax \\in \\mathbb{R}^m$ when it is known that $x \\in \\mathbb{R}^n$ has at most $k < m$ nonzero entries and that $A$ is the adjacency matrix of an unbalanced left $d$-regular expander graph. The matrices in this class are sparse and allow a highly efficient implementation. A number of algorithms have been designed to work exclusively under this setting, composing the branch of combinatorial compressed-sensing (CCS).\n  Serial-$\\ell_0$ and Parallel-$\\ell_0$ itera","authors_text":"Jared Tanner, Rodrigo Mendoza-Smith","cross_cats":["cs.IT","math.CO","math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NA","submitted_at":"2015-08-06T01:37:46Z","title":"Expander $\\ell_0$-Decoding"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1508.01256","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:db29182f37daab77f701180e1c1081655243a942c693656d628c9ad446610047","target":"record","created_at":"2026-05-18T01:35:43Z","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":"6abb471e2eda8d82f723273613f8e9d8ab214226b3f40ef89e8247c702f90c12","cross_cats_sorted":["cs.IT","math.CO","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NA","submitted_at":"2015-08-06T01:37:46Z","title_canon_sha256":"1f144d3102907a174f69ada0207870f5205a9eba080a50422b56aa46f24fecde"},"schema_version":"1.0","source":{"id":"1508.01256","kind":"arxiv","version":1}},"canonical_sha256":"c97a15e01185d101f5d7515e7eb01e568ec3203a97a6e2b4de820a68c39274e0","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"c97a15e01185d101f5d7515e7eb01e568ec3203a97a6e2b4de820a68c39274e0","first_computed_at":"2026-05-18T01:35:43.055258Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:35:43.055258Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"BIjxgr1/OnwWo0UBSlTyya9RmqzXBBKepGvpb8cdRUKfdVm2ZsLlyTU3DDsPw1XQo9EXVjhiz+qgxXMKbzuEDg==","signature_status":"signed_v1","signed_at":"2026-05-18T01:35:43.055729Z","signed_message":"canonical_sha256_bytes"},"source_id":"1508.01256","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:db29182f37daab77f701180e1c1081655243a942c693656d628c9ad446610047","sha256:839516788f9988266b6c444a8ef1159144f99678bacfe81fc030b2914aa6bd04"],"state_sha256":"9e6aae54b5983fa15545cbf9de3a8eaca10c3bddc4e5a470f4578c8d69956760"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"GCzt7dWilm5SoXdraTQdV4WyHLap5P10uinfFb1wOHVyCrGPAtU2z6DnUUmu821+/a+w4+s+EGTWZvPQRVl3Cg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-23T12:51:51.922248Z","bundle_sha256":"b20120872e6312193b60ecde5735a99667aa67a4bc764e0e691e3f3201f39090"}}