{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2012:7O3D4JABLEOQXOBBTVDBNLHT7E","short_pith_number":"pith:7O3D4JAB","canonical_record":{"source":{"id":"1211.4801","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.CO","submitted_at":"2012-11-20T16:52:23Z","cross_cats_sorted":["stat.ME"],"title_canon_sha256":"23679c66448200d253ce529dc78ae76944274693e50fdc2acec41c5dd020c734","abstract_canon_sha256":"24f5eb158cfda994fd21389c9341aced84df13b1089eb3a3aa8d154ef04fdda7"},"schema_version":"1.0"},"canonical_sha256":"fbb63e2401591d0bb8219d4616acf3f92963c9381a71f4d4eaf9587453641890","source":{"kind":"arxiv","id":"1211.4801","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1211.4801","created_at":"2026-05-18T00:51:19Z"},{"alias_kind":"arxiv_version","alias_value":"1211.4801v1","created_at":"2026-05-18T00:51:19Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1211.4801","created_at":"2026-05-18T00:51:19Z"},{"alias_kind":"pith_short_12","alias_value":"7O3D4JABLEOQ","created_at":"2026-05-18T12:26:58Z"},{"alias_kind":"pith_short_16","alias_value":"7O3D4JABLEOQXOBB","created_at":"2026-05-18T12:26:58Z"},{"alias_kind":"pith_short_8","alias_value":"7O3D4JAB","created_at":"2026-05-18T12:26:58Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2012:7O3D4JABLEOQXOBBTVDBNLHT7E","target":"record","payload":{"canonical_record":{"source":{"id":"1211.4801","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.CO","submitted_at":"2012-11-20T16:52:23Z","cross_cats_sorted":["stat.ME"],"title_canon_sha256":"23679c66448200d253ce529dc78ae76944274693e50fdc2acec41c5dd020c734","abstract_canon_sha256":"24f5eb158cfda994fd21389c9341aced84df13b1089eb3a3aa8d154ef04fdda7"},"schema_version":"1.0"},"canonical_sha256":"fbb63e2401591d0bb8219d4616acf3f92963c9381a71f4d4eaf9587453641890","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:51:19.531002Z","signature_b64":"m6if+CNtP4nmnfwTD1Ns+ziFDklPBssKimzTf+F1vORvvhhJDIN+eDacfLhinbBPfUpwHJdIcXvk8ni2qVyzCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"fbb63e2401591d0bb8219d4616acf3f92963c9381a71f4d4eaf9587453641890","last_reissued_at":"2026-05-18T00:51:19.530310Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:51:19.530310Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1211.4801","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:51:19Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"PRdVIz3OtWfVu9aqz/7NE058VM/6TE+eadIXR/lG5cDqO0w9a2gyE7xomudIQH6c1BIHApkHJxPI29KCy6GCCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-10T21:48:12.282090Z"},"content_sha256":"672bc7103989b1bfaa683195f7fae90762b23bc5ebe0ec7837c25ccc238e0c3c","schema_version":"1.0","event_id":"sha256:672bc7103989b1bfaa683195f7fae90762b23bc5ebe0ec7837c25ccc238e0c3c"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2012:7O3D4JABLEOQXOBBTVDBNLHT7E","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"MCMC inference for Markov Jump Processes via the Linear Noise Approximation","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["stat.ME"],"primary_cat":"stat.CO","authors_text":"Mark A. Girolami, Vassilios Stathopoulos","submitted_at":"2012-11-20T16:52:23Z","abstract_excerpt":"Bayesian analysis for Markov jump processes is a non-trivial and challenging problem. Although exact inference is theoretically possible, it is computationally demanding thus its applicability is limited to a small class of problems. In this paper we describe the application of Riemann manifold MCMC methods using an approximation to the likelihood of the Markov jump process which is valid when the system modelled is near its thermodynamic limit. The proposed approach is both statistically and computationally efficient while the convergence rate and mixing of the chains allows for fast MCMC inf"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1211.4801","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:51:19Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"QUugEMk3LtSmhY7UNZ5oBBwMFGYcGjcLYNMaPrk0LIs0GrM/c+nw5F2uPpvB7G3C2Zybw7ob/eUZEFocuJFmCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-10T21:48:12.282469Z"},"content_sha256":"2f809ec8ee135a1dcaed1e95284953c3819a8c1d1015cc1b534fbb7549851c48","schema_version":"1.0","event_id":"sha256:2f809ec8ee135a1dcaed1e95284953c3819a8c1d1015cc1b534fbb7549851c48"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/7O3D4JABLEOQXOBBTVDBNLHT7E/bundle.json","state_url":"https://pith.science/pith/7O3D4JABLEOQXOBBTVDBNLHT7E/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/7O3D4JABLEOQXOBBTVDBNLHT7E/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-10T21:48:12Z","links":{"resolver":"https://pith.science/pith/7O3D4JABLEOQXOBBTVDBNLHT7E","bundle":"https://pith.science/pith/7O3D4JABLEOQXOBBTVDBNLHT7E/bundle.json","state":"https://pith.science/pith/7O3D4JABLEOQXOBBTVDBNLHT7E/state.json","well_known_bundle":"https://pith.science/.well-known/pith/7O3D4JABLEOQXOBBTVDBNLHT7E/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2012:7O3D4JABLEOQXOBBTVDBNLHT7E","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":"24f5eb158cfda994fd21389c9341aced84df13b1089eb3a3aa8d154ef04fdda7","cross_cats_sorted":["stat.ME"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.CO","submitted_at":"2012-11-20T16:52:23Z","title_canon_sha256":"23679c66448200d253ce529dc78ae76944274693e50fdc2acec41c5dd020c734"},"schema_version":"1.0","source":{"id":"1211.4801","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1211.4801","created_at":"2026-05-18T00:51:19Z"},{"alias_kind":"arxiv_version","alias_value":"1211.4801v1","created_at":"2026-05-18T00:51:19Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1211.4801","created_at":"2026-05-18T00:51:19Z"},{"alias_kind":"pith_short_12","alias_value":"7O3D4JABLEOQ","created_at":"2026-05-18T12:26:58Z"},{"alias_kind":"pith_short_16","alias_value":"7O3D4JABLEOQXOBB","created_at":"2026-05-18T12:26:58Z"},{"alias_kind":"pith_short_8","alias_value":"7O3D4JAB","created_at":"2026-05-18T12:26:58Z"}],"graph_snapshots":[{"event_id":"sha256:2f809ec8ee135a1dcaed1e95284953c3819a8c1d1015cc1b534fbb7549851c48","target":"graph","created_at":"2026-05-18T00:51:19Z","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":"Bayesian analysis for Markov jump processes is a non-trivial and challenging problem. Although exact inference is theoretically possible, it is computationally demanding thus its applicability is limited to a small class of problems. In this paper we describe the application of Riemann manifold MCMC methods using an approximation to the likelihood of the Markov jump process which is valid when the system modelled is near its thermodynamic limit. The proposed approach is both statistically and computationally efficient while the convergence rate and mixing of the chains allows for fast MCMC inf","authors_text":"Mark A. Girolami, Vassilios Stathopoulos","cross_cats":["stat.ME"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.CO","submitted_at":"2012-11-20T16:52:23Z","title":"MCMC inference for Markov Jump Processes via the Linear Noise Approximation"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1211.4801","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:672bc7103989b1bfaa683195f7fae90762b23bc5ebe0ec7837c25ccc238e0c3c","target":"record","created_at":"2026-05-18T00:51:19Z","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":"24f5eb158cfda994fd21389c9341aced84df13b1089eb3a3aa8d154ef04fdda7","cross_cats_sorted":["stat.ME"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.CO","submitted_at":"2012-11-20T16:52:23Z","title_canon_sha256":"23679c66448200d253ce529dc78ae76944274693e50fdc2acec41c5dd020c734"},"schema_version":"1.0","source":{"id":"1211.4801","kind":"arxiv","version":1}},"canonical_sha256":"fbb63e2401591d0bb8219d4616acf3f92963c9381a71f4d4eaf9587453641890","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"fbb63e2401591d0bb8219d4616acf3f92963c9381a71f4d4eaf9587453641890","first_computed_at":"2026-05-18T00:51:19.530310Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:51:19.530310Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"m6if+CNtP4nmnfwTD1Ns+ziFDklPBssKimzTf+F1vORvvhhJDIN+eDacfLhinbBPfUpwHJdIcXvk8ni2qVyzCg==","signature_status":"signed_v1","signed_at":"2026-05-18T00:51:19.531002Z","signed_message":"canonical_sha256_bytes"},"source_id":"1211.4801","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:672bc7103989b1bfaa683195f7fae90762b23bc5ebe0ec7837c25ccc238e0c3c","sha256:2f809ec8ee135a1dcaed1e95284953c3819a8c1d1015cc1b534fbb7549851c48"],"state_sha256":"a35bd29b02b71c3109b10451c55e49b00c4cc3e56dfefff9d5b6dd4936bc3581"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"oi5sf65jfyiCgMXzOzOMKWeYMPKxTF3/vHsQEtdXQ844bBnpLBzhhBVPeify8aRjPrR1f40xyDzELozB2zGzBg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-10T21:48:12.284535Z","bundle_sha256":"17cf569652750a7adce17ae0bf7e233ee77f9a447343511f5de88b611e121fa0"}}