{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2012:E7TUBKVLDNB3THAVT4UDYHLSXC","short_pith_number":"pith:E7TUBKVL","canonical_record":{"source":{"id":"1206.0663","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2012-06-04T16:22:34Z","cross_cats_sorted":["cs.SY","math.IT","math.OC","stat.ML"],"title_canon_sha256":"cd1edfc111418d8a12c14b3182c0947cc1b722be65d02580b7c11844ec01681b","abstract_canon_sha256":"e9132dcccde012865ba422e73a1fb7e4d0b9a4b94427cbea5c6b07db3f3e64c2"},"schema_version":"1.0"},"canonical_sha256":"27e740aaab1b43b99c159f283c1d72b8839be00dcfc8322b32afdd58c18045d2","source":{"kind":"arxiv","id":"1206.0663","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1206.0663","created_at":"2026-05-18T03:54:17Z"},{"alias_kind":"arxiv_version","alias_value":"1206.0663v1","created_at":"2026-05-18T03:54:17Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1206.0663","created_at":"2026-05-18T03:54:17Z"},{"alias_kind":"pith_short_12","alias_value":"E7TUBKVLDNB3","created_at":"2026-05-18T12:27:04Z"},{"alias_kind":"pith_short_16","alias_value":"E7TUBKVLDNB3THAV","created_at":"2026-05-18T12:27:04Z"},{"alias_kind":"pith_short_8","alias_value":"E7TUBKVL","created_at":"2026-05-18T12:27:04Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2012:E7TUBKVLDNB3THAVT4UDYHLSXC","target":"record","payload":{"canonical_record":{"source":{"id":"1206.0663","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2012-06-04T16:22:34Z","cross_cats_sorted":["cs.SY","math.IT","math.OC","stat.ML"],"title_canon_sha256":"cd1edfc111418d8a12c14b3182c0947cc1b722be65d02580b7c11844ec01681b","abstract_canon_sha256":"e9132dcccde012865ba422e73a1fb7e4d0b9a4b94427cbea5c6b07db3f3e64c2"},"schema_version":"1.0"},"canonical_sha256":"27e740aaab1b43b99c159f283c1d72b8839be00dcfc8322b32afdd58c18045d2","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:54:17.019332Z","signature_b64":"Y60MknA06/bAqtr08Z/zglGN0ury1jDRViYK36ZLEC8aGF4+Np+JH9QS0+bf90ebCvyotLqPfb5s3KSXLK3AAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"27e740aaab1b43b99c159f283c1d72b8839be00dcfc8322b32afdd58c18045d2","last_reissued_at":"2026-05-18T03:54:17.018871Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:54:17.018871Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1206.0663","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:54:17Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"AJG1x7CqOnKTxuHLpFliPru0CsgmojQIZkThl94ijMZAYTjnrEv6c0DsZ/fWMUZqokP/ioFKn4IXikF0nQQTBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-09T23:47:26.607540Z"},"content_sha256":"b0b4c6028ea3d275496e98d2d1aecd56641ca88d575f3635b6b62cacbfc40439","schema_version":"1.0","event_id":"sha256:b0b4c6028ea3d275496e98d2d1aecd56641ca88d575f3635b6b62cacbfc40439"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2012:E7TUBKVLDNB3THAVT4UDYHLSXC","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Multi-Sparse Signal Recovery for Compressive Sensing","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.SY","math.IT","math.OC","stat.ML"],"primary_cat":"cs.IT","authors_text":"Ivan Gligorijevic, Maarten De Vos, Sabine Van Huffel, Vladimir Matic, Yipeng Liu","submitted_at":"2012-06-04T16:22:34Z","abstract_excerpt":"Signal recovery is one of the key techniques of Compressive sensing (CS). It reconstructs the original signal from the linear sub-Nyquist measurements. Classical methods exploit the sparsity in one domain to formulate the L0 norm optimization. Recent investigation shows that some signals are sparse in multiple domains. To further improve the signal reconstruction performance, we can exploit this multi-sparsity to generate a new convex programming model. The latter is formulated with multiple sparsity constraints in multiple domains and the linear measurement fitting constraint. It improves sig"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1206.0663","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:54:17Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"JOGTCoL+vYagmAcPf5cPxdfXRr+Bxn2Mf6pldM0ElUIY7iN45JDL3oLNYcAS/Tap+2B0LnJ4caLXcZ9LOa+VCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-09T23:47:26.608231Z"},"content_sha256":"dac6275f4fd04e67d1db3066aad2de3b1682de790a4d5d532ac2f30d6a4e6429","schema_version":"1.0","event_id":"sha256:dac6275f4fd04e67d1db3066aad2de3b1682de790a4d5d532ac2f30d6a4e6429"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/E7TUBKVLDNB3THAVT4UDYHLSXC/bundle.json","state_url":"https://pith.science/pith/E7TUBKVLDNB3THAVT4UDYHLSXC/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/E7TUBKVLDNB3THAVT4UDYHLSXC/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-09T23:47:26Z","links":{"resolver":"https://pith.science/pith/E7TUBKVLDNB3THAVT4UDYHLSXC","bundle":"https://pith.science/pith/E7TUBKVLDNB3THAVT4UDYHLSXC/bundle.json","state":"https://pith.science/pith/E7TUBKVLDNB3THAVT4UDYHLSXC/state.json","well_known_bundle":"https://pith.science/.well-known/pith/E7TUBKVLDNB3THAVT4UDYHLSXC/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2012:E7TUBKVLDNB3THAVT4UDYHLSXC","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":"e9132dcccde012865ba422e73a1fb7e4d0b9a4b94427cbea5c6b07db3f3e64c2","cross_cats_sorted":["cs.SY","math.IT","math.OC","stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2012-06-04T16:22:34Z","title_canon_sha256":"cd1edfc111418d8a12c14b3182c0947cc1b722be65d02580b7c11844ec01681b"},"schema_version":"1.0","source":{"id":"1206.0663","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1206.0663","created_at":"2026-05-18T03:54:17Z"},{"alias_kind":"arxiv_version","alias_value":"1206.0663v1","created_at":"2026-05-18T03:54:17Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1206.0663","created_at":"2026-05-18T03:54:17Z"},{"alias_kind":"pith_short_12","alias_value":"E7TUBKVLDNB3","created_at":"2026-05-18T12:27:04Z"},{"alias_kind":"pith_short_16","alias_value":"E7TUBKVLDNB3THAV","created_at":"2026-05-18T12:27:04Z"},{"alias_kind":"pith_short_8","alias_value":"E7TUBKVL","created_at":"2026-05-18T12:27:04Z"}],"graph_snapshots":[{"event_id":"sha256:dac6275f4fd04e67d1db3066aad2de3b1682de790a4d5d532ac2f30d6a4e6429","target":"graph","created_at":"2026-05-18T03:54:17Z","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":"Signal recovery is one of the key techniques of Compressive sensing (CS). It reconstructs the original signal from the linear sub-Nyquist measurements. Classical methods exploit the sparsity in one domain to formulate the L0 norm optimization. Recent investigation shows that some signals are sparse in multiple domains. To further improve the signal reconstruction performance, we can exploit this multi-sparsity to generate a new convex programming model. The latter is formulated with multiple sparsity constraints in multiple domains and the linear measurement fitting constraint. It improves sig","authors_text":"Ivan Gligorijevic, Maarten De Vos, Sabine Van Huffel, Vladimir Matic, Yipeng Liu","cross_cats":["cs.SY","math.IT","math.OC","stat.ML"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2012-06-04T16:22:34Z","title":"Multi-Sparse Signal Recovery for Compressive Sensing"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1206.0663","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:b0b4c6028ea3d275496e98d2d1aecd56641ca88d575f3635b6b62cacbfc40439","target":"record","created_at":"2026-05-18T03:54:17Z","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":"e9132dcccde012865ba422e73a1fb7e4d0b9a4b94427cbea5c6b07db3f3e64c2","cross_cats_sorted":["cs.SY","math.IT","math.OC","stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2012-06-04T16:22:34Z","title_canon_sha256":"cd1edfc111418d8a12c14b3182c0947cc1b722be65d02580b7c11844ec01681b"},"schema_version":"1.0","source":{"id":"1206.0663","kind":"arxiv","version":1}},"canonical_sha256":"27e740aaab1b43b99c159f283c1d72b8839be00dcfc8322b32afdd58c18045d2","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"27e740aaab1b43b99c159f283c1d72b8839be00dcfc8322b32afdd58c18045d2","first_computed_at":"2026-05-18T03:54:17.018871Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:54:17.018871Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"Y60MknA06/bAqtr08Z/zglGN0ury1jDRViYK36ZLEC8aGF4+Np+JH9QS0+bf90ebCvyotLqPfb5s3KSXLK3AAQ==","signature_status":"signed_v1","signed_at":"2026-05-18T03:54:17.019332Z","signed_message":"canonical_sha256_bytes"},"source_id":"1206.0663","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:b0b4c6028ea3d275496e98d2d1aecd56641ca88d575f3635b6b62cacbfc40439","sha256:dac6275f4fd04e67d1db3066aad2de3b1682de790a4d5d532ac2f30d6a4e6429"],"state_sha256":"5ed9bd47618cc471ace76ada4d09cd195325723d014a3c4a05607dadad57aac1"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"TuDO0q+7nhHqJe3LguEv7F6KvofvjAemxrpwmHsxeKJsHsxMUntVWXFWwYehXPxjC22WjHP2p+loJRrnRHFnAA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-09T23:47:26.612436Z","bundle_sha256":"c71b8c1c583fb7d3d889f231ebdb09200c74cf43e989368418b557996eec8f84"}}