{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2013:OHXTTTHQPQ3WKIR6HDZVMVAVOS","short_pith_number":"pith:OHXTTTHQ","schema_version":"1.0","canonical_sha256":"71ef39ccf07c3765223e38f356541574aedc1f702f99a11d9da4f1f567fa3c45","source":{"kind":"arxiv","id":"1302.3921","version":2},"attestation_state":"computed","paper":{"title":"Support detection in super-resolution","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT","math.NA","math.OC"],"primary_cat":"cs.IT","authors_text":"Carlos Fernandez-Granda","submitted_at":"2013-02-16T02:24:12Z","abstract_excerpt":"We study the problem of super-resolving a superposition of point sources from noisy low-pass data with a cut-off frequency f. Solving a tractable convex program is shown to locate the elements of the support with high precision as long as they are separated by 2/f and the noise level is small with respect to the amplitude of the signal."},"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":"1302.3921","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2013-02-16T02:24:12Z","cross_cats_sorted":["math.IT","math.NA","math.OC"],"title_canon_sha256":"71c61ad2040a6b3da2db7d62c05d4b6a633b37244390917bd7ebc1d9cca3f144","abstract_canon_sha256":"fd0fee26b7efdc5993a6286dc93ff0a1164a713dc0da00f66f971efce475685e"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:22:07.802752Z","signature_b64":"4dU+AnIdS9EO/c7Nt3A53IatApE0eW2cOaiN2qRoiQmH90uSiRqg9HbhLp/EmLyckNUPpYw70NIg3k6U4V5ZBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"71ef39ccf07c3765223e38f356541574aedc1f702f99a11d9da4f1f567fa3c45","last_reissued_at":"2026-05-18T03:22:07.801888Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:22:07.801888Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Support detection in super-resolution","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT","math.NA","math.OC"],"primary_cat":"cs.IT","authors_text":"Carlos Fernandez-Granda","submitted_at":"2013-02-16T02:24:12Z","abstract_excerpt":"We study the problem of super-resolving a superposition of point sources from noisy low-pass data with a cut-off frequency f. Solving a tractable convex program is shown to locate the elements of the support with high precision as long as they are separated by 2/f and the noise level is small with respect to the amplitude of the signal."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1302.3921","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":"1302.3921","created_at":"2026-05-18T03:22:07.802018+00:00"},{"alias_kind":"arxiv_version","alias_value":"1302.3921v2","created_at":"2026-05-18T03:22:07.802018+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1302.3921","created_at":"2026-05-18T03:22:07.802018+00:00"},{"alias_kind":"pith_short_12","alias_value":"OHXTTTHQPQ3W","created_at":"2026-05-18T12:27:54.935989+00:00"},{"alias_kind":"pith_short_16","alias_value":"OHXTTTHQPQ3WKIR6","created_at":"2026-05-18T12:27:54.935989+00:00"},{"alias_kind":"pith_short_8","alias_value":"OHXTTTHQ","created_at":"2026-05-18T12:27:54.935989+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/OHXTTTHQPQ3WKIR6HDZVMVAVOS","json":"https://pith.science/pith/OHXTTTHQPQ3WKIR6HDZVMVAVOS.json","graph_json":"https://pith.science/api/pith-number/OHXTTTHQPQ3WKIR6HDZVMVAVOS/graph.json","events_json":"https://pith.science/api/pith-number/OHXTTTHQPQ3WKIR6HDZVMVAVOS/events.json","paper":"https://pith.science/paper/OHXTTTHQ"},"agent_actions":{"view_html":"https://pith.science/pith/OHXTTTHQPQ3WKIR6HDZVMVAVOS","download_json":"https://pith.science/pith/OHXTTTHQPQ3WKIR6HDZVMVAVOS.json","view_paper":"https://pith.science/paper/OHXTTTHQ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1302.3921&json=true","fetch_graph":"https://pith.science/api/pith-number/OHXTTTHQPQ3WKIR6HDZVMVAVOS/graph.json","fetch_events":"https://pith.science/api/pith-number/OHXTTTHQPQ3WKIR6HDZVMVAVOS/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/OHXTTTHQPQ3WKIR6HDZVMVAVOS/action/timestamp_anchor","attest_storage":"https://pith.science/pith/OHXTTTHQPQ3WKIR6HDZVMVAVOS/action/storage_attestation","attest_author":"https://pith.science/pith/OHXTTTHQPQ3WKIR6HDZVMVAVOS/action/author_attestation","sign_citation":"https://pith.science/pith/OHXTTTHQPQ3WKIR6HDZVMVAVOS/action/citation_signature","submit_replication":"https://pith.science/pith/OHXTTTHQPQ3WKIR6HDZVMVAVOS/action/replication_record"}},"created_at":"2026-05-18T03:22:07.802018+00:00","updated_at":"2026-05-18T03:22:07.802018+00:00"}