{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:S6AUDSCCAZTQSZALFQLZAL7XGT","short_pith_number":"pith:S6AUDSCC","canonical_record":{"source":{"id":"1708.06187","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2017-08-21T12:38:32Z","cross_cats_sorted":[],"title_canon_sha256":"663aa1bd59472959f513d023942bee793c000ea162bd217c8775c1146f5c1c3d","abstract_canon_sha256":"5e5439c13f5ede6c54cc143408b252b84b25e33f3c7ca4487eba7b184a94400c"},"schema_version":"1.0"},"canonical_sha256":"978141c842066709640b2c17902ff734e9712c4cca2aefdb7c38b8ba310b01eb","source":{"kind":"arxiv","id":"1708.06187","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1708.06187","created_at":"2026-05-18T00:00:09Z"},{"alias_kind":"arxiv_version","alias_value":"1708.06187v2","created_at":"2026-05-18T00:00:09Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1708.06187","created_at":"2026-05-18T00:00:09Z"},{"alias_kind":"pith_short_12","alias_value":"S6AUDSCCAZTQ","created_at":"2026-05-18T12:31:43Z"},{"alias_kind":"pith_short_16","alias_value":"S6AUDSCCAZTQSZAL","created_at":"2026-05-18T12:31:43Z"},{"alias_kind":"pith_short_8","alias_value":"S6AUDSCC","created_at":"2026-05-18T12:31:43Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:S6AUDSCCAZTQSZALFQLZAL7XGT","target":"record","payload":{"canonical_record":{"source":{"id":"1708.06187","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2017-08-21T12:38:32Z","cross_cats_sorted":[],"title_canon_sha256":"663aa1bd59472959f513d023942bee793c000ea162bd217c8775c1146f5c1c3d","abstract_canon_sha256":"5e5439c13f5ede6c54cc143408b252b84b25e33f3c7ca4487eba7b184a94400c"},"schema_version":"1.0"},"canonical_sha256":"978141c842066709640b2c17902ff734e9712c4cca2aefdb7c38b8ba310b01eb","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:00:09.127509Z","signature_b64":"DJ38sZN0MUYizRPpiJ1mKwp/9M8hftHAhklvFtWO25x6NyvpSGULhGFdVNrx0ELQ6EKjz3g3ezfHFnpNI/8BBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"978141c842066709640b2c17902ff734e9712c4cca2aefdb7c38b8ba310b01eb","last_reissued_at":"2026-05-18T00:00:09.126911Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:00:09.126911Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1708.06187","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-18T00:00:09Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"8XtQs+DdnyDC+T45eRMXOJ4KmyOgipdqp4FQCfbjgkEFU2jhRuGVlz5N0nSsgu3+kmjwrNeK/SDZqO48EPaYCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T20:20:39.316353Z"},"content_sha256":"746e539de942e6b5bea59a29ad84ee9b130a3c4742387596382e8a83745f28d8","schema_version":"1.0","event_id":"sha256:746e539de942e6b5bea59a29ad84ee9b130a3c4742387596382e8a83745f28d8"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:S6AUDSCCAZTQSZALFQLZAL7XGT","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Sparse polynomial interpolation: sparse recovery, super resolution, or Prony?","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Bernard Mourrain (AROMATH), C\\'edric Josz (LAAS-MAC), Jean-Bernard Lasserre (LAAS-MAC)","submitted_at":"2017-08-21T12:38:32Z","abstract_excerpt":"We show that the sparse polynomial interpolation problem reduces to a discrete super-resolution problem on the $n$-dimensional torus. Therefore the semidefinite programming  approach initiated by Cand\\`es \\\\& Fernandez-Granda \\cite{candes\\_towards\\_2014}  in the univariate case can be applied. We extend their result to the multivariate case, i.e., we show that exact recovery is guaranteed provided that a geometric spacing condition on the supports holds and the number of evaluations are sufficiently many (but not many). It also turns out that the sparse recovery LP-formulation  of $\\ell\\_1$-no"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1708.06187","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-18T00:00:09Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ctm1SMdp4bSXVfptACWsJ5/GzthuE5+TLJGByBLICAoQd5xaSgp/tvzPoiVtJnRFSkaaxvLDVhNo+yUcQzEjCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T20:20:39.316956Z"},"content_sha256":"960c5feef0d1109734503484db683d7f4bba39fc48f059834041bda11f954c19","schema_version":"1.0","event_id":"sha256:960c5feef0d1109734503484db683d7f4bba39fc48f059834041bda11f954c19"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/S6AUDSCCAZTQSZALFQLZAL7XGT/bundle.json","state_url":"https://pith.science/pith/S6AUDSCCAZTQSZALFQLZAL7XGT/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/S6AUDSCCAZTQSZALFQLZAL7XGT/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-26T20:20:39Z","links":{"resolver":"https://pith.science/pith/S6AUDSCCAZTQSZALFQLZAL7XGT","bundle":"https://pith.science/pith/S6AUDSCCAZTQSZALFQLZAL7XGT/bundle.json","state":"https://pith.science/pith/S6AUDSCCAZTQSZALFQLZAL7XGT/state.json","well_known_bundle":"https://pith.science/.well-known/pith/S6AUDSCCAZTQSZALFQLZAL7XGT/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:S6AUDSCCAZTQSZALFQLZAL7XGT","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":"5e5439c13f5ede6c54cc143408b252b84b25e33f3c7ca4487eba7b184a94400c","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2017-08-21T12:38:32Z","title_canon_sha256":"663aa1bd59472959f513d023942bee793c000ea162bd217c8775c1146f5c1c3d"},"schema_version":"1.0","source":{"id":"1708.06187","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1708.06187","created_at":"2026-05-18T00:00:09Z"},{"alias_kind":"arxiv_version","alias_value":"1708.06187v2","created_at":"2026-05-18T00:00:09Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1708.06187","created_at":"2026-05-18T00:00:09Z"},{"alias_kind":"pith_short_12","alias_value":"S6AUDSCCAZTQ","created_at":"2026-05-18T12:31:43Z"},{"alias_kind":"pith_short_16","alias_value":"S6AUDSCCAZTQSZAL","created_at":"2026-05-18T12:31:43Z"},{"alias_kind":"pith_short_8","alias_value":"S6AUDSCC","created_at":"2026-05-18T12:31:43Z"}],"graph_snapshots":[{"event_id":"sha256:960c5feef0d1109734503484db683d7f4bba39fc48f059834041bda11f954c19","target":"graph","created_at":"2026-05-18T00:00:09Z","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 show that the sparse polynomial interpolation problem reduces to a discrete super-resolution problem on the $n$-dimensional torus. Therefore the semidefinite programming  approach initiated by Cand\\`es \\\\& Fernandez-Granda \\cite{candes\\_towards\\_2014}  in the univariate case can be applied. We extend their result to the multivariate case, i.e., we show that exact recovery is guaranteed provided that a geometric spacing condition on the supports holds and the number of evaluations are sufficiently many (but not many). It also turns out that the sparse recovery LP-formulation  of $\\ell\\_1$-no","authors_text":"Bernard Mourrain (AROMATH), C\\'edric Josz (LAAS-MAC), Jean-Bernard Lasserre (LAAS-MAC)","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2017-08-21T12:38:32Z","title":"Sparse polynomial interpolation: sparse recovery, super resolution, or Prony?"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1708.06187","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:746e539de942e6b5bea59a29ad84ee9b130a3c4742387596382e8a83745f28d8","target":"record","created_at":"2026-05-18T00:00:09Z","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":"5e5439c13f5ede6c54cc143408b252b84b25e33f3c7ca4487eba7b184a94400c","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2017-08-21T12:38:32Z","title_canon_sha256":"663aa1bd59472959f513d023942bee793c000ea162bd217c8775c1146f5c1c3d"},"schema_version":"1.0","source":{"id":"1708.06187","kind":"arxiv","version":2}},"canonical_sha256":"978141c842066709640b2c17902ff734e9712c4cca2aefdb7c38b8ba310b01eb","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"978141c842066709640b2c17902ff734e9712c4cca2aefdb7c38b8ba310b01eb","first_computed_at":"2026-05-18T00:00:09.126911Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:00:09.126911Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"DJ38sZN0MUYizRPpiJ1mKwp/9M8hftHAhklvFtWO25x6NyvpSGULhGFdVNrx0ELQ6EKjz3g3ezfHFnpNI/8BBw==","signature_status":"signed_v1","signed_at":"2026-05-18T00:00:09.127509Z","signed_message":"canonical_sha256_bytes"},"source_id":"1708.06187","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:746e539de942e6b5bea59a29ad84ee9b130a3c4742387596382e8a83745f28d8","sha256:960c5feef0d1109734503484db683d7f4bba39fc48f059834041bda11f954c19"],"state_sha256":"cdfe109b2e638dc570910ed49c93a24db6360600469618a6604ed4b493eb779f"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"2VmXtJnZgrO4kH1ACDXrereHC2Xfpc4piruQZf2Z2/YQugkG1uNhiyPfLLzJTWDuW2EB2dtWtYuMpnT5H7aIAA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-26T20:20:39.320194Z","bundle_sha256":"eb7cf42f40bac736a5689da9f35cf69f88c25cdc9473891cf3d2cbb899f9fea3"}}