{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:MS4GVWOHK6TLWX5X5WWPSLLZVP","short_pith_number":"pith:MS4GVWOH","schema_version":"1.0","canonical_sha256":"64b86ad9c757a6bb5fb7edacf92d79abf4a7ef0587cea039ef95ccc168dfaaa0","source":{"kind":"arxiv","id":"1502.01385","version":1},"attestation_state":"computed","paper":{"title":"The recoverability limit for superresolution via sparsity","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT","math.NA"],"primary_cat":"cs.IT","authors_text":"Laurent Demanet, Nam Nguyen","submitted_at":"2015-02-04T22:43:10Z","abstract_excerpt":"We consider the problem of robustly recovering a $k$-sparse coefficient vector from the Fourier series that it generates, restricted to the interval $[- \\Omega, \\Omega]$. The difficulty of this problem is linked to the superresolution factor SRF, equal to the ratio of the Rayleigh length (inverse of $\\Omega$) by the spacing of the grid supporting the sparse vector. In the presence of additive deterministic noise of norm $\\sigma$, we show upper and lower bounds on the minimax error rate that both scale like $(SRF)^{2k-1} \\sigma$, providing a partial answer to a question posed by Donoho in 1992."},"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":"1502.01385","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2015-02-04T22:43:10Z","cross_cats_sorted":["math.IT","math.NA"],"title_canon_sha256":"ebdf5ae4095c789022224f3f8ca71ed5ec21ea13d8e016c562d7a3a61d32399f","abstract_canon_sha256":"818077ab879168e672cc840cc1b9a292492e023f7f3096d106da067f6c869db9"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:27:56.643835Z","signature_b64":"sFqz0orJkHAvZ3qiMeoqVAgWnnBoNY3ItIwtfoy4XKymCFM4uf4F7eX/RHl2gRHNyNNMOw9M7tDhGLq6Iu7PCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"64b86ad9c757a6bb5fb7edacf92d79abf4a7ef0587cea039ef95ccc168dfaaa0","last_reissued_at":"2026-05-18T02:27:56.643412Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:27:56.643412Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"The recoverability limit for superresolution via sparsity","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT","math.NA"],"primary_cat":"cs.IT","authors_text":"Laurent Demanet, Nam Nguyen","submitted_at":"2015-02-04T22:43:10Z","abstract_excerpt":"We consider the problem of robustly recovering a $k$-sparse coefficient vector from the Fourier series that it generates, restricted to the interval $[- \\Omega, \\Omega]$. The difficulty of this problem is linked to the superresolution factor SRF, equal to the ratio of the Rayleigh length (inverse of $\\Omega$) by the spacing of the grid supporting the sparse vector. In the presence of additive deterministic noise of norm $\\sigma$, we show upper and lower bounds on the minimax error rate that both scale like $(SRF)^{2k-1} \\sigma$, providing a partial answer to a question posed by Donoho in 1992."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1502.01385","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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1502.01385","created_at":"2026-05-18T02:27:56.643479+00:00"},{"alias_kind":"arxiv_version","alias_value":"1502.01385v1","created_at":"2026-05-18T02:27:56.643479+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1502.01385","created_at":"2026-05-18T02:27:56.643479+00:00"},{"alias_kind":"pith_short_12","alias_value":"MS4GVWOHK6TL","created_at":"2026-05-18T12:29:32.376354+00:00"},{"alias_kind":"pith_short_16","alias_value":"MS4GVWOHK6TLWX5X","created_at":"2026-05-18T12:29:32.376354+00:00"},{"alias_kind":"pith_short_8","alias_value":"MS4GVWOH","created_at":"2026-05-18T12:29:32.376354+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":2,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2605.04601","citing_title":"Two-Point Resolution in Spectral Super-Resolution","ref_index":49,"is_internal_anchor":false},{"citing_arxiv_id":"2604.15135","citing_title":"On the exponential rate of the condition number of Fourier submatrices and Vandermonde matrices","ref_index":13,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/MS4GVWOHK6TLWX5X5WWPSLLZVP","json":"https://pith.science/pith/MS4GVWOHK6TLWX5X5WWPSLLZVP.json","graph_json":"https://pith.science/api/pith-number/MS4GVWOHK6TLWX5X5WWPSLLZVP/graph.json","events_json":"https://pith.science/api/pith-number/MS4GVWOHK6TLWX5X5WWPSLLZVP/events.json","paper":"https://pith.science/paper/MS4GVWOH"},"agent_actions":{"view_html":"https://pith.science/pith/MS4GVWOHK6TLWX5X5WWPSLLZVP","download_json":"https://pith.science/pith/MS4GVWOHK6TLWX5X5WWPSLLZVP.json","view_paper":"https://pith.science/paper/MS4GVWOH","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1502.01385&json=true","fetch_graph":"https://pith.science/api/pith-number/MS4GVWOHK6TLWX5X5WWPSLLZVP/graph.json","fetch_events":"https://pith.science/api/pith-number/MS4GVWOHK6TLWX5X5WWPSLLZVP/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/MS4GVWOHK6TLWX5X5WWPSLLZVP/action/timestamp_anchor","attest_storage":"https://pith.science/pith/MS4GVWOHK6TLWX5X5WWPSLLZVP/action/storage_attestation","attest_author":"https://pith.science/pith/MS4GVWOHK6TLWX5X5WWPSLLZVP/action/author_attestation","sign_citation":"https://pith.science/pith/MS4GVWOHK6TLWX5X5WWPSLLZVP/action/citation_signature","submit_replication":"https://pith.science/pith/MS4GVWOHK6TLWX5X5WWPSLLZVP/action/replication_record"}},"created_at":"2026-05-18T02:27:56.643479+00:00","updated_at":"2026-05-18T02:27:56.643479+00:00"}