{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:V3OA66KSQPH4TARI2LGW4E6NC2","short_pith_number":"pith:V3OA66KS","canonical_record":{"source":{"id":"1711.07622","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NA","submitted_at":"2017-11-21T04:02:12Z","cross_cats_sorted":[],"title_canon_sha256":"9245dbf024076b72ebaa96cf51924c2706b735444274160dff7aae1ab96b198c","abstract_canon_sha256":"115207759acb852bec232faed2ddb521dd655928c98905a7478600443f780897"},"schema_version":"1.0"},"canonical_sha256":"aedc0f795283cfc98228d2cd6e13cd16bd77bab40c1cb1f272673558928cb613","source":{"kind":"arxiv","id":"1711.07622","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1711.07622","created_at":"2026-05-17T23:46:42Z"},{"alias_kind":"arxiv_version","alias_value":"1711.07622v3","created_at":"2026-05-17T23:46:42Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1711.07622","created_at":"2026-05-17T23:46:42Z"},{"alias_kind":"pith_short_12","alias_value":"V3OA66KSQPH4","created_at":"2026-05-18T12:31:49Z"},{"alias_kind":"pith_short_16","alias_value":"V3OA66KSQPH4TARI","created_at":"2026-05-18T12:31:49Z"},{"alias_kind":"pith_short_8","alias_value":"V3OA66KS","created_at":"2026-05-18T12:31:49Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:V3OA66KSQPH4TARI2LGW4E6NC2","target":"record","payload":{"canonical_record":{"source":{"id":"1711.07622","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NA","submitted_at":"2017-11-21T04:02:12Z","cross_cats_sorted":[],"title_canon_sha256":"9245dbf024076b72ebaa96cf51924c2706b735444274160dff7aae1ab96b198c","abstract_canon_sha256":"115207759acb852bec232faed2ddb521dd655928c98905a7478600443f780897"},"schema_version":"1.0"},"canonical_sha256":"aedc0f795283cfc98228d2cd6e13cd16bd77bab40c1cb1f272673558928cb613","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:46:42.016196Z","signature_b64":"VkQt4CTAjOXBCDPHtApaTHl9+ncws8Yl+TT1De9WBuCtoyysL4w8+UagZNcp2dI6aIFnV8Cls2+kcmQFvTTDDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"aedc0f795283cfc98228d2cd6e13cd16bd77bab40c1cb1f272673558928cb613","last_reissued_at":"2026-05-17T23:46:42.015704Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:46:42.015704Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1711.07622","source_version":3,"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:46:42Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"6oWdiCh5imOpqlPmKyN77GNvc8lihp49KGd0p++VXtI0kfvvn7y90o4m+u7IQNSGSYNLUgKBlTC+pphpS5wVDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-11T02:28:08.743452Z"},"content_sha256":"5b122e0a3e0ce275ebe2bbdbb646052999de84ef8fee1a2dbe58c27a93c39b69","schema_version":"1.0","event_id":"sha256:5b122e0a3e0ce275ebe2bbdbb646052999de84ef8fee1a2dbe58c27a93c39b69"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:V3OA66KSQPH4TARI2LGW4E6NC2","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Correcting for unknown errors in sparse high-dimensional function approximation","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.NA","authors_text":"Anyi Bao, Ben Adcock, Simone Brugiapaglia","submitted_at":"2017-11-21T04:02:12Z","abstract_excerpt":"We consider sparsity-based techniques for the approximation of high-dimensional functions from random pointwise evaluations. To date, almost all the works published in this field contain some a priori assumptions about the error corrupting the samples that are hard to verify in practice. In this paper, we instead focus on the scenario where the error is unknown. We study the performance of four sparsity-promoting optimization problems: weighted quadratically-constrained basis pursuit, weighted LASSO, weighted square-root LASSO, and weighted LAD-LASSO. From the theoretical perspective, we prove"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1711.07622","kind":"arxiv","version":3},"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:46:42Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Ig4eiSSeBb4sRmCo8wIuwM8O1/ZNA36A1IWx/AHdKn0+Ci4ULDo6I7OcnZp8vMuaosBbVKi4kpz3LgSc0ykVBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-11T02:28:08.744113Z"},"content_sha256":"7c477226bce00aa2ccce5c7235e2f23be4e2976c94c49e04a6953dcc98abe33e","schema_version":"1.0","event_id":"sha256:7c477226bce00aa2ccce5c7235e2f23be4e2976c94c49e04a6953dcc98abe33e"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/V3OA66KSQPH4TARI2LGW4E6NC2/bundle.json","state_url":"https://pith.science/pith/V3OA66KSQPH4TARI2LGW4E6NC2/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/V3OA66KSQPH4TARI2LGW4E6NC2/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-11T02:28:08Z","links":{"resolver":"https://pith.science/pith/V3OA66KSQPH4TARI2LGW4E6NC2","bundle":"https://pith.science/pith/V3OA66KSQPH4TARI2LGW4E6NC2/bundle.json","state":"https://pith.science/pith/V3OA66KSQPH4TARI2LGW4E6NC2/state.json","well_known_bundle":"https://pith.science/.well-known/pith/V3OA66KSQPH4TARI2LGW4E6NC2/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:V3OA66KSQPH4TARI2LGW4E6NC2","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":"115207759acb852bec232faed2ddb521dd655928c98905a7478600443f780897","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NA","submitted_at":"2017-11-21T04:02:12Z","title_canon_sha256":"9245dbf024076b72ebaa96cf51924c2706b735444274160dff7aae1ab96b198c"},"schema_version":"1.0","source":{"id":"1711.07622","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1711.07622","created_at":"2026-05-17T23:46:42Z"},{"alias_kind":"arxiv_version","alias_value":"1711.07622v3","created_at":"2026-05-17T23:46:42Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1711.07622","created_at":"2026-05-17T23:46:42Z"},{"alias_kind":"pith_short_12","alias_value":"V3OA66KSQPH4","created_at":"2026-05-18T12:31:49Z"},{"alias_kind":"pith_short_16","alias_value":"V3OA66KSQPH4TARI","created_at":"2026-05-18T12:31:49Z"},{"alias_kind":"pith_short_8","alias_value":"V3OA66KS","created_at":"2026-05-18T12:31:49Z"}],"graph_snapshots":[{"event_id":"sha256:7c477226bce00aa2ccce5c7235e2f23be4e2976c94c49e04a6953dcc98abe33e","target":"graph","created_at":"2026-05-17T23:46:42Z","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 sparsity-based techniques for the approximation of high-dimensional functions from random pointwise evaluations. To date, almost all the works published in this field contain some a priori assumptions about the error corrupting the samples that are hard to verify in practice. In this paper, we instead focus on the scenario where the error is unknown. We study the performance of four sparsity-promoting optimization problems: weighted quadratically-constrained basis pursuit, weighted LASSO, weighted square-root LASSO, and weighted LAD-LASSO. From the theoretical perspective, we prove","authors_text":"Anyi Bao, Ben Adcock, Simone Brugiapaglia","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NA","submitted_at":"2017-11-21T04:02:12Z","title":"Correcting for unknown errors in sparse high-dimensional function approximation"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1711.07622","kind":"arxiv","version":3},"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:5b122e0a3e0ce275ebe2bbdbb646052999de84ef8fee1a2dbe58c27a93c39b69","target":"record","created_at":"2026-05-17T23:46:42Z","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":"115207759acb852bec232faed2ddb521dd655928c98905a7478600443f780897","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NA","submitted_at":"2017-11-21T04:02:12Z","title_canon_sha256":"9245dbf024076b72ebaa96cf51924c2706b735444274160dff7aae1ab96b198c"},"schema_version":"1.0","source":{"id":"1711.07622","kind":"arxiv","version":3}},"canonical_sha256":"aedc0f795283cfc98228d2cd6e13cd16bd77bab40c1cb1f272673558928cb613","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"aedc0f795283cfc98228d2cd6e13cd16bd77bab40c1cb1f272673558928cb613","first_computed_at":"2026-05-17T23:46:42.015704Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:46:42.015704Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"VkQt4CTAjOXBCDPHtApaTHl9+ncws8Yl+TT1De9WBuCtoyysL4w8+UagZNcp2dI6aIFnV8Cls2+kcmQFvTTDDw==","signature_status":"signed_v1","signed_at":"2026-05-17T23:46:42.016196Z","signed_message":"canonical_sha256_bytes"},"source_id":"1711.07622","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:5b122e0a3e0ce275ebe2bbdbb646052999de84ef8fee1a2dbe58c27a93c39b69","sha256:7c477226bce00aa2ccce5c7235e2f23be4e2976c94c49e04a6953dcc98abe33e"],"state_sha256":"264cb3dda2ba4e32dd7681c345b3838ca04205978384bdbe8ef6e3513cd37302"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Q3O4Gd/1tjhAuuGHKvidt3rfZZaSuW/zXbkHtjXkGkN8PdCtVlkOwDMlKtZaegnBFJSLG1ejPr5RYCq8ah6CDg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-11T02:28:08.747614Z","bundle_sha256":"6c92930ae3da079c36f480b7550751cb06d584a82fccc57e4f8d20c3c4368eba"}}