{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:T47R6WUQFQVIRG6WI6RW2BNWIB","short_pith_number":"pith:T47R6WUQ","canonical_record":{"source":{"id":"1809.07139","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.CO","submitted_at":"2018-09-19T12:14:45Z","cross_cats_sorted":[],"title_canon_sha256":"3f4753e432b9e93c5c43102e225739e5c43e0f1f2b6b5bde83ddcafeeacd305d","abstract_canon_sha256":"5271dc8f8f26412e8035dc6e36af7dad12130c66f2ac7e17fba99cc892f19d7c"},"schema_version":"1.0"},"canonical_sha256":"9f3f1f5a902c2a889bd647a36d05b64078c78037c6505de66f7e08ffc2c3f67e","source":{"kind":"arxiv","id":"1809.07139","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1809.07139","created_at":"2026-05-17T23:55:07Z"},{"alias_kind":"arxiv_version","alias_value":"1809.07139v2","created_at":"2026-05-17T23:55:07Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1809.07139","created_at":"2026-05-17T23:55:07Z"},{"alias_kind":"pith_short_12","alias_value":"T47R6WUQFQVI","created_at":"2026-05-18T12:32:53Z"},{"alias_kind":"pith_short_16","alias_value":"T47R6WUQFQVIRG6W","created_at":"2026-05-18T12:32:53Z"},{"alias_kind":"pith_short_8","alias_value":"T47R6WUQ","created_at":"2026-05-18T12:32:53Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:T47R6WUQFQVIRG6WI6RW2BNWIB","target":"record","payload":{"canonical_record":{"source":{"id":"1809.07139","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.CO","submitted_at":"2018-09-19T12:14:45Z","cross_cats_sorted":[],"title_canon_sha256":"3f4753e432b9e93c5c43102e225739e5c43e0f1f2b6b5bde83ddcafeeacd305d","abstract_canon_sha256":"5271dc8f8f26412e8035dc6e36af7dad12130c66f2ac7e17fba99cc892f19d7c"},"schema_version":"1.0"},"canonical_sha256":"9f3f1f5a902c2a889bd647a36d05b64078c78037c6505de66f7e08ffc2c3f67e","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:55:07.395139Z","signature_b64":"g4+3eWJPptT4Au6jvhNuyWI+pyLt8ZqfiLBkpgaDzv245u3OS9e04MfkOjnuECCYJEv+CXwr4cmMD3ddM/bwCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"9f3f1f5a902c2a889bd647a36d05b64078c78037c6505de66f7e08ffc2c3f67e","last_reissued_at":"2026-05-17T23:55:07.394759Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:55:07.394759Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1809.07139","source_version":2,"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-17T23:55:07Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"S3bSqNpyKSPPnALdDBMuOvapmkNnpNbrN8j/TXPBF8gYbA5+2RfFYJYItJky1UYJyhKgqfwOorNTUgLbNadWDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-06T12:21:58.630730Z"},"content_sha256":"8f2fc2555fbac46d57672de3b2f1f4dfd6d889075aef732e59addd9b5c68d666","schema_version":"1.0","event_id":"sha256:8f2fc2555fbac46d57672de3b2f1f4dfd6d889075aef732e59addd9b5c68d666"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:T47R6WUQFQVIRG6WI6RW2BNWIB","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Efficient sampling of conditioned Markov jump processes","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"stat.CO","authors_text":"Andrew Golightly, Chris Sherlock","submitted_at":"2018-09-19T12:14:45Z","abstract_excerpt":"We consider the task of generating draws from a Markov jump process (MJP) between two time-points at which the process is known. Resulting draws are typically termed bridges and the generation of such bridges plays a key role in simulation-based inference algorithms for MJPs. The problem is challenging due to the intractability of the conditioned process, necessitating the use of computationally intensive methods such as weighted resampling or Markov chain Monte Carlo. An efficient implementation of such schemes requires an approximation of the intractable conditioned hazard/propensity functio"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1809.07139","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":""},"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-17T23:55:07Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"4b12S+eCiWLumJdR+ZJaGlTXl+0muDU0QxZp9dsTvJnFmmNjcR38dGsSZHzPsH/EnqLZ8GFn6ryDc9zR59nWAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-06T12:21:58.631430Z"},"content_sha256":"f8bc6c6e65d42873dde1182bed7d432a200fcbbb17628458cfc06ea7484568b5","schema_version":"1.0","event_id":"sha256:f8bc6c6e65d42873dde1182bed7d432a200fcbbb17628458cfc06ea7484568b5"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/T47R6WUQFQVIRG6WI6RW2BNWIB/bundle.json","state_url":"https://pith.science/pith/T47R6WUQFQVIRG6WI6RW2BNWIB/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/T47R6WUQFQVIRG6WI6RW2BNWIB/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-06T12:21:58Z","links":{"resolver":"https://pith.science/pith/T47R6WUQFQVIRG6WI6RW2BNWIB","bundle":"https://pith.science/pith/T47R6WUQFQVIRG6WI6RW2BNWIB/bundle.json","state":"https://pith.science/pith/T47R6WUQFQVIRG6WI6RW2BNWIB/state.json","well_known_bundle":"https://pith.science/.well-known/pith/T47R6WUQFQVIRG6WI6RW2BNWIB/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:T47R6WUQFQVIRG6WI6RW2BNWIB","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":"5271dc8f8f26412e8035dc6e36af7dad12130c66f2ac7e17fba99cc892f19d7c","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.CO","submitted_at":"2018-09-19T12:14:45Z","title_canon_sha256":"3f4753e432b9e93c5c43102e225739e5c43e0f1f2b6b5bde83ddcafeeacd305d"},"schema_version":"1.0","source":{"id":"1809.07139","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1809.07139","created_at":"2026-05-17T23:55:07Z"},{"alias_kind":"arxiv_version","alias_value":"1809.07139v2","created_at":"2026-05-17T23:55:07Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1809.07139","created_at":"2026-05-17T23:55:07Z"},{"alias_kind":"pith_short_12","alias_value":"T47R6WUQFQVI","created_at":"2026-05-18T12:32:53Z"},{"alias_kind":"pith_short_16","alias_value":"T47R6WUQFQVIRG6W","created_at":"2026-05-18T12:32:53Z"},{"alias_kind":"pith_short_8","alias_value":"T47R6WUQ","created_at":"2026-05-18T12:32:53Z"}],"graph_snapshots":[{"event_id":"sha256:f8bc6c6e65d42873dde1182bed7d432a200fcbbb17628458cfc06ea7484568b5","target":"graph","created_at":"2026-05-17T23:55:07Z","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 consider the task of generating draws from a Markov jump process (MJP) between two time-points at which the process is known. Resulting draws are typically termed bridges and the generation of such bridges plays a key role in simulation-based inference algorithms for MJPs. The problem is challenging due to the intractability of the conditioned process, necessitating the use of computationally intensive methods such as weighted resampling or Markov chain Monte Carlo. An efficient implementation of such schemes requires an approximation of the intractable conditioned hazard/propensity functio","authors_text":"Andrew Golightly, Chris Sherlock","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.CO","submitted_at":"2018-09-19T12:14:45Z","title":"Efficient sampling of conditioned Markov jump processes"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1809.07139","kind":"arxiv","version":2},"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:8f2fc2555fbac46d57672de3b2f1f4dfd6d889075aef732e59addd9b5c68d666","target":"record","created_at":"2026-05-17T23:55:07Z","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":"5271dc8f8f26412e8035dc6e36af7dad12130c66f2ac7e17fba99cc892f19d7c","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.CO","submitted_at":"2018-09-19T12:14:45Z","title_canon_sha256":"3f4753e432b9e93c5c43102e225739e5c43e0f1f2b6b5bde83ddcafeeacd305d"},"schema_version":"1.0","source":{"id":"1809.07139","kind":"arxiv","version":2}},"canonical_sha256":"9f3f1f5a902c2a889bd647a36d05b64078c78037c6505de66f7e08ffc2c3f67e","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"9f3f1f5a902c2a889bd647a36d05b64078c78037c6505de66f7e08ffc2c3f67e","first_computed_at":"2026-05-17T23:55:07.394759Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:55:07.394759Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"g4+3eWJPptT4Au6jvhNuyWI+pyLt8ZqfiLBkpgaDzv245u3OS9e04MfkOjnuECCYJEv+CXwr4cmMD3ddM/bwCA==","signature_status":"signed_v1","signed_at":"2026-05-17T23:55:07.395139Z","signed_message":"canonical_sha256_bytes"},"source_id":"1809.07139","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:8f2fc2555fbac46d57672de3b2f1f4dfd6d889075aef732e59addd9b5c68d666","sha256:f8bc6c6e65d42873dde1182bed7d432a200fcbbb17628458cfc06ea7484568b5"],"state_sha256":"42cd9d1d268e102e8d36f79966ec377bd84d2a82809f6423f36f4e4baf53401f"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"77vFQcUFDhIbFfS1daFDecflgdnxUxYZfnwD7aL6ROGitylhdB1uGJCnYjT2dHilKCFv7HHuoVwMhFRlL46HBw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-06T12:21:58.635465Z","bundle_sha256":"c261fb664b38e539f2f68df939a842a51236d8b54c8f29f1454e51df78f014e4"}}