{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2014:F2VJM7N5O2YVQVGRN5DFNXNT2U","short_pith_number":"pith:F2VJM7N5","schema_version":"1.0","canonical_sha256":"2eaa967dbd76b15854d16f4656ddb3d501204063b75452a06b48e6ae99d3eab9","source":{"kind":"arxiv","id":"1401.2838","version":1},"attestation_state":"computed","paper":{"title":"GPS-ABC: Gaussian Process Surrogate Approximate Bayesian Computation","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["q-bio.QM","stat.ML"],"primary_cat":"cs.LG","authors_text":"Edward Meeds, Max Welling","submitted_at":"2014-01-13T14:02:37Z","abstract_excerpt":"Scientists often express their understanding of the world through a computationally demanding simulation program. Analyzing the posterior distribution of the parameters given observations (the inverse problem) can be extremely challenging. The Approximate Bayesian Computation (ABC) framework is the standard statistical tool to handle these likelihood free problems, but they require a very large number of simulations. In this work we develop two new ABC sampling algorithms that significantly reduce the number of simulations necessary for posterior inference. Both algorithms use confidence estim"},"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":"1401.2838","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2014-01-13T14:02:37Z","cross_cats_sorted":["q-bio.QM","stat.ML"],"title_canon_sha256":"8ce9af50a4b31c3c46dac8a3bdc55fbeb19b6a60ce72417e34fc535e00e068ca","abstract_canon_sha256":"a7377af842ee0978d1cbe74db7926d1cf9ae05b8f6108cfa6ba74b3b1e560b2e"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:02:31.799254Z","signature_b64":"Nh+vLN00brEwVbG5Z98xSguYXO8/yaWZLh3wJnZ7ujpASkT8ORkhTevKnhm/utXNXkwW4ErCiGnWcLVX0XSOAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"2eaa967dbd76b15854d16f4656ddb3d501204063b75452a06b48e6ae99d3eab9","last_reissued_at":"2026-05-18T03:02:31.798448Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:02:31.798448Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"GPS-ABC: Gaussian Process Surrogate Approximate Bayesian Computation","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["q-bio.QM","stat.ML"],"primary_cat":"cs.LG","authors_text":"Edward Meeds, Max Welling","submitted_at":"2014-01-13T14:02:37Z","abstract_excerpt":"Scientists often express their understanding of the world through a computationally demanding simulation program. Analyzing the posterior distribution of the parameters given observations (the inverse problem) can be extremely challenging. The Approximate Bayesian Computation (ABC) framework is the standard statistical tool to handle these likelihood free problems, but they require a very large number of simulations. In this work we develop two new ABC sampling algorithms that significantly reduce the number of simulations necessary for posterior inference. Both algorithms use confidence estim"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1401.2838","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":""},"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":"1401.2838","created_at":"2026-05-18T03:02:31.798552+00:00"},{"alias_kind":"arxiv_version","alias_value":"1401.2838v1","created_at":"2026-05-18T03:02:31.798552+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1401.2838","created_at":"2026-05-18T03:02:31.798552+00:00"},{"alias_kind":"pith_short_12","alias_value":"F2VJM7N5O2YV","created_at":"2026-05-18T12:28:28.263976+00:00"},{"alias_kind":"pith_short_16","alias_value":"F2VJM7N5O2YVQVGR","created_at":"2026-05-18T12:28:28.263976+00:00"},{"alias_kind":"pith_short_8","alias_value":"F2VJM7N5","created_at":"2026-05-18T12:28:28.263976+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/F2VJM7N5O2YVQVGRN5DFNXNT2U","json":"https://pith.science/pith/F2VJM7N5O2YVQVGRN5DFNXNT2U.json","graph_json":"https://pith.science/api/pith-number/F2VJM7N5O2YVQVGRN5DFNXNT2U/graph.json","events_json":"https://pith.science/api/pith-number/F2VJM7N5O2YVQVGRN5DFNXNT2U/events.json","paper":"https://pith.science/paper/F2VJM7N5"},"agent_actions":{"view_html":"https://pith.science/pith/F2VJM7N5O2YVQVGRN5DFNXNT2U","download_json":"https://pith.science/pith/F2VJM7N5O2YVQVGRN5DFNXNT2U.json","view_paper":"https://pith.science/paper/F2VJM7N5","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1401.2838&json=true","fetch_graph":"https://pith.science/api/pith-number/F2VJM7N5O2YVQVGRN5DFNXNT2U/graph.json","fetch_events":"https://pith.science/api/pith-number/F2VJM7N5O2YVQVGRN5DFNXNT2U/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/F2VJM7N5O2YVQVGRN5DFNXNT2U/action/timestamp_anchor","attest_storage":"https://pith.science/pith/F2VJM7N5O2YVQVGRN5DFNXNT2U/action/storage_attestation","attest_author":"https://pith.science/pith/F2VJM7N5O2YVQVGRN5DFNXNT2U/action/author_attestation","sign_citation":"https://pith.science/pith/F2VJM7N5O2YVQVGRN5DFNXNT2U/action/citation_signature","submit_replication":"https://pith.science/pith/F2VJM7N5O2YVQVGRN5DFNXNT2U/action/replication_record"}},"created_at":"2026-05-18T03:02:31.798552+00:00","updated_at":"2026-05-18T03:02:31.798552+00:00"}