{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2019:VROCHXXUIMAVZUO56HHKALGZZG","short_pith_number":"pith:VROCHXXU","schema_version":"1.0","canonical_sha256":"ac5c23def443015cd1ddf1cea02cd9c9881cb7e882ee13e7c86e597b77649ccd","source":{"kind":"arxiv","id":"1904.06998","version":3},"attestation_state":"computed","paper":{"title":"An optimal polynomial approximation of Brownian motion","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.NA","math.PR"],"primary_cat":"math.NA","authors_text":"Harald Oberhauser, James Foster, Terry Lyons","submitted_at":"2019-04-15T12:37:33Z","abstract_excerpt":"In this paper, we will present a strong (or pathwise) approximation of standard Brownian motion by a class of orthogonal polynomials. The coefficients that are obtained from the expansion of Brownian motion in this polynomial basis are independent Gaussian random variables. Therefore it is practical (requires $N$ independent Gaussian coefficients) to generate an approximate sample path of Brownian motion that respects integration of polynomials with degree less than $N$. Moreover, since these orthogonal polynomials appear naturally as eigenfunctions of an integral operator defined by the Brown"},"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":"1904.06998","kind":"arxiv","version":3},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.NA","submitted_at":"2019-04-15T12:37:33Z","cross_cats_sorted":["cs.NA","math.PR"],"title_canon_sha256":"03134275b4851a854a32c0803c66e54436b83e0381fa1d517d27504098d3a65c","abstract_canon_sha256":"456af5e1b650626486743f79eb348462992d27fc744eb9a6c3a200e6fccffac2"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T01:04:27.743925Z","signature_b64":"ye5dcFz/6ICZZloxEnUGfRmOM6zzfcuaeKq3eRZ1Z3yuCOdGAJttdEmpvtr0boOJsKWbW5J/tzIkWnd6Hk2MCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"ac5c23def443015cd1ddf1cea02cd9c9881cb7e882ee13e7c86e597b77649ccd","last_reissued_at":"2026-07-05T01:04:27.743445Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T01:04:27.743445Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"An optimal polynomial approximation of Brownian motion","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.NA","math.PR"],"primary_cat":"math.NA","authors_text":"Harald Oberhauser, James Foster, Terry Lyons","submitted_at":"2019-04-15T12:37:33Z","abstract_excerpt":"In this paper, we will present a strong (or pathwise) approximation of standard Brownian motion by a class of orthogonal polynomials. The coefficients that are obtained from the expansion of Brownian motion in this polynomial basis are independent Gaussian random variables. Therefore it is practical (requires $N$ independent Gaussian coefficients) to generate an approximate sample path of Brownian motion that respects integration of polynomials with degree less than $N$. Moreover, since these orthogonal polynomials appear naturally as eigenfunctions of an integral operator defined by the Brown"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1904.06998","kind":"arxiv","version":3},"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/1904.06998/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":"1904.06998","created_at":"2026-07-05T01:04:27.743510+00:00"},{"alias_kind":"arxiv_version","alias_value":"1904.06998v3","created_at":"2026-07-05T01:04:27.743510+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1904.06998","created_at":"2026-07-05T01:04:27.743510+00:00"},{"alias_kind":"pith_short_12","alias_value":"VROCHXXUIMAV","created_at":"2026-07-05T01:04:27.743510+00:00"},{"alias_kind":"pith_short_16","alias_value":"VROCHXXUIMAVZUO5","created_at":"2026-07-05T01:04:27.743510+00:00"},{"alias_kind":"pith_short_8","alias_value":"VROCHXXU","created_at":"2026-07-05T01:04:27.743510+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"1908.08286","citing_title":"Learning stochastic differential equations using RNN with log signature features","ref_index":8,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/VROCHXXUIMAVZUO56HHKALGZZG","json":"https://pith.science/pith/VROCHXXUIMAVZUO56HHKALGZZG.json","graph_json":"https://pith.science/api/pith-number/VROCHXXUIMAVZUO56HHKALGZZG/graph.json","events_json":"https://pith.science/api/pith-number/VROCHXXUIMAVZUO56HHKALGZZG/events.json","paper":"https://pith.science/paper/VROCHXXU"},"agent_actions":{"view_html":"https://pith.science/pith/VROCHXXUIMAVZUO56HHKALGZZG","download_json":"https://pith.science/pith/VROCHXXUIMAVZUO56HHKALGZZG.json","view_paper":"https://pith.science/paper/VROCHXXU","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1904.06998&json=true","fetch_graph":"https://pith.science/api/pith-number/VROCHXXUIMAVZUO56HHKALGZZG/graph.json","fetch_events":"https://pith.science/api/pith-number/VROCHXXUIMAVZUO56HHKALGZZG/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/VROCHXXUIMAVZUO56HHKALGZZG/action/timestamp_anchor","attest_storage":"https://pith.science/pith/VROCHXXUIMAVZUO56HHKALGZZG/action/storage_attestation","attest_author":"https://pith.science/pith/VROCHXXUIMAVZUO56HHKALGZZG/action/author_attestation","sign_citation":"https://pith.science/pith/VROCHXXUIMAVZUO56HHKALGZZG/action/citation_signature","submit_replication":"https://pith.science/pith/VROCHXXUIMAVZUO56HHKALGZZG/action/replication_record"}},"created_at":"2026-07-05T01:04:27.743510+00:00","updated_at":"2026-07-05T01:04:27.743510+00:00"}