{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:PUXYBQ54BOZYBTY4HHVNPI5O6C","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":"d65614721172f2e8df9b156aa50a09d8d6fb5e0053736db23f710ad83fdb5882","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.CO","submitted_at":"2016-06-21T15:08:41Z","title_canon_sha256":"500aa893bb8036add699afe4439a483618007a9fd6ec9f28382679551ed77bfc"},"schema_version":"1.0","source":{"id":"1606.06611","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1606.06611","created_at":"2026-05-18T00:47:14Z"},{"alias_kind":"arxiv_version","alias_value":"1606.06611v2","created_at":"2026-05-18T00:47:14Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1606.06611","created_at":"2026-05-18T00:47:14Z"},{"alias_kind":"pith_short_12","alias_value":"PUXYBQ54BOZY","created_at":"2026-05-18T12:30:39Z"},{"alias_kind":"pith_short_16","alias_value":"PUXYBQ54BOZYBTY4","created_at":"2026-05-18T12:30:39Z"},{"alias_kind":"pith_short_8","alias_value":"PUXYBQ54","created_at":"2026-05-18T12:30:39Z"}],"graph_snapshots":[{"event_id":"sha256:0d46d290ed5e19ca460140cb89bb971d5a7a334171887b029cc1b10e00b30be1","target":"graph","created_at":"2026-05-18T00:47:14Z","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 paper introduces an efficient sparse recovery approach for Polynomial Chaos (PC) expansions, which promotes the sparsity by breaking the dimensionality of the problem. The proposed algorithm incrementally explores sub-dimensional expansions for a sparser recovery, and shows success when removal of uninfluential parameters that results in a lower coherence for measurement matrix, allows for a higher order and/or sparser expansion to be recovered. The incremental algorithm effectively searches for the sparsest PC approximation, and not only can it decrease the prediction error, it can also ","authors_text":"Hadi Meidani, Negin Alemazkoor","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.CO","submitted_at":"2016-06-21T15:08:41Z","title":"Divide and Conquer: An Incremental Sparsity Promoting Compressive Sampling Approach for Polynomial Chaos Expansions"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1606.06611","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:26888da373fb4760b23c11a4aa921d879dda227cd35a44c904dab84efba16bcb","target":"record","created_at":"2026-05-18T00:47:14Z","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":"d65614721172f2e8df9b156aa50a09d8d6fb5e0053736db23f710ad83fdb5882","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.CO","submitted_at":"2016-06-21T15:08:41Z","title_canon_sha256":"500aa893bb8036add699afe4439a483618007a9fd6ec9f28382679551ed77bfc"},"schema_version":"1.0","source":{"id":"1606.06611","kind":"arxiv","version":2}},"canonical_sha256":"7d2f80c3bc0bb380cf1c39ead7a3aef0b5cb2c39cc1ae1ff4bb29c8ddda8c140","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"7d2f80c3bc0bb380cf1c39ead7a3aef0b5cb2c39cc1ae1ff4bb29c8ddda8c140","first_computed_at":"2026-05-18T00:47:14.253281Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:47:14.253281Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"X8JNflf/HcY9uVxoZn/YJTq5rDG3HF6msNENuL7j7V8Si4fgsTrKDiDo6hsdxxTwDREwSPFpvstcUli88/1EDA==","signature_status":"signed_v1","signed_at":"2026-05-18T00:47:14.253919Z","signed_message":"canonical_sha256_bytes"},"source_id":"1606.06611","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:26888da373fb4760b23c11a4aa921d879dda227cd35a44c904dab84efba16bcb","sha256:0d46d290ed5e19ca460140cb89bb971d5a7a334171887b029cc1b10e00b30be1"],"state_sha256":"0a714a6f06557c2841dbb4465c664a5d0388722533bea06b5f63fa4c3d8849ad"}