{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2013:J6MRTZSSQRJFILOR6HB3CDJOYI","short_pith_number":"pith:J6MRTZSS","schema_version":"1.0","canonical_sha256":"4f9919e6528452542dd1f1c3b10d2ec226a6173c9a2ec889e20c991738be53e5","source":{"kind":"arxiv","id":"1307.2342","version":2},"attestation_state":"computed","paper":{"title":"Model Selection with Low Complexity Priors","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.IT","math.IT","math.ST","stat.TH"],"primary_cat":"math.OC","authors_text":"Gabriel Peyr\\'e (CEREMADE), Jalal M. Fadili (GREYC), Mohammad Golbabaee (CEREMADE), Samuel Vaiter (CEREMADE)","submitted_at":"2013-07-09T06:27:47Z","abstract_excerpt":"Regularization plays a pivotal role when facing the challenge of solving ill-posed inverse problems, where the number of observations is smaller than the ambient dimension of the object to be estimated. A line of recent work has studied regularization models with various types of low-dimensional structures. In such settings, the general approach is to solve a regularized optimization problem, which combines a data fidelity term and some regularization penalty that promotes the assumed low-dimensional/simple structure. This paper provides a general framework to capture this low-dimensional stru"},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"canonical_record":{"source":{"id":"1307.2342","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2013-07-09T06:27:47Z","cross_cats_sorted":["cs.IT","math.IT","math.ST","stat.TH"],"title_canon_sha256":"98ceefd1d4d9a28d33cf920c71ca7835e3bc64f12e0806cce5a71970b66752eb","abstract_canon_sha256":"aff7a47f2901d37398ad599b42cb9c47ee25dfef94c84245cd51cc78e7b36c83"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:48:27.356863Z","signature_b64":"vqgS+0pwXyu+s2jXFtJxQsTO8FhVdFPs1xDMyBTMxtln7yYaFYGWhtpGp+agRdskivgVp1fAuzvrhfa2hsqjDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"4f9919e6528452542dd1f1c3b10d2ec226a6173c9a2ec889e20c991738be53e5","last_reissued_at":"2026-05-18T02:48:27.356122Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:48:27.356122Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Model Selection with Low Complexity Priors","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.IT","math.IT","math.ST","stat.TH"],"primary_cat":"math.OC","authors_text":"Gabriel Peyr\\'e (CEREMADE), Jalal M. Fadili (GREYC), Mohammad Golbabaee (CEREMADE), Samuel Vaiter (CEREMADE)","submitted_at":"2013-07-09T06:27:47Z","abstract_excerpt":"Regularization plays a pivotal role when facing the challenge of solving ill-posed inverse problems, where the number of observations is smaller than the ambient dimension of the object to be estimated. A line of recent work has studied regularization models with various types of low-dimensional structures. In such settings, the general approach is to solve a regularized optimization problem, which combines a data fidelity term and some regularization penalty that promotes the assumed low-dimensional/simple structure. This paper provides a general framework to capture this low-dimensional stru"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1307.2342","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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1307.2342","created_at":"2026-05-18T02:48:27.356242+00:00"},{"alias_kind":"arxiv_version","alias_value":"1307.2342v2","created_at":"2026-05-18T02:48:27.356242+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1307.2342","created_at":"2026-05-18T02:48:27.356242+00:00"},{"alias_kind":"pith_short_12","alias_value":"J6MRTZSSQRJF","created_at":"2026-05-18T12:27:49.015174+00:00"},{"alias_kind":"pith_short_16","alias_value":"J6MRTZSSQRJFILOR","created_at":"2026-05-18T12:27:49.015174+00:00"},{"alias_kind":"pith_short_8","alias_value":"J6MRTZSS","created_at":"2026-05-18T12:27:49.015174+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/J6MRTZSSQRJFILOR6HB3CDJOYI","json":"https://pith.science/pith/J6MRTZSSQRJFILOR6HB3CDJOYI.json","graph_json":"https://pith.science/api/pith-number/J6MRTZSSQRJFILOR6HB3CDJOYI/graph.json","events_json":"https://pith.science/api/pith-number/J6MRTZSSQRJFILOR6HB3CDJOYI/events.json","paper":"https://pith.science/paper/J6MRTZSS"},"agent_actions":{"view_html":"https://pith.science/pith/J6MRTZSSQRJFILOR6HB3CDJOYI","download_json":"https://pith.science/pith/J6MRTZSSQRJFILOR6HB3CDJOYI.json","view_paper":"https://pith.science/paper/J6MRTZSS","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1307.2342&json=true","fetch_graph":"https://pith.science/api/pith-number/J6MRTZSSQRJFILOR6HB3CDJOYI/graph.json","fetch_events":"https://pith.science/api/pith-number/J6MRTZSSQRJFILOR6HB3CDJOYI/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/J6MRTZSSQRJFILOR6HB3CDJOYI/action/timestamp_anchor","attest_storage":"https://pith.science/pith/J6MRTZSSQRJFILOR6HB3CDJOYI/action/storage_attestation","attest_author":"https://pith.science/pith/J6MRTZSSQRJFILOR6HB3CDJOYI/action/author_attestation","sign_citation":"https://pith.science/pith/J6MRTZSSQRJFILOR6HB3CDJOYI/action/citation_signature","submit_replication":"https://pith.science/pith/J6MRTZSSQRJFILOR6HB3CDJOYI/action/replication_record"}},"created_at":"2026-05-18T02:48:27.356242+00:00","updated_at":"2026-05-18T02:48:27.356242+00:00"}