{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:ZXYS5ULFQXFYKFFLBYR5VYE2YK","short_pith_number":"pith:ZXYS5ULF","schema_version":"1.0","canonical_sha256":"cdf12ed16585cb8514ab0e23dae09ac29897141406b4af5b65c7259eed1a7a8d","source":{"kind":"arxiv","id":"1505.06075","version":1},"attestation_state":"computed","paper":{"title":"The Stein-Dirichlet-Malliavin method","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.PR","authors_text":"Laurent Decreusefond (LTCI)","submitted_at":"2015-05-22T13:40:57Z","abstract_excerpt":"The Stein's method is a popular method used to derive upper-bounds of distances between probability distributions. It can be viewed, in certain of its formulations, as an avatar of the semi-group or of the smart-path method used commonly in Gaussian analysis. We show how this procedure can be enriched by Malliavin calculus leading to a functional approach valid in infinite dimensional spaces."},"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":"1505.06075","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2015-05-22T13:40:57Z","cross_cats_sorted":[],"title_canon_sha256":"b16490a4c5ba3e03f7b4d804851ced4236790669b3f96649792173e758e6c899","abstract_canon_sha256":"4735326e77e14a4f5ad3ee04553e88859c85cc7e09e0c6774f260048f1215470"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:03:49.209850Z","signature_b64":"AdsyouCO+IRiy62WymaOVrGmFVpF4IsksjtavObmgWVDI0yiS3Nl7xo/3VZIf/mP+wU1cofHlmWPypKSW3ZHDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"cdf12ed16585cb8514ab0e23dae09ac29897141406b4af5b65c7259eed1a7a8d","last_reissued_at":"2026-05-18T02:03:49.209353Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:03:49.209353Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"The Stein-Dirichlet-Malliavin method","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.PR","authors_text":"Laurent Decreusefond (LTCI)","submitted_at":"2015-05-22T13:40:57Z","abstract_excerpt":"The Stein's method is a popular method used to derive upper-bounds of distances between probability distributions. It can be viewed, in certain of its formulations, as an avatar of the semi-group or of the smart-path method used commonly in Gaussian analysis. We show how this procedure can be enriched by Malliavin calculus leading to a functional approach valid in infinite dimensional spaces."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1505.06075","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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1505.06075","created_at":"2026-05-18T02:03:49.209426+00:00"},{"alias_kind":"arxiv_version","alias_value":"1505.06075v1","created_at":"2026-05-18T02:03:49.209426+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1505.06075","created_at":"2026-05-18T02:03:49.209426+00:00"},{"alias_kind":"pith_short_12","alias_value":"ZXYS5ULFQXFY","created_at":"2026-05-18T12:29:52.810259+00:00"},{"alias_kind":"pith_short_16","alias_value":"ZXYS5ULFQXFYKFFL","created_at":"2026-05-18T12:29:52.810259+00:00"},{"alias_kind":"pith_short_8","alias_value":"ZXYS5ULF","created_at":"2026-05-18T12:29:52.810259+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/ZXYS5ULFQXFYKFFLBYR5VYE2YK","json":"https://pith.science/pith/ZXYS5ULFQXFYKFFLBYR5VYE2YK.json","graph_json":"https://pith.science/api/pith-number/ZXYS5ULFQXFYKFFLBYR5VYE2YK/graph.json","events_json":"https://pith.science/api/pith-number/ZXYS5ULFQXFYKFFLBYR5VYE2YK/events.json","paper":"https://pith.science/paper/ZXYS5ULF"},"agent_actions":{"view_html":"https://pith.science/pith/ZXYS5ULFQXFYKFFLBYR5VYE2YK","download_json":"https://pith.science/pith/ZXYS5ULFQXFYKFFLBYR5VYE2YK.json","view_paper":"https://pith.science/paper/ZXYS5ULF","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1505.06075&json=true","fetch_graph":"https://pith.science/api/pith-number/ZXYS5ULFQXFYKFFLBYR5VYE2YK/graph.json","fetch_events":"https://pith.science/api/pith-number/ZXYS5ULFQXFYKFFLBYR5VYE2YK/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/ZXYS5ULFQXFYKFFLBYR5VYE2YK/action/timestamp_anchor","attest_storage":"https://pith.science/pith/ZXYS5ULFQXFYKFFLBYR5VYE2YK/action/storage_attestation","attest_author":"https://pith.science/pith/ZXYS5ULFQXFYKFFLBYR5VYE2YK/action/author_attestation","sign_citation":"https://pith.science/pith/ZXYS5ULFQXFYKFFLBYR5VYE2YK/action/citation_signature","submit_replication":"https://pith.science/pith/ZXYS5ULFQXFYKFFLBYR5VYE2YK/action/replication_record"}},"created_at":"2026-05-18T02:03:49.209426+00:00","updated_at":"2026-05-18T02:03:49.209426+00:00"}