{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2023:UB4SOHEE4IRHAOXNMMWQJPDJWT","short_pith_number":"pith:UB4SOHEE","schema_version":"1.0","canonical_sha256":"a079271c84e222703aed632d04bc69b4f9ac0bf268ba408eaa4a0311acef899a","source":{"kind":"arxiv","id":"2311.04172","version":1},"attestation_state":"computed","paper":{"title":"Measure transport via polynomial density surrogates","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.NA","math.ST","stat.TH"],"primary_cat":"math.NA","authors_text":"Jakob Zech, Josephine Westermann","submitted_at":"2023-11-07T17:54:59Z","abstract_excerpt":"We discuss an algorithm to compute transport maps that couple the uniform measure on $[0,1]^d$ with a specified target distribution $\\pi$ on $[0,1]^d$. The primary objectives are either to sample from or to compute expectations w.r.t. $\\pi$. The method is based on leveraging a polynomial surrogate of the target density, which is obtained by a least-squares or interpolation approximation. We discuss the design and construction of suitable sparse approximation spaces, and provide a complete error and cost analysis for target densities belonging to certain smoothness classes. Further, we explore "},"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":"2311.04172","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NA","submitted_at":"2023-11-07T17:54:59Z","cross_cats_sorted":["cs.NA","math.ST","stat.TH"],"title_canon_sha256":"4078aaac590d7d3ed7be4f67fa31b8190dc236cb91a3f47b09e92d91b65e55b1","abstract_canon_sha256":"3a0904bf00fbc8cbb5550010da356a591b9d6c538488ca1fd8e4471942f0c4ad"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T07:10:11.743408Z","signature_b64":"rMpieeclUd6BEWA/rXqB23VqXOZ0Ti0oAm/4V4Go5FOGmmzaVjfnExFM+eNW4vv1qGOTlokeMyzUIHRRiwCJAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"a079271c84e222703aed632d04bc69b4f9ac0bf268ba408eaa4a0311acef899a","last_reissued_at":"2026-07-05T07:10:11.742903Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T07:10:11.742903Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Measure transport via polynomial density surrogates","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.NA","math.ST","stat.TH"],"primary_cat":"math.NA","authors_text":"Jakob Zech, Josephine Westermann","submitted_at":"2023-11-07T17:54:59Z","abstract_excerpt":"We discuss an algorithm to compute transport maps that couple the uniform measure on $[0,1]^d$ with a specified target distribution $\\pi$ on $[0,1]^d$. The primary objectives are either to sample from or to compute expectations w.r.t. $\\pi$. The method is based on leveraging a polynomial surrogate of the target density, which is obtained by a least-squares or interpolation approximation. We discuss the design and construction of suitable sparse approximation spaces, and provide a complete error and cost analysis for target densities belonging to certain smoothness classes. Further, we explore "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2311.04172","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2311.04172/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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":"2311.04172","created_at":"2026-07-05T07:10:11.742964+00:00"},{"alias_kind":"arxiv_version","alias_value":"2311.04172v1","created_at":"2026-07-05T07:10:11.742964+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2311.04172","created_at":"2026-07-05T07:10:11.742964+00:00"},{"alias_kind":"pith_short_12","alias_value":"UB4SOHEE4IRH","created_at":"2026-07-05T07:10:11.742964+00:00"},{"alias_kind":"pith_short_16","alias_value":"UB4SOHEE4IRHAOXN","created_at":"2026-07-05T07:10:11.742964+00:00"},{"alias_kind":"pith_short_8","alias_value":"UB4SOHEE","created_at":"2026-07-05T07:10:11.742964+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":2,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2606.27564","citing_title":"Fast-Mixing Markov Chains without Gradients","ref_index":36,"is_internal_anchor":false},{"citing_arxiv_id":"2502.20086","citing_title":"Subspace accelerated measure transport methods for fast and scalable sequential experimental design, with application to photoacoustic imaging","ref_index":53,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/UB4SOHEE4IRHAOXNMMWQJPDJWT","json":"https://pith.science/pith/UB4SOHEE4IRHAOXNMMWQJPDJWT.json","graph_json":"https://pith.science/api/pith-number/UB4SOHEE4IRHAOXNMMWQJPDJWT/graph.json","events_json":"https://pith.science/api/pith-number/UB4SOHEE4IRHAOXNMMWQJPDJWT/events.json","paper":"https://pith.science/paper/UB4SOHEE"},"agent_actions":{"view_html":"https://pith.science/pith/UB4SOHEE4IRHAOXNMMWQJPDJWT","download_json":"https://pith.science/pith/UB4SOHEE4IRHAOXNMMWQJPDJWT.json","view_paper":"https://pith.science/paper/UB4SOHEE","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2311.04172&json=true","fetch_graph":"https://pith.science/api/pith-number/UB4SOHEE4IRHAOXNMMWQJPDJWT/graph.json","fetch_events":"https://pith.science/api/pith-number/UB4SOHEE4IRHAOXNMMWQJPDJWT/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/UB4SOHEE4IRHAOXNMMWQJPDJWT/action/timestamp_anchor","attest_storage":"https://pith.science/pith/UB4SOHEE4IRHAOXNMMWQJPDJWT/action/storage_attestation","attest_author":"https://pith.science/pith/UB4SOHEE4IRHAOXNMMWQJPDJWT/action/author_attestation","sign_citation":"https://pith.science/pith/UB4SOHEE4IRHAOXNMMWQJPDJWT/action/citation_signature","submit_replication":"https://pith.science/pith/UB4SOHEE4IRHAOXNMMWQJPDJWT/action/replication_record"}},"created_at":"2026-07-05T07:10:11.742964+00:00","updated_at":"2026-07-05T07:10:11.742964+00:00"}