{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:QREC5YKJEMV2PONPGYSANV7O4L","short_pith_number":"pith:QREC5YKJ","schema_version":"1.0","canonical_sha256":"84482ee149232ba7b9af362406d7eee2f34f6cd450b9b695ad66bdb10d2c4a5d","source":{"kind":"arxiv","id":"1808.08400","version":1},"attestation_state":"computed","paper":{"title":"Tree-based Particle Smoothing Algorithms in a Hidden Markov Model","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"stat.ME","authors_text":"Axel Gandy, Dong Ding","submitted_at":"2018-08-25T10:09:33Z","abstract_excerpt":"We provide a new strategy built on the divide-and-conquer approach by Lindsten et al. (2017) to investigate the smoothing problem in a hidden Markov model. We employ this approach to decompose a hidden Markov model into sub-models with intermediate target distributions based on an auxiliary tree structure and produce independent samples from the sub-models at the leaf nodes towards the original model of interest at the root. We review the target distribution in the sub-models suggested by Lindsten et al. and propose two new classes of target distributions, which are the estimates of the (joint"},"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":"1808.08400","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ME","submitted_at":"2018-08-25T10:09:33Z","cross_cats_sorted":[],"title_canon_sha256":"49fa7b4a6c5daeb054a32b7e9ad0907a0053bdb655b9f4fd8649ab6147739185","abstract_canon_sha256":"fd30e388ceff26f6d16917965a5db8c317c8a9b74e41337b4ddb0b73997fd85e"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:07:16.622763Z","signature_b64":"57Azr2i6jiXBmJVqn0TPS+XAbfnuwXPVGWuJWYBh/EhBit2TwkKCsOZesxryW2Czjronss6+UqkprpD46cTUAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"84482ee149232ba7b9af362406d7eee2f34f6cd450b9b695ad66bdb10d2c4a5d","last_reissued_at":"2026-05-18T00:07:16.622117Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:07:16.622117Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Tree-based Particle Smoothing Algorithms in a Hidden Markov Model","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"stat.ME","authors_text":"Axel Gandy, Dong Ding","submitted_at":"2018-08-25T10:09:33Z","abstract_excerpt":"We provide a new strategy built on the divide-and-conquer approach by Lindsten et al. (2017) to investigate the smoothing problem in a hidden Markov model. We employ this approach to decompose a hidden Markov model into sub-models with intermediate target distributions based on an auxiliary tree structure and produce independent samples from the sub-models at the leaf nodes towards the original model of interest at the root. We review the target distribution in the sub-models suggested by Lindsten et al. and propose two new classes of target distributions, which are the estimates of the (joint"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1808.08400","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":"1808.08400","created_at":"2026-05-18T00:07:16.622223+00:00"},{"alias_kind":"arxiv_version","alias_value":"1808.08400v1","created_at":"2026-05-18T00:07:16.622223+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1808.08400","created_at":"2026-05-18T00:07:16.622223+00:00"},{"alias_kind":"pith_short_12","alias_value":"QREC5YKJEMV2","created_at":"2026-05-18T12:32:46.962924+00:00"},{"alias_kind":"pith_short_16","alias_value":"QREC5YKJEMV2PONP","created_at":"2026-05-18T12:32:46.962924+00:00"},{"alias_kind":"pith_short_8","alias_value":"QREC5YKJ","created_at":"2026-05-18T12:32:46.962924+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/QREC5YKJEMV2PONPGYSANV7O4L","json":"https://pith.science/pith/QREC5YKJEMV2PONPGYSANV7O4L.json","graph_json":"https://pith.science/api/pith-number/QREC5YKJEMV2PONPGYSANV7O4L/graph.json","events_json":"https://pith.science/api/pith-number/QREC5YKJEMV2PONPGYSANV7O4L/events.json","paper":"https://pith.science/paper/QREC5YKJ"},"agent_actions":{"view_html":"https://pith.science/pith/QREC5YKJEMV2PONPGYSANV7O4L","download_json":"https://pith.science/pith/QREC5YKJEMV2PONPGYSANV7O4L.json","view_paper":"https://pith.science/paper/QREC5YKJ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1808.08400&json=true","fetch_graph":"https://pith.science/api/pith-number/QREC5YKJEMV2PONPGYSANV7O4L/graph.json","fetch_events":"https://pith.science/api/pith-number/QREC5YKJEMV2PONPGYSANV7O4L/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/QREC5YKJEMV2PONPGYSANV7O4L/action/timestamp_anchor","attest_storage":"https://pith.science/pith/QREC5YKJEMV2PONPGYSANV7O4L/action/storage_attestation","attest_author":"https://pith.science/pith/QREC5YKJEMV2PONPGYSANV7O4L/action/author_attestation","sign_citation":"https://pith.science/pith/QREC5YKJEMV2PONPGYSANV7O4L/action/citation_signature","submit_replication":"https://pith.science/pith/QREC5YKJEMV2PONPGYSANV7O4L/action/replication_record"}},"created_at":"2026-05-18T00:07:16.622223+00:00","updated_at":"2026-05-18T00:07:16.622223+00:00"}