{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:KOLMSEIJXAQSQQGEKAYGNFELEQ","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":"36b57fd4d6f524a006e144e4b673157581bb7a4680822d9881f4faa9ecf9ceb2","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NA","submitted_at":"2018-03-19T09:04:44Z","title_canon_sha256":"0982f83b2722a956ebdbb4f555125cc3400bcc1e734ec91ef98e8c148a45f83f"},"schema_version":"1.0","source":{"id":"1803.06833","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1803.06833","created_at":"2026-05-18T00:20:41Z"},{"alias_kind":"arxiv_version","alias_value":"1803.06833v1","created_at":"2026-05-18T00:20:41Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1803.06833","created_at":"2026-05-18T00:20:41Z"},{"alias_kind":"pith_short_12","alias_value":"KOLMSEIJXAQS","created_at":"2026-05-18T12:32:33Z"},{"alias_kind":"pith_short_16","alias_value":"KOLMSEIJXAQSQQGE","created_at":"2026-05-18T12:32:33Z"},{"alias_kind":"pith_short_8","alias_value":"KOLMSEIJ","created_at":"2026-05-18T12:32:33Z"}],"graph_snapshots":[{"event_id":"sha256:28545d97a43cfaed87908f4ba459cd383f72fbb809790699fa68f3bbeb40fa67","target":"graph","created_at":"2026-05-18T00:20:41Z","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":"A novel approach for non-intrusive uncertainty propagation is proposed. Our approach overcomes the limitation of many traditional methods, such as generalised polynomial chaos methods, which may lack sufficient accuracy when the quantity of interest depends discontinuously on the input parameters. As a remedy we propose an adaptive sampling algorithm based on minimum spanning trees combined with a domain decomposition method based on support vector machines. The minimum spanning tree determines new sample locations based on both the probability density of the input parameters and the gradient ","authors_text":"Barry Koren, Benjamin Sanderse, Yous van Halder","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NA","submitted_at":"2018-03-19T09:04:44Z","title":"An adaptive minimum spanning tree multi-element method for uncertainty quantification of smooth and discontinuous responses"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1803.06833","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:239d45ca8a5efe6ca3a04d4e2afe05d84fb8e6b7f295e75e4b64cf356a291d8c","target":"record","created_at":"2026-05-18T00:20:41Z","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":"36b57fd4d6f524a006e144e4b673157581bb7a4680822d9881f4faa9ecf9ceb2","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NA","submitted_at":"2018-03-19T09:04:44Z","title_canon_sha256":"0982f83b2722a956ebdbb4f555125cc3400bcc1e734ec91ef98e8c148a45f83f"},"schema_version":"1.0","source":{"id":"1803.06833","kind":"arxiv","version":1}},"canonical_sha256":"5396c91109b8212840c4503066948b243a99a06a2d590c679f26036f6efb9d30","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"5396c91109b8212840c4503066948b243a99a06a2d590c679f26036f6efb9d30","first_computed_at":"2026-05-18T00:20:41.242892Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:20:41.242892Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"2R1b1FrTNIJA+L9n57SkB1plu6me2gt/tRm9/1mrSjH3Cm3ti441oLcG4hXkXOM41YTONbL/AHY2vHI9WL4pBg==","signature_status":"signed_v1","signed_at":"2026-05-18T00:20:41.243618Z","signed_message":"canonical_sha256_bytes"},"source_id":"1803.06833","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:239d45ca8a5efe6ca3a04d4e2afe05d84fb8e6b7f295e75e4b64cf356a291d8c","sha256:28545d97a43cfaed87908f4ba459cd383f72fbb809790699fa68f3bbeb40fa67"],"state_sha256":"248183290ffffc41dd3df4c357cab69a146a7af481583ce3b15e273d5240f4f1"}