{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:WVHNE4GI7W5BVLDDXBUUY7YNYW","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":"f22205fe780a0c537b6a496d99768dea4d29ecccf3b45e2591a241fb5aef803b","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2018-10-05T15:30:59Z","title_canon_sha256":"98550fd25326e603a93dc2b6b4417db14baad4e0cab6d027b035ed0ec314ff5e"},"schema_version":"1.0","source":{"id":"1810.02748","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1810.02748","created_at":"2026-07-05T01:59:08Z"},{"alias_kind":"arxiv_version","alias_value":"1810.02748v2","created_at":"2026-07-05T01:59:08Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1810.02748","created_at":"2026-07-05T01:59:08Z"},{"alias_kind":"pith_short_12","alias_value":"WVHNE4GI7W5B","created_at":"2026-07-05T01:59:08Z"},{"alias_kind":"pith_short_16","alias_value":"WVHNE4GI7W5BVLDD","created_at":"2026-07-05T01:59:08Z"},{"alias_kind":"pith_short_8","alias_value":"WVHNE4GI","created_at":"2026-07-05T01:59:08Z"}],"graph_snapshots":[{"event_id":"sha256:1b88036a872bf223840c57489f6e842fe8e1c0a0274e2e5a5d444ae11864929e","target":"graph","created_at":"2026-07-05T01:59:08Z","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"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/1810.02748/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"This paper provides a new tractable lower bound for the sparse recovery threshold of sensing matrices. This lower bound is used as a proxy to quantify the quality of sensing matrices in two different applications. First, it serves as regularization for the classical dictionary learning problem in order to learn dictionaries with better generalisation properties on unseen data. Then, the proxy is used to design sampling schemes for MRI acquisition that exhibit high reconstruction performances.","authors_text":"Alexandre d'Aspremont, Mathieu Barr\\'e","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2018-10-05T15:30:59Z","title":"An M* Proxy for Sparse Recovery Performance"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1810.02748","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:6ee7fc4b74c5682ac74decba57dd532ef1d82f518390e8ea1f1263d1406d1d8c","target":"record","created_at":"2026-07-05T01:59:08Z","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":"f22205fe780a0c537b6a496d99768dea4d29ecccf3b45e2591a241fb5aef803b","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2018-10-05T15:30:59Z","title_canon_sha256":"98550fd25326e603a93dc2b6b4417db14baad4e0cab6d027b035ed0ec314ff5e"},"schema_version":"1.0","source":{"id":"1810.02748","kind":"arxiv","version":2}},"canonical_sha256":"b54ed270c8fdba1aac63b8694c7f0dc5b07e7306f991c5cb24be23934bc5d58b","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"b54ed270c8fdba1aac63b8694c7f0dc5b07e7306f991c5cb24be23934bc5d58b","first_computed_at":"2026-07-05T01:59:08.317690Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T01:59:08.317690Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"VNWQZ0ubxC7imZKUnkZMt0MWr85RtaiMKjhevlrgjcJDWZB6jbyDOjSZmHbjeLDutgHKdhd2psFgzCwebJvBBA==","signature_status":"signed_v1","signed_at":"2026-07-05T01:59:08.318140Z","signed_message":"canonical_sha256_bytes"},"source_id":"1810.02748","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:6ee7fc4b74c5682ac74decba57dd532ef1d82f518390e8ea1f1263d1406d1d8c","sha256:1b88036a872bf223840c57489f6e842fe8e1c0a0274e2e5a5d444ae11864929e"],"state_sha256":"d62ff4b1aa52541913900c0c1756520106d9600c21b415330d769fb047440ca2"}