{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2013:H2ROARYVBAHEXK7NKDQF3XS62H","short_pith_number":"pith:H2ROARYV","schema_version":"1.0","canonical_sha256":"3ea2e04715080e4babed50e05dde5ed1d1f32b5e5485bd61f619549cdc2b9468","source":{"kind":"arxiv","id":"1302.6288","version":2},"attestation_state":"computed","paper":{"title":"Super-resolution via superset selection and pruning","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT","math.NA"],"primary_cat":"cs.IT","authors_text":"Deanna Needell, Laurent Demanet, Nam Nguyen","submitted_at":"2013-02-26T01:23:50Z","abstract_excerpt":"We present a pursuit-like algorithm that we call the \"superset method\" for recovery of sparse vectors from consecutive Fourier measurements in the super-resolution regime. The algorithm has a subspace identification step that hinges on the translation invariance of the Fourier transform, followed by a removal step to estimate the solution's support. The superset method is always successful in the noiseless regime (unlike L1-minimization) and generalizes to higher dimensions (unlike the matrix pencil method). Relative robustness to noise is demonstrated numerically."},"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.6288","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2013-02-26T01:23:50Z","cross_cats_sorted":["math.IT","math.NA"],"title_canon_sha256":"9ec1d8d8859434ab481f93c8dff31c78d63d48ff56f4edcd8e0c106abeaa35b2","abstract_canon_sha256":"8045f8b46a0323b442af8e00417315eaaacc2d3505540c4969ab39b4ea48b295"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:21:23.633671Z","signature_b64":"d9a2H4Fbmzx9tOPto+4fnQb0vr9BM6SricdVIYbogMV+siMY5RswOEYLP1iB+E09zhHKQWLqRI0h8oLeytrRAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"3ea2e04715080e4babed50e05dde5ed1d1f32b5e5485bd61f619549cdc2b9468","last_reissued_at":"2026-05-18T03:21:23.633104Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:21:23.633104Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Super-resolution via superset selection and pruning","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT","math.NA"],"primary_cat":"cs.IT","authors_text":"Deanna Needell, Laurent Demanet, Nam Nguyen","submitted_at":"2013-02-26T01:23:50Z","abstract_excerpt":"We present a pursuit-like algorithm that we call the \"superset method\" for recovery of sparse vectors from consecutive Fourier measurements in the super-resolution regime. The algorithm has a subspace identification step that hinges on the translation invariance of the Fourier transform, followed by a removal step to estimate the solution's support. The superset method is always successful in the noiseless regime (unlike L1-minimization) and generalizes to higher dimensions (unlike the matrix pencil method). Relative robustness to noise is demonstrated numerically."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1302.6288","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.6288","created_at":"2026-05-18T03:21:23.633191+00:00"},{"alias_kind":"arxiv_version","alias_value":"1302.6288v2","created_at":"2026-05-18T03:21:23.633191+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1302.6288","created_at":"2026-05-18T03:21:23.633191+00:00"},{"alias_kind":"pith_short_12","alias_value":"H2ROARYVBAHE","created_at":"2026-05-18T12:27:46.883200+00:00"},{"alias_kind":"pith_short_16","alias_value":"H2ROARYVBAHEXK7N","created_at":"2026-05-18T12:27:46.883200+00:00"},{"alias_kind":"pith_short_8","alias_value":"H2ROARYV","created_at":"2026-05-18T12:27:46.883200+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/H2ROARYVBAHEXK7NKDQF3XS62H","json":"https://pith.science/pith/H2ROARYVBAHEXK7NKDQF3XS62H.json","graph_json":"https://pith.science/api/pith-number/H2ROARYVBAHEXK7NKDQF3XS62H/graph.json","events_json":"https://pith.science/api/pith-number/H2ROARYVBAHEXK7NKDQF3XS62H/events.json","paper":"https://pith.science/paper/H2ROARYV"},"agent_actions":{"view_html":"https://pith.science/pith/H2ROARYVBAHEXK7NKDQF3XS62H","download_json":"https://pith.science/pith/H2ROARYVBAHEXK7NKDQF3XS62H.json","view_paper":"https://pith.science/paper/H2ROARYV","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1302.6288&json=true","fetch_graph":"https://pith.science/api/pith-number/H2ROARYVBAHEXK7NKDQF3XS62H/graph.json","fetch_events":"https://pith.science/api/pith-number/H2ROARYVBAHEXK7NKDQF3XS62H/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/H2ROARYVBAHEXK7NKDQF3XS62H/action/timestamp_anchor","attest_storage":"https://pith.science/pith/H2ROARYVBAHEXK7NKDQF3XS62H/action/storage_attestation","attest_author":"https://pith.science/pith/H2ROARYVBAHEXK7NKDQF3XS62H/action/author_attestation","sign_citation":"https://pith.science/pith/H2ROARYVBAHEXK7NKDQF3XS62H/action/citation_signature","submit_replication":"https://pith.science/pith/H2ROARYVBAHEXK7NKDQF3XS62H/action/replication_record"}},"created_at":"2026-05-18T03:21:23.633191+00:00","updated_at":"2026-05-18T03:21:23.633191+00:00"}