{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2014:CVVQF7Q6D7OP6RYNEWWESOZQQD","short_pith_number":"pith:CVVQF7Q6","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"},"canonical_sha256":"156b02fe1e1fdcff470d25ac493b3080d182410d55f466e59e9984e895c8f833","source":{"kind":"arxiv","id":"1402.4039","version":5},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1402.4039","created_at":"2026-05-18T02:32:38Z"},{"alias_kind":"arxiv_version","alias_value":"1402.4039v5","created_at":"2026-05-18T02:32:38Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1402.4039","created_at":"2026-05-18T02:32:38Z"},{"alias_kind":"pith_short_12","alias_value":"CVVQF7Q6D7OP","created_at":"2026-05-18T12:28:25Z"},{"alias_kind":"pith_short_16","alias_value":"CVVQF7Q6D7OP6RYN","created_at":"2026-05-18T12:28:25Z"},{"alias_kind":"pith_short_8","alias_value":"CVVQF7Q6","created_at":"2026-05-18T12:28:25Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2014:CVVQF7Q6D7OP6RYNEWWESOZQQD","target":"record","payload":{"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"},"canonical_sha256":"156b02fe1e1fdcff470d25ac493b3080d182410d55f466e59e9984e895c8f833","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"},"source_kind":"arxiv","source_id":"1402.4039","source_version":5,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T02:32:38Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"dOLnS5Xsboql981KMfAnQd35OY88TrzZlHgEfesHG4tj9mSyuTpgxHQR2Uuasdy+RYLbINUvIC707840qt3KCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-04T01:30:34.349713Z"},"content_sha256":"3bcda353246f4ed5ab0fa9f419e8746477a5e437cd361a9b411af22138b8f82d","schema_version":"1.0","event_id":"sha256:3bcda353246f4ed5ab0fa9f419e8746477a5e437cd361a9b411af22138b8f82d"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2014:CVVQF7Q6D7OP6RYNEWWESOZQQD","target":"graph","payload":{"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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T02:32:38Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Mv/jT32xQec4W6cBsHBVfmsfHZsfpKSMP+PEf6DcncJJkPyJPh4UGGEN1FJd4hB7y5whRqxoTgDJAlQ8DRoVCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-04T01:30:34.350054Z"},"content_sha256":"502a95e3a7f71b36098b11926e047794b88af746a6eef8bd1d26965d2de13b79","schema_version":"1.0","event_id":"sha256:502a95e3a7f71b36098b11926e047794b88af746a6eef8bd1d26965d2de13b79"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/CVVQF7Q6D7OP6RYNEWWESOZQQD/bundle.json","state_url":"https://pith.science/pith/CVVQF7Q6D7OP6RYNEWWESOZQQD/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/CVVQF7Q6D7OP6RYNEWWESOZQQD/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-06-04T01:30:34Z","links":{"resolver":"https://pith.science/pith/CVVQF7Q6D7OP6RYNEWWESOZQQD","bundle":"https://pith.science/pith/CVVQF7Q6D7OP6RYNEWWESOZQQD/bundle.json","state":"https://pith.science/pith/CVVQF7Q6D7OP6RYNEWWESOZQQD/state.json","well_known_bundle":"https://pith.science/.well-known/pith/CVVQF7Q6D7OP6RYNEWWESOZQQD/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:CVVQF7Q6D7OP6RYNEWWESOZQQD","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"89427d758a9ea32cc2d3dabb0c7c68d1471e78546e531448311fbc4a21bed34f","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.CO","submitted_at":"2014-02-17T15:47:32Z","title_canon_sha256":"c069053866cf839180c30a9cc7c2771ab57c6af8241a4885d65a09cf486473d0"},"schema_version":"1.0","source":{"id":"1402.4039","kind":"arxiv","version":5}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1402.4039","created_at":"2026-05-18T02:32:38Z"},{"alias_kind":"arxiv_version","alias_value":"1402.4039v5","created_at":"2026-05-18T02:32:38Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1402.4039","created_at":"2026-05-18T02:32:38Z"},{"alias_kind":"pith_short_12","alias_value":"CVVQF7Q6D7OP","created_at":"2026-05-18T12:28:25Z"},{"alias_kind":"pith_short_16","alias_value":"CVVQF7Q6D7OP6RYN","created_at":"2026-05-18T12:28:25Z"},{"alias_kind":"pith_short_8","alias_value":"CVVQF7Q6","created_at":"2026-05-18T12:28:25Z"}],"graph_snapshots":[{"event_id":"sha256:502a95e3a7f71b36098b11926e047794b88af746a6eef8bd1d26965d2de13b79","target":"graph","created_at":"2026-05-18T02:32:38Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"paper":{"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","authors_text":"Mathieu Gerber, Nicolas Chopin","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.CO","submitted_at":"2014-02-17T15:47:32Z","title":"Sequential Quasi-Monte Carlo"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1402.4039","kind":"arxiv","version":5},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:3bcda353246f4ed5ab0fa9f419e8746477a5e437cd361a9b411af22138b8f82d","target":"record","created_at":"2026-05-18T02:32:38Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"89427d758a9ea32cc2d3dabb0c7c68d1471e78546e531448311fbc4a21bed34f","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.CO","submitted_at":"2014-02-17T15:47:32Z","title_canon_sha256":"c069053866cf839180c30a9cc7c2771ab57c6af8241a4885d65a09cf486473d0"},"schema_version":"1.0","source":{"id":"1402.4039","kind":"arxiv","version":5}},"canonical_sha256":"156b02fe1e1fdcff470d25ac493b3080d182410d55f466e59e9984e895c8f833","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"156b02fe1e1fdcff470d25ac493b3080d182410d55f466e59e9984e895c8f833","first_computed_at":"2026-05-18T02:32:38.906843Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:32:38.906843Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"7A4dlPhPhPc7S0Qh3MG5nlPRpD7dn7WlkNsXkiSigrLa206/m5NENL+pWXZDi1inyLHeK8H7Shofb0VKIRqOBw==","signature_status":"signed_v1","signed_at":"2026-05-18T02:32:38.907329Z","signed_message":"canonical_sha256_bytes"},"source_id":"1402.4039","source_kind":"arxiv","source_version":5}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:3bcda353246f4ed5ab0fa9f419e8746477a5e437cd361a9b411af22138b8f82d","sha256:502a95e3a7f71b36098b11926e047794b88af746a6eef8bd1d26965d2de13b79"],"state_sha256":"0e1877d960708059cf781cc6d1876c14803a0b153b6e1293cc828a489de33a7b"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Bfd8vty5IhVzN6bJCzg45dJbHt3nOqJWugUapXuvAo0uZcCshGdLBcaujTfPYbPgVC79I9myVUff+2G04jWzCw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-04T01:30:34.352044Z","bundle_sha256":"da291ea5276be8f5dec78b2d73a35f7f7c63b1d533e21371421c89d3b9b450dd"}}