{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2014:RKIJU6VBNUWIUNPTUQI6S47OOP","short_pith_number":"pith:RKIJU6VB","canonical_record":{"source":{"id":"1403.6886","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.CO","submitted_at":"2014-03-26T23:05:57Z","cross_cats_sorted":[],"title_canon_sha256":"400075b0b7edc066ec25d4594da6d3a6fd4d06de20d78db4bfffd374ca05ca25","abstract_canon_sha256":"801458feefb4d0eb6e2d1e1d70ca5a05c72efcb1598ef8e3c1a597c46fedcd90"},"schema_version":"1.0"},"canonical_sha256":"8a909a7aa16d2c8a35f3a411e973ee73caca288bb278fee20d54c80f8a0aa597","source":{"kind":"arxiv","id":"1403.6886","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1403.6886","created_at":"2026-05-18T02:39:38Z"},{"alias_kind":"arxiv_version","alias_value":"1403.6886v2","created_at":"2026-05-18T02:39:38Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1403.6886","created_at":"2026-05-18T02:39:38Z"},{"alias_kind":"pith_short_12","alias_value":"RKIJU6VBNUWI","created_at":"2026-05-18T12:28:46Z"},{"alias_kind":"pith_short_16","alias_value":"RKIJU6VBNUWIUNPT","created_at":"2026-05-18T12:28:46Z"},{"alias_kind":"pith_short_8","alias_value":"RKIJU6VB","created_at":"2026-05-18T12:28:46Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2014:RKIJU6VBNUWIUNPTUQI6S47OOP","target":"record","payload":{"canonical_record":{"source":{"id":"1403.6886","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.CO","submitted_at":"2014-03-26T23:05:57Z","cross_cats_sorted":[],"title_canon_sha256":"400075b0b7edc066ec25d4594da6d3a6fd4d06de20d78db4bfffd374ca05ca25","abstract_canon_sha256":"801458feefb4d0eb6e2d1e1d70ca5a05c72efcb1598ef8e3c1a597c46fedcd90"},"schema_version":"1.0"},"canonical_sha256":"8a909a7aa16d2c8a35f3a411e973ee73caca288bb278fee20d54c80f8a0aa597","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:39:38.169798Z","signature_b64":"sJNyl/dgeTL7LTv862Pz0WOqI5LLQUzvzPr7qkmXCxQ5taOinzbDUklN6y3pHCOpR1tJBDJzY2u5wrXC4+zPAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"8a909a7aa16d2c8a35f3a411e973ee73caca288bb278fee20d54c80f8a0aa597","last_reissued_at":"2026-05-18T02:39:38.169412Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:39:38.169412Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1403.6886","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-18T02:39:38Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"G0TqsWCSfs/YVswSd8xsiD0w9iU0hS0DbKyHFb5atF8clXL3syn7+vQFHQNbuFRGrvFaH/WvkxRbSmObkHBaCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-07T23:58:54.286536Z"},"content_sha256":"1cc953d419813918f2b6608d552f953d4f91952054d81c66403eae22526ed475","schema_version":"1.0","event_id":"sha256:1cc953d419813918f2b6608d552f953d4f91952054d81c66403eae22526ed475"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2014:RKIJU6VBNUWIUNPTUQI6S47OOP","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Scalable Inference for Markov Processes with Intractable Likelihoods","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"stat.CO","authors_text":"Colin S. Gillespie, Darren J. Wilkinson, Jamie Owen","submitted_at":"2014-03-26T23:05:57Z","abstract_excerpt":"Bayesian inference for Markov processes has become increasingly relevant in recent years. Problems of this type often have intractable likelihoods and prior knowledge about model rate parameters is often poor. Markov Chain Monte Carlo (MCMC) techniques can lead to exact inference in such models but in practice can suffer performance issues including long burn-in periods and poor mixing. On the other hand approximate Bayesian computation techniques can allow rapid exploration of a large parameter space but yield only approximate posterior distributions. Here we consider the combined use of appr"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1403.6886","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-18T02:39:38Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"SRUvIZEcoq+rzVpRtDxl4g1anfSsd1lk3mcyefY1G5CzoiraEEQ2V6wNmHvazxVMSIdpUvP3Heu9DB5qGY0ABw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-07T23:58:54.287288Z"},"content_sha256":"d2703218d51fd37f33f940306a76ce6d4a4cab96297d94ec04534b4d1de11bb5","schema_version":"1.0","event_id":"sha256:d2703218d51fd37f33f940306a76ce6d4a4cab96297d94ec04534b4d1de11bb5"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/RKIJU6VBNUWIUNPTUQI6S47OOP/bundle.json","state_url":"https://pith.science/pith/RKIJU6VBNUWIUNPTUQI6S47OOP/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/RKIJU6VBNUWIUNPTUQI6S47OOP/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-07T23:58:54Z","links":{"resolver":"https://pith.science/pith/RKIJU6VBNUWIUNPTUQI6S47OOP","bundle":"https://pith.science/pith/RKIJU6VBNUWIUNPTUQI6S47OOP/bundle.json","state":"https://pith.science/pith/RKIJU6VBNUWIUNPTUQI6S47OOP/state.json","well_known_bundle":"https://pith.science/.well-known/pith/RKIJU6VBNUWIUNPTUQI6S47OOP/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:RKIJU6VBNUWIUNPTUQI6S47OOP","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":"801458feefb4d0eb6e2d1e1d70ca5a05c72efcb1598ef8e3c1a597c46fedcd90","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.CO","submitted_at":"2014-03-26T23:05:57Z","title_canon_sha256":"400075b0b7edc066ec25d4594da6d3a6fd4d06de20d78db4bfffd374ca05ca25"},"schema_version":"1.0","source":{"id":"1403.6886","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1403.6886","created_at":"2026-05-18T02:39:38Z"},{"alias_kind":"arxiv_version","alias_value":"1403.6886v2","created_at":"2026-05-18T02:39:38Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1403.6886","created_at":"2026-05-18T02:39:38Z"},{"alias_kind":"pith_short_12","alias_value":"RKIJU6VBNUWI","created_at":"2026-05-18T12:28:46Z"},{"alias_kind":"pith_short_16","alias_value":"RKIJU6VBNUWIUNPT","created_at":"2026-05-18T12:28:46Z"},{"alias_kind":"pith_short_8","alias_value":"RKIJU6VB","created_at":"2026-05-18T12:28:46Z"}],"graph_snapshots":[{"event_id":"sha256:d2703218d51fd37f33f940306a76ce6d4a4cab96297d94ec04534b4d1de11bb5","target":"graph","created_at":"2026-05-18T02:39:38Z","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 inference for Markov processes has become increasingly relevant in recent years. Problems of this type often have intractable likelihoods and prior knowledge about model rate parameters is often poor. Markov Chain Monte Carlo (MCMC) techniques can lead to exact inference in such models but in practice can suffer performance issues including long burn-in periods and poor mixing. On the other hand approximate Bayesian computation techniques can allow rapid exploration of a large parameter space but yield only approximate posterior distributions. Here we consider the combined use of appr","authors_text":"Colin S. Gillespie, Darren J. Wilkinson, Jamie Owen","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.CO","submitted_at":"2014-03-26T23:05:57Z","title":"Scalable Inference for Markov Processes with Intractable Likelihoods"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1403.6886","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:1cc953d419813918f2b6608d552f953d4f91952054d81c66403eae22526ed475","target":"record","created_at":"2026-05-18T02:39:38Z","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":"801458feefb4d0eb6e2d1e1d70ca5a05c72efcb1598ef8e3c1a597c46fedcd90","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.CO","submitted_at":"2014-03-26T23:05:57Z","title_canon_sha256":"400075b0b7edc066ec25d4594da6d3a6fd4d06de20d78db4bfffd374ca05ca25"},"schema_version":"1.0","source":{"id":"1403.6886","kind":"arxiv","version":2}},"canonical_sha256":"8a909a7aa16d2c8a35f3a411e973ee73caca288bb278fee20d54c80f8a0aa597","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"8a909a7aa16d2c8a35f3a411e973ee73caca288bb278fee20d54c80f8a0aa597","first_computed_at":"2026-05-18T02:39:38.169412Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:39:38.169412Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"sJNyl/dgeTL7LTv862Pz0WOqI5LLQUzvzPr7qkmXCxQ5taOinzbDUklN6y3pHCOpR1tJBDJzY2u5wrXC4+zPAA==","signature_status":"signed_v1","signed_at":"2026-05-18T02:39:38.169798Z","signed_message":"canonical_sha256_bytes"},"source_id":"1403.6886","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:1cc953d419813918f2b6608d552f953d4f91952054d81c66403eae22526ed475","sha256:d2703218d51fd37f33f940306a76ce6d4a4cab96297d94ec04534b4d1de11bb5"],"state_sha256":"470641e73bf0096672cc7798957c6e9b55e140924005b34d47aa0998286a4dab"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ei8DQQMSoI8HzAoQu1+t3MXbznA9sK4E/vg7jbk9B7zoyxXB5lhIQ5dt0gfRSAZgYyG7GJbkpPXoIBTFxDakAQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-07T23:58:54.291646Z","bundle_sha256":"9ffaf249b2ea31bd7b6d49fc590566de02862b40e9a24340cf5b43bfad43585e"}}