{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2012:57VU2OW5DTLJ6QMHOSO6YARSAH","short_pith_number":"pith:57VU2OW5","canonical_record":{"source":{"id":"1201.3302","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2012-01-16T16:10:42Z","cross_cats_sorted":[],"title_canon_sha256":"98940139afab6fde833fc41e1f8d36877cf3c1e1e29f2290232ab553cfb68a70","abstract_canon_sha256":"42f9f6a135026d62a0fb2d33c44b7a93a0dc7fa45025c996403053b2bbfa83be"},"schema_version":"1.0"},"canonical_sha256":"efeb4d3add1cd69f4187749dec023201da855e6f8deb14553bf020cb93a3e0f4","source":{"kind":"arxiv","id":"1201.3302","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1201.3302","created_at":"2026-05-18T03:58:38Z"},{"alias_kind":"arxiv_version","alias_value":"1201.3302v2","created_at":"2026-05-18T03:58:38Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1201.3302","created_at":"2026-05-18T03:58:38Z"},{"alias_kind":"pith_short_12","alias_value":"57VU2OW5DTLJ","created_at":"2026-05-18T12:26:53Z"},{"alias_kind":"pith_short_16","alias_value":"57VU2OW5DTLJ6QMH","created_at":"2026-05-18T12:26:53Z"},{"alias_kind":"pith_short_8","alias_value":"57VU2OW5","created_at":"2026-05-18T12:26:53Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2012:57VU2OW5DTLJ6QMHOSO6YARSAH","target":"record","payload":{"canonical_record":{"source":{"id":"1201.3302","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2012-01-16T16:10:42Z","cross_cats_sorted":[],"title_canon_sha256":"98940139afab6fde833fc41e1f8d36877cf3c1e1e29f2290232ab553cfb68a70","abstract_canon_sha256":"42f9f6a135026d62a0fb2d33c44b7a93a0dc7fa45025c996403053b2bbfa83be"},"schema_version":"1.0"},"canonical_sha256":"efeb4d3add1cd69f4187749dec023201da855e6f8deb14553bf020cb93a3e0f4","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:58:38.033007Z","signature_b64":"Z5TafmkeH+/q5lM4k+hgmHYtXIRrayj0KiHCjE8tEjt4bi8Y7pnbh3ibWBXKS99EGoNXgd8KIjwXb8piQqXMDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"efeb4d3add1cd69f4187749dec023201da855e6f8deb14553bf020cb93a3e0f4","last_reissued_at":"2026-05-18T03:58:38.032481Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:58:38.032481Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1201.3302","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-18T03:58:38Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Gis00667q30itl2BieAzBshiA+2g22+GGWechB62SSVmTxeY/un5pBpkkoV+lGoCD0JRTcigHkp3u3wwxm5IDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-11T23:33:55.109288Z"},"content_sha256":"38725c7fd9e6be4e94d575375e20c29e67c17af4fc95689ea0d3990545c917e5","schema_version":"1.0","event_id":"sha256:38725c7fd9e6be4e94d575375e20c29e67c17af4fc95689ea0d3990545c917e5"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2012:57VU2OW5DTLJ6QMHOSO6YARSAH","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"A General Framework of Dual Certificate Analysis for Structured Sparse Recovery Problems","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"stat.ML","authors_text":"Cun-Hui Zhang, Tong Zhang","submitted_at":"2012-01-16T16:10:42Z","abstract_excerpt":"This paper develops a general theoretical framework to analyze structured sparse recovery problems using the notation of dual certificate. Although certain aspects of the dual certificate idea have already been used in some previous work, due to the lack of a general and coherent theory, the analysis has so far only been carried out in limited scopes for specific problems. In this context the current paper makes two contributions. First, we introduce a general definition of dual certificate, which we then use to develop a unified theory of sparse recovery analysis for convex programming. Secon"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1201.3302","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-18T03:58:38Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"H3hz1o2hpycjrlDpn3N/mbpm0nk2Dm2xh3E8f/y4b1P8N+elmcD4LWOdeQQUXxfPw7v59uW/FaLNlDb4/95OBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-11T23:33:55.109957Z"},"content_sha256":"19445bc4b1fb05b6956f0097261bb7fefec0b613f44370e720ef928cd2ae39b4","schema_version":"1.0","event_id":"sha256:19445bc4b1fb05b6956f0097261bb7fefec0b613f44370e720ef928cd2ae39b4"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/57VU2OW5DTLJ6QMHOSO6YARSAH/bundle.json","state_url":"https://pith.science/pith/57VU2OW5DTLJ6QMHOSO6YARSAH/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/57VU2OW5DTLJ6QMHOSO6YARSAH/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-11T23:33:55Z","links":{"resolver":"https://pith.science/pith/57VU2OW5DTLJ6QMHOSO6YARSAH","bundle":"https://pith.science/pith/57VU2OW5DTLJ6QMHOSO6YARSAH/bundle.json","state":"https://pith.science/pith/57VU2OW5DTLJ6QMHOSO6YARSAH/state.json","well_known_bundle":"https://pith.science/.well-known/pith/57VU2OW5DTLJ6QMHOSO6YARSAH/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2012:57VU2OW5DTLJ6QMHOSO6YARSAH","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":"42f9f6a135026d62a0fb2d33c44b7a93a0dc7fa45025c996403053b2bbfa83be","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2012-01-16T16:10:42Z","title_canon_sha256":"98940139afab6fde833fc41e1f8d36877cf3c1e1e29f2290232ab553cfb68a70"},"schema_version":"1.0","source":{"id":"1201.3302","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1201.3302","created_at":"2026-05-18T03:58:38Z"},{"alias_kind":"arxiv_version","alias_value":"1201.3302v2","created_at":"2026-05-18T03:58:38Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1201.3302","created_at":"2026-05-18T03:58:38Z"},{"alias_kind":"pith_short_12","alias_value":"57VU2OW5DTLJ","created_at":"2026-05-18T12:26:53Z"},{"alias_kind":"pith_short_16","alias_value":"57VU2OW5DTLJ6QMH","created_at":"2026-05-18T12:26:53Z"},{"alias_kind":"pith_short_8","alias_value":"57VU2OW5","created_at":"2026-05-18T12:26:53Z"}],"graph_snapshots":[{"event_id":"sha256:19445bc4b1fb05b6956f0097261bb7fefec0b613f44370e720ef928cd2ae39b4","target":"graph","created_at":"2026-05-18T03:58:38Z","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":"This paper develops a general theoretical framework to analyze structured sparse recovery problems using the notation of dual certificate. Although certain aspects of the dual certificate idea have already been used in some previous work, due to the lack of a general and coherent theory, the analysis has so far only been carried out in limited scopes for specific problems. In this context the current paper makes two contributions. First, we introduce a general definition of dual certificate, which we then use to develop a unified theory of sparse recovery analysis for convex programming. Secon","authors_text":"Cun-Hui Zhang, Tong Zhang","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2012-01-16T16:10:42Z","title":"A General Framework of Dual Certificate Analysis for Structured Sparse Recovery Problems"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1201.3302","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:38725c7fd9e6be4e94d575375e20c29e67c17af4fc95689ea0d3990545c917e5","target":"record","created_at":"2026-05-18T03:58:38Z","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":"42f9f6a135026d62a0fb2d33c44b7a93a0dc7fa45025c996403053b2bbfa83be","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2012-01-16T16:10:42Z","title_canon_sha256":"98940139afab6fde833fc41e1f8d36877cf3c1e1e29f2290232ab553cfb68a70"},"schema_version":"1.0","source":{"id":"1201.3302","kind":"arxiv","version":2}},"canonical_sha256":"efeb4d3add1cd69f4187749dec023201da855e6f8deb14553bf020cb93a3e0f4","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"efeb4d3add1cd69f4187749dec023201da855e6f8deb14553bf020cb93a3e0f4","first_computed_at":"2026-05-18T03:58:38.032481Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:58:38.032481Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"Z5TafmkeH+/q5lM4k+hgmHYtXIRrayj0KiHCjE8tEjt4bi8Y7pnbh3ibWBXKS99EGoNXgd8KIjwXb8piQqXMDw==","signature_status":"signed_v1","signed_at":"2026-05-18T03:58:38.033007Z","signed_message":"canonical_sha256_bytes"},"source_id":"1201.3302","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:38725c7fd9e6be4e94d575375e20c29e67c17af4fc95689ea0d3990545c917e5","sha256:19445bc4b1fb05b6956f0097261bb7fefec0b613f44370e720ef928cd2ae39b4"],"state_sha256":"fab289be26925c2ab0e3148775c00d4a5fb51e167c685d41b4725b525a449ca9"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ara2hjDSLlndAN3W4qxyQb9f/YKvGwcSTtkeqMWa2t8WMme7ny4k5UtWNGVV97aCBRSi1wfo7z52tv3lgQsrAg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-11T23:33:55.113838Z","bundle_sha256":"43eff5ac476899d615643d834095ba52943a48ca99833028b49b85a6187d21f4"}}