{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2020:X2S46SSZVYRP5O2QQ5XWB3WIBS","short_pith_number":"pith:X2S46SSZ","schema_version":"1.0","canonical_sha256":"bea5cf4a59ae22febb50876f60eec80cbbe033c3197fb8c1b16f57477a7253ba","source":{"kind":"arxiv","id":"2006.14126","version":1},"attestation_state":"computed","paper":{"title":"Robust and Efficient Approximate Bayesian Computation: A Minimum Distance Approach","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["econ.EM","math.ST","stat.TH"],"primary_cat":"stat.ME","authors_text":"David T. Frazier","submitted_at":"2020-06-25T01:11:02Z","abstract_excerpt":"In many instances, the application of approximate Bayesian methods is hampered by two practical features: 1) the requirement to project the data down to low-dimensional summary, including the choice of this projection, which ultimately yields inefficient inference; 2) a possible lack of robustness to deviations from the underlying model structure. Motivated by these efficiency and robustness concerns, we construct a new Bayesian method that can deliver efficient estimators when the underlying model is well-specified, and which is simultaneously robust to certain forms of model misspecification"},"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":"2006.14126","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ME","submitted_at":"2020-06-25T01:11:02Z","cross_cats_sorted":["econ.EM","math.ST","stat.TH"],"title_canon_sha256":"2b5db114093bcceb08bd70babe80dfe78d86f7b3cbf166da4686a4848f43cc36","abstract_canon_sha256":"9d68207a8019fbbe5ab77ba2966fd2234103c6659cdd48e242dc56e5fe93122a"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T01:13:29.386094Z","signature_b64":"D/ICiJYUIat7Ouf3tPmOAg5W6gEBRvWKZb7om+M9oVemECZhuU89jA4+Fo0kcHM16vy5y9wsvUXlbQK8k1fQCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"bea5cf4a59ae22febb50876f60eec80cbbe033c3197fb8c1b16f57477a7253ba","last_reissued_at":"2026-07-05T01:13:29.385619Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T01:13:29.385619Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Robust and Efficient Approximate Bayesian Computation: A Minimum Distance Approach","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["econ.EM","math.ST","stat.TH"],"primary_cat":"stat.ME","authors_text":"David T. Frazier","submitted_at":"2020-06-25T01:11:02Z","abstract_excerpt":"In many instances, the application of approximate Bayesian methods is hampered by two practical features: 1) the requirement to project the data down to low-dimensional summary, including the choice of this projection, which ultimately yields inefficient inference; 2) a possible lack of robustness to deviations from the underlying model structure. Motivated by these efficiency and robustness concerns, we construct a new Bayesian method that can deliver efficient estimators when the underlying model is well-specified, and which is simultaneously robust to certain forms of model misspecification"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2006.14126","kind":"arxiv","version":1},"verdict":{"id":null,"model_set":{},"created_at":null,"strongest_claim":"","one_line_summary":"","pipeline_version":null,"weakest_assumption":"","pith_extraction_headline":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2006.14126/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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":"2006.14126","created_at":"2026-07-05T01:13:29.385682+00:00"},{"alias_kind":"arxiv_version","alias_value":"2006.14126v1","created_at":"2026-07-05T01:13:29.385682+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2006.14126","created_at":"2026-07-05T01:13:29.385682+00:00"},{"alias_kind":"pith_short_12","alias_value":"X2S46SSZVYRP","created_at":"2026-07-05T01:13:29.385682+00:00"},{"alias_kind":"pith_short_16","alias_value":"X2S46SSZVYRP5O2Q","created_at":"2026-07-05T01:13:29.385682+00:00"},{"alias_kind":"pith_short_8","alias_value":"X2S46SSZ","created_at":"2026-07-05T01:13:29.385682+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2606.22981","citing_title":"Learning the distance for ABC and localized neural posterior estimation","ref_index":6,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/X2S46SSZVYRP5O2QQ5XWB3WIBS","json":"https://pith.science/pith/X2S46SSZVYRP5O2QQ5XWB3WIBS.json","graph_json":"https://pith.science/api/pith-number/X2S46SSZVYRP5O2QQ5XWB3WIBS/graph.json","events_json":"https://pith.science/api/pith-number/X2S46SSZVYRP5O2QQ5XWB3WIBS/events.json","paper":"https://pith.science/paper/X2S46SSZ"},"agent_actions":{"view_html":"https://pith.science/pith/X2S46SSZVYRP5O2QQ5XWB3WIBS","download_json":"https://pith.science/pith/X2S46SSZVYRP5O2QQ5XWB3WIBS.json","view_paper":"https://pith.science/paper/X2S46SSZ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2006.14126&json=true","fetch_graph":"https://pith.science/api/pith-number/X2S46SSZVYRP5O2QQ5XWB3WIBS/graph.json","fetch_events":"https://pith.science/api/pith-number/X2S46SSZVYRP5O2QQ5XWB3WIBS/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/X2S46SSZVYRP5O2QQ5XWB3WIBS/action/timestamp_anchor","attest_storage":"https://pith.science/pith/X2S46SSZVYRP5O2QQ5XWB3WIBS/action/storage_attestation","attest_author":"https://pith.science/pith/X2S46SSZVYRP5O2QQ5XWB3WIBS/action/author_attestation","sign_citation":"https://pith.science/pith/X2S46SSZVYRP5O2QQ5XWB3WIBS/action/citation_signature","submit_replication":"https://pith.science/pith/X2S46SSZVYRP5O2QQ5XWB3WIBS/action/replication_record"}},"created_at":"2026-07-05T01:13:29.385682+00:00","updated_at":"2026-07-05T01:13:29.385682+00:00"}