{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2014:CVVQF7Q6D7OP6RYNEWWESOZQQD","short_pith_number":"pith:CVVQF7Q6","schema_version":"1.0","canonical_sha256":"156b02fe1e1fdcff470d25ac493b3080d182410d55f466e59e9984e895c8f833","source":{"kind":"arxiv","id":"1402.4039","version":5},"attestation_state":"computed","paper":{"title":"Sequential Quasi-Monte Carlo","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"stat.CO","authors_text":"Mathieu Gerber, Nicolas Chopin","submitted_at":"2014-02-17T15:47:32Z","abstract_excerpt":"We derive and study SQMC (Sequential Quasi-Monte Carlo), a class of algorithms obtained by introducing QMC point sets in particle filtering. SQMC is related to, and may be seen as an extension of, the array-RQMC algorithm of L'Ecuyer et al. (2006). The complexity of SQMC is $O(N \\log N)$, where $N$ is the number of simulations at each iteration, and its error rate is smaller than the Monte Carlo rate $O_P(N^{-1/2})$. The only requirement to implement SQMC is the ability to write the simulation of particle $x_t^n$ given $x_{t-1}^n$ as a deterministic function of $x_{t-1}^n$ and a fixed number o"},"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":"1402.4039","kind":"arxiv","version":5},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.CO","submitted_at":"2014-02-17T15:47:32Z","cross_cats_sorted":[],"title_canon_sha256":"c069053866cf839180c30a9cc7c2771ab57c6af8241a4885d65a09cf486473d0","abstract_canon_sha256":"89427d758a9ea32cc2d3dabb0c7c68d1471e78546e531448311fbc4a21bed34f"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:32:38.907329Z","signature_b64":"7A4dlPhPhPc7S0Qh3MG5nlPRpD7dn7WlkNsXkiSigrLa206/m5NENL+pWXZDi1inyLHeK8H7Shofb0VKIRqOBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"156b02fe1e1fdcff470d25ac493b3080d182410d55f466e59e9984e895c8f833","last_reissued_at":"2026-05-18T02:32:38.906843Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:32:38.906843Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Sequential Quasi-Monte Carlo","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"stat.CO","authors_text":"Mathieu Gerber, Nicolas Chopin","submitted_at":"2014-02-17T15:47:32Z","abstract_excerpt":"We derive and study SQMC (Sequential Quasi-Monte Carlo), a class of algorithms obtained by introducing QMC point sets in particle filtering. SQMC is related to, and may be seen as an extension of, the array-RQMC algorithm of L'Ecuyer et al. (2006). The complexity of SQMC is $O(N \\log N)$, where $N$ is the number of simulations at each iteration, and its error rate is smaller than the Monte Carlo rate $O_P(N^{-1/2})$. The only requirement to implement SQMC is the ability to write the simulation of particle $x_t^n$ given $x_{t-1}^n$ as a deterministic function of $x_{t-1}^n$ and a fixed number o"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1402.4039","kind":"arxiv","version":5},"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":"1402.4039","created_at":"2026-05-18T02:32:38.906900+00:00"},{"alias_kind":"arxiv_version","alias_value":"1402.4039v5","created_at":"2026-05-18T02:32:38.906900+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1402.4039","created_at":"2026-05-18T02:32:38.906900+00:00"},{"alias_kind":"pith_short_12","alias_value":"CVVQF7Q6D7OP","created_at":"2026-05-18T12:28:25.294606+00:00"},{"alias_kind":"pith_short_16","alias_value":"CVVQF7Q6D7OP6RYN","created_at":"2026-05-18T12:28:25.294606+00:00"},{"alias_kind":"pith_short_8","alias_value":"CVVQF7Q6","created_at":"2026-05-18T12:28:25.294606+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/CVVQF7Q6D7OP6RYNEWWESOZQQD","json":"https://pith.science/pith/CVVQF7Q6D7OP6RYNEWWESOZQQD.json","graph_json":"https://pith.science/api/pith-number/CVVQF7Q6D7OP6RYNEWWESOZQQD/graph.json","events_json":"https://pith.science/api/pith-number/CVVQF7Q6D7OP6RYNEWWESOZQQD/events.json","paper":"https://pith.science/paper/CVVQF7Q6"},"agent_actions":{"view_html":"https://pith.science/pith/CVVQF7Q6D7OP6RYNEWWESOZQQD","download_json":"https://pith.science/pith/CVVQF7Q6D7OP6RYNEWWESOZQQD.json","view_paper":"https://pith.science/paper/CVVQF7Q6","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1402.4039&json=true","fetch_graph":"https://pith.science/api/pith-number/CVVQF7Q6D7OP6RYNEWWESOZQQD/graph.json","fetch_events":"https://pith.science/api/pith-number/CVVQF7Q6D7OP6RYNEWWESOZQQD/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/CVVQF7Q6D7OP6RYNEWWESOZQQD/action/timestamp_anchor","attest_storage":"https://pith.science/pith/CVVQF7Q6D7OP6RYNEWWESOZQQD/action/storage_attestation","attest_author":"https://pith.science/pith/CVVQF7Q6D7OP6RYNEWWESOZQQD/action/author_attestation","sign_citation":"https://pith.science/pith/CVVQF7Q6D7OP6RYNEWWESOZQQD/action/citation_signature","submit_replication":"https://pith.science/pith/CVVQF7Q6D7OP6RYNEWWESOZQQD/action/replication_record"}},"created_at":"2026-05-18T02:32:38.906900+00:00","updated_at":"2026-05-18T02:32:38.906900+00:00"}