{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2013:PABAAM2CZPGX2UIQTVHWNNPYF3","short_pith_number":"pith:PABAAM2C","canonical_record":{"source":{"id":"1302.6964","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ME","submitted_at":"2013-02-27T19:21:12Z","cross_cats_sorted":["math.PR","stat.CO"],"title_canon_sha256":"636f86497d2a41d7b9d3690abc41330e46ee7361315dd8443350a1b942efdb1a","abstract_canon_sha256":"95d87b8fc2f3980489a1068e35e3d13fd745c1414c3eacebc364c5442f10248c"},"schema_version":"1.0"},"canonical_sha256":"7802003342cbcd7d51109d4f66b5f82efb76ed04d6810db32364a8621ff2fd12","source":{"kind":"arxiv","id":"1302.6964","version":4},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1302.6964","created_at":"2026-05-18T01:21:08Z"},{"alias_kind":"arxiv_version","alias_value":"1302.6964v4","created_at":"2026-05-18T01:21:08Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1302.6964","created_at":"2026-05-18T01:21:08Z"},{"alias_kind":"pith_short_12","alias_value":"PABAAM2CZPGX","created_at":"2026-05-18T12:27:54Z"},{"alias_kind":"pith_short_16","alias_value":"PABAAM2CZPGX2UIQ","created_at":"2026-05-18T12:27:54Z"},{"alias_kind":"pith_short_8","alias_value":"PABAAM2C","created_at":"2026-05-18T12:27:54Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2013:PABAAM2CZPGX2UIQTVHWNNPYF3","target":"record","payload":{"canonical_record":{"source":{"id":"1302.6964","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ME","submitted_at":"2013-02-27T19:21:12Z","cross_cats_sorted":["math.PR","stat.CO"],"title_canon_sha256":"636f86497d2a41d7b9d3690abc41330e46ee7361315dd8443350a1b942efdb1a","abstract_canon_sha256":"95d87b8fc2f3980489a1068e35e3d13fd745c1414c3eacebc364c5442f10248c"},"schema_version":"1.0"},"canonical_sha256":"7802003342cbcd7d51109d4f66b5f82efb76ed04d6810db32364a8621ff2fd12","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:21:08.904126Z","signature_b64":"pkuMcC3aqP7G8svTgwVNtOJafENUnn3epDgcN+nTxVzGcenp9sfXF/NpKA7iDRff4CObtU+feuS3axJ7P/3vBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"7802003342cbcd7d51109d4f66b5f82efb76ed04d6810db32364a8621ff2fd12","last_reissued_at":"2026-05-18T01:21:08.903554Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:21:08.903554Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1302.6964","source_version":4,"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-18T01:21:08Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"IofVKqAskzYmnul00/HzZ2r7gcZuYudUc5z9IvcAJjMIFHA4+O+10Ar686iOCibo07Cfr1szR2VZzyVH2fogAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-03T04:38:07.565926Z"},"content_sha256":"8112f74a7f4c4038219b84cbccd9f1f03bc19692d3d675a98e04c6c328eb3cee","schema_version":"1.0","event_id":"sha256:8112f74a7f4c4038219b84cbccd9f1f03bc19692d3d675a98e04c6c328eb3cee"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2013:PABAAM2CZPGX2UIQTVHWNNPYF3","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"On the exact and $\\varepsilon$-strong simulation of (jump) diffusions","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.PR","stat.CO"],"primary_cat":"stat.ME","authors_text":"Adam M. Johansen, Gareth O. Roberts, Murray Pollock","submitted_at":"2013-02-27T19:21:12Z","abstract_excerpt":"This paper introduces a framework for simulating finite dimensional representations of (jump) diffusion sample paths over finite intervals, without discretisation error (exactly), in such a way that the sample path can be restored at any finite collection of time points. Within this framework we extend existing exact algorithms and introduce novel adaptive approaches. We consider an application of the methodology developed within this paper which allows the simulation of upper and lower bounding processes which almost surely constrain (jump) diffusion sample paths to any specified tolerance. W"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1302.6964","kind":"arxiv","version":4},"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-18T01:21:08Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Nc98UeDIgGRhog3EkSEgwCkpR10gRCKeYQR7LfeRFi3Wq4h9zC7BI4YnTAuB9ONuqsUpoWuNOhKeVDueH2czCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-03T04:38:07.566483Z"},"content_sha256":"2aebd41ec2ce543396743667409bdfa5017d0282d5691ec1600780eec323e5aa","schema_version":"1.0","event_id":"sha256:2aebd41ec2ce543396743667409bdfa5017d0282d5691ec1600780eec323e5aa"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/PABAAM2CZPGX2UIQTVHWNNPYF3/bundle.json","state_url":"https://pith.science/pith/PABAAM2CZPGX2UIQTVHWNNPYF3/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/PABAAM2CZPGX2UIQTVHWNNPYF3/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-03T04:38:07Z","links":{"resolver":"https://pith.science/pith/PABAAM2CZPGX2UIQTVHWNNPYF3","bundle":"https://pith.science/pith/PABAAM2CZPGX2UIQTVHWNNPYF3/bundle.json","state":"https://pith.science/pith/PABAAM2CZPGX2UIQTVHWNNPYF3/state.json","well_known_bundle":"https://pith.science/.well-known/pith/PABAAM2CZPGX2UIQTVHWNNPYF3/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2013:PABAAM2CZPGX2UIQTVHWNNPYF3","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":"95d87b8fc2f3980489a1068e35e3d13fd745c1414c3eacebc364c5442f10248c","cross_cats_sorted":["math.PR","stat.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ME","submitted_at":"2013-02-27T19:21:12Z","title_canon_sha256":"636f86497d2a41d7b9d3690abc41330e46ee7361315dd8443350a1b942efdb1a"},"schema_version":"1.0","source":{"id":"1302.6964","kind":"arxiv","version":4}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1302.6964","created_at":"2026-05-18T01:21:08Z"},{"alias_kind":"arxiv_version","alias_value":"1302.6964v4","created_at":"2026-05-18T01:21:08Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1302.6964","created_at":"2026-05-18T01:21:08Z"},{"alias_kind":"pith_short_12","alias_value":"PABAAM2CZPGX","created_at":"2026-05-18T12:27:54Z"},{"alias_kind":"pith_short_16","alias_value":"PABAAM2CZPGX2UIQ","created_at":"2026-05-18T12:27:54Z"},{"alias_kind":"pith_short_8","alias_value":"PABAAM2C","created_at":"2026-05-18T12:27:54Z"}],"graph_snapshots":[{"event_id":"sha256:2aebd41ec2ce543396743667409bdfa5017d0282d5691ec1600780eec323e5aa","target":"graph","created_at":"2026-05-18T01:21:08Z","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":"This paper introduces a framework for simulating finite dimensional representations of (jump) diffusion sample paths over finite intervals, without discretisation error (exactly), in such a way that the sample path can be restored at any finite collection of time points. Within this framework we extend existing exact algorithms and introduce novel adaptive approaches. We consider an application of the methodology developed within this paper which allows the simulation of upper and lower bounding processes which almost surely constrain (jump) diffusion sample paths to any specified tolerance. W","authors_text":"Adam M. Johansen, Gareth O. Roberts, Murray Pollock","cross_cats":["math.PR","stat.CO"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ME","submitted_at":"2013-02-27T19:21:12Z","title":"On the exact and $\\varepsilon$-strong simulation of (jump) diffusions"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1302.6964","kind":"arxiv","version":4},"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:8112f74a7f4c4038219b84cbccd9f1f03bc19692d3d675a98e04c6c328eb3cee","target":"record","created_at":"2026-05-18T01:21:08Z","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":"95d87b8fc2f3980489a1068e35e3d13fd745c1414c3eacebc364c5442f10248c","cross_cats_sorted":["math.PR","stat.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ME","submitted_at":"2013-02-27T19:21:12Z","title_canon_sha256":"636f86497d2a41d7b9d3690abc41330e46ee7361315dd8443350a1b942efdb1a"},"schema_version":"1.0","source":{"id":"1302.6964","kind":"arxiv","version":4}},"canonical_sha256":"7802003342cbcd7d51109d4f66b5f82efb76ed04d6810db32364a8621ff2fd12","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"7802003342cbcd7d51109d4f66b5f82efb76ed04d6810db32364a8621ff2fd12","first_computed_at":"2026-05-18T01:21:08.903554Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:21:08.903554Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"pkuMcC3aqP7G8svTgwVNtOJafENUnn3epDgcN+nTxVzGcenp9sfXF/NpKA7iDRff4CObtU+feuS3axJ7P/3vBQ==","signature_status":"signed_v1","signed_at":"2026-05-18T01:21:08.904126Z","signed_message":"canonical_sha256_bytes"},"source_id":"1302.6964","source_kind":"arxiv","source_version":4}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:8112f74a7f4c4038219b84cbccd9f1f03bc19692d3d675a98e04c6c328eb3cee","sha256:2aebd41ec2ce543396743667409bdfa5017d0282d5691ec1600780eec323e5aa"],"state_sha256":"3560b61b4c9951d100ea600af03d2398c97334a8b3ffae82fe3f00bdd1b337db"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ZMCG31W3anY82KheJZHb+YPMFzRilCbQfmnmVIteWyuQhQprCvbquuXmP4xoHsOQvW6xQ6EcQbMStGpwwFuLBA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-03T04:38:07.569199Z","bundle_sha256":"3ca2f68d7915f9577b81a2215ed267998754e211f3e2d8a9d5cb8e4c9c7762d1"}}