{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2022:KAYVYRDKYECMXSS6PRUMKAMULH","short_pith_number":"pith:KAYVYRDK","schema_version":"1.0","canonical_sha256":"50315c446ac104cbca5e7c68c5019459e07192c81ca15ae5d9eaaf9975d0f7f7","source":{"kind":"arxiv","id":"2211.02045","version":2},"attestation_state":"computed","paper":{"title":"Fast and robust Bayesian Inference using Gaussian Processes with GPry","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["astro-ph.IM","stat.ME","stat.ML"],"primary_cat":"astro-ph.CO","authors_text":"Christian Fidler, Jes\\'us Torrado, Jonas El Gammal, Nils Sch\\\"oneberg","submitted_at":"2022-11-03T17:57:45Z","abstract_excerpt":"We present the GPry algorithm for fast Bayesian inference of general (non-Gaussian) posteriors with a moderate number of parameters. GPry does not need any pre-training, special hardware such as GPUs, and is intended as a drop-in replacement for traditional Monte Carlo methods for Bayesian inference. Our algorithm is based on generating a Gaussian Process surrogate model of the log-posterior, aided by a Support Vector Machine classifier that excludes extreme or non-finite values. An active learning scheme allows us to reduce the number of required posterior evaluations by two orders of magnitu"},"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":"2211.02045","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"astro-ph.CO","submitted_at":"2022-11-03T17:57:45Z","cross_cats_sorted":["astro-ph.IM","stat.ME","stat.ML"],"title_canon_sha256":"cafca512b92ed7c841b0b8175c9712e58d9c77fdb3652662279f1c373d3500d7","abstract_canon_sha256":"074fc3387046a7f2bce6de28f65f5e782f07f6718e64b3545630251f8426c024"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T10:37:19.469893Z","signature_b64":"Zppxt9fhZlTx14ylT45REYN8TT8RKzHl2ky2bPwlJSylWFE85sljgAJFCr0iSL9e4EA1Mk/upPN8wOFhk4MSBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"50315c446ac104cbca5e7c68c5019459e07192c81ca15ae5d9eaaf9975d0f7f7","last_reissued_at":"2026-07-05T10:37:19.469167Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T10:37:19.469167Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Fast and robust Bayesian Inference using Gaussian Processes with GPry","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["astro-ph.IM","stat.ME","stat.ML"],"primary_cat":"astro-ph.CO","authors_text":"Christian Fidler, Jes\\'us Torrado, Jonas El Gammal, Nils Sch\\\"oneberg","submitted_at":"2022-11-03T17:57:45Z","abstract_excerpt":"We present the GPry algorithm for fast Bayesian inference of general (non-Gaussian) posteriors with a moderate number of parameters. GPry does not need any pre-training, special hardware such as GPUs, and is intended as a drop-in replacement for traditional Monte Carlo methods for Bayesian inference. Our algorithm is based on generating a Gaussian Process surrogate model of the log-posterior, aided by a Support Vector Machine classifier that excludes extreme or non-finite values. An active learning scheme allows us to reduce the number of required posterior evaluations by two orders of magnitu"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2211.02045","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2211.02045/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":"2211.02045","created_at":"2026-07-05T10:37:19.469254+00:00"},{"alias_kind":"arxiv_version","alias_value":"2211.02045v2","created_at":"2026-07-05T10:37:19.469254+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2211.02045","created_at":"2026-07-05T10:37:19.469254+00:00"},{"alias_kind":"pith_short_12","alias_value":"KAYVYRDKYECM","created_at":"2026-07-05T10:37:19.469254+00:00"},{"alias_kind":"pith_short_16","alias_value":"KAYVYRDKYECMXSS6","created_at":"2026-07-05T10:37:19.469254+00:00"},{"alias_kind":"pith_short_8","alias_value":"KAYVYRDK","created_at":"2026-07-05T10:37:19.469254+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2606.04895","citing_title":"Posterior sampling in the Age of Emulators","ref_index":9,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/KAYVYRDKYECMXSS6PRUMKAMULH","json":"https://pith.science/pith/KAYVYRDKYECMXSS6PRUMKAMULH.json","graph_json":"https://pith.science/api/pith-number/KAYVYRDKYECMXSS6PRUMKAMULH/graph.json","events_json":"https://pith.science/api/pith-number/KAYVYRDKYECMXSS6PRUMKAMULH/events.json","paper":"https://pith.science/paper/KAYVYRDK"},"agent_actions":{"view_html":"https://pith.science/pith/KAYVYRDKYECMXSS6PRUMKAMULH","download_json":"https://pith.science/pith/KAYVYRDKYECMXSS6PRUMKAMULH.json","view_paper":"https://pith.science/paper/KAYVYRDK","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2211.02045&json=true","fetch_graph":"https://pith.science/api/pith-number/KAYVYRDKYECMXSS6PRUMKAMULH/graph.json","fetch_events":"https://pith.science/api/pith-number/KAYVYRDKYECMXSS6PRUMKAMULH/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/KAYVYRDKYECMXSS6PRUMKAMULH/action/timestamp_anchor","attest_storage":"https://pith.science/pith/KAYVYRDKYECMXSS6PRUMKAMULH/action/storage_attestation","attest_author":"https://pith.science/pith/KAYVYRDKYECMXSS6PRUMKAMULH/action/author_attestation","sign_citation":"https://pith.science/pith/KAYVYRDKYECMXSS6PRUMKAMULH/action/citation_signature","submit_replication":"https://pith.science/pith/KAYVYRDKYECMXSS6PRUMKAMULH/action/replication_record"}},"created_at":"2026-07-05T10:37:19.469254+00:00","updated_at":"2026-07-05T10:37:19.469254+00:00"}