{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2014:7ZHLTKO3HL4PCEUCS6EMSYA46P","short_pith_number":"pith:7ZHLTKO3","schema_version":"1.0","canonical_sha256":"fe4eb9a9db3af8f112829788c9601cf3fba2cf680ac7c1c7e26f63d017fa6df0","source":{"kind":"arxiv","id":"1401.6055","version":1},"attestation_state":"computed","paper":{"title":"Moderate deviations for recursive stochastic algorithms","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.PR","authors_text":"Dane Johnson, Paul Dupuis","submitted_at":"2014-01-23T17:05:34Z","abstract_excerpt":"We prove a moderate deviation principle for the continuous time interpolation of discrete time recursive stochastic processes. The methods of proof are somewhat different from the corresponding large deviation result, and in particular the proof of the upper bound is more complicated. The results can be applied to the design of accelerated Monte Carlo algorithms for certain problems, where schemes based on moderate deviations are easier to construct and in certain situations provide performance comparable to those based on large deviations."},"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":"1401.6055","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2014-01-23T17:05:34Z","cross_cats_sorted":[],"title_canon_sha256":"570b657a38dd2110ce91815f7e19a41c4d6637f01f48ad90767f93b9a246ff5f","abstract_canon_sha256":"a7909227345b5338e9c333a68fa4232599c6f2065f401b984371d525ec5d2278"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:01:22.987819Z","signature_b64":"ElYlebMz/k4YpR+Ze2m2LlmEsBkLbjCG8dWWn4K71Dqjp+1TmTMS0Byu7mXrGrWY9zytirNTIHO41qPBET7jBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"fe4eb9a9db3af8f112829788c9601cf3fba2cf680ac7c1c7e26f63d017fa6df0","last_reissued_at":"2026-05-18T03:01:22.987069Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:01:22.987069Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Moderate deviations for recursive stochastic algorithms","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.PR","authors_text":"Dane Johnson, Paul Dupuis","submitted_at":"2014-01-23T17:05:34Z","abstract_excerpt":"We prove a moderate deviation principle for the continuous time interpolation of discrete time recursive stochastic processes. The methods of proof are somewhat different from the corresponding large deviation result, and in particular the proof of the upper bound is more complicated. The results can be applied to the design of accelerated Monte Carlo algorithms for certain problems, where schemes based on moderate deviations are easier to construct and in certain situations provide performance comparable to those based on large deviations."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1401.6055","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":"1401.6055","created_at":"2026-05-18T03:01:22.987174+00:00"},{"alias_kind":"arxiv_version","alias_value":"1401.6055v1","created_at":"2026-05-18T03:01:22.987174+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1401.6055","created_at":"2026-05-18T03:01:22.987174+00:00"},{"alias_kind":"pith_short_12","alias_value":"7ZHLTKO3HL4P","created_at":"2026-05-18T12:28:19.803747+00:00"},{"alias_kind":"pith_short_16","alias_value":"7ZHLTKO3HL4PCEUC","created_at":"2026-05-18T12:28:19.803747+00:00"},{"alias_kind":"pith_short_8","alias_value":"7ZHLTKO3","created_at":"2026-05-18T12:28:19.803747+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/7ZHLTKO3HL4PCEUCS6EMSYA46P","json":"https://pith.science/pith/7ZHLTKO3HL4PCEUCS6EMSYA46P.json","graph_json":"https://pith.science/api/pith-number/7ZHLTKO3HL4PCEUCS6EMSYA46P/graph.json","events_json":"https://pith.science/api/pith-number/7ZHLTKO3HL4PCEUCS6EMSYA46P/events.json","paper":"https://pith.science/paper/7ZHLTKO3"},"agent_actions":{"view_html":"https://pith.science/pith/7ZHLTKO3HL4PCEUCS6EMSYA46P","download_json":"https://pith.science/pith/7ZHLTKO3HL4PCEUCS6EMSYA46P.json","view_paper":"https://pith.science/paper/7ZHLTKO3","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1401.6055&json=true","fetch_graph":"https://pith.science/api/pith-number/7ZHLTKO3HL4PCEUCS6EMSYA46P/graph.json","fetch_events":"https://pith.science/api/pith-number/7ZHLTKO3HL4PCEUCS6EMSYA46P/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/7ZHLTKO3HL4PCEUCS6EMSYA46P/action/timestamp_anchor","attest_storage":"https://pith.science/pith/7ZHLTKO3HL4PCEUCS6EMSYA46P/action/storage_attestation","attest_author":"https://pith.science/pith/7ZHLTKO3HL4PCEUCS6EMSYA46P/action/author_attestation","sign_citation":"https://pith.science/pith/7ZHLTKO3HL4PCEUCS6EMSYA46P/action/citation_signature","submit_replication":"https://pith.science/pith/7ZHLTKO3HL4PCEUCS6EMSYA46P/action/replication_record"}},"created_at":"2026-05-18T03:01:22.987174+00:00","updated_at":"2026-05-18T03:01:22.987174+00:00"}