{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2011:7YHDSOJ66W3AKNICPCSM7BQAWZ","short_pith_number":"pith:7YHDSOJ6","canonical_record":{"source":{"id":"1102.2928","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2011-02-14T23:37:28Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"67cb000e7f7a0c9fc28a21f0dc086081ccb7c6266979339a639f6b77598469dd","abstract_canon_sha256":"b96815628b25cec0c39d9ab83597cb43b59a70d287d2d3db7326915a37bdd855"},"schema_version":"1.0"},"canonical_sha256":"fe0e39393ef5b605350278a4cf8600b64e40b487a65590529039f4702c0ac847","source":{"kind":"arxiv","id":"1102.2928","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1102.2928","created_at":"2026-05-18T04:20:58Z"},{"alias_kind":"arxiv_version","alias_value":"1102.2928v2","created_at":"2026-05-18T04:20:58Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1102.2928","created_at":"2026-05-18T04:20:58Z"},{"alias_kind":"pith_short_12","alias_value":"7YHDSOJ66W3A","created_at":"2026-05-18T12:26:22Z"},{"alias_kind":"pith_short_16","alias_value":"7YHDSOJ66W3AKNIC","created_at":"2026-05-18T12:26:22Z"},{"alias_kind":"pith_short_8","alias_value":"7YHDSOJ6","created_at":"2026-05-18T12:26:22Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2011:7YHDSOJ66W3AKNICPCSM7BQAWZ","target":"record","payload":{"canonical_record":{"source":{"id":"1102.2928","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2011-02-14T23:37:28Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"67cb000e7f7a0c9fc28a21f0dc086081ccb7c6266979339a639f6b77598469dd","abstract_canon_sha256":"b96815628b25cec0c39d9ab83597cb43b59a70d287d2d3db7326915a37bdd855"},"schema_version":"1.0"},"canonical_sha256":"fe0e39393ef5b605350278a4cf8600b64e40b487a65590529039f4702c0ac847","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:20:58.789463Z","signature_b64":"i2A82SYQIsI9UfPeY87DjFdfT+lZe72fCN3+odkeGNWwdEcaNgKptOitU1Pr9NtMHdXYuiD0wCn2tI7nuVGXCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"fe0e39393ef5b605350278a4cf8600b64e40b487a65590529039f4702c0ac847","last_reissued_at":"2026-05-18T04:20:58.789028Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:20:58.789028Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1102.2928","source_version":2,"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-18T04:20:58Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"WQhsDOBOqYZdFgrPqSc04iJUofkgV85X4tXMk+XiqGW/Cw0ihuyqy9pv25Y6+lqWGSNeQv0MMXfyQat7bMoEDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-20T05:32:11.502950Z"},"content_sha256":"1f6bdbd528cac4f0c0b06c6b047880b047dc2c4a58540c91d61e51d46f8a4bad","schema_version":"1.0","event_id":"sha256:1f6bdbd528cac4f0c0b06c6b047880b047dc2c4a58540c91d61e51d46f8a4bad"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2011:7YHDSOJ66W3AKNICPCSM7BQAWZ","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Density Evolution Analysis of Node-Based Verification-Based 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, Anoosheh Heidarzadeh, Ioannis Lambadaris, Yaser Eftekhari","submitted_at":"2011-02-14T23:37:28Z","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"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1102.2928","kind":"arxiv","version":2},"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-18T04:20:58Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"1J9U596iaBoXIF6Bmn7iXjH1Pc8BAO0svNZ45Gcpy1R6EqlKm9BbPN71Xk3FE1Vd1ZKMCrUlqSwgpg1D0dp0AA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-20T05:32:11.503293Z"},"content_sha256":"313ca3b4db56bd3e106b64f0ad0e7e9f7ead943e2e162cad0f7bc519753f0e92","schema_version":"1.0","event_id":"sha256:313ca3b4db56bd3e106b64f0ad0e7e9f7ead943e2e162cad0f7bc519753f0e92"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/7YHDSOJ66W3AKNICPCSM7BQAWZ/bundle.json","state_url":"https://pith.science/pith/7YHDSOJ66W3AKNICPCSM7BQAWZ/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/7YHDSOJ66W3AKNICPCSM7BQAWZ/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-20T05:32:11Z","links":{"resolver":"https://pith.science/pith/7YHDSOJ66W3AKNICPCSM7BQAWZ","bundle":"https://pith.science/pith/7YHDSOJ66W3AKNICPCSM7BQAWZ/bundle.json","state":"https://pith.science/pith/7YHDSOJ66W3AKNICPCSM7BQAWZ/state.json","well_known_bundle":"https://pith.science/.well-known/pith/7YHDSOJ66W3AKNICPCSM7BQAWZ/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2011:7YHDSOJ66W3AKNICPCSM7BQAWZ","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-02-14T23:37:28Z","title_canon_sha256":"67cb000e7f7a0c9fc28a21f0dc086081ccb7c6266979339a639f6b77598469dd"},"schema_version":"1.0","source":{"id":"1102.2928","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1102.2928","created_at":"2026-05-18T04:20:58Z"},{"alias_kind":"arxiv_version","alias_value":"1102.2928v2","created_at":"2026-05-18T04:20:58Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1102.2928","created_at":"2026-05-18T04:20:58Z"},{"alias_kind":"pith_short_12","alias_value":"7YHDSOJ66W3A","created_at":"2026-05-18T12:26:22Z"},{"alias_kind":"pith_short_16","alias_value":"7YHDSOJ66W3AKNIC","created_at":"2026-05-18T12:26:22Z"},{"alias_kind":"pith_short_8","alias_value":"7YHDSOJ6","created_at":"2026-05-18T12:26:22Z"}],"graph_snapshots":[{"event_id":"sha256:313ca3b4db56bd3e106b64f0ad0e7e9f7ead943e2e162cad0f7bc519753f0e92","target":"graph","created_at":"2026-05-18T04:20:58Z","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-02-14T23:37:28Z","title":"Density Evolution Analysis of Node-Based Verification-Based Algorithms in Compressed Sensing"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1102.2928","kind":"arxiv","version":2},"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:1f6bdbd528cac4f0c0b06c6b047880b047dc2c4a58540c91d61e51d46f8a4bad","target":"record","created_at":"2026-05-18T04:20:58Z","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-02-14T23:37:28Z","title_canon_sha256":"67cb000e7f7a0c9fc28a21f0dc086081ccb7c6266979339a639f6b77598469dd"},"schema_version":"1.0","source":{"id":"1102.2928","kind":"arxiv","version":2}},"canonical_sha256":"fe0e39393ef5b605350278a4cf8600b64e40b487a65590529039f4702c0ac847","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"fe0e39393ef5b605350278a4cf8600b64e40b487a65590529039f4702c0ac847","first_computed_at":"2026-05-18T04:20:58.789028Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T04:20:58.789028Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"i2A82SYQIsI9UfPeY87DjFdfT+lZe72fCN3+odkeGNWwdEcaNgKptOitU1Pr9NtMHdXYuiD0wCn2tI7nuVGXCA==","signature_status":"signed_v1","signed_at":"2026-05-18T04:20:58.789463Z","signed_message":"canonical_sha256_bytes"},"source_id":"1102.2928","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:1f6bdbd528cac4f0c0b06c6b047880b047dc2c4a58540c91d61e51d46f8a4bad","sha256:313ca3b4db56bd3e106b64f0ad0e7e9f7ead943e2e162cad0f7bc519753f0e92"],"state_sha256":"d8a64185962f5a8a73f59a20b18b2eda73699a64be0cb42cf70c036e9255a133"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"m5uAuHCd6sXiWhfLlmTaaSKXZWgdheIGQXE+EBUfvGjpNkZHbzviJoMsuGP1aF+C16BK/jJ87buZ0XKInt2tAA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-20T05:32:11.505221Z","bundle_sha256":"d02e42515c2a0d4e5d0637fe08f8bc028565985d2adb8cee9774b20d465419bc"}}