{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2013:H2ROARYVBAHEXK7NKDQF3XS62H","short_pith_number":"pith:H2ROARYV","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"},"canonical_sha256":"3ea2e04715080e4babed50e05dde5ed1d1f32b5e5485bd61f619549cdc2b9468","source":{"kind":"arxiv","id":"1302.6288","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1302.6288","created_at":"2026-05-18T03:21:23Z"},{"alias_kind":"arxiv_version","alias_value":"1302.6288v2","created_at":"2026-05-18T03:21:23Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1302.6288","created_at":"2026-05-18T03:21:23Z"},{"alias_kind":"pith_short_12","alias_value":"H2ROARYVBAHE","created_at":"2026-05-18T12:27:46Z"},{"alias_kind":"pith_short_16","alias_value":"H2ROARYVBAHEXK7N","created_at":"2026-05-18T12:27:46Z"},{"alias_kind":"pith_short_8","alias_value":"H2ROARYV","created_at":"2026-05-18T12:27:46Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2013:H2ROARYVBAHEXK7NKDQF3XS62H","target":"record","payload":{"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"},"canonical_sha256":"3ea2e04715080e4babed50e05dde5ed1d1f32b5e5485bd61f619549cdc2b9468","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"},"source_kind":"arxiv","source_id":"1302.6288","source_version":2,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T03:21:23Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"8KMlnW1AoW1XxVcvyy9/JUfqeEnwaEWzxRC/brLgQVtmEMcS4Yh1vrZiXCebYuLEDc20ZqSn3n7FS9d9yfuXDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-20T05:14:07.766362Z"},"content_sha256":"855d77ab7cdcdae0c670fecb2646c05f9028c359830e44c69e4f51d5d4301db8","schema_version":"1.0","event_id":"sha256:855d77ab7cdcdae0c670fecb2646c05f9028c359830e44c69e4f51d5d4301db8"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2013:H2ROARYVBAHEXK7NKDQF3XS62H","target":"graph","payload":{"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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T03:21:23Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"/DbgIxUHW3ao9yhNcmjbAu+wYq9m1xzAmnJcvo/UZ+Z1BgvaQA7eL/TVskoJg3Hgs/Z1ebotCidWus8V/QI4DQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-20T05:14:07.766711Z"},"content_sha256":"8f6a6ba7e8a881fd730a2dec73dd721a636757d8aa0ffdbf978f38f28a546ce5","schema_version":"1.0","event_id":"sha256:8f6a6ba7e8a881fd730a2dec73dd721a636757d8aa0ffdbf978f38f28a546ce5"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/H2ROARYVBAHEXK7NKDQF3XS62H/bundle.json","state_url":"https://pith.science/pith/H2ROARYVBAHEXK7NKDQF3XS62H/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/H2ROARYVBAHEXK7NKDQF3XS62H/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-06-20T05:14:07Z","links":{"resolver":"https://pith.science/pith/H2ROARYVBAHEXK7NKDQF3XS62H","bundle":"https://pith.science/pith/H2ROARYVBAHEXK7NKDQF3XS62H/bundle.json","state":"https://pith.science/pith/H2ROARYVBAHEXK7NKDQF3XS62H/state.json","well_known_bundle":"https://pith.science/.well-known/pith/H2ROARYVBAHEXK7NKDQF3XS62H/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2013:H2ROARYVBAHEXK7NKDQF3XS62H","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"8045f8b46a0323b442af8e00417315eaaacc2d3505540c4969ab39b4ea48b295","cross_cats_sorted":["math.IT","math.NA"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2013-02-26T01:23:50Z","title_canon_sha256":"9ec1d8d8859434ab481f93c8dff31c78d63d48ff56f4edcd8e0c106abeaa35b2"},"schema_version":"1.0","source":{"id":"1302.6288","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1302.6288","created_at":"2026-05-18T03:21:23Z"},{"alias_kind":"arxiv_version","alias_value":"1302.6288v2","created_at":"2026-05-18T03:21:23Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1302.6288","created_at":"2026-05-18T03:21:23Z"},{"alias_kind":"pith_short_12","alias_value":"H2ROARYVBAHE","created_at":"2026-05-18T12:27:46Z"},{"alias_kind":"pith_short_16","alias_value":"H2ROARYVBAHEXK7N","created_at":"2026-05-18T12:27:46Z"},{"alias_kind":"pith_short_8","alias_value":"H2ROARYV","created_at":"2026-05-18T12:27:46Z"}],"graph_snapshots":[{"event_id":"sha256:8f6a6ba7e8a881fd730a2dec73dd721a636757d8aa0ffdbf978f38f28a546ce5","target":"graph","created_at":"2026-05-18T03:21:23Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"paper":{"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.","authors_text":"Deanna Needell, Laurent Demanet, Nam Nguyen","cross_cats":["math.IT","math.NA"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2013-02-26T01:23:50Z","title":"Super-resolution via superset selection and pruning"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1302.6288","kind":"arxiv","version":2},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:855d77ab7cdcdae0c670fecb2646c05f9028c359830e44c69e4f51d5d4301db8","target":"record","created_at":"2026-05-18T03:21:23Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"8045f8b46a0323b442af8e00417315eaaacc2d3505540c4969ab39b4ea48b295","cross_cats_sorted":["math.IT","math.NA"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2013-02-26T01:23:50Z","title_canon_sha256":"9ec1d8d8859434ab481f93c8dff31c78d63d48ff56f4edcd8e0c106abeaa35b2"},"schema_version":"1.0","source":{"id":"1302.6288","kind":"arxiv","version":2}},"canonical_sha256":"3ea2e04715080e4babed50e05dde5ed1d1f32b5e5485bd61f619549cdc2b9468","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"3ea2e04715080e4babed50e05dde5ed1d1f32b5e5485bd61f619549cdc2b9468","first_computed_at":"2026-05-18T03:21:23.633104Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:21:23.633104Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"d9a2H4Fbmzx9tOPto+4fnQb0vr9BM6SricdVIYbogMV+siMY5RswOEYLP1iB+E09zhHKQWLqRI0h8oLeytrRAQ==","signature_status":"signed_v1","signed_at":"2026-05-18T03:21:23.633671Z","signed_message":"canonical_sha256_bytes"},"source_id":"1302.6288","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:855d77ab7cdcdae0c670fecb2646c05f9028c359830e44c69e4f51d5d4301db8","sha256:8f6a6ba7e8a881fd730a2dec73dd721a636757d8aa0ffdbf978f38f28a546ce5"],"state_sha256":"8b65d733b9f2a0c504e8d1b816a18378e22f8ade68538cee0e4aad51d9e4660b"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"24gLf0mGNGyWTp0aiqLJORt7Uk0V4kKlKEhR8KxSOxtjZsp1VQJKu0x9a4kPkvWgXHV+uXSxyBaZa1mqjD9QBg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-20T05:14:07.768750Z","bundle_sha256":"dcda6f48dccda7315b6df49f4ffd7e0e00a32d721083e5afdc4b6ce8f3648df6"}}