{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2019:VVYR6ZDJKPF44AJZB72E6LVE6R","short_pith_number":"pith:VVYR6ZDJ","schema_version":"1.0","canonical_sha256":"ad711f646953cbce01390ff44f2ea4f466f3e18b6c69eac8bfd804f9637e5f5f","source":{"kind":"arxiv","id":"1909.00099","version":2},"attestation_state":"computed","paper":{"title":"Strong convergence of an adaptive time-stepping Milstein method for SDEs with monotone coefficients","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.NA"],"primary_cat":"math.NA","authors_text":"C\\'onall Kelly, Fandi Sun, Gabriel Lord","submitted_at":"2019-08-31T00:37:22Z","abstract_excerpt":"We introduce an explicit adaptive Milstein method for stochastic differential equations (SDEs) with no commutativity condition. The drift and diffusion are separately locally Lipschitz and together satisfy a monotone condition. This method relies on a class of path-bounded time-stepping strategies which work by reducing the stepsize as solutions approach the boundary of a sphere, invoking a backstop method in the event that the timestep becomes too small. We prove that such schemes are strongly $L_2$ convergent of order one. This order is inherited by an explicit adaptive Euler-Maruyama scheme"},"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":"1909.00099","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NA","submitted_at":"2019-08-31T00:37:22Z","cross_cats_sorted":["cs.NA"],"title_canon_sha256":"7e2be6bc0fceed70451eb3341bdce9aaa17e32c8f103049d6cf5f1a4c96c9d4f","abstract_canon_sha256":"0506650dfcc2db938a6470b1e3dd5cbbeb40c3480eab1fac90699c7d64c833d4"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T05:17:22.768270Z","signature_b64":"NfB4KNU50fkzpDJtB0QnYXsr7GHR04yYUqPXiz9NGTUxwgIhe0b9JNAJfK9MpQfp94t1qlfEvBZ7i4lSy1MZBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"ad711f646953cbce01390ff44f2ea4f466f3e18b6c69eac8bfd804f9637e5f5f","last_reissued_at":"2026-07-05T05:17:22.767742Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T05:17:22.767742Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Strong convergence of an adaptive time-stepping Milstein method for SDEs with monotone coefficients","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.NA"],"primary_cat":"math.NA","authors_text":"C\\'onall Kelly, Fandi Sun, Gabriel Lord","submitted_at":"2019-08-31T00:37:22Z","abstract_excerpt":"We introduce an explicit adaptive Milstein method for stochastic differential equations (SDEs) with no commutativity condition. The drift and diffusion are separately locally Lipschitz and together satisfy a monotone condition. This method relies on a class of path-bounded time-stepping strategies which work by reducing the stepsize as solutions approach the boundary of a sphere, invoking a backstop method in the event that the timestep becomes too small. We prove that such schemes are strongly $L_2$ convergent of order one. This order is inherited by an explicit adaptive Euler-Maruyama scheme"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1909.00099","kind":"arxiv","version":2},"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/1909.00099/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":"1909.00099","created_at":"2026-07-05T05:17:22.767809+00:00"},{"alias_kind":"arxiv_version","alias_value":"1909.00099v2","created_at":"2026-07-05T05:17:22.767809+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1909.00099","created_at":"2026-07-05T05:17:22.767809+00:00"},{"alias_kind":"pith_short_12","alias_value":"VVYR6ZDJKPF4","created_at":"2026-07-05T05:17:22.767809+00:00"},{"alias_kind":"pith_short_16","alias_value":"VVYR6ZDJKPF44AJZ","created_at":"2026-07-05T05:17:22.767809+00:00"},{"alias_kind":"pith_short_8","alias_value":"VVYR6ZDJ","created_at":"2026-07-05T05:17:22.767809+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2605.07939","citing_title":"Accelerating Langevin Monte Carlo via Efficient Stochastic Runge--Kutta Methods beyond Log-Concavity","ref_index":120,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/VVYR6ZDJKPF44AJZB72E6LVE6R","json":"https://pith.science/pith/VVYR6ZDJKPF44AJZB72E6LVE6R.json","graph_json":"https://pith.science/api/pith-number/VVYR6ZDJKPF44AJZB72E6LVE6R/graph.json","events_json":"https://pith.science/api/pith-number/VVYR6ZDJKPF44AJZB72E6LVE6R/events.json","paper":"https://pith.science/paper/VVYR6ZDJ"},"agent_actions":{"view_html":"https://pith.science/pith/VVYR6ZDJKPF44AJZB72E6LVE6R","download_json":"https://pith.science/pith/VVYR6ZDJKPF44AJZB72E6LVE6R.json","view_paper":"https://pith.science/paper/VVYR6ZDJ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1909.00099&json=true","fetch_graph":"https://pith.science/api/pith-number/VVYR6ZDJKPF44AJZB72E6LVE6R/graph.json","fetch_events":"https://pith.science/api/pith-number/VVYR6ZDJKPF44AJZB72E6LVE6R/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/VVYR6ZDJKPF44AJZB72E6LVE6R/action/timestamp_anchor","attest_storage":"https://pith.science/pith/VVYR6ZDJKPF44AJZB72E6LVE6R/action/storage_attestation","attest_author":"https://pith.science/pith/VVYR6ZDJKPF44AJZB72E6LVE6R/action/author_attestation","sign_citation":"https://pith.science/pith/VVYR6ZDJKPF44AJZB72E6LVE6R/action/citation_signature","submit_replication":"https://pith.science/pith/VVYR6ZDJKPF44AJZB72E6LVE6R/action/replication_record"}},"created_at":"2026-07-05T05:17:22.767809+00:00","updated_at":"2026-07-05T05:17:22.767809+00:00"}