{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:R6VXB65K27MB6IYAH45JFLJLNU","short_pith_number":"pith:R6VXB65K","schema_version":"1.0","canonical_sha256":"8fab70fbaad7d81f23003f3a92ad2b6d248248107e57cb984cd2588e3c2eb856","source":{"kind":"arxiv","id":"1507.07034","version":2},"attestation_state":"computed","paper":{"title":"Super-Resolution of Point Sources via Convex Programming","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.IT","math.IT","math.NA"],"primary_cat":"math.OC","authors_text":"Carlos Fernandez-Granda","submitted_at":"2015-07-24T22:11:11Z","abstract_excerpt":"We consider the problem of recovering a signal consisting of a superposition of point sources from low-resolution data with a cut-off frequency f. If the distance between the sources is under 1/f, this problem is not well posed in the sense that the low-pass data corresponding to two different signals may be practically the same. We show that minimizing a continuous version of the l1 norm achieves exact recovery as long as the sources are separated by at least 1.26/f. The proof is based on the construction of a dual certificate for the optimization problem, which can be used to establish that "},"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":"1507.07034","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2015-07-24T22:11:11Z","cross_cats_sorted":["cs.IT","math.IT","math.NA"],"title_canon_sha256":"acc21bf0a203996b813db293803d41bb4e8bb28da4e8fd086fd8b0e2eecdfc8d","abstract_canon_sha256":"8b4456799133d0e6bf4a862d75f34f29c629e441a795465c1386fa5df1d0fd81"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:04:57.874020Z","signature_b64":"5ZB2hUUpzDbE6chz2balOpAKgk/whe3ZBwPnW7J31p7b/3ZAJiZxsmNL7/0lJ8gkpuc1B1vmO0STvZD5HOosCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"8fab70fbaad7d81f23003f3a92ad2b6d248248107e57cb984cd2588e3c2eb856","last_reissued_at":"2026-05-18T01:04:57.873271Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:04:57.873271Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Super-Resolution of Point Sources via Convex Programming","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.IT","math.IT","math.NA"],"primary_cat":"math.OC","authors_text":"Carlos Fernandez-Granda","submitted_at":"2015-07-24T22:11:11Z","abstract_excerpt":"We consider the problem of recovering a signal consisting of a superposition of point sources from low-resolution data with a cut-off frequency f. If the distance between the sources is under 1/f, this problem is not well posed in the sense that the low-pass data corresponding to two different signals may be practically the same. We show that minimizing a continuous version of the l1 norm achieves exact recovery as long as the sources are separated by at least 1.26/f. The proof is based on the construction of a dual certificate for the optimization problem, which can be used to establish that "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1507.07034","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":"1507.07034","created_at":"2026-05-18T01:04:57.873417+00:00"},{"alias_kind":"arxiv_version","alias_value":"1507.07034v2","created_at":"2026-05-18T01:04:57.873417+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1507.07034","created_at":"2026-05-18T01:04:57.873417+00:00"},{"alias_kind":"pith_short_12","alias_value":"R6VXB65K27MB","created_at":"2026-05-18T12:29:39.896362+00:00"},{"alias_kind":"pith_short_16","alias_value":"R6VXB65K27MB6IYA","created_at":"2026-05-18T12:29:39.896362+00:00"},{"alias_kind":"pith_short_8","alias_value":"R6VXB65K","created_at":"2026-05-18T12:29:39.896362+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/R6VXB65K27MB6IYAH45JFLJLNU","json":"https://pith.science/pith/R6VXB65K27MB6IYAH45JFLJLNU.json","graph_json":"https://pith.science/api/pith-number/R6VXB65K27MB6IYAH45JFLJLNU/graph.json","events_json":"https://pith.science/api/pith-number/R6VXB65K27MB6IYAH45JFLJLNU/events.json","paper":"https://pith.science/paper/R6VXB65K"},"agent_actions":{"view_html":"https://pith.science/pith/R6VXB65K27MB6IYAH45JFLJLNU","download_json":"https://pith.science/pith/R6VXB65K27MB6IYAH45JFLJLNU.json","view_paper":"https://pith.science/paper/R6VXB65K","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1507.07034&json=true","fetch_graph":"https://pith.science/api/pith-number/R6VXB65K27MB6IYAH45JFLJLNU/graph.json","fetch_events":"https://pith.science/api/pith-number/R6VXB65K27MB6IYAH45JFLJLNU/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/R6VXB65K27MB6IYAH45JFLJLNU/action/timestamp_anchor","attest_storage":"https://pith.science/pith/R6VXB65K27MB6IYAH45JFLJLNU/action/storage_attestation","attest_author":"https://pith.science/pith/R6VXB65K27MB6IYAH45JFLJLNU/action/author_attestation","sign_citation":"https://pith.science/pith/R6VXB65K27MB6IYAH45JFLJLNU/action/citation_signature","submit_replication":"https://pith.science/pith/R6VXB65K27MB6IYAH45JFLJLNU/action/replication_record"}},"created_at":"2026-05-18T01:04:57.873417+00:00","updated_at":"2026-05-18T01:04:57.873417+00:00"}