{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2013:RRPQWIB2YPS3ANP24ZJTHIEKEM","short_pith_number":"pith:RRPQWIB2","schema_version":"1.0","canonical_sha256":"8c5f0b203ac3e5b035fae65333a08a232400cbc2960619d4a812aaf76db6d764","source":{"kind":"arxiv","id":"1306.6462","version":3},"attestation_state":"computed","paper":{"title":"On the Convergence of Adaptive Sequential Monte Carlo Methods","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"stat.CO","authors_text":"Ajay Jasra, Alexandre Thiery, Alexandros Beskos, Nikolas Kantas","submitted_at":"2013-06-27T10:43:15Z","abstract_excerpt":"In several implementations of Sequential Monte Carlo (SMC) methods it is natural, and important in terms of algorithmic efficiency, to exploit the information of the history of the samples to optimally tune their subsequent propagations. In this article we provide a carefully formulated asymptotic theory for a class of such \\emph{adaptive} SMC methods. The theoretical framework developed here will cover, under assumptions, several commonly used SMC algorithms. There are only limited results about the theoretical underpinning of such adaptive methods: we will bridge this gap by providing a weak"},"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":"1306.6462","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.CO","submitted_at":"2013-06-27T10:43:15Z","cross_cats_sorted":[],"title_canon_sha256":"071b54862e8324c84a2c73c6c4a9dfc725df3971c90ad7b90c2491cbd0fc37f3","abstract_canon_sha256":"cc005f094de7c807e8de33a8826ac8a912685fedaf9e966740020fce72dd2d48"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:00:00.827505Z","signature_b64":"ovtSxQtBnOWDqylJiaJeQ04r1tKi1m2YnmP6DKmlurff7i6ZexIQ8bsdvh8wSK/MyfPtP7Ef94CwHxFTpaf5BQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"8c5f0b203ac3e5b035fae65333a08a232400cbc2960619d4a812aaf76db6d764","last_reissued_at":"2026-05-18T03:00:00.826662Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:00:00.826662Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"On the Convergence of Adaptive Sequential Monte Carlo Methods","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"stat.CO","authors_text":"Ajay Jasra, Alexandre Thiery, Alexandros Beskos, Nikolas Kantas","submitted_at":"2013-06-27T10:43:15Z","abstract_excerpt":"In several implementations of Sequential Monte Carlo (SMC) methods it is natural, and important in terms of algorithmic efficiency, to exploit the information of the history of the samples to optimally tune their subsequent propagations. In this article we provide a carefully formulated asymptotic theory for a class of such \\emph{adaptive} SMC methods. The theoretical framework developed here will cover, under assumptions, several commonly used SMC algorithms. There are only limited results about the theoretical underpinning of such adaptive methods: we will bridge this gap by providing a weak"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1306.6462","kind":"arxiv","version":3},"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":"1306.6462","created_at":"2026-05-18T03:00:00.826798+00:00"},{"alias_kind":"arxiv_version","alias_value":"1306.6462v3","created_at":"2026-05-18T03:00:00.826798+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1306.6462","created_at":"2026-05-18T03:00:00.826798+00:00"},{"alias_kind":"pith_short_12","alias_value":"RRPQWIB2YPS3","created_at":"2026-05-18T12:27:59.945178+00:00"},{"alias_kind":"pith_short_16","alias_value":"RRPQWIB2YPS3ANP2","created_at":"2026-05-18T12:27:59.945178+00:00"},{"alias_kind":"pith_short_8","alias_value":"RRPQWIB2","created_at":"2026-05-18T12:27:59.945178+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/RRPQWIB2YPS3ANP24ZJTHIEKEM","json":"https://pith.science/pith/RRPQWIB2YPS3ANP24ZJTHIEKEM.json","graph_json":"https://pith.science/api/pith-number/RRPQWIB2YPS3ANP24ZJTHIEKEM/graph.json","events_json":"https://pith.science/api/pith-number/RRPQWIB2YPS3ANP24ZJTHIEKEM/events.json","paper":"https://pith.science/paper/RRPQWIB2"},"agent_actions":{"view_html":"https://pith.science/pith/RRPQWIB2YPS3ANP24ZJTHIEKEM","download_json":"https://pith.science/pith/RRPQWIB2YPS3ANP24ZJTHIEKEM.json","view_paper":"https://pith.science/paper/RRPQWIB2","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1306.6462&json=true","fetch_graph":"https://pith.science/api/pith-number/RRPQWIB2YPS3ANP24ZJTHIEKEM/graph.json","fetch_events":"https://pith.science/api/pith-number/RRPQWIB2YPS3ANP24ZJTHIEKEM/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/RRPQWIB2YPS3ANP24ZJTHIEKEM/action/timestamp_anchor","attest_storage":"https://pith.science/pith/RRPQWIB2YPS3ANP24ZJTHIEKEM/action/storage_attestation","attest_author":"https://pith.science/pith/RRPQWIB2YPS3ANP24ZJTHIEKEM/action/author_attestation","sign_citation":"https://pith.science/pith/RRPQWIB2YPS3ANP24ZJTHIEKEM/action/citation_signature","submit_replication":"https://pith.science/pith/RRPQWIB2YPS3ANP24ZJTHIEKEM/action/replication_record"}},"created_at":"2026-05-18T03:00:00.826798+00:00","updated_at":"2026-05-18T03:00:00.826798+00:00"}