{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2019:ZFLINYQSZSJRESHHR5DJKLMPMV","short_pith_number":"pith:ZFLINYQS","canonical_record":{"source":{"id":"1902.00412","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.CO","submitted_at":"2019-02-01T15:47:19Z","cross_cats_sorted":[],"title_canon_sha256":"6fc20e2f042dbd99f901fa70f060188836ac56183503e502884a0511bd860992","abstract_canon_sha256":"c3ebd85089b26d5a41dd2e4346aeecfc82b317d7b0a0455b8a6dd808f1c7f399"},"schema_version":"1.0"},"canonical_sha256":"c95686e212cc931248e78f46952d8f656ff982637c0cc326bdd0e1c6d6fb0e39","source":{"kind":"arxiv","id":"1902.00412","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1902.00412","created_at":"2026-05-17T23:46:03Z"},{"alias_kind":"arxiv_version","alias_value":"1902.00412v2","created_at":"2026-05-17T23:46:03Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1902.00412","created_at":"2026-05-17T23:46:03Z"},{"alias_kind":"pith_short_12","alias_value":"ZFLINYQSZSJR","created_at":"2026-05-18T12:33:33Z"},{"alias_kind":"pith_short_16","alias_value":"ZFLINYQSZSJRESHH","created_at":"2026-05-18T12:33:33Z"},{"alias_kind":"pith_short_8","alias_value":"ZFLINYQS","created_at":"2026-05-18T12:33:33Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2019:ZFLINYQSZSJRESHHR5DJKLMPMV","target":"record","payload":{"canonical_record":{"source":{"id":"1902.00412","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.CO","submitted_at":"2019-02-01T15:47:19Z","cross_cats_sorted":[],"title_canon_sha256":"6fc20e2f042dbd99f901fa70f060188836ac56183503e502884a0511bd860992","abstract_canon_sha256":"c3ebd85089b26d5a41dd2e4346aeecfc82b317d7b0a0455b8a6dd808f1c7f399"},"schema_version":"1.0"},"canonical_sha256":"c95686e212cc931248e78f46952d8f656ff982637c0cc326bdd0e1c6d6fb0e39","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:46:03.545691Z","signature_b64":"cbljHxoSKHZznATNK6k7qRqmaKbSKOvfsu5oYSX9RTArRfolbTRajwZz2KcVUFh1vBAFm+LngNWwNuJ76ADaAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"c95686e212cc931248e78f46952d8f656ff982637c0cc326bdd0e1c6d6fb0e39","last_reissued_at":"2026-05-17T23:46:03.544996Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:46:03.544996Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1902.00412","source_version":2,"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-17T23:46:03Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"9fPANc9PWBhhMD60E07WpKdFZCt83+jENolBIySvvoovnJPNQRl7wjmtqoz64OEJ3bZvasesLAA/RVwBtqDgDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-22T21:59:00.869420Z"},"content_sha256":"24575d09d4881f299c164e320e0dd70d00c4385bbf7301726645a686048c1677","schema_version":"1.0","event_id":"sha256:24575d09d4881f299c164e320e0dd70d00c4385bbf7301726645a686048c1677"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2019:ZFLINYQSZSJRESHHR5DJKLMPMV","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"On the use of approximate Bayesian computation Markov chain Monte Carlo with inflated tolerance and post-correction","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"stat.CO","authors_text":"Jordan Franks, Matti Vihola","submitted_at":"2019-02-01T15:47:19Z","abstract_excerpt":"Approximate Bayesian computation allows for inference of complicated probabilistic models with intractable likelihoods using model simulations. The Markov chain Monte Carlo implementation of approximate Bayesian computation is often sensitive to the tolerance parameter: low tolerance leads to poor mixing and large tolerance entails excess bias. We consider an approach using a relatively large tolerance for the Markov chain Monte Carlo sampler to ensure its sufficient mixing, and post-processing the output leading to estimators for a range of finer tolerances. We introduce an approximate confid"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1902.00412","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"},"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-17T23:46:03Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"uIfqauGKfDZWH1ttL14EKZ7JnBF0ccn489uS5HEhgrX4hwHg9hpOgkrSO2YnLsq6NPvijOkHtSSyji4iGqvtBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-22T21:59:00.869769Z"},"content_sha256":"ccab1deb844d8f6bc7930417dc0770f5067e519974f4168e6d61ff7a9a9735a1","schema_version":"1.0","event_id":"sha256:ccab1deb844d8f6bc7930417dc0770f5067e519974f4168e6d61ff7a9a9735a1"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/ZFLINYQSZSJRESHHR5DJKLMPMV/bundle.json","state_url":"https://pith.science/pith/ZFLINYQSZSJRESHHR5DJKLMPMV/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/ZFLINYQSZSJRESHHR5DJKLMPMV/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-22T21:59:00Z","links":{"resolver":"https://pith.science/pith/ZFLINYQSZSJRESHHR5DJKLMPMV","bundle":"https://pith.science/pith/ZFLINYQSZSJRESHHR5DJKLMPMV/bundle.json","state":"https://pith.science/pith/ZFLINYQSZSJRESHHR5DJKLMPMV/state.json","well_known_bundle":"https://pith.science/.well-known/pith/ZFLINYQSZSJRESHHR5DJKLMPMV/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2019:ZFLINYQSZSJRESHHR5DJKLMPMV","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":"c3ebd85089b26d5a41dd2e4346aeecfc82b317d7b0a0455b8a6dd808f1c7f399","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.CO","submitted_at":"2019-02-01T15:47:19Z","title_canon_sha256":"6fc20e2f042dbd99f901fa70f060188836ac56183503e502884a0511bd860992"},"schema_version":"1.0","source":{"id":"1902.00412","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1902.00412","created_at":"2026-05-17T23:46:03Z"},{"alias_kind":"arxiv_version","alias_value":"1902.00412v2","created_at":"2026-05-17T23:46:03Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1902.00412","created_at":"2026-05-17T23:46:03Z"},{"alias_kind":"pith_short_12","alias_value":"ZFLINYQSZSJR","created_at":"2026-05-18T12:33:33Z"},{"alias_kind":"pith_short_16","alias_value":"ZFLINYQSZSJRESHH","created_at":"2026-05-18T12:33:33Z"},{"alias_kind":"pith_short_8","alias_value":"ZFLINYQS","created_at":"2026-05-18T12:33:33Z"}],"graph_snapshots":[{"event_id":"sha256:ccab1deb844d8f6bc7930417dc0770f5067e519974f4168e6d61ff7a9a9735a1","target":"graph","created_at":"2026-05-17T23:46:03Z","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":"Approximate Bayesian computation allows for inference of complicated probabilistic models with intractable likelihoods using model simulations. The Markov chain Monte Carlo implementation of approximate Bayesian computation is often sensitive to the tolerance parameter: low tolerance leads to poor mixing and large tolerance entails excess bias. We consider an approach using a relatively large tolerance for the Markov chain Monte Carlo sampler to ensure its sufficient mixing, and post-processing the output leading to estimators for a range of finer tolerances. We introduce an approximate confid","authors_text":"Jordan Franks, Matti Vihola","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.CO","submitted_at":"2019-02-01T15:47:19Z","title":"On the use of approximate Bayesian computation Markov chain Monte Carlo with inflated tolerance and post-correction"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1902.00412","kind":"arxiv","version":2},"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:24575d09d4881f299c164e320e0dd70d00c4385bbf7301726645a686048c1677","target":"record","created_at":"2026-05-17T23:46:03Z","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":"c3ebd85089b26d5a41dd2e4346aeecfc82b317d7b0a0455b8a6dd808f1c7f399","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.CO","submitted_at":"2019-02-01T15:47:19Z","title_canon_sha256":"6fc20e2f042dbd99f901fa70f060188836ac56183503e502884a0511bd860992"},"schema_version":"1.0","source":{"id":"1902.00412","kind":"arxiv","version":2}},"canonical_sha256":"c95686e212cc931248e78f46952d8f656ff982637c0cc326bdd0e1c6d6fb0e39","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"c95686e212cc931248e78f46952d8f656ff982637c0cc326bdd0e1c6d6fb0e39","first_computed_at":"2026-05-17T23:46:03.544996Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:46:03.544996Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"cbljHxoSKHZznATNK6k7qRqmaKbSKOvfsu5oYSX9RTArRfolbTRajwZz2KcVUFh1vBAFm+LngNWwNuJ76ADaAQ==","signature_status":"signed_v1","signed_at":"2026-05-17T23:46:03.545691Z","signed_message":"canonical_sha256_bytes"},"source_id":"1902.00412","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:24575d09d4881f299c164e320e0dd70d00c4385bbf7301726645a686048c1677","sha256:ccab1deb844d8f6bc7930417dc0770f5067e519974f4168e6d61ff7a9a9735a1"],"state_sha256":"cebc1cf6e0b313df3629939ebbcc4bccd13fee21e27566d1120d7ba09db7adae"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"32d2emGo+t7cltIWTjy7mh4sdFU42dwV6NQeNw8hbeqlTyQLwWuchLUT/XG7u+l1uU5Hc4QyMuUsOwApe6/gCw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-22T21:59:00.871813Z","bundle_sha256":"b3ce22771c9f91efb7c083f81974b78870ed78fd7c4c4b01b12368e17fe3f376"}}