{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2013:MHH6ZOHEYXAK6S7O4LRQH6I64M","short_pith_number":"pith:MHH6ZOHE","schema_version":"1.0","canonical_sha256":"61cfecb8e4c5c0af4beee2e303f91ee33d3974cb69caae13ad62ff6b14e46e7d","source":{"kind":"arxiv","id":"1308.0624","version":1},"attestation_state":"computed","paper":{"title":"A weighted L1-minimization approach for sparse polynomial chaos expansions","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.AP"],"primary_cat":"math.NA","authors_text":"Alireza Doostan, Jerrad Hampton, Ji Peng","submitted_at":"2013-08-02T21:51:27Z","abstract_excerpt":"This work proposes a method for sparse polynomial chaos (PC) approximation of high-dimensional stochastic functions based on non-adapted random sampling. We modify the standard l1 -minimization algorithm, originally proposed in the context of compressive sampling, using a priori information about the decay of the PC coefficients and refer to the resulting algorithm as weighted l1 -minimization. We provide conditions under which we may guarantee recovery using this weighted scheme. Numerical tests are used to compare the weighted and non-weighted methods for the recovery of solutions to two dif"},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"canonical_record":{"source":{"id":"1308.0624","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NA","submitted_at":"2013-08-02T21:51:27Z","cross_cats_sorted":["math.AP"],"title_canon_sha256":"03b7b303abc0e617725e0f0126b1b0b2dc5dbbf76f3215e8a0ae665ad9dd28b3","abstract_canon_sha256":"60e4d03f60e0142d08cb348506234967d799279048f32a9c231188a9b1752e00"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:48:24.379556Z","signature_b64":"UMOFEBTNlQ/bgbiLRTQSQmddSLyy4XuUZWpRZ+PKzQ9ebNWa+3fALW6VROaHkrAdRmo6aXbKq6a2riKH2Rn0Aw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"61cfecb8e4c5c0af4beee2e303f91ee33d3974cb69caae13ad62ff6b14e46e7d","last_reissued_at":"2026-05-18T01:48:24.378831Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:48:24.378831Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A weighted L1-minimization approach for sparse polynomial chaos expansions","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.AP"],"primary_cat":"math.NA","authors_text":"Alireza Doostan, Jerrad Hampton, Ji Peng","submitted_at":"2013-08-02T21:51:27Z","abstract_excerpt":"This work proposes a method for sparse polynomial chaos (PC) approximation of high-dimensional stochastic functions based on non-adapted random sampling. We modify the standard l1 -minimization algorithm, originally proposed in the context of compressive sampling, using a priori information about the decay of the PC coefficients and refer to the resulting algorithm as weighted l1 -minimization. We provide conditions under which we may guarantee recovery using this weighted scheme. Numerical tests are used to compare the weighted and non-weighted methods for the recovery of solutions to two dif"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1308.0624","kind":"arxiv","version":1},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1308.0624","created_at":"2026-05-18T01:48:24.378952+00:00"},{"alias_kind":"arxiv_version","alias_value":"1308.0624v1","created_at":"2026-05-18T01:48:24.378952+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1308.0624","created_at":"2026-05-18T01:48:24.378952+00:00"},{"alias_kind":"pith_short_12","alias_value":"MHH6ZOHEYXAK","created_at":"2026-05-18T12:27:52.871228+00:00"},{"alias_kind":"pith_short_16","alias_value":"MHH6ZOHEYXAK6S7O","created_at":"2026-05-18T12:27:52.871228+00:00"},{"alias_kind":"pith_short_8","alias_value":"MHH6ZOHE","created_at":"2026-05-18T12:27:52.871228+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/MHH6ZOHEYXAK6S7O4LRQH6I64M","json":"https://pith.science/pith/MHH6ZOHEYXAK6S7O4LRQH6I64M.json","graph_json":"https://pith.science/api/pith-number/MHH6ZOHEYXAK6S7O4LRQH6I64M/graph.json","events_json":"https://pith.science/api/pith-number/MHH6ZOHEYXAK6S7O4LRQH6I64M/events.json","paper":"https://pith.science/paper/MHH6ZOHE"},"agent_actions":{"view_html":"https://pith.science/pith/MHH6ZOHEYXAK6S7O4LRQH6I64M","download_json":"https://pith.science/pith/MHH6ZOHEYXAK6S7O4LRQH6I64M.json","view_paper":"https://pith.science/paper/MHH6ZOHE","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1308.0624&json=true","fetch_graph":"https://pith.science/api/pith-number/MHH6ZOHEYXAK6S7O4LRQH6I64M/graph.json","fetch_events":"https://pith.science/api/pith-number/MHH6ZOHEYXAK6S7O4LRQH6I64M/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/MHH6ZOHEYXAK6S7O4LRQH6I64M/action/timestamp_anchor","attest_storage":"https://pith.science/pith/MHH6ZOHEYXAK6S7O4LRQH6I64M/action/storage_attestation","attest_author":"https://pith.science/pith/MHH6ZOHEYXAK6S7O4LRQH6I64M/action/author_attestation","sign_citation":"https://pith.science/pith/MHH6ZOHEYXAK6S7O4LRQH6I64M/action/citation_signature","submit_replication":"https://pith.science/pith/MHH6ZOHEYXAK6S7O4LRQH6I64M/action/replication_record"}},"created_at":"2026-05-18T01:48:24.378952+00:00","updated_at":"2026-05-18T01:48:24.378952+00:00"}