{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2012:IUDGJMFDT4VNOUUCCCKBGEJGVR","short_pith_number":"pith:IUDGJMFD","canonical_record":{"source":{"id":"1203.1714","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2012-03-08T09:18:36Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"4d6f07b6a474194963a1c8eb122960d618ed49859038235ac200c8f6adbc9d03","abstract_canon_sha256":"7b03321cd95b1acb8d8ea946c1ac89fa525d6fde9d74cb1de076bec3f79070c7"},"schema_version":"1.0"},"canonical_sha256":"450664b0a39f2ad752821094131126ac671f755c98cdd8cb8cd4d40b14a4d52f","source":{"kind":"arxiv","id":"1203.1714","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1203.1714","created_at":"2026-05-18T04:00:37Z"},{"alias_kind":"arxiv_version","alias_value":"1203.1714v1","created_at":"2026-05-18T04:00:37Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1203.1714","created_at":"2026-05-18T04:00:37Z"},{"alias_kind":"pith_short_12","alias_value":"IUDGJMFDT4VN","created_at":"2026-05-18T12:27:09Z"},{"alias_kind":"pith_short_16","alias_value":"IUDGJMFDT4VNOUUC","created_at":"2026-05-18T12:27:09Z"},{"alias_kind":"pith_short_8","alias_value":"IUDGJMFD","created_at":"2026-05-18T12:27:09Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2012:IUDGJMFDT4VNOUUCCCKBGEJGVR","target":"record","payload":{"canonical_record":{"source":{"id":"1203.1714","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2012-03-08T09:18:36Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"4d6f07b6a474194963a1c8eb122960d618ed49859038235ac200c8f6adbc9d03","abstract_canon_sha256":"7b03321cd95b1acb8d8ea946c1ac89fa525d6fde9d74cb1de076bec3f79070c7"},"schema_version":"1.0"},"canonical_sha256":"450664b0a39f2ad752821094131126ac671f755c98cdd8cb8cd4d40b14a4d52f","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:00:37.200119Z","signature_b64":"h71iu/tpOk1B4l8FYDDQEhN1tfHVuwwI1mhrJ0PkbCS397i4LV0m6dqERIsHXkKRvaEEHqAUkNqmye0hIYdUDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"450664b0a39f2ad752821094131126ac671f755c98cdd8cb8cd4d40b14a4d52f","last_reissued_at":"2026-05-18T04:00:37.199412Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:00:37.199412Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1203.1714","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-18T04:00:37Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"qbvn48AeYSeYokA6UdZBVpdu6GAWYys6eyo777ujHE7P//Okk95maaYdi+H5qHl4+ps3OMVFHCQwVksn/6iwCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-02T18:37:47.302760Z"},"content_sha256":"86f5efba0c4bd07c6829cf5d1bf7d7093cb4334f6ab46752fa273530ea4759c0","schema_version":"1.0","event_id":"sha256:86f5efba0c4bd07c6829cf5d1bf7d7093cb4334f6ab46752fa273530ea4759c0"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2012:IUDGJMFDT4VNOUUCCCKBGEJGVR","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Efficient Recovery of Block Sparse Signals via Zero-point Attracting Projection","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Jian Jin, Jingbo Liu, Yuantao Gu","submitted_at":"2012-03-08T09:18:36Z","abstract_excerpt":"In this paper, we consider compressed sensing (CS) of block-sparse signals, i.e., sparse signals that have nonzero coefficients occurring in clusters. An efficient algorithm, called zero-point attracting projection (ZAP) algorithm, is extended to the scenario of block CS. The block version of ZAP algorithm employs an approximate $l_{2,0}$ norm as the cost function, and finds its minimum in the solution space via iterations. For block sparse signals, an analysis of the stability of the local minimums of this cost function under the perturbation of noise reveals an advantage of the proposed algo"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1203.1714","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-18T04:00:37Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"EwEw8KhjsLjmhPYKzGqCi9Fr0oXKFYmru7AaF0zitGgjlwAA67exFtBP8XlqqrnwVzk9f1pNgbAaJq9XO/ylCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-02T18:37:47.303100Z"},"content_sha256":"8f33758d49cf43fa9d29b7dcffe768f0211cabc3140e3363da859d01e1039a9e","schema_version":"1.0","event_id":"sha256:8f33758d49cf43fa9d29b7dcffe768f0211cabc3140e3363da859d01e1039a9e"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/IUDGJMFDT4VNOUUCCCKBGEJGVR/bundle.json","state_url":"https://pith.science/pith/IUDGJMFDT4VNOUUCCCKBGEJGVR/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/IUDGJMFDT4VNOUUCCCKBGEJGVR/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-02T18:37:47Z","links":{"resolver":"https://pith.science/pith/IUDGJMFDT4VNOUUCCCKBGEJGVR","bundle":"https://pith.science/pith/IUDGJMFDT4VNOUUCCCKBGEJGVR/bundle.json","state":"https://pith.science/pith/IUDGJMFDT4VNOUUCCCKBGEJGVR/state.json","well_known_bundle":"https://pith.science/.well-known/pith/IUDGJMFDT4VNOUUCCCKBGEJGVR/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2012:IUDGJMFDT4VNOUUCCCKBGEJGVR","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":"7b03321cd95b1acb8d8ea946c1ac89fa525d6fde9d74cb1de076bec3f79070c7","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2012-03-08T09:18:36Z","title_canon_sha256":"4d6f07b6a474194963a1c8eb122960d618ed49859038235ac200c8f6adbc9d03"},"schema_version":"1.0","source":{"id":"1203.1714","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1203.1714","created_at":"2026-05-18T04:00:37Z"},{"alias_kind":"arxiv_version","alias_value":"1203.1714v1","created_at":"2026-05-18T04:00:37Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1203.1714","created_at":"2026-05-18T04:00:37Z"},{"alias_kind":"pith_short_12","alias_value":"IUDGJMFDT4VN","created_at":"2026-05-18T12:27:09Z"},{"alias_kind":"pith_short_16","alias_value":"IUDGJMFDT4VNOUUC","created_at":"2026-05-18T12:27:09Z"},{"alias_kind":"pith_short_8","alias_value":"IUDGJMFD","created_at":"2026-05-18T12:27:09Z"}],"graph_snapshots":[{"event_id":"sha256:8f33758d49cf43fa9d29b7dcffe768f0211cabc3140e3363da859d01e1039a9e","target":"graph","created_at":"2026-05-18T04:00:37Z","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 consider compressed sensing (CS) of block-sparse signals, i.e., sparse signals that have nonzero coefficients occurring in clusters. An efficient algorithm, called zero-point attracting projection (ZAP) algorithm, is extended to the scenario of block CS. The block version of ZAP algorithm employs an approximate $l_{2,0}$ norm as the cost function, and finds its minimum in the solution space via iterations. For block sparse signals, an analysis of the stability of the local minimums of this cost function under the perturbation of noise reveals an advantage of the proposed algo","authors_text":"Jian Jin, Jingbo Liu, Yuantao Gu","cross_cats":["math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2012-03-08T09:18:36Z","title":"Efficient Recovery of Block Sparse Signals via Zero-point Attracting Projection"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1203.1714","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:86f5efba0c4bd07c6829cf5d1bf7d7093cb4334f6ab46752fa273530ea4759c0","target":"record","created_at":"2026-05-18T04:00:37Z","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":"7b03321cd95b1acb8d8ea946c1ac89fa525d6fde9d74cb1de076bec3f79070c7","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2012-03-08T09:18:36Z","title_canon_sha256":"4d6f07b6a474194963a1c8eb122960d618ed49859038235ac200c8f6adbc9d03"},"schema_version":"1.0","source":{"id":"1203.1714","kind":"arxiv","version":1}},"canonical_sha256":"450664b0a39f2ad752821094131126ac671f755c98cdd8cb8cd4d40b14a4d52f","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"450664b0a39f2ad752821094131126ac671f755c98cdd8cb8cd4d40b14a4d52f","first_computed_at":"2026-05-18T04:00:37.199412Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T04:00:37.199412Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"h71iu/tpOk1B4l8FYDDQEhN1tfHVuwwI1mhrJ0PkbCS397i4LV0m6dqERIsHXkKRvaEEHqAUkNqmye0hIYdUDA==","signature_status":"signed_v1","signed_at":"2026-05-18T04:00:37.200119Z","signed_message":"canonical_sha256_bytes"},"source_id":"1203.1714","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:86f5efba0c4bd07c6829cf5d1bf7d7093cb4334f6ab46752fa273530ea4759c0","sha256:8f33758d49cf43fa9d29b7dcffe768f0211cabc3140e3363da859d01e1039a9e"],"state_sha256":"4f6496e2fa1f47b5000f42f843248333ed6d4fb8bd7b64bd4464e1c0bf26241c"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"RKWwznuDozC8A+SYiIQA5wr15E6XtFYpdzBIMZRx3DeTQVn3gdhvY9m75yd4eg7Hmcc/btiLgW4mx1L+AKvtCg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-02T18:37:47.305975Z","bundle_sha256":"28aa67358f580d6ad1c2e4d46cd6b3b9ffd572dec75f2ef79d53ffb7e83c100e"}}