{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:YN6G5IO7YB5BC7XQC4H5TCFNKJ","short_pith_number":"pith:YN6G5IO7","canonical_record":{"source":{"id":"1710.01057","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.CO","submitted_at":"2017-10-03T10:09:07Z","cross_cats_sorted":[],"title_canon_sha256":"ca1cdcea05a526abdbc659a05dcf2c557e466ba4c3caef6286b8c6bc9fa38afe","abstract_canon_sha256":"627bf1473532adc19bcd5b69a197c05401b91723a7bb736860b0f9a206e9a815"},"schema_version":"1.0"},"canonical_sha256":"c37c6ea1dfc07a117ef0170fd988ad526876b9e18a026ccb1724a6038ce001c4","source":{"kind":"arxiv","id":"1710.01057","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1710.01057","created_at":"2026-05-18T00:16:44Z"},{"alias_kind":"arxiv_version","alias_value":"1710.01057v3","created_at":"2026-05-18T00:16:44Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1710.01057","created_at":"2026-05-18T00:16:44Z"},{"alias_kind":"pith_short_12","alias_value":"YN6G5IO7YB5B","created_at":"2026-05-18T12:31:56Z"},{"alias_kind":"pith_short_16","alias_value":"YN6G5IO7YB5BC7XQ","created_at":"2026-05-18T12:31:56Z"},{"alias_kind":"pith_short_8","alias_value":"YN6G5IO7","created_at":"2026-05-18T12:31:56Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:YN6G5IO7YB5BC7XQC4H5TCFNKJ","target":"record","payload":{"canonical_record":{"source":{"id":"1710.01057","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.CO","submitted_at":"2017-10-03T10:09:07Z","cross_cats_sorted":[],"title_canon_sha256":"ca1cdcea05a526abdbc659a05dcf2c557e466ba4c3caef6286b8c6bc9fa38afe","abstract_canon_sha256":"627bf1473532adc19bcd5b69a197c05401b91723a7bb736860b0f9a206e9a815"},"schema_version":"1.0"},"canonical_sha256":"c37c6ea1dfc07a117ef0170fd988ad526876b9e18a026ccb1724a6038ce001c4","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:16:44.867410Z","signature_b64":"leKDyS/479LP9dHPQcmijBrLKf7+PStHk0DO+Xky3y+0Aynn8ufTBeCCwdguW+K5gnAuGKRMheQf94Kj8rE2CA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"c37c6ea1dfc07a117ef0170fd988ad526876b9e18a026ccb1724a6038ce001c4","last_reissued_at":"2026-05-18T00:16:44.866727Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:16:44.866727Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1710.01057","source_version":3,"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-18T00:16:44Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"tw0Z/8CYQaLuMljn12Qv81X3P5CnRVuSwElrFDikHLhnfsbqM1BkjMOJLei+Pijbmsx8xqoHuRcfzYFKw6fDBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T20:48:46.119290Z"},"content_sha256":"40134171b7c361e15399678469cebb1e219954f340a98bd5cf96a5d318b2606f","schema_version":"1.0","event_id":"sha256:40134171b7c361e15399678469cebb1e219954f340a98bd5cf96a5d318b2606f"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:YN6G5IO7YB5BC7XQC4H5TCFNKJ","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Improving approximate Bayesian computation via quasi-Monte Carlo","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"stat.CO","authors_text":"Alexander Buchholz, Nicolas Chopin","submitted_at":"2017-10-03T10:09:07Z","abstract_excerpt":"ABC (approximate Bayesian computation) is a general approach for dealing with models with an intractable likelihood. In this work, we derive ABC algorithms based on QMC (quasi- Monte Carlo) sequences. We show that the resulting ABC estimates have a lower variance than their Monte Carlo counter-parts. We also develop QMC variants of sequential ABC algorithms, which progressively adapt the proposal distribution and the acceptance threshold. We illustrate our QMC approach through several examples taken from the ABC literature. Keywords: Approximate Bayesian computation, Likelihood-free inference,"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1710.01057","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"},"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-18T00:16:44Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"wqN7q4NCQo63b0RPJQRGyAOdYPv9fzEuaPYphS3v5IG4W7r0zd95NvCaDy0jsKNFcSy2Bz4fD0Os+1g+WRcSCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T20:48:46.119767Z"},"content_sha256":"23f46132412ffcbd2163adaad6b3d4dec44b3b2a5e5ad65900a56dba3dc4295e","schema_version":"1.0","event_id":"sha256:23f46132412ffcbd2163adaad6b3d4dec44b3b2a5e5ad65900a56dba3dc4295e"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/YN6G5IO7YB5BC7XQC4H5TCFNKJ/bundle.json","state_url":"https://pith.science/pith/YN6G5IO7YB5BC7XQC4H5TCFNKJ/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/YN6G5IO7YB5BC7XQC4H5TCFNKJ/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-05-27T20:48:46Z","links":{"resolver":"https://pith.science/pith/YN6G5IO7YB5BC7XQC4H5TCFNKJ","bundle":"https://pith.science/pith/YN6G5IO7YB5BC7XQC4H5TCFNKJ/bundle.json","state":"https://pith.science/pith/YN6G5IO7YB5BC7XQC4H5TCFNKJ/state.json","well_known_bundle":"https://pith.science/.well-known/pith/YN6G5IO7YB5BC7XQC4H5TCFNKJ/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:YN6G5IO7YB5BC7XQC4H5TCFNKJ","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":"627bf1473532adc19bcd5b69a197c05401b91723a7bb736860b0f9a206e9a815","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.CO","submitted_at":"2017-10-03T10:09:07Z","title_canon_sha256":"ca1cdcea05a526abdbc659a05dcf2c557e466ba4c3caef6286b8c6bc9fa38afe"},"schema_version":"1.0","source":{"id":"1710.01057","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1710.01057","created_at":"2026-05-18T00:16:44Z"},{"alias_kind":"arxiv_version","alias_value":"1710.01057v3","created_at":"2026-05-18T00:16:44Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1710.01057","created_at":"2026-05-18T00:16:44Z"},{"alias_kind":"pith_short_12","alias_value":"YN6G5IO7YB5B","created_at":"2026-05-18T12:31:56Z"},{"alias_kind":"pith_short_16","alias_value":"YN6G5IO7YB5BC7XQ","created_at":"2026-05-18T12:31:56Z"},{"alias_kind":"pith_short_8","alias_value":"YN6G5IO7","created_at":"2026-05-18T12:31:56Z"}],"graph_snapshots":[{"event_id":"sha256:23f46132412ffcbd2163adaad6b3d4dec44b3b2a5e5ad65900a56dba3dc4295e","target":"graph","created_at":"2026-05-18T00:16:44Z","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":"ABC (approximate Bayesian computation) is a general approach for dealing with models with an intractable likelihood. In this work, we derive ABC algorithms based on QMC (quasi- Monte Carlo) sequences. We show that the resulting ABC estimates have a lower variance than their Monte Carlo counter-parts. We also develop QMC variants of sequential ABC algorithms, which progressively adapt the proposal distribution and the acceptance threshold. We illustrate our QMC approach through several examples taken from the ABC literature. Keywords: Approximate Bayesian computation, Likelihood-free inference,","authors_text":"Alexander Buchholz, Nicolas Chopin","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.CO","submitted_at":"2017-10-03T10:09:07Z","title":"Improving approximate Bayesian computation via quasi-Monte Carlo"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1710.01057","kind":"arxiv","version":3},"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:40134171b7c361e15399678469cebb1e219954f340a98bd5cf96a5d318b2606f","target":"record","created_at":"2026-05-18T00:16:44Z","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":"627bf1473532adc19bcd5b69a197c05401b91723a7bb736860b0f9a206e9a815","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.CO","submitted_at":"2017-10-03T10:09:07Z","title_canon_sha256":"ca1cdcea05a526abdbc659a05dcf2c557e466ba4c3caef6286b8c6bc9fa38afe"},"schema_version":"1.0","source":{"id":"1710.01057","kind":"arxiv","version":3}},"canonical_sha256":"c37c6ea1dfc07a117ef0170fd988ad526876b9e18a026ccb1724a6038ce001c4","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"c37c6ea1dfc07a117ef0170fd988ad526876b9e18a026ccb1724a6038ce001c4","first_computed_at":"2026-05-18T00:16:44.866727Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:16:44.866727Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"leKDyS/479LP9dHPQcmijBrLKf7+PStHk0DO+Xky3y+0Aynn8ufTBeCCwdguW+K5gnAuGKRMheQf94Kj8rE2CA==","signature_status":"signed_v1","signed_at":"2026-05-18T00:16:44.867410Z","signed_message":"canonical_sha256_bytes"},"source_id":"1710.01057","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:40134171b7c361e15399678469cebb1e219954f340a98bd5cf96a5d318b2606f","sha256:23f46132412ffcbd2163adaad6b3d4dec44b3b2a5e5ad65900a56dba3dc4295e"],"state_sha256":"f39a53e130e6ffaf78a0ea8b3d6683ceab72d8308fd27f1d7f78072e1b485a7f"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"xQSvKIE9rTIwcolPnPHqGt+MqC2Pang07tzXQ+uQ0N66giB85SQJSRiAfhQJUUIaA5Dnd9207LejwYbNGH1QBA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-27T20:48:46.122907Z","bundle_sha256":"082693ba62e6ca0bc1149734bf5cb65bed3a25ec91df25549979a8841b9c3285"}}