{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2012:55QRMFGIJ7OXPJVYEE77PPTMWC","short_pith_number":"pith:55QRMFGI","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"},"canonical_sha256":"ef611614c84fdd77a6b8213ff7be6cb0b7e7afaca768d31b225e21a6ca69eab4","source":{"kind":"arxiv","id":"1204.5136","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1204.5136","created_at":"2026-05-18T03:57:14Z"},{"alias_kind":"arxiv_version","alias_value":"1204.5136v1","created_at":"2026-05-18T03:57:14Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1204.5136","created_at":"2026-05-18T03:57:14Z"},{"alias_kind":"pith_short_12","alias_value":"55QRMFGIJ7OX","created_at":"2026-05-18T12:26:53Z"},{"alias_kind":"pith_short_16","alias_value":"55QRMFGIJ7OXPJVY","created_at":"2026-05-18T12:26:53Z"},{"alias_kind":"pith_short_8","alias_value":"55QRMFGI","created_at":"2026-05-18T12:26:53Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2012:55QRMFGIJ7OXPJVYEE77PPTMWC","target":"record","payload":{"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"},"canonical_sha256":"ef611614c84fdd77a6b8213ff7be6cb0b7e7afaca768d31b225e21a6ca69eab4","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"},"source_kind":"arxiv","source_id":"1204.5136","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-18T03:57:14Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Th+td2Mvqo5iJYWl/6EnbYsY70rvqVEOKdxOWPA0v5BUDPjbO0WWusNMqas17V0zVdDSk6O0piF+o6SEZVucAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-20T06:07:21.378068Z"},"content_sha256":"68e4519e05c82ef414efef009f040a134ade3086ef1b8e12445230af6992c31e","schema_version":"1.0","event_id":"sha256:68e4519e05c82ef414efef009f040a134ade3086ef1b8e12445230af6992c31e"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2012:55QRMFGIJ7OXPJVYEE77PPTMWC","target":"graph","payload":{"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"},"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-18T03:57:14Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"YMrSpiOjzz7V+ELaLRIoCqSrcRND7JMIc0CeFAcPf0kyTQNjPlFVZnpPoBg/Z8/PUp80hYmXSuSL2+8maewFCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-20T06:07:21.378427Z"},"content_sha256":"27fe259bb3d323cb4a2b769fba59eac9a4a627825979fd23c4a6b290b4393d8d","schema_version":"1.0","event_id":"sha256:27fe259bb3d323cb4a2b769fba59eac9a4a627825979fd23c4a6b290b4393d8d"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/55QRMFGIJ7OXPJVYEE77PPTMWC/bundle.json","state_url":"https://pith.science/pith/55QRMFGIJ7OXPJVYEE77PPTMWC/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/55QRMFGIJ7OXPJVYEE77PPTMWC/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-20T06:07:21Z","links":{"resolver":"https://pith.science/pith/55QRMFGIJ7OXPJVYEE77PPTMWC","bundle":"https://pith.science/pith/55QRMFGIJ7OXPJVYEE77PPTMWC/bundle.json","state":"https://pith.science/pith/55QRMFGIJ7OXPJVYEE77PPTMWC/state.json","well_known_bundle":"https://pith.science/.well-known/pith/55QRMFGIJ7OXPJVYEE77PPTMWC/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2012:55QRMFGIJ7OXPJVYEE77PPTMWC","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":"9e6db7aa5cfb6ef820303a8fa35cf3691da9899e35f9cc85741649a08daefc59","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2012-04-23T18:29:05Z","title_canon_sha256":"8bcc3ff12e96e9ec9d6b7760f03f599ad8d25929a08e9e599c47de32118a08bc"},"schema_version":"1.0","source":{"id":"1204.5136","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1204.5136","created_at":"2026-05-18T03:57:14Z"},{"alias_kind":"arxiv_version","alias_value":"1204.5136v1","created_at":"2026-05-18T03:57:14Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1204.5136","created_at":"2026-05-18T03:57:14Z"},{"alias_kind":"pith_short_12","alias_value":"55QRMFGIJ7OX","created_at":"2026-05-18T12:26:53Z"},{"alias_kind":"pith_short_16","alias_value":"55QRMFGIJ7OXPJVY","created_at":"2026-05-18T12:26:53Z"},{"alias_kind":"pith_short_8","alias_value":"55QRMFGI","created_at":"2026-05-18T12:26:53Z"}],"graph_snapshots":[{"event_id":"sha256:27fe259bb3d323cb4a2b769fba59eac9a4a627825979fd23c4a6b290b4393d8d","target":"graph","created_at":"2026-05-18T03:57:14Z","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 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","authors_text":"Amir H. Banihashemi, Ioannis Lambadaris, Yaser Eftekhari","cross_cats":["math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2012-04-23T18:29:05Z","title":"Analysis and Design of Irregular Graphs for Node-Based Verification-Based Recovery Algorithms in Compressed Sensing"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1204.5136","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:68e4519e05c82ef414efef009f040a134ade3086ef1b8e12445230af6992c31e","target":"record","created_at":"2026-05-18T03:57:14Z","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":"9e6db7aa5cfb6ef820303a8fa35cf3691da9899e35f9cc85741649a08daefc59","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2012-04-23T18:29:05Z","title_canon_sha256":"8bcc3ff12e96e9ec9d6b7760f03f599ad8d25929a08e9e599c47de32118a08bc"},"schema_version":"1.0","source":{"id":"1204.5136","kind":"arxiv","version":1}},"canonical_sha256":"ef611614c84fdd77a6b8213ff7be6cb0b7e7afaca768d31b225e21a6ca69eab4","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"ef611614c84fdd77a6b8213ff7be6cb0b7e7afaca768d31b225e21a6ca69eab4","first_computed_at":"2026-05-18T03:57:14.699115Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:57:14.699115Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"actanDjabvqp7Ah8aheCJbLY7gmIVu4/kjmKLREbJvtpMoyJKojpcmwNUANK59YF+YCTpQyKyo++TyYoY5zMBQ==","signature_status":"signed_v1","signed_at":"2026-05-18T03:57:14.699579Z","signed_message":"canonical_sha256_bytes"},"source_id":"1204.5136","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:68e4519e05c82ef414efef009f040a134ade3086ef1b8e12445230af6992c31e","sha256:27fe259bb3d323cb4a2b769fba59eac9a4a627825979fd23c4a6b290b4393d8d"],"state_sha256":"c184843bc415eec4dc53090325cc6d897053d897a5c81b7fdf50ca04a415c7de"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"6dV4MaNv/8Sh1aHbGzc4H5Q1YX5tN+3e0xb++DgNiKhFgzEJ2QHfhTDMH73OOH/9BMFEr1dageYueibpFbcYCg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-20T06:07:21.380290Z","bundle_sha256":"ea3971f9428af186edc82ad001ddc06e1ea70867bb2dde4eed77ffd6b733d441"}}