{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:R6VXB65K27MB6IYAH45JFLJLNU","short_pith_number":"pith:R6VXB65K","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"},"canonical_sha256":"8fab70fbaad7d81f23003f3a92ad2b6d248248107e57cb984cd2588e3c2eb856","source":{"kind":"arxiv","id":"1507.07034","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1507.07034","created_at":"2026-05-18T01:04:57Z"},{"alias_kind":"arxiv_version","alias_value":"1507.07034v2","created_at":"2026-05-18T01:04:57Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1507.07034","created_at":"2026-05-18T01:04:57Z"},{"alias_kind":"pith_short_12","alias_value":"R6VXB65K27MB","created_at":"2026-05-18T12:29:39Z"},{"alias_kind":"pith_short_16","alias_value":"R6VXB65K27MB6IYA","created_at":"2026-05-18T12:29:39Z"},{"alias_kind":"pith_short_8","alias_value":"R6VXB65K","created_at":"2026-05-18T12:29:39Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:R6VXB65K27MB6IYAH45JFLJLNU","target":"record","payload":{"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"},"canonical_sha256":"8fab70fbaad7d81f23003f3a92ad2b6d248248107e57cb984cd2588e3c2eb856","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"},"source_kind":"arxiv","source_id":"1507.07034","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-18T01:04:57Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"RxzeJpIoOIEJ+CNt2RAhFmSrduClzXzzovoFnhg9Hl+2VRzV11eaR4MJzIJtloQxo/eqgSyLYGYcnKEUWyuiAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-25T08:15:35.033200Z"},"content_sha256":"4a7c882b7296530eb79be89559be59c923a952608a51f50e4ad95d55c6542ca1","schema_version":"1.0","event_id":"sha256:4a7c882b7296530eb79be89559be59c923a952608a51f50e4ad95d55c6542ca1"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:R6VXB65K27MB6IYAH45JFLJLNU","target":"graph","payload":{"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"},"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-18T01:04:57Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"5NVYhcWe9Z1fWqFVHoNQfNI1HGDQqFCe0sDKaeO9OXW6grfMdLVKqL5x5I5O3f0MoMCyGqWl3bNRkW4q5NcLDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-25T08:15:35.033731Z"},"content_sha256":"f2eccc9fdab2c5d4e86fab09a05802e2d2f4e804cc7de6f84537b011600351b9","schema_version":"1.0","event_id":"sha256:f2eccc9fdab2c5d4e86fab09a05802e2d2f4e804cc7de6f84537b011600351b9"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/R6VXB65K27MB6IYAH45JFLJLNU/bundle.json","state_url":"https://pith.science/pith/R6VXB65K27MB6IYAH45JFLJLNU/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/R6VXB65K27MB6IYAH45JFLJLNU/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-25T08:15:35Z","links":{"resolver":"https://pith.science/pith/R6VXB65K27MB6IYAH45JFLJLNU","bundle":"https://pith.science/pith/R6VXB65K27MB6IYAH45JFLJLNU/bundle.json","state":"https://pith.science/pith/R6VXB65K27MB6IYAH45JFLJLNU/state.json","well_known_bundle":"https://pith.science/.well-known/pith/R6VXB65K27MB6IYAH45JFLJLNU/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:R6VXB65K27MB6IYAH45JFLJLNU","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":"8b4456799133d0e6bf4a862d75f34f29c629e441a795465c1386fa5df1d0fd81","cross_cats_sorted":["cs.IT","math.IT","math.NA"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2015-07-24T22:11:11Z","title_canon_sha256":"acc21bf0a203996b813db293803d41bb4e8bb28da4e8fd086fd8b0e2eecdfc8d"},"schema_version":"1.0","source":{"id":"1507.07034","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1507.07034","created_at":"2026-05-18T01:04:57Z"},{"alias_kind":"arxiv_version","alias_value":"1507.07034v2","created_at":"2026-05-18T01:04:57Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1507.07034","created_at":"2026-05-18T01:04:57Z"},{"alias_kind":"pith_short_12","alias_value":"R6VXB65K27MB","created_at":"2026-05-18T12:29:39Z"},{"alias_kind":"pith_short_16","alias_value":"R6VXB65K27MB6IYA","created_at":"2026-05-18T12:29:39Z"},{"alias_kind":"pith_short_8","alias_value":"R6VXB65K","created_at":"2026-05-18T12:29:39Z"}],"graph_snapshots":[{"event_id":"sha256:f2eccc9fdab2c5d4e86fab09a05802e2d2f4e804cc7de6f84537b011600351b9","target":"graph","created_at":"2026-05-18T01:04:57Z","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 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 ","authors_text":"Carlos Fernandez-Granda","cross_cats":["cs.IT","math.IT","math.NA"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2015-07-24T22:11:11Z","title":"Super-Resolution of Point Sources via Convex Programming"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1507.07034","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:4a7c882b7296530eb79be89559be59c923a952608a51f50e4ad95d55c6542ca1","target":"record","created_at":"2026-05-18T01:04:57Z","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":"8b4456799133d0e6bf4a862d75f34f29c629e441a795465c1386fa5df1d0fd81","cross_cats_sorted":["cs.IT","math.IT","math.NA"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2015-07-24T22:11:11Z","title_canon_sha256":"acc21bf0a203996b813db293803d41bb4e8bb28da4e8fd086fd8b0e2eecdfc8d"},"schema_version":"1.0","source":{"id":"1507.07034","kind":"arxiv","version":2}},"canonical_sha256":"8fab70fbaad7d81f23003f3a92ad2b6d248248107e57cb984cd2588e3c2eb856","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"8fab70fbaad7d81f23003f3a92ad2b6d248248107e57cb984cd2588e3c2eb856","first_computed_at":"2026-05-18T01:04:57.873271Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:04:57.873271Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"5ZB2hUUpzDbE6chz2balOpAKgk/whe3ZBwPnW7J31p7b/3ZAJiZxsmNL7/0lJ8gkpuc1B1vmO0STvZD5HOosCw==","signature_status":"signed_v1","signed_at":"2026-05-18T01:04:57.874020Z","signed_message":"canonical_sha256_bytes"},"source_id":"1507.07034","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:4a7c882b7296530eb79be89559be59c923a952608a51f50e4ad95d55c6542ca1","sha256:f2eccc9fdab2c5d4e86fab09a05802e2d2f4e804cc7de6f84537b011600351b9"],"state_sha256":"3dcbfee0de16e5e56283c630301ce1d46c5eab4d7d54b6c982170875354c5a78"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Qed5DJN4ogSWN6T4+nf9Mzqac5/BPfgI+lRc5FRq91yXd56mJ7qMZZ9XS4uSEeUUOAc5hgtLL1qX/ep2H2/3DQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-25T08:15:35.036001Z","bundle_sha256":"a77e5faf9a6a4306b7da133ca75106daa239a6b5d6af0d7b416e787b7683d43f"}}