{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2023:KN3JLFNHGBWFN5HWXRUMGWN6LA","short_pith_number":"pith:KN3JLFNH","schema_version":"1.0","canonical_sha256":"53769595a7306c56f4f6bc68c359be582f16372b97ec29afae290aff59be2412","source":{"kind":"arxiv","id":"2303.02554","version":1},"attestation_state":"computed","paper":{"title":"Self-reinforced polynomial approximation methods for concentrated probability densities","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.NA","stat.CO","stat.ML"],"primary_cat":"math.NA","authors_text":"Olivier Zahm, Sergey Dolgov, Tiangang Cui","submitted_at":"2023-03-05T02:44:02Z","abstract_excerpt":"Transport map methods offer a powerful statistical learning tool that can couple a target high-dimensional random variable with some reference random variable using invertible transformations. This paper presents new computational techniques for building the Knothe--Rosenblatt (KR) rearrangement based on general separable functions. We first introduce a new construction of the KR rearrangement -- with guaranteed invertibility in its numerical implementation -- based on approximating the density of the target random variable using tensor-product spectral polynomials and downward closed sparse i"},"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":"2303.02554","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NA","submitted_at":"2023-03-05T02:44:02Z","cross_cats_sorted":["cs.NA","stat.CO","stat.ML"],"title_canon_sha256":"d6824627ae2fcf7e85c6ce550fc8548546f3c735d8f95bb8e85648cce26f02d4","abstract_canon_sha256":"87e1bbe17c25c64dd3149b20001c1ba6d5788a4a0a996837aa142cec38ffe3c7"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T05:48:12.785312Z","signature_b64":"EDRWLmtxoeIOuAaqtyGGWiw/7VM99rXvWiiC2cpddg54US8TW68pq9dFeRh6GWTKqQP9MYcSr2jHwze5htcPBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"53769595a7306c56f4f6bc68c359be582f16372b97ec29afae290aff59be2412","last_reissued_at":"2026-07-05T05:48:12.784899Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T05:48:12.784899Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Self-reinforced polynomial approximation methods for concentrated probability densities","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.NA","stat.CO","stat.ML"],"primary_cat":"math.NA","authors_text":"Olivier Zahm, Sergey Dolgov, Tiangang Cui","submitted_at":"2023-03-05T02:44:02Z","abstract_excerpt":"Transport map methods offer a powerful statistical learning tool that can couple a target high-dimensional random variable with some reference random variable using invertible transformations. This paper presents new computational techniques for building the Knothe--Rosenblatt (KR) rearrangement based on general separable functions. We first introduce a new construction of the KR rearrangement -- with guaranteed invertibility in its numerical implementation -- based on approximating the density of the target random variable using tensor-product spectral polynomials and downward closed sparse i"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2303.02554","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/2303.02554/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":"2303.02554","created_at":"2026-07-05T05:48:12.784963+00:00"},{"alias_kind":"arxiv_version","alias_value":"2303.02554v1","created_at":"2026-07-05T05:48:12.784963+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2303.02554","created_at":"2026-07-05T05:48:12.784963+00:00"},{"alias_kind":"pith_short_12","alias_value":"KN3JLFNHGBWF","created_at":"2026-07-05T05:48:12.784963+00:00"},{"alias_kind":"pith_short_16","alias_value":"KN3JLFNHGBWFN5HW","created_at":"2026-07-05T05:48:12.784963+00:00"},{"alias_kind":"pith_short_8","alias_value":"KN3JLFNH","created_at":"2026-07-05T05:48:12.784963+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":0,"sample":[{"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":17,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/KN3JLFNHGBWFN5HWXRUMGWN6LA","json":"https://pith.science/pith/KN3JLFNHGBWFN5HWXRUMGWN6LA.json","graph_json":"https://pith.science/api/pith-number/KN3JLFNHGBWFN5HWXRUMGWN6LA/graph.json","events_json":"https://pith.science/api/pith-number/KN3JLFNHGBWFN5HWXRUMGWN6LA/events.json","paper":"https://pith.science/paper/KN3JLFNH"},"agent_actions":{"view_html":"https://pith.science/pith/KN3JLFNHGBWFN5HWXRUMGWN6LA","download_json":"https://pith.science/pith/KN3JLFNHGBWFN5HWXRUMGWN6LA.json","view_paper":"https://pith.science/paper/KN3JLFNH","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2303.02554&json=true","fetch_graph":"https://pith.science/api/pith-number/KN3JLFNHGBWFN5HWXRUMGWN6LA/graph.json","fetch_events":"https://pith.science/api/pith-number/KN3JLFNHGBWFN5HWXRUMGWN6LA/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/KN3JLFNHGBWFN5HWXRUMGWN6LA/action/timestamp_anchor","attest_storage":"https://pith.science/pith/KN3JLFNHGBWFN5HWXRUMGWN6LA/action/storage_attestation","attest_author":"https://pith.science/pith/KN3JLFNHGBWFN5HWXRUMGWN6LA/action/author_attestation","sign_citation":"https://pith.science/pith/KN3JLFNHGBWFN5HWXRUMGWN6LA/action/citation_signature","submit_replication":"https://pith.science/pith/KN3JLFNHGBWFN5HWXRUMGWN6LA/action/replication_record"}},"created_at":"2026-07-05T05:48:12.784963+00:00","updated_at":"2026-07-05T05:48:12.784963+00:00"}