{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2019:3OG22FTGHKN22TDCKGP5EQO4XF","short_pith_number":"pith:3OG22FTG","schema_version":"1.0","canonical_sha256":"db8dad16663a9bad4c62519fd241dcb972db9ae27e47c851764a7f8263cd1083","source":{"kind":"arxiv","id":"1903.10860","version":1},"attestation_state":"computed","paper":{"title":"Accelerated Bayesian inference using deep learning","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["astro-ph.IM"],"primary_cat":"astro-ph.CO","authors_text":"Adam Moss","submitted_at":"2019-03-26T13:25:50Z","abstract_excerpt":"We present a novel Bayesian inference tool that uses a neural network to parameterise efficient Markov Chain Monte-Carlo (MCMC) proposals. The target distribution is first transformed into a diagonal, unit variance Gaussian by a series of non-linear, invertible, and non-volume preserving flows. Neural networks are extremely expressive, and can transform complex targets to a simple latent representation. Efficient proposals can then be made in this space, and we demonstrate a high degree of mixing on several challenging distributions. Parameter space can naturally be split into a block diagonal"},"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":"1903.10860","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"astro-ph.CO","submitted_at":"2019-03-26T13:25:50Z","cross_cats_sorted":["astro-ph.IM"],"title_canon_sha256":"1d26192cdffa7ffbee51e8ee90f8541ed1e93cfddad028b271a4e0b21df8e53d","abstract_canon_sha256":"5a73e90ccf2d3706c960a675e35facdbbc02ccb5ce887b8c040d79e942f9539e"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T01:07:24.748820Z","signature_b64":"fYeRWfFWKc5176ayflsHbdhKJ/UyAumtd+hFo130vOLri/tDDy/mkz4Y3j9njgjHNUVkdEFEbHa1rZllT1ZuDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"db8dad16663a9bad4c62519fd241dcb972db9ae27e47c851764a7f8263cd1083","last_reissued_at":"2026-07-05T01:07:24.748265Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T01:07:24.748265Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Accelerated Bayesian inference using deep learning","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["astro-ph.IM"],"primary_cat":"astro-ph.CO","authors_text":"Adam Moss","submitted_at":"2019-03-26T13:25:50Z","abstract_excerpt":"We present a novel Bayesian inference tool that uses a neural network to parameterise efficient Markov Chain Monte-Carlo (MCMC) proposals. The target distribution is first transformed into a diagonal, unit variance Gaussian by a series of non-linear, invertible, and non-volume preserving flows. Neural networks are extremely expressive, and can transform complex targets to a simple latent representation. Efficient proposals can then be made in this space, and we demonstrate a high degree of mixing on several challenging distributions. Parameter space can naturally be split into a block diagonal"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1903.10860","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/1903.10860/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":"1903.10860","created_at":"2026-07-05T01:07:24.748336+00:00"},{"alias_kind":"arxiv_version","alias_value":"1903.10860v1","created_at":"2026-07-05T01:07:24.748336+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1903.10860","created_at":"2026-07-05T01:07:24.748336+00:00"},{"alias_kind":"pith_short_12","alias_value":"3OG22FTGHKN2","created_at":"2026-07-05T01:07:24.748336+00:00"},{"alias_kind":"pith_short_16","alias_value":"3OG22FTGHKN22TDC","created_at":"2026-07-05T01:07:24.748336+00:00"},{"alias_kind":"pith_short_8","alias_value":"3OG22FTG","created_at":"2026-07-05T01:07:24.748336+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"1909.02488","citing_title":"Quantum tunnelling, real-time dynamics and Picard-Lefschetz thimbles","ref_index":55,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/3OG22FTGHKN22TDCKGP5EQO4XF","json":"https://pith.science/pith/3OG22FTGHKN22TDCKGP5EQO4XF.json","graph_json":"https://pith.science/api/pith-number/3OG22FTGHKN22TDCKGP5EQO4XF/graph.json","events_json":"https://pith.science/api/pith-number/3OG22FTGHKN22TDCKGP5EQO4XF/events.json","paper":"https://pith.science/paper/3OG22FTG"},"agent_actions":{"view_html":"https://pith.science/pith/3OG22FTGHKN22TDCKGP5EQO4XF","download_json":"https://pith.science/pith/3OG22FTGHKN22TDCKGP5EQO4XF.json","view_paper":"https://pith.science/paper/3OG22FTG","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1903.10860&json=true","fetch_graph":"https://pith.science/api/pith-number/3OG22FTGHKN22TDCKGP5EQO4XF/graph.json","fetch_events":"https://pith.science/api/pith-number/3OG22FTGHKN22TDCKGP5EQO4XF/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/3OG22FTGHKN22TDCKGP5EQO4XF/action/timestamp_anchor","attest_storage":"https://pith.science/pith/3OG22FTGHKN22TDCKGP5EQO4XF/action/storage_attestation","attest_author":"https://pith.science/pith/3OG22FTGHKN22TDCKGP5EQO4XF/action/author_attestation","sign_citation":"https://pith.science/pith/3OG22FTGHKN22TDCKGP5EQO4XF/action/citation_signature","submit_replication":"https://pith.science/pith/3OG22FTGHKN22TDCKGP5EQO4XF/action/replication_record"}},"created_at":"2026-07-05T01:07:24.748336+00:00","updated_at":"2026-07-05T01:07:24.748336+00:00"}