{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2014:KOC3QNN4KQIRLPP36VFTJCYRYV","short_pith_number":"pith:KOC3QNN4","schema_version":"1.0","canonical_sha256":"5385b835bc541115bdfbf54b348b11c5544e56b0c22873ee2dbe7522e845d31d","source":{"kind":"arxiv","id":"1406.4993","version":2},"attestation_state":"computed","paper":{"title":"Divide-and-Conquer with Sequential Monte Carlo","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["stat.ML"],"primary_cat":"stat.CO","authors_text":"Adam M. Johansen, Alexandre Bouchard-C\\^ot\\'e, Bonnie Kirkpatrick, Christian A. Naesseth, Fredrik Lindsten, John Aston, Thomas B. Sch\\\"on","submitted_at":"2014-06-19T10:01:15Z","abstract_excerpt":"We propose a novel class of Sequential Monte Carlo (SMC) algorithms, appropriate for inference in probabilistic graphical models. This class of algorithms adopts a divide-and-conquer approach based upon an auxiliary tree-structured decomposition of the model of interest, turning the overall inferential task into a collection of recursively solved sub-problems. The proposed method is applicable to a broad class of probabilistic graphical models, including models with loops. Unlike a standard SMC sampler, the proposed Divide-and-Conquer SMC employs multiple independent populations of weighted pa"},"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":"1406.4993","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.CO","submitted_at":"2014-06-19T10:01:15Z","cross_cats_sorted":["stat.ML"],"title_canon_sha256":"7bf30e791c48d61e2ed40c27675b4a8c662fea7a58fd1b23d5d6964ed21a2417","abstract_canon_sha256":"e2742320f15e311930d1a0d4877922ae166830280d111cc348ec349198d4f19d"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:25:27.472272Z","signature_b64":"7wKzYhMhwx5/WLcU9+RZ4LFkIlFI3ja4D9P8DQRgSSIuVZF/RCVg8mWyWmP1vunNZvj0wzLG3URO+rbusC/QDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"5385b835bc541115bdfbf54b348b11c5544e56b0c22873ee2dbe7522e845d31d","last_reissued_at":"2026-05-18T00:25:27.471519Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:25:27.471519Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Divide-and-Conquer with Sequential Monte Carlo","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["stat.ML"],"primary_cat":"stat.CO","authors_text":"Adam M. Johansen, Alexandre Bouchard-C\\^ot\\'e, Bonnie Kirkpatrick, Christian A. Naesseth, Fredrik Lindsten, John Aston, Thomas B. Sch\\\"on","submitted_at":"2014-06-19T10:01:15Z","abstract_excerpt":"We propose a novel class of Sequential Monte Carlo (SMC) algorithms, appropriate for inference in probabilistic graphical models. This class of algorithms adopts a divide-and-conquer approach based upon an auxiliary tree-structured decomposition of the model of interest, turning the overall inferential task into a collection of recursively solved sub-problems. The proposed method is applicable to a broad class of probabilistic graphical models, including models with loops. Unlike a standard SMC sampler, the proposed Divide-and-Conquer SMC employs multiple independent populations of weighted pa"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1406.4993","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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1406.4993","created_at":"2026-05-18T00:25:27.471643+00:00"},{"alias_kind":"arxiv_version","alias_value":"1406.4993v2","created_at":"2026-05-18T00:25:27.471643+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1406.4993","created_at":"2026-05-18T00:25:27.471643+00:00"},{"alias_kind":"pith_short_12","alias_value":"KOC3QNN4KQIR","created_at":"2026-05-18T12:28:35.611951+00:00"},{"alias_kind":"pith_short_16","alias_value":"KOC3QNN4KQIRLPP3","created_at":"2026-05-18T12:28:35.611951+00:00"},{"alias_kind":"pith_short_8","alias_value":"KOC3QNN4","created_at":"2026-05-18T12:28:35.611951+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/KOC3QNN4KQIRLPP36VFTJCYRYV","json":"https://pith.science/pith/KOC3QNN4KQIRLPP36VFTJCYRYV.json","graph_json":"https://pith.science/api/pith-number/KOC3QNN4KQIRLPP36VFTJCYRYV/graph.json","events_json":"https://pith.science/api/pith-number/KOC3QNN4KQIRLPP36VFTJCYRYV/events.json","paper":"https://pith.science/paper/KOC3QNN4"},"agent_actions":{"view_html":"https://pith.science/pith/KOC3QNN4KQIRLPP36VFTJCYRYV","download_json":"https://pith.science/pith/KOC3QNN4KQIRLPP36VFTJCYRYV.json","view_paper":"https://pith.science/paper/KOC3QNN4","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1406.4993&json=true","fetch_graph":"https://pith.science/api/pith-number/KOC3QNN4KQIRLPP36VFTJCYRYV/graph.json","fetch_events":"https://pith.science/api/pith-number/KOC3QNN4KQIRLPP36VFTJCYRYV/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/KOC3QNN4KQIRLPP36VFTJCYRYV/action/timestamp_anchor","attest_storage":"https://pith.science/pith/KOC3QNN4KQIRLPP36VFTJCYRYV/action/storage_attestation","attest_author":"https://pith.science/pith/KOC3QNN4KQIRLPP36VFTJCYRYV/action/author_attestation","sign_citation":"https://pith.science/pith/KOC3QNN4KQIRLPP36VFTJCYRYV/action/citation_signature","submit_replication":"https://pith.science/pith/KOC3QNN4KQIRLPP36VFTJCYRYV/action/replication_record"}},"created_at":"2026-05-18T00:25:27.471643+00:00","updated_at":"2026-05-18T00:25:27.471643+00:00"}