{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2014:7ZHLTKO3HL4PCEUCS6EMSYA46P","short_pith_number":"pith:7ZHLTKO3","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"},"canonical_sha256":"fe4eb9a9db3af8f112829788c9601cf3fba2cf680ac7c1c7e26f63d017fa6df0","source":{"kind":"arxiv","id":"1401.6055","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1401.6055","created_at":"2026-05-18T03:01:22Z"},{"alias_kind":"arxiv_version","alias_value":"1401.6055v1","created_at":"2026-05-18T03:01:22Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1401.6055","created_at":"2026-05-18T03:01:22Z"},{"alias_kind":"pith_short_12","alias_value":"7ZHLTKO3HL4P","created_at":"2026-05-18T12:28:19Z"},{"alias_kind":"pith_short_16","alias_value":"7ZHLTKO3HL4PCEUC","created_at":"2026-05-18T12:28:19Z"},{"alias_kind":"pith_short_8","alias_value":"7ZHLTKO3","created_at":"2026-05-18T12:28:19Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2014:7ZHLTKO3HL4PCEUCS6EMSYA46P","target":"record","payload":{"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"},"canonical_sha256":"fe4eb9a9db3af8f112829788c9601cf3fba2cf680ac7c1c7e26f63d017fa6df0","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"},"source_kind":"arxiv","source_id":"1401.6055","source_version":1,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T03:01:22Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"hPrCyDfBZN+xyGbPHQbgROJiXhKGB0IJUz4qKcJM5cvY+uwV5+7MSiuw9hCcDYFiR7b+O6fO5XSFeupsrvEBCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T13:45:44.413056Z"},"content_sha256":"70c139c190c903e90c044b64824e0e8a57f04bdcd2fca326de3dba172008cf3e","schema_version":"1.0","event_id":"sha256:70c139c190c903e90c044b64824e0e8a57f04bdcd2fca326de3dba172008cf3e"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2014:7ZHLTKO3HL4PCEUCS6EMSYA46P","target":"graph","payload":{"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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T03:01:22Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"PWPVP2ygjnLyObvxCtNUJ7ni4ESBut0I8uzPUDhdGYFWVXiNfMONp7ihiVDYuHvZ5SJEy1Zr99EF4cEmUBDeDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T13:45:44.413541Z"},"content_sha256":"eedf96f6a9536f33f95989676060e824fdf0dff01d923144bc67dafc202cbfc3","schema_version":"1.0","event_id":"sha256:eedf96f6a9536f33f95989676060e824fdf0dff01d923144bc67dafc202cbfc3"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/7ZHLTKO3HL4PCEUCS6EMSYA46P/bundle.json","state_url":"https://pith.science/pith/7ZHLTKO3HL4PCEUCS6EMSYA46P/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/7ZHLTKO3HL4PCEUCS6EMSYA46P/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-05-27T13:45:44Z","links":{"resolver":"https://pith.science/pith/7ZHLTKO3HL4PCEUCS6EMSYA46P","bundle":"https://pith.science/pith/7ZHLTKO3HL4PCEUCS6EMSYA46P/bundle.json","state":"https://pith.science/pith/7ZHLTKO3HL4PCEUCS6EMSYA46P/state.json","well_known_bundle":"https://pith.science/.well-known/pith/7ZHLTKO3HL4PCEUCS6EMSYA46P/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:7ZHLTKO3HL4PCEUCS6EMSYA46P","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"a7909227345b5338e9c333a68fa4232599c6f2065f401b984371d525ec5d2278","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2014-01-23T17:05:34Z","title_canon_sha256":"570b657a38dd2110ce91815f7e19a41c4d6637f01f48ad90767f93b9a246ff5f"},"schema_version":"1.0","source":{"id":"1401.6055","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1401.6055","created_at":"2026-05-18T03:01:22Z"},{"alias_kind":"arxiv_version","alias_value":"1401.6055v1","created_at":"2026-05-18T03:01:22Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1401.6055","created_at":"2026-05-18T03:01:22Z"},{"alias_kind":"pith_short_12","alias_value":"7ZHLTKO3HL4P","created_at":"2026-05-18T12:28:19Z"},{"alias_kind":"pith_short_16","alias_value":"7ZHLTKO3HL4PCEUC","created_at":"2026-05-18T12:28:19Z"},{"alias_kind":"pith_short_8","alias_value":"7ZHLTKO3","created_at":"2026-05-18T12:28:19Z"}],"graph_snapshots":[{"event_id":"sha256:eedf96f6a9536f33f95989676060e824fdf0dff01d923144bc67dafc202cbfc3","target":"graph","created_at":"2026-05-18T03:01:22Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"paper":{"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.","authors_text":"Dane Johnson, Paul Dupuis","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2014-01-23T17:05:34Z","title":"Moderate deviations for recursive stochastic algorithms"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1401.6055","kind":"arxiv","version":1},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:70c139c190c903e90c044b64824e0e8a57f04bdcd2fca326de3dba172008cf3e","target":"record","created_at":"2026-05-18T03:01:22Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"a7909227345b5338e9c333a68fa4232599c6f2065f401b984371d525ec5d2278","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2014-01-23T17:05:34Z","title_canon_sha256":"570b657a38dd2110ce91815f7e19a41c4d6637f01f48ad90767f93b9a246ff5f"},"schema_version":"1.0","source":{"id":"1401.6055","kind":"arxiv","version":1}},"canonical_sha256":"fe4eb9a9db3af8f112829788c9601cf3fba2cf680ac7c1c7e26f63d017fa6df0","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"fe4eb9a9db3af8f112829788c9601cf3fba2cf680ac7c1c7e26f63d017fa6df0","first_computed_at":"2026-05-18T03:01:22.987069Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:01:22.987069Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"ElYlebMz/k4YpR+Ze2m2LlmEsBkLbjCG8dWWn4K71Dqjp+1TmTMS0Byu7mXrGrWY9zytirNTIHO41qPBET7jBw==","signature_status":"signed_v1","signed_at":"2026-05-18T03:01:22.987819Z","signed_message":"canonical_sha256_bytes"},"source_id":"1401.6055","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:70c139c190c903e90c044b64824e0e8a57f04bdcd2fca326de3dba172008cf3e","sha256:eedf96f6a9536f33f95989676060e824fdf0dff01d923144bc67dafc202cbfc3"],"state_sha256":"a265eae404e1d9d01acebda0c2847aa77a71def51eb73a142e78972e650412a3"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"tSKNTZOprJKTIg3qIMcsdawlUXan7LQy7UCegodBotj9f9rkBEh2iZKEEfjnUGRO8qNgAaoERF5HUzcXh0XrBA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-27T13:45:44.416349Z","bundle_sha256":"7a8858e1810d278c69f2e7f913d09b05f7562c9054bb01fb6b8140bebb83a311"}}