{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2013:MHH6ZOHEYXAK6S7O4LRQH6I64M","short_pith_number":"pith:MHH6ZOHE","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"},"canonical_sha256":"61cfecb8e4c5c0af4beee2e303f91ee33d3974cb69caae13ad62ff6b14e46e7d","source":{"kind":"arxiv","id":"1308.0624","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1308.0624","created_at":"2026-05-18T01:48:24Z"},{"alias_kind":"arxiv_version","alias_value":"1308.0624v1","created_at":"2026-05-18T01:48:24Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1308.0624","created_at":"2026-05-18T01:48:24Z"},{"alias_kind":"pith_short_12","alias_value":"MHH6ZOHEYXAK","created_at":"2026-05-18T12:27:52Z"},{"alias_kind":"pith_short_16","alias_value":"MHH6ZOHEYXAK6S7O","created_at":"2026-05-18T12:27:52Z"},{"alias_kind":"pith_short_8","alias_value":"MHH6ZOHE","created_at":"2026-05-18T12:27:52Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2013:MHH6ZOHEYXAK6S7O4LRQH6I64M","target":"record","payload":{"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"},"canonical_sha256":"61cfecb8e4c5c0af4beee2e303f91ee33d3974cb69caae13ad62ff6b14e46e7d","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"},"source_kind":"arxiv","source_id":"1308.0624","source_version":1,"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-18T01:48:24Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"rAeo9F1T7YkaVlVymcc3Drw8qi16mVuC5qA1b8nvCYW1Pj70DqBrMC6u84y9WUkuY+ommACgSqDeQ+MVKoPpBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-07T21:52:37.873596Z"},"content_sha256":"21b91ac523b24d3a11d1670dff0ff51e2b0824edd526f046ec8fd755e2992dfe","schema_version":"1.0","event_id":"sha256:21b91ac523b24d3a11d1670dff0ff51e2b0824edd526f046ec8fd755e2992dfe"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2013:MHH6ZOHEYXAK6S7O4LRQH6I64M","target":"graph","payload":{"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"},"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-18T01:48:24Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"A7P5tYG1vUi5Tgj4x+H+ygecdrjWcOkjFYalzfkY7x08NqC0p6bEtjs6TpifX3vmerdEv1T5NBfwY967LTXIBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-07T21:52:37.874291Z"},"content_sha256":"2f9956b14f1cf3fe184cf2c99e37c1ec459a4f68aad9b051ed008eb802484203","schema_version":"1.0","event_id":"sha256:2f9956b14f1cf3fe184cf2c99e37c1ec459a4f68aad9b051ed008eb802484203"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/MHH6ZOHEYXAK6S7O4LRQH6I64M/bundle.json","state_url":"https://pith.science/pith/MHH6ZOHEYXAK6S7O4LRQH6I64M/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/MHH6ZOHEYXAK6S7O4LRQH6I64M/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-07T21:52:37Z","links":{"resolver":"https://pith.science/pith/MHH6ZOHEYXAK6S7O4LRQH6I64M","bundle":"https://pith.science/pith/MHH6ZOHEYXAK6S7O4LRQH6I64M/bundle.json","state":"https://pith.science/pith/MHH6ZOHEYXAK6S7O4LRQH6I64M/state.json","well_known_bundle":"https://pith.science/.well-known/pith/MHH6ZOHEYXAK6S7O4LRQH6I64M/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2013:MHH6ZOHEYXAK6S7O4LRQH6I64M","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":"60e4d03f60e0142d08cb348506234967d799279048f32a9c231188a9b1752e00","cross_cats_sorted":["math.AP"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NA","submitted_at":"2013-08-02T21:51:27Z","title_canon_sha256":"03b7b303abc0e617725e0f0126b1b0b2dc5dbbf76f3215e8a0ae665ad9dd28b3"},"schema_version":"1.0","source":{"id":"1308.0624","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1308.0624","created_at":"2026-05-18T01:48:24Z"},{"alias_kind":"arxiv_version","alias_value":"1308.0624v1","created_at":"2026-05-18T01:48:24Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1308.0624","created_at":"2026-05-18T01:48:24Z"},{"alias_kind":"pith_short_12","alias_value":"MHH6ZOHEYXAK","created_at":"2026-05-18T12:27:52Z"},{"alias_kind":"pith_short_16","alias_value":"MHH6ZOHEYXAK6S7O","created_at":"2026-05-18T12:27:52Z"},{"alias_kind":"pith_short_8","alias_value":"MHH6ZOHE","created_at":"2026-05-18T12:27:52Z"}],"graph_snapshots":[{"event_id":"sha256:2f9956b14f1cf3fe184cf2c99e37c1ec459a4f68aad9b051ed008eb802484203","target":"graph","created_at":"2026-05-18T01:48:24Z","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":"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","authors_text":"Alireza Doostan, Jerrad Hampton, Ji Peng","cross_cats":["math.AP"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NA","submitted_at":"2013-08-02T21:51:27Z","title":"A weighted L1-minimization approach for sparse polynomial chaos expansions"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1308.0624","kind":"arxiv","version":1},"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:21b91ac523b24d3a11d1670dff0ff51e2b0824edd526f046ec8fd755e2992dfe","target":"record","created_at":"2026-05-18T01:48:24Z","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":"60e4d03f60e0142d08cb348506234967d799279048f32a9c231188a9b1752e00","cross_cats_sorted":["math.AP"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NA","submitted_at":"2013-08-02T21:51:27Z","title_canon_sha256":"03b7b303abc0e617725e0f0126b1b0b2dc5dbbf76f3215e8a0ae665ad9dd28b3"},"schema_version":"1.0","source":{"id":"1308.0624","kind":"arxiv","version":1}},"canonical_sha256":"61cfecb8e4c5c0af4beee2e303f91ee33d3974cb69caae13ad62ff6b14e46e7d","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"61cfecb8e4c5c0af4beee2e303f91ee33d3974cb69caae13ad62ff6b14e46e7d","first_computed_at":"2026-05-18T01:48:24.378831Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:48:24.378831Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"UMOFEBTNlQ/bgbiLRTQSQmddSLyy4XuUZWpRZ+PKzQ9ebNWa+3fALW6VROaHkrAdRmo6aXbKq6a2riKH2Rn0Aw==","signature_status":"signed_v1","signed_at":"2026-05-18T01:48:24.379556Z","signed_message":"canonical_sha256_bytes"},"source_id":"1308.0624","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:21b91ac523b24d3a11d1670dff0ff51e2b0824edd526f046ec8fd755e2992dfe","sha256:2f9956b14f1cf3fe184cf2c99e37c1ec459a4f68aad9b051ed008eb802484203"],"state_sha256":"2ae579e090f6f7441e3eaf93c9086c2729800e87c3512656570fbd88a1387952"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"5bHz4wyb4wVPybOeg3T54ynmIzebSHd9Fy+NRFXCWfoYzLiySS/XWCmwlJtAm+J2plTQkt1TM+2PDwly2zdQBQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-07T21:52:37.878117Z","bundle_sha256":"f2901860fde3d4f35a107ae7f457b3a8dfd128b22332ba3975596455240d70b8"}}