{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:OZQHO7X4U4U7DMV35CQQWGBLIS","short_pith_number":"pith:OZQHO7X4","canonical_record":{"source":{"id":"1809.00658","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NA","submitted_at":"2018-09-03T17:02:55Z","cross_cats_sorted":["cs.IT","cs.NA","math.IT"],"title_canon_sha256":"a928e2c7c683e717a41e03e2286d6f86f86d1516fba28fe85724fadf2f1a313a","abstract_canon_sha256":"8f0326a575f24c731dac6a2e6af492800daacc81127a05d92daa273542895d01"},"schema_version":"1.0"},"canonical_sha256":"7660777efca729f1b2bbe8a10b182b44901de284e7b317cc5afc5fa68b54a960","source":{"kind":"arxiv","id":"1809.00658","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1809.00658","created_at":"2026-05-17T23:42:58Z"},{"alias_kind":"arxiv_version","alias_value":"1809.00658v2","created_at":"2026-05-17T23:42:58Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1809.00658","created_at":"2026-05-17T23:42:58Z"},{"alias_kind":"pith_short_12","alias_value":"OZQHO7X4U4U7","created_at":"2026-05-18T12:32:43Z"},{"alias_kind":"pith_short_16","alias_value":"OZQHO7X4U4U7DMV3","created_at":"2026-05-18T12:32:43Z"},{"alias_kind":"pith_short_8","alias_value":"OZQHO7X4","created_at":"2026-05-18T12:32:43Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:OZQHO7X4U4U7DMV35CQQWGBLIS","target":"record","payload":{"canonical_record":{"source":{"id":"1809.00658","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NA","submitted_at":"2018-09-03T17:02:55Z","cross_cats_sorted":["cs.IT","cs.NA","math.IT"],"title_canon_sha256":"a928e2c7c683e717a41e03e2286d6f86f86d1516fba28fe85724fadf2f1a313a","abstract_canon_sha256":"8f0326a575f24c731dac6a2e6af492800daacc81127a05d92daa273542895d01"},"schema_version":"1.0"},"canonical_sha256":"7660777efca729f1b2bbe8a10b182b44901de284e7b317cc5afc5fa68b54a960","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:42:58.857344Z","signature_b64":"YblXtGd2jIfLsLbrQ8VIXHq7h41gY7D8Tgt2a4vOUTkiGqfCg21HCxToo/7REXgfjSsS+vZSiwodUkvnz7n5AQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"7660777efca729f1b2bbe8a10b182b44901de284e7b317cc5afc5fa68b54a960","last_reissued_at":"2026-05-17T23:42:58.856758Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:42:58.856758Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1809.00658","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-17T23:42:58Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"aiwYB7ickTJ94ZKh/H97PrzeLE3XiNLcNLzTLyvXePWKxN1Ng3bAvQNqDmEEvFGql8KeIACvm1cYHlovTmNNDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T14:48:39.042767Z"},"content_sha256":"ea8b6d35d1895f3da89c36beb592542de2ae411580db9152f5c25178184ab316","schema_version":"1.0","event_id":"sha256:ea8b6d35d1895f3da89c36beb592542de2ae411580db9152f5c25178184ab316"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:OZQHO7X4U4U7DMV35CQQWGBLIS","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Conditioning of partial nonuniform Fourier matrices with clustered nodes","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.IT","cs.NA","math.IT"],"primary_cat":"math.NA","authors_text":"Dmitry Batenkov, Gil Goldman, Laurent Demanet, Yosef Yomdin","submitted_at":"2018-09-03T17:02:55Z","abstract_excerpt":"We prove sharp lower bounds for the smallest singular value of a partial Fourier matrix with arbitrary \"off the grid\" nodes (equivalently, a rectangular Vandermonde matrix with the nodes on the unit circle), in the case when some of the nodes are separated by less than the inverse bandwidth. The bound is polynomial in the reciprocal of the so-called \"super-resolution factor\", while the exponent is controlled by the maximal number of nodes which are clustered together. As a corollary, we obtain sharp minimax bounds for the problem of sparse super-resolution on a grid under the partial clusterin"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1809.00658","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-17T23:42:58Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"eYlx2fUfJyglf1rBqStqzDQhkoj216FOIC559jxuX2DVFr4aBnkJ40Puy6XFQZqBMgsheSrrkwGrWkfSSCofAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T14:48:39.043452Z"},"content_sha256":"f80d36e46c20fd788c7037a2d9c2a2d02a705fa7a885cab013b1323c632a9522","schema_version":"1.0","event_id":"sha256:f80d36e46c20fd788c7037a2d9c2a2d02a705fa7a885cab013b1323c632a9522"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/OZQHO7X4U4U7DMV35CQQWGBLIS/bundle.json","state_url":"https://pith.science/pith/OZQHO7X4U4U7DMV35CQQWGBLIS/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/OZQHO7X4U4U7DMV35CQQWGBLIS/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-05-27T14:48:39Z","links":{"resolver":"https://pith.science/pith/OZQHO7X4U4U7DMV35CQQWGBLIS","bundle":"https://pith.science/pith/OZQHO7X4U4U7DMV35CQQWGBLIS/bundle.json","state":"https://pith.science/pith/OZQHO7X4U4U7DMV35CQQWGBLIS/state.json","well_known_bundle":"https://pith.science/.well-known/pith/OZQHO7X4U4U7DMV35CQQWGBLIS/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:OZQHO7X4U4U7DMV35CQQWGBLIS","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":"8f0326a575f24c731dac6a2e6af492800daacc81127a05d92daa273542895d01","cross_cats_sorted":["cs.IT","cs.NA","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NA","submitted_at":"2018-09-03T17:02:55Z","title_canon_sha256":"a928e2c7c683e717a41e03e2286d6f86f86d1516fba28fe85724fadf2f1a313a"},"schema_version":"1.0","source":{"id":"1809.00658","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1809.00658","created_at":"2026-05-17T23:42:58Z"},{"alias_kind":"arxiv_version","alias_value":"1809.00658v2","created_at":"2026-05-17T23:42:58Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1809.00658","created_at":"2026-05-17T23:42:58Z"},{"alias_kind":"pith_short_12","alias_value":"OZQHO7X4U4U7","created_at":"2026-05-18T12:32:43Z"},{"alias_kind":"pith_short_16","alias_value":"OZQHO7X4U4U7DMV3","created_at":"2026-05-18T12:32:43Z"},{"alias_kind":"pith_short_8","alias_value":"OZQHO7X4","created_at":"2026-05-18T12:32:43Z"}],"graph_snapshots":[{"event_id":"sha256:f80d36e46c20fd788c7037a2d9c2a2d02a705fa7a885cab013b1323c632a9522","target":"graph","created_at":"2026-05-17T23:42:58Z","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 prove sharp lower bounds for the smallest singular value of a partial Fourier matrix with arbitrary \"off the grid\" nodes (equivalently, a rectangular Vandermonde matrix with the nodes on the unit circle), in the case when some of the nodes are separated by less than the inverse bandwidth. The bound is polynomial in the reciprocal of the so-called \"super-resolution factor\", while the exponent is controlled by the maximal number of nodes which are clustered together. As a corollary, we obtain sharp minimax bounds for the problem of sparse super-resolution on a grid under the partial clusterin","authors_text":"Dmitry Batenkov, Gil Goldman, Laurent Demanet, Yosef Yomdin","cross_cats":["cs.IT","cs.NA","math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NA","submitted_at":"2018-09-03T17:02:55Z","title":"Conditioning of partial nonuniform Fourier matrices with clustered nodes"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1809.00658","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:ea8b6d35d1895f3da89c36beb592542de2ae411580db9152f5c25178184ab316","target":"record","created_at":"2026-05-17T23:42:58Z","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":"8f0326a575f24c731dac6a2e6af492800daacc81127a05d92daa273542895d01","cross_cats_sorted":["cs.IT","cs.NA","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NA","submitted_at":"2018-09-03T17:02:55Z","title_canon_sha256":"a928e2c7c683e717a41e03e2286d6f86f86d1516fba28fe85724fadf2f1a313a"},"schema_version":"1.0","source":{"id":"1809.00658","kind":"arxiv","version":2}},"canonical_sha256":"7660777efca729f1b2bbe8a10b182b44901de284e7b317cc5afc5fa68b54a960","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"7660777efca729f1b2bbe8a10b182b44901de284e7b317cc5afc5fa68b54a960","first_computed_at":"2026-05-17T23:42:58.856758Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:42:58.856758Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"YblXtGd2jIfLsLbrQ8VIXHq7h41gY7D8Tgt2a4vOUTkiGqfCg21HCxToo/7REXgfjSsS+vZSiwodUkvnz7n5AQ==","signature_status":"signed_v1","signed_at":"2026-05-17T23:42:58.857344Z","signed_message":"canonical_sha256_bytes"},"source_id":"1809.00658","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:ea8b6d35d1895f3da89c36beb592542de2ae411580db9152f5c25178184ab316","sha256:f80d36e46c20fd788c7037a2d9c2a2d02a705fa7a885cab013b1323c632a9522"],"state_sha256":"5b5fec1baa48e9996b9023d7b45c8326eaa3bf45e2c9e8a8be8d27c7bcb3cca1"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"cY4GqT8buewchl5Ig+gP6SYqsVhxR4PZkLEepwAi8q+7PgyqKL+ju1uB0gn6mevNt67XdXGtPGs4G0EoBfSTAQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-27T14:48:39.047038Z","bundle_sha256":"e8e0b4c1f794755b28b51332f05c2ce6ba4c359f86d9a7ca2cb76334e1f3ca63"}}