{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2011:UXTPB2YK244WBDIOTGR7FN7LV3","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":"b96815628b25cec0c39d9ab83597cb43b59a70d287d2d3db7326915a37bdd855","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2011-04-01T17:46:43Z","title_canon_sha256":"66fefb5a012016e6ba70348ebb07bbf43d8975278392da03fc58a21cc9836dfb"},"schema_version":"1.0","source":{"id":"1104.0224","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1104.0224","created_at":"2026-05-18T04:25:12Z"},{"alias_kind":"arxiv_version","alias_value":"1104.0224v1","created_at":"2026-05-18T04:25:12Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1104.0224","created_at":"2026-05-18T04:25:12Z"},{"alias_kind":"pith_short_12","alias_value":"UXTPB2YK244W","created_at":"2026-05-18T12:26:42Z"},{"alias_kind":"pith_short_16","alias_value":"UXTPB2YK244WBDIO","created_at":"2026-05-18T12:26:42Z"},{"alias_kind":"pith_short_8","alias_value":"UXTPB2YK","created_at":"2026-05-18T12:26:42Z"}],"graph_snapshots":[{"event_id":"sha256:e25ec595432544168cffb2025be8c2356f577a1969af70143ad735b757db37b6","target":"graph","created_at":"2026-05-18T04:25:12Z","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":"In this paper, we present a new approach for the analysis of iterative node-based verification-based (NB-VB) recovery algorithms in the context of compressive sensing. These algorithms are particularly interesting due to their low complexity (linear in the signal dimension $n$). The asymptotic analysis predicts the fraction of unverified signal elements at each iteration $\\ell$ in the asymptotic regime where $n \\rightarrow \\infty$. The analysis is similar in nature to the well-known density evolution technique commonly used to analyze iterative decoding algorithms. To perform the analysis, a m","authors_text":"Amir H. Banihashemi, Anoosheh Heidarzadeh, Ioannis Lambadaris, Yaser Eftekhari","cross_cats":["math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2011-04-01T17:46:43Z","title":"Density Evolution Analysis of Node-Based Verification-Based Algorithms in Compressive Sensing"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1104.0224","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:8e22559e7d0e9beabf064612a4d86a9ae69fd5ad75da4a4f9fbd662f47b3c228","target":"record","created_at":"2026-05-18T04:25:12Z","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":"b96815628b25cec0c39d9ab83597cb43b59a70d287d2d3db7326915a37bdd855","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2011-04-01T17:46:43Z","title_canon_sha256":"66fefb5a012016e6ba70348ebb07bbf43d8975278392da03fc58a21cc9836dfb"},"schema_version":"1.0","source":{"id":"1104.0224","kind":"arxiv","version":1}},"canonical_sha256":"a5e6f0eb0ad739608d0e99a3f2b7ebaec6a3a951421e4768a583b0a701584412","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"a5e6f0eb0ad739608d0e99a3f2b7ebaec6a3a951421e4768a583b0a701584412","first_computed_at":"2026-05-18T04:25:12.131886Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T04:25:12.131886Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"Lnn+b6SAJpSb4lgB/kOjI3H1mMoF2Qzq0JFusboO1P9Uu2K7XLnli4iEiX9KUr6Ef0/OGLezNgTPh++Jt0gLBw==","signature_status":"signed_v1","signed_at":"2026-05-18T04:25:12.132498Z","signed_message":"canonical_sha256_bytes"},"source_id":"1104.0224","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:8e22559e7d0e9beabf064612a4d86a9ae69fd5ad75da4a4f9fbd662f47b3c228","sha256:e25ec595432544168cffb2025be8c2356f577a1969af70143ad735b757db37b6"],"state_sha256":"c8e0f707ac496b5a98c18a1171071356c70abc8cdea3838dd4e2c4f1c84d4bde"}