{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2010:QHUJQOAWQVRSRD3PMBLE52XP7C","short_pith_number":"pith:QHUJQOAW","canonical_record":{"source":{"id":"1001.1347","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2010-01-08T19:44:05Z","cross_cats_sorted":[],"title_canon_sha256":"311b50853ea9bd5e1ddcd3d4e20937ad1751be04f93bc7c7cf1165806eac2c20","abstract_canon_sha256":"cfce8d1825577d76e6dee123ee9fbe94cf7a0921b69e4514a0dc8dc7f4f81b27"},"schema_version":"1.0"},"canonical_sha256":"81e89838168563288f6f60564eeaeff88189ab8a35397f15370200d8a53b0eb5","source":{"kind":"arxiv","id":"1001.1347","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1001.1347","created_at":"2026-05-18T00:23:09Z"},{"alias_kind":"arxiv_version","alias_value":"1001.1347v1","created_at":"2026-05-18T00:23:09Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1001.1347","created_at":"2026-05-18T00:23:09Z"},{"alias_kind":"pith_short_12","alias_value":"QHUJQOAWQVRS","created_at":"2026-05-18T12:26:12Z"},{"alias_kind":"pith_short_16","alias_value":"QHUJQOAWQVRSRD3P","created_at":"2026-05-18T12:26:12Z"},{"alias_kind":"pith_short_8","alias_value":"QHUJQOAW","created_at":"2026-05-18T12:26:12Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2010:QHUJQOAWQVRSRD3PMBLE52XP7C","target":"record","payload":{"canonical_record":{"source":{"id":"1001.1347","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2010-01-08T19:44:05Z","cross_cats_sorted":[],"title_canon_sha256":"311b50853ea9bd5e1ddcd3d4e20937ad1751be04f93bc7c7cf1165806eac2c20","abstract_canon_sha256":"cfce8d1825577d76e6dee123ee9fbe94cf7a0921b69e4514a0dc8dc7f4f81b27"},"schema_version":"1.0"},"canonical_sha256":"81e89838168563288f6f60564eeaeff88189ab8a35397f15370200d8a53b0eb5","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:23:09.938396Z","signature_b64":"Fco7cm0ahD2B7DE/9/y6DPRLVubahN341mfzenB8ZB5e8/s6zQduk5/oPxL/IwX1EcnzA2vOgANMMOskUUVyBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"81e89838168563288f6f60564eeaeff88189ab8a35397f15370200d8a53b0eb5","last_reissued_at":"2026-05-18T00:23:09.937876Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:23:09.937876Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1001.1347","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-18T00:23:09Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"R139qLw6dQ72rmGYHiRHXOcV2z8ZLg4JEKTEeADycKUZ362qMga4UIQ30K7DgHXwpHiZSLpLQSUs6JJE+V8fDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-24T14:35:36.709786Z"},"content_sha256":"ec7be23c93ae21b6851c759ed19cb60873e259c1d2177d6fec163d512f5277a6","schema_version":"1.0","event_id":"sha256:ec7be23c93ae21b6851c759ed19cb60873e259c1d2177d6fec163d512f5277a6"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2010:QHUJQOAWQVRSRD3PMBLE52XP7C","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"On some Non Asymptotic Bounds for the Euler Scheme","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.PR","authors_text":"Stephane Menozzi (PMA), Vincent Lemaire (PMA)","submitted_at":"2010-01-08T19:44:05Z","abstract_excerpt":"We obtain non asymptotic bounds for the Monte Carlo algorithm associated to the Euler discretization of some diffusion processes. The key tool is the Gaussian concentration satisfied by the density of the discretization scheme. This Gaussian concentration is derived from a Gaussian upper bound of the density of the scheme and a modification of the so-called \"Herbst argument\" used to prove Logarithmic Sobolev inequalities. We eventually establish a Gaussian lower bound for the density of the scheme that emphasizes the concentration is sharp."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1001.1347","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-18T00:23:09Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"+YJHvFaLBMoQ6Gf2v2Vz2CMi96Yg6zPLvWePOaf4fr5Oj2x0825aJaQk++oudDBSQWKJb8iT2pEn3gQDNCDRDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-24T14:35:36.710125Z"},"content_sha256":"c27538eabe2e3a5fa9a032b2141be3be0a91c4ed82fb4cf97f6eadc135689f94","schema_version":"1.0","event_id":"sha256:c27538eabe2e3a5fa9a032b2141be3be0a91c4ed82fb4cf97f6eadc135689f94"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/QHUJQOAWQVRSRD3PMBLE52XP7C/bundle.json","state_url":"https://pith.science/pith/QHUJQOAWQVRSRD3PMBLE52XP7C/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/QHUJQOAWQVRSRD3PMBLE52XP7C/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-06-24T14:35:36Z","links":{"resolver":"https://pith.science/pith/QHUJQOAWQVRSRD3PMBLE52XP7C","bundle":"https://pith.science/pith/QHUJQOAWQVRSRD3PMBLE52XP7C/bundle.json","state":"https://pith.science/pith/QHUJQOAWQVRSRD3PMBLE52XP7C/state.json","well_known_bundle":"https://pith.science/.well-known/pith/QHUJQOAWQVRSRD3PMBLE52XP7C/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2010:QHUJQOAWQVRSRD3PMBLE52XP7C","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":"cfce8d1825577d76e6dee123ee9fbe94cf7a0921b69e4514a0dc8dc7f4f81b27","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2010-01-08T19:44:05Z","title_canon_sha256":"311b50853ea9bd5e1ddcd3d4e20937ad1751be04f93bc7c7cf1165806eac2c20"},"schema_version":"1.0","source":{"id":"1001.1347","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1001.1347","created_at":"2026-05-18T00:23:09Z"},{"alias_kind":"arxiv_version","alias_value":"1001.1347v1","created_at":"2026-05-18T00:23:09Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1001.1347","created_at":"2026-05-18T00:23:09Z"},{"alias_kind":"pith_short_12","alias_value":"QHUJQOAWQVRS","created_at":"2026-05-18T12:26:12Z"},{"alias_kind":"pith_short_16","alias_value":"QHUJQOAWQVRSRD3P","created_at":"2026-05-18T12:26:12Z"},{"alias_kind":"pith_short_8","alias_value":"QHUJQOAW","created_at":"2026-05-18T12:26:12Z"}],"graph_snapshots":[{"event_id":"sha256:c27538eabe2e3a5fa9a032b2141be3be0a91c4ed82fb4cf97f6eadc135689f94","target":"graph","created_at":"2026-05-18T00:23:09Z","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 obtain non asymptotic bounds for the Monte Carlo algorithm associated to the Euler discretization of some diffusion processes. The key tool is the Gaussian concentration satisfied by the density of the discretization scheme. This Gaussian concentration is derived from a Gaussian upper bound of the density of the scheme and a modification of the so-called \"Herbst argument\" used to prove Logarithmic Sobolev inequalities. We eventually establish a Gaussian lower bound for the density of the scheme that emphasizes the concentration is sharp.","authors_text":"Stephane Menozzi (PMA), Vincent Lemaire (PMA)","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2010-01-08T19:44:05Z","title":"On some Non Asymptotic Bounds for the Euler Scheme"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1001.1347","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:ec7be23c93ae21b6851c759ed19cb60873e259c1d2177d6fec163d512f5277a6","target":"record","created_at":"2026-05-18T00:23:09Z","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":"cfce8d1825577d76e6dee123ee9fbe94cf7a0921b69e4514a0dc8dc7f4f81b27","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2010-01-08T19:44:05Z","title_canon_sha256":"311b50853ea9bd5e1ddcd3d4e20937ad1751be04f93bc7c7cf1165806eac2c20"},"schema_version":"1.0","source":{"id":"1001.1347","kind":"arxiv","version":1}},"canonical_sha256":"81e89838168563288f6f60564eeaeff88189ab8a35397f15370200d8a53b0eb5","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"81e89838168563288f6f60564eeaeff88189ab8a35397f15370200d8a53b0eb5","first_computed_at":"2026-05-18T00:23:09.937876Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:23:09.937876Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"Fco7cm0ahD2B7DE/9/y6DPRLVubahN341mfzenB8ZB5e8/s6zQduk5/oPxL/IwX1EcnzA2vOgANMMOskUUVyBw==","signature_status":"signed_v1","signed_at":"2026-05-18T00:23:09.938396Z","signed_message":"canonical_sha256_bytes"},"source_id":"1001.1347","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:ec7be23c93ae21b6851c759ed19cb60873e259c1d2177d6fec163d512f5277a6","sha256:c27538eabe2e3a5fa9a032b2141be3be0a91c4ed82fb4cf97f6eadc135689f94"],"state_sha256":"72c026e295b232b22570f45de2ac974d62de13631a5b671ea87994a678d841d2"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"06AwcIgfU6TI++TVPfhTVUVJf2r8HnjIo7oCHDGmQHZ6uIQai1Ac5ZqjbsRaNw80KsDkBYDD4XWcTWYQVCsODA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-24T14:35:36.712029Z","bundle_sha256":"860afc3751ae730e8ec30d525f475f1eff83e84f9174d74967d1b9ece496109b"}}