{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:P4TZFMJNNMKJOWHZUWHLAEAFIK","short_pith_number":"pith:P4TZFMJN","schema_version":"1.0","canonical_sha256":"7f2792b12d6b149758f9a58eb010054283899c01ded0ac4133ee5b800d16c4d3","source":{"kind":"arxiv","id":"1505.01434","version":1},"attestation_state":"computed","paper":{"title":"Particle Gibbs algorithms for Markov jump processes","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"stat.CO","authors_text":"Blazej Miasojedow, Wojciech Niemiro","submitted_at":"2015-05-06T17:03:30Z","abstract_excerpt":"In the present paper we propose a new MCMC algorithm for sampling from the posterior distribution of hidden trajectory of a Markov jump process. Our algorithm is based on the idea of exploiting virtual jumps, introduced by Rao and Teh (2013). The main novelty is that our algorithm uses particle Gibbs with ancestor sampling to update the skeleton, while Rao and Teh use forward filtering backward sampling (FFBS). In contrast to previous methods our algorithm can be implemented even if the state space is infinite. In addition, the cost of a single step of the proposed algorithm does not depend on"},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"canonical_record":{"source":{"id":"1505.01434","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.CO","submitted_at":"2015-05-06T17:03:30Z","cross_cats_sorted":[],"title_canon_sha256":"9161d4c1fe6e264334d7beeb5a525f5a9d77ba56c96707917b7a2c5bb00d2028","abstract_canon_sha256":"5f79273dd75629d062d9af07cba5f5455594fdcb0f4666d5a3a9e2f145a2afd2"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:16:49.374768Z","signature_b64":"biHCzDL0AKU0P4IbjqqNFdLSrNln0ru3VN7BnKfjmkqr0e9Ci/Ag2Pc9hCItn3LJ6WNzfn6YF1c54NR2zA+cBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"7f2792b12d6b149758f9a58eb010054283899c01ded0ac4133ee5b800d16c4d3","last_reissued_at":"2026-05-18T02:16:49.374072Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:16:49.374072Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Particle Gibbs algorithms for Markov jump processes","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"stat.CO","authors_text":"Blazej Miasojedow, Wojciech Niemiro","submitted_at":"2015-05-06T17:03:30Z","abstract_excerpt":"In the present paper we propose a new MCMC algorithm for sampling from the posterior distribution of hidden trajectory of a Markov jump process. Our algorithm is based on the idea of exploiting virtual jumps, introduced by Rao and Teh (2013). The main novelty is that our algorithm uses particle Gibbs with ancestor sampling to update the skeleton, while Rao and Teh use forward filtering backward sampling (FFBS). In contrast to previous methods our algorithm can be implemented even if the state space is infinite. In addition, the cost of a single step of the proposed algorithm does not depend on"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1505.01434","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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1505.01434","created_at":"2026-05-18T02:16:49.374187+00:00"},{"alias_kind":"arxiv_version","alias_value":"1505.01434v1","created_at":"2026-05-18T02:16:49.374187+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1505.01434","created_at":"2026-05-18T02:16:49.374187+00:00"},{"alias_kind":"pith_short_12","alias_value":"P4TZFMJNNMKJ","created_at":"2026-05-18T12:29:34.919912+00:00"},{"alias_kind":"pith_short_16","alias_value":"P4TZFMJNNMKJOWHZ","created_at":"2026-05-18T12:29:34.919912+00:00"},{"alias_kind":"pith_short_8","alias_value":"P4TZFMJN","created_at":"2026-05-18T12:29:34.919912+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/P4TZFMJNNMKJOWHZUWHLAEAFIK","json":"https://pith.science/pith/P4TZFMJNNMKJOWHZUWHLAEAFIK.json","graph_json":"https://pith.science/api/pith-number/P4TZFMJNNMKJOWHZUWHLAEAFIK/graph.json","events_json":"https://pith.science/api/pith-number/P4TZFMJNNMKJOWHZUWHLAEAFIK/events.json","paper":"https://pith.science/paper/P4TZFMJN"},"agent_actions":{"view_html":"https://pith.science/pith/P4TZFMJNNMKJOWHZUWHLAEAFIK","download_json":"https://pith.science/pith/P4TZFMJNNMKJOWHZUWHLAEAFIK.json","view_paper":"https://pith.science/paper/P4TZFMJN","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1505.01434&json=true","fetch_graph":"https://pith.science/api/pith-number/P4TZFMJNNMKJOWHZUWHLAEAFIK/graph.json","fetch_events":"https://pith.science/api/pith-number/P4TZFMJNNMKJOWHZUWHLAEAFIK/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/P4TZFMJNNMKJOWHZUWHLAEAFIK/action/timestamp_anchor","attest_storage":"https://pith.science/pith/P4TZFMJNNMKJOWHZUWHLAEAFIK/action/storage_attestation","attest_author":"https://pith.science/pith/P4TZFMJNNMKJOWHZUWHLAEAFIK/action/author_attestation","sign_citation":"https://pith.science/pith/P4TZFMJNNMKJOWHZUWHLAEAFIK/action/citation_signature","submit_replication":"https://pith.science/pith/P4TZFMJNNMKJOWHZUWHLAEAFIK/action/replication_record"}},"created_at":"2026-05-18T02:16:49.374187+00:00","updated_at":"2026-05-18T02:16:49.374187+00:00"}