{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2012:55QRMFGIJ7OXPJVYEE77PPTMWC","short_pith_number":"pith:55QRMFGI","schema_version":"1.0","canonical_sha256":"ef611614c84fdd77a6b8213ff7be6cb0b7e7afaca768d31b225e21a6ca69eab4","source":{"kind":"arxiv","id":"1204.5136","version":1},"attestation_state":"computed","paper":{"title":"Analysis and Design of Irregular Graphs for Node-Based Verification-Based Recovery Algorithms in Compressed Sensing","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Amir H. Banihashemi, Ioannis Lambadaris, Yaser Eftekhari","submitted_at":"2012-04-23T18:29:05Z","abstract_excerpt":"In this paper, we present a probabilistic analysis of iterative node-based verification-based (NB-VB) recovery algorithms over irregular graphs in the context of compressed sensing. Verification-based algorithms are particularly interesting due to their low complexity (linear in the signal dimension $n$). The analysis predicts the average fraction of unverified signal elements at each iteration $\\ell$ where the average is taken over the ensembles of input signals and sensing matrices. The analysis is asymptotic ($n \\rightarrow \\infty$) and is similar in nature to the well-known density evoluti"},"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":"1204.5136","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2012-04-23T18:29:05Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"8bcc3ff12e96e9ec9d6b7760f03f599ad8d25929a08e9e599c47de32118a08bc","abstract_canon_sha256":"9e6db7aa5cfb6ef820303a8fa35cf3691da9899e35f9cc85741649a08daefc59"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:57:14.699579Z","signature_b64":"actanDjabvqp7Ah8aheCJbLY7gmIVu4/kjmKLREbJvtpMoyJKojpcmwNUANK59YF+YCTpQyKyo++TyYoY5zMBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"ef611614c84fdd77a6b8213ff7be6cb0b7e7afaca768d31b225e21a6ca69eab4","last_reissued_at":"2026-05-18T03:57:14.699115Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:57:14.699115Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Analysis and Design of Irregular Graphs for Node-Based Verification-Based Recovery Algorithms in Compressed Sensing","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Amir H. Banihashemi, Ioannis Lambadaris, Yaser Eftekhari","submitted_at":"2012-04-23T18:29:05Z","abstract_excerpt":"In this paper, we present a probabilistic analysis of iterative node-based verification-based (NB-VB) recovery algorithms over irregular graphs in the context of compressed sensing. Verification-based algorithms are particularly interesting due to their low complexity (linear in the signal dimension $n$). The analysis predicts the average fraction of unverified signal elements at each iteration $\\ell$ where the average is taken over the ensembles of input signals and sensing matrices. The analysis is asymptotic ($n \\rightarrow \\infty$) and is similar in nature to the well-known density evoluti"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1204.5136","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":"1204.5136","created_at":"2026-05-18T03:57:14.699184+00:00"},{"alias_kind":"arxiv_version","alias_value":"1204.5136v1","created_at":"2026-05-18T03:57:14.699184+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1204.5136","created_at":"2026-05-18T03:57:14.699184+00:00"},{"alias_kind":"pith_short_12","alias_value":"55QRMFGIJ7OX","created_at":"2026-05-18T12:26:53.410803+00:00"},{"alias_kind":"pith_short_16","alias_value":"55QRMFGIJ7OXPJVY","created_at":"2026-05-18T12:26:53.410803+00:00"},{"alias_kind":"pith_short_8","alias_value":"55QRMFGI","created_at":"2026-05-18T12:26:53.410803+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/55QRMFGIJ7OXPJVYEE77PPTMWC","json":"https://pith.science/pith/55QRMFGIJ7OXPJVYEE77PPTMWC.json","graph_json":"https://pith.science/api/pith-number/55QRMFGIJ7OXPJVYEE77PPTMWC/graph.json","events_json":"https://pith.science/api/pith-number/55QRMFGIJ7OXPJVYEE77PPTMWC/events.json","paper":"https://pith.science/paper/55QRMFGI"},"agent_actions":{"view_html":"https://pith.science/pith/55QRMFGIJ7OXPJVYEE77PPTMWC","download_json":"https://pith.science/pith/55QRMFGIJ7OXPJVYEE77PPTMWC.json","view_paper":"https://pith.science/paper/55QRMFGI","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1204.5136&json=true","fetch_graph":"https://pith.science/api/pith-number/55QRMFGIJ7OXPJVYEE77PPTMWC/graph.json","fetch_events":"https://pith.science/api/pith-number/55QRMFGIJ7OXPJVYEE77PPTMWC/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/55QRMFGIJ7OXPJVYEE77PPTMWC/action/timestamp_anchor","attest_storage":"https://pith.science/pith/55QRMFGIJ7OXPJVYEE77PPTMWC/action/storage_attestation","attest_author":"https://pith.science/pith/55QRMFGIJ7OXPJVYEE77PPTMWC/action/author_attestation","sign_citation":"https://pith.science/pith/55QRMFGIJ7OXPJVYEE77PPTMWC/action/citation_signature","submit_replication":"https://pith.science/pith/55QRMFGIJ7OXPJVYEE77PPTMWC/action/replication_record"}},"created_at":"2026-05-18T03:57:14.699184+00:00","updated_at":"2026-05-18T03:57:14.699184+00:00"}