{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:DAXOKNGBNSSHD2RDCMNSIGYCNK","short_pith_number":"pith:DAXOKNGB","canonical_record":{"source":{"id":"1703.06987","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NA","submitted_at":"2017-03-20T22:14:40Z","cross_cats_sorted":[],"title_canon_sha256":"a07ea35917984cd8c4212f86ec387c3d68bd92890c1ad3d471bac2b8c0a6a65c","abstract_canon_sha256":"a48ec84d7cfb0b320c77a78e975712a4c5959340ed88e9141ad7d23f8d70adb7"},"schema_version":"1.0"},"canonical_sha256":"182ee534c16ca471ea23131b241b026ab83ae7bb5282ec0c3289ceefa5ee014d","source":{"kind":"arxiv","id":"1703.06987","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1703.06987","created_at":"2026-05-18T00:42:43Z"},{"alias_kind":"arxiv_version","alias_value":"1703.06987v2","created_at":"2026-05-18T00:42:43Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1703.06987","created_at":"2026-05-18T00:42:43Z"},{"alias_kind":"pith_short_12","alias_value":"DAXOKNGBNSSH","created_at":"2026-05-18T12:31:10Z"},{"alias_kind":"pith_short_16","alias_value":"DAXOKNGBNSSHD2RD","created_at":"2026-05-18T12:31:10Z"},{"alias_kind":"pith_short_8","alias_value":"DAXOKNGB","created_at":"2026-05-18T12:31:10Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:DAXOKNGBNSSHD2RDCMNSIGYCNK","target":"record","payload":{"canonical_record":{"source":{"id":"1703.06987","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NA","submitted_at":"2017-03-20T22:14:40Z","cross_cats_sorted":[],"title_canon_sha256":"a07ea35917984cd8c4212f86ec387c3d68bd92890c1ad3d471bac2b8c0a6a65c","abstract_canon_sha256":"a48ec84d7cfb0b320c77a78e975712a4c5959340ed88e9141ad7d23f8d70adb7"},"schema_version":"1.0"},"canonical_sha256":"182ee534c16ca471ea23131b241b026ab83ae7bb5282ec0c3289ceefa5ee014d","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:42:43.733378Z","signature_b64":"Qx2MU3EF2Vs4yGdMMOvPmAwfp4k1hhEggKGzQH0x52gs6RRlrAnjflqLxTVe5FpBriOpwFKCeIbx+28RFaQ1Bw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"182ee534c16ca471ea23131b241b026ab83ae7bb5282ec0c3289ceefa5ee014d","last_reissued_at":"2026-05-18T00:42:43.732696Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:42:43.732696Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1703.06987","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:42:43Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ZbhKovqFxdDZEjrmSOc5aeJs4tS6cfa6UVi26Jcu1WxE+Mq/Zs+f5Xmx3Xn9ydQ6VLR0/8N0wcEooSi3/xlrCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-11T06:44:58.421372Z"},"content_sha256":"5198e78bb7f6d640c4e4d97633eaf83817c152e5b546d28613f1dca42408267a","schema_version":"1.0","event_id":"sha256:5198e78bb7f6d640c4e4d97633eaf83817c152e5b546d28613f1dca42408267a"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:DAXOKNGBNSSHD2RDCMNSIGYCNK","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Compressed sensing approaches for polynomial approximation of high-dimensional functions","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.NA","authors_text":"Ben Adcock, Clayton G. Webster, Simone Brugiapaglia","submitted_at":"2017-03-20T22:14:40Z","abstract_excerpt":"In recent years, the use of sparse recovery techniques in the approximation of high-dimensional functions has garnered increasing interest. In this work we present a survey of recent progress in this emerging topic. Our main focus is on the computation of polynomial approximations of high-dimensional functions on $d$-dimensional hypercubes. We show that smooth, multivariate functions possess expansions in orthogonal polynomial bases that are not only approximately sparse, but possess a particular type of structured sparsity defined by so-called lower sets. This structure can be exploited via t"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1703.06987","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:42:43Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"lCjrA33AC7Xm2ljFmq+W/bMz4kfYCfE+4B2XNPsb6pK4CHKspyk4+VZNNiyqf3y/+Hmnp/CoH8HMgxecB0dWAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-11T06:44:58.422106Z"},"content_sha256":"4e08136d5946d04ea2f9148de1b2411422571dafeac8230d592aac61575f6c8d","schema_version":"1.0","event_id":"sha256:4e08136d5946d04ea2f9148de1b2411422571dafeac8230d592aac61575f6c8d"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/DAXOKNGBNSSHD2RDCMNSIGYCNK/bundle.json","state_url":"https://pith.science/pith/DAXOKNGBNSSHD2RDCMNSIGYCNK/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/DAXOKNGBNSSHD2RDCMNSIGYCNK/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-11T06:44:58Z","links":{"resolver":"https://pith.science/pith/DAXOKNGBNSSHD2RDCMNSIGYCNK","bundle":"https://pith.science/pith/DAXOKNGBNSSHD2RDCMNSIGYCNK/bundle.json","state":"https://pith.science/pith/DAXOKNGBNSSHD2RDCMNSIGYCNK/state.json","well_known_bundle":"https://pith.science/.well-known/pith/DAXOKNGBNSSHD2RDCMNSIGYCNK/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:DAXOKNGBNSSHD2RDCMNSIGYCNK","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":"a48ec84d7cfb0b320c77a78e975712a4c5959340ed88e9141ad7d23f8d70adb7","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NA","submitted_at":"2017-03-20T22:14:40Z","title_canon_sha256":"a07ea35917984cd8c4212f86ec387c3d68bd92890c1ad3d471bac2b8c0a6a65c"},"schema_version":"1.0","source":{"id":"1703.06987","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1703.06987","created_at":"2026-05-18T00:42:43Z"},{"alias_kind":"arxiv_version","alias_value":"1703.06987v2","created_at":"2026-05-18T00:42:43Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1703.06987","created_at":"2026-05-18T00:42:43Z"},{"alias_kind":"pith_short_12","alias_value":"DAXOKNGBNSSH","created_at":"2026-05-18T12:31:10Z"},{"alias_kind":"pith_short_16","alias_value":"DAXOKNGBNSSHD2RD","created_at":"2026-05-18T12:31:10Z"},{"alias_kind":"pith_short_8","alias_value":"DAXOKNGB","created_at":"2026-05-18T12:31:10Z"}],"graph_snapshots":[{"event_id":"sha256:4e08136d5946d04ea2f9148de1b2411422571dafeac8230d592aac61575f6c8d","target":"graph","created_at":"2026-05-18T00:42:43Z","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":"In recent years, the use of sparse recovery techniques in the approximation of high-dimensional functions has garnered increasing interest. In this work we present a survey of recent progress in this emerging topic. Our main focus is on the computation of polynomial approximations of high-dimensional functions on $d$-dimensional hypercubes. We show that smooth, multivariate functions possess expansions in orthogonal polynomial bases that are not only approximately sparse, but possess a particular type of structured sparsity defined by so-called lower sets. This structure can be exploited via t","authors_text":"Ben Adcock, Clayton G. Webster, Simone Brugiapaglia","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NA","submitted_at":"2017-03-20T22:14:40Z","title":"Compressed sensing approaches for polynomial approximation of high-dimensional functions"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1703.06987","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:5198e78bb7f6d640c4e4d97633eaf83817c152e5b546d28613f1dca42408267a","target":"record","created_at":"2026-05-18T00:42:43Z","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":"a48ec84d7cfb0b320c77a78e975712a4c5959340ed88e9141ad7d23f8d70adb7","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NA","submitted_at":"2017-03-20T22:14:40Z","title_canon_sha256":"a07ea35917984cd8c4212f86ec387c3d68bd92890c1ad3d471bac2b8c0a6a65c"},"schema_version":"1.0","source":{"id":"1703.06987","kind":"arxiv","version":2}},"canonical_sha256":"182ee534c16ca471ea23131b241b026ab83ae7bb5282ec0c3289ceefa5ee014d","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"182ee534c16ca471ea23131b241b026ab83ae7bb5282ec0c3289ceefa5ee014d","first_computed_at":"2026-05-18T00:42:43.732696Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:42:43.732696Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"Qx2MU3EF2Vs4yGdMMOvPmAwfp4k1hhEggKGzQH0x52gs6RRlrAnjflqLxTVe5FpBriOpwFKCeIbx+28RFaQ1Bw==","signature_status":"signed_v1","signed_at":"2026-05-18T00:42:43.733378Z","signed_message":"canonical_sha256_bytes"},"source_id":"1703.06987","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:5198e78bb7f6d640c4e4d97633eaf83817c152e5b546d28613f1dca42408267a","sha256:4e08136d5946d04ea2f9148de1b2411422571dafeac8230d592aac61575f6c8d"],"state_sha256":"c0b518d8c21dc8cc00b9e028e436cb151a93ba759efcdc04f557e784ee95d26e"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"PFoECEkXBNi1V6P5pvIXJgwL6y2uW8akQmI0bG4JedLc1yLXJ1dCjyM0kB/ZS1KWqCu1RisJW5xEBYn0cfkZBw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-11T06:44:58.426383Z","bundle_sha256":"3900b29abd8b7f507312c59e655f4ced2744d78ae3cbd09b61e0dc024ef0fa47"}}