{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:EXHGRMQP5Q45PWTLSD7S3PT5IL","short_pith_number":"pith:EXHGRMQP","canonical_record":{"source":{"id":"1705.10347","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.CO","submitted_at":"2017-05-29T18:28:14Z","cross_cats_sorted":["math.ST","stat.TH"],"title_canon_sha256":"89d121e643c7a386207f4edb717c07774a47dda6621ad5f9ba8cb00e33814193","abstract_canon_sha256":"e239b186ac0b18fbe38c5dc7bffb4533eb608a7171ce1258efcf79d645627cde"},"schema_version":"1.0"},"canonical_sha256":"25ce68b20fec39d7da6b90ff2dbe7d42fd17e4238dea3e9ebe3153729f79eaf5","source":{"kind":"arxiv","id":"1705.10347","version":4},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1705.10347","created_at":"2026-05-17T23:59:33Z"},{"alias_kind":"arxiv_version","alias_value":"1705.10347v4","created_at":"2026-05-17T23:59:33Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1705.10347","created_at":"2026-05-17T23:59:33Z"},{"alias_kind":"pith_short_12","alias_value":"EXHGRMQP5Q45","created_at":"2026-05-18T12:31:12Z"},{"alias_kind":"pith_short_16","alias_value":"EXHGRMQP5Q45PWTL","created_at":"2026-05-18T12:31:12Z"},{"alias_kind":"pith_short_8","alias_value":"EXHGRMQP","created_at":"2026-05-18T12:31:12Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:EXHGRMQP5Q45PWTLSD7S3PT5IL","target":"record","payload":{"canonical_record":{"source":{"id":"1705.10347","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.CO","submitted_at":"2017-05-29T18:28:14Z","cross_cats_sorted":["math.ST","stat.TH"],"title_canon_sha256":"89d121e643c7a386207f4edb717c07774a47dda6621ad5f9ba8cb00e33814193","abstract_canon_sha256":"e239b186ac0b18fbe38c5dc7bffb4533eb608a7171ce1258efcf79d645627cde"},"schema_version":"1.0"},"canonical_sha256":"25ce68b20fec39d7da6b90ff2dbe7d42fd17e4238dea3e9ebe3153729f79eaf5","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:59:33.289728Z","signature_b64":"Tc5A21nxcVwTX57GQ1DM+e92jbShIkXMLID/uWseHKmH/orZQKJn6BwA0Jkwfc3k/EdX7RybNFV9zN7Ps4teCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"25ce68b20fec39d7da6b90ff2dbe7d42fd17e4238dea3e9ebe3153729f79eaf5","last_reissued_at":"2026-05-17T23:59:33.289108Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:59:33.289108Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1705.10347","source_version":4,"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:59:33Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"VIBzGrBC+BYD1aZ966ANP0oz7F1SC0XYnuWyEatZoToDFbV4UFdrG0HIxIN6VHSt0fnO7Y2oFrvwZZWwO+/HCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T22:15:59.974362Z"},"content_sha256":"53471a9daf23a157b69047e61e80783116347d1f515fe3bafc44de2cb4ae20d4","schema_version":"1.0","event_id":"sha256:53471a9daf23a157b69047e61e80783116347d1f515fe3bafc44de2cb4ae20d4"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:EXHGRMQP5Q45PWTLSD7S3PT5IL","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"An effective likelihood-free approximate computing method with statistical inferential guarantees","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.ST","stat.TH"],"primary_cat":"stat.CO","authors_text":"Min-ge Xie, Suzanne Thornton, Wentao Li","submitted_at":"2017-05-29T18:28:14Z","abstract_excerpt":"Approximate Bayesian computing is a powerful likelihood-free method that has grown increasingly popular since early applications in population genetics. However, complications arise in the theoretical justification for Bayesian inference conducted from this method with a non-sufficient summary statistic. In this paper, we seek to re-frame approximate Bayesian computing within a frequentist context and justify its performance by standards set on the frequency coverage rate. In doing so, we develop a new computational technique called approximate confidence distribution computing, yielding theor"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1705.10347","kind":"arxiv","version":4},"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:59:33Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"+ytQRsFToEMf/maImVWJ/L+bhqUtDh3Dc4SIZi+QG8HLotDPazzKekHhoRtnNe2aamw3+xV0I5uaTUiLCyBBDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T22:15:59.975233Z"},"content_sha256":"c5d676e0c4af27313d94a575c35d588262b766056490fe74df17542bea3b58db","schema_version":"1.0","event_id":"sha256:c5d676e0c4af27313d94a575c35d588262b766056490fe74df17542bea3b58db"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/EXHGRMQP5Q45PWTLSD7S3PT5IL/bundle.json","state_url":"https://pith.science/pith/EXHGRMQP5Q45PWTLSD7S3PT5IL/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/EXHGRMQP5Q45PWTLSD7S3PT5IL/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-31T22:15:59Z","links":{"resolver":"https://pith.science/pith/EXHGRMQP5Q45PWTLSD7S3PT5IL","bundle":"https://pith.science/pith/EXHGRMQP5Q45PWTLSD7S3PT5IL/bundle.json","state":"https://pith.science/pith/EXHGRMQP5Q45PWTLSD7S3PT5IL/state.json","well_known_bundle":"https://pith.science/.well-known/pith/EXHGRMQP5Q45PWTLSD7S3PT5IL/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:EXHGRMQP5Q45PWTLSD7S3PT5IL","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":"e239b186ac0b18fbe38c5dc7bffb4533eb608a7171ce1258efcf79d645627cde","cross_cats_sorted":["math.ST","stat.TH"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.CO","submitted_at":"2017-05-29T18:28:14Z","title_canon_sha256":"89d121e643c7a386207f4edb717c07774a47dda6621ad5f9ba8cb00e33814193"},"schema_version":"1.0","source":{"id":"1705.10347","kind":"arxiv","version":4}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1705.10347","created_at":"2026-05-17T23:59:33Z"},{"alias_kind":"arxiv_version","alias_value":"1705.10347v4","created_at":"2026-05-17T23:59:33Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1705.10347","created_at":"2026-05-17T23:59:33Z"},{"alias_kind":"pith_short_12","alias_value":"EXHGRMQP5Q45","created_at":"2026-05-18T12:31:12Z"},{"alias_kind":"pith_short_16","alias_value":"EXHGRMQP5Q45PWTL","created_at":"2026-05-18T12:31:12Z"},{"alias_kind":"pith_short_8","alias_value":"EXHGRMQP","created_at":"2026-05-18T12:31:12Z"}],"graph_snapshots":[{"event_id":"sha256:c5d676e0c4af27313d94a575c35d588262b766056490fe74df17542bea3b58db","target":"graph","created_at":"2026-05-17T23:59:33Z","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 computing is a powerful likelihood-free method that has grown increasingly popular since early applications in population genetics. However, complications arise in the theoretical justification for Bayesian inference conducted from this method with a non-sufficient summary statistic. In this paper, we seek to re-frame approximate Bayesian computing within a frequentist context and justify its performance by standards set on the frequency coverage rate. In doing so, we develop a new computational technique called approximate confidence distribution computing, yielding theor","authors_text":"Min-ge Xie, Suzanne Thornton, Wentao Li","cross_cats":["math.ST","stat.TH"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.CO","submitted_at":"2017-05-29T18:28:14Z","title":"An effective likelihood-free approximate computing method with statistical inferential guarantees"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1705.10347","kind":"arxiv","version":4},"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:53471a9daf23a157b69047e61e80783116347d1f515fe3bafc44de2cb4ae20d4","target":"record","created_at":"2026-05-17T23:59:33Z","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":"e239b186ac0b18fbe38c5dc7bffb4533eb608a7171ce1258efcf79d645627cde","cross_cats_sorted":["math.ST","stat.TH"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.CO","submitted_at":"2017-05-29T18:28:14Z","title_canon_sha256":"89d121e643c7a386207f4edb717c07774a47dda6621ad5f9ba8cb00e33814193"},"schema_version":"1.0","source":{"id":"1705.10347","kind":"arxiv","version":4}},"canonical_sha256":"25ce68b20fec39d7da6b90ff2dbe7d42fd17e4238dea3e9ebe3153729f79eaf5","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"25ce68b20fec39d7da6b90ff2dbe7d42fd17e4238dea3e9ebe3153729f79eaf5","first_computed_at":"2026-05-17T23:59:33.289108Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:59:33.289108Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"Tc5A21nxcVwTX57GQ1DM+e92jbShIkXMLID/uWseHKmH/orZQKJn6BwA0Jkwfc3k/EdX7RybNFV9zN7Ps4teCQ==","signature_status":"signed_v1","signed_at":"2026-05-17T23:59:33.289728Z","signed_message":"canonical_sha256_bytes"},"source_id":"1705.10347","source_kind":"arxiv","source_version":4}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:53471a9daf23a157b69047e61e80783116347d1f515fe3bafc44de2cb4ae20d4","sha256:c5d676e0c4af27313d94a575c35d588262b766056490fe74df17542bea3b58db"],"state_sha256":"d2d7e1d95fe8eae60312015ce7199e8e6e5e14238aa176244403f601d91a0098"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"KEakKGoDO22A8GAqsu92ufVFbg6KOphyDT5h8TBkiW8WFqTj/anYDIoZ78GRsE6zLSdynOcHDgfe+xQZGxeqDA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-31T22:15:59.980607Z","bundle_sha256":"225577720e08a39514fe9913d03045caeee2c45714a513e715ff1c9716de6f40"}}