{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:ADAIKR3EZHHR34STBOQ4J3UTUF","short_pith_number":"pith:ADAIKR3E","schema_version":"1.0","canonical_sha256":"00c0854764c9cf1df2530ba1c4ee93a16582a8dbb95e9a5aa7d6f847dbba31e8","source":{"kind":"arxiv","id":"1610.05735","version":1},"attestation_state":"computed","paper":{"title":"Deep Amortized Inference for Probabilistic Programs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG","stat.ML"],"primary_cat":"cs.AI","authors_text":"Daniel Ritchie, Noah D. Goodman, Paul Horsfall","submitted_at":"2016-10-18T18:35:09Z","abstract_excerpt":"Probabilistic programming languages (PPLs) are a powerful modeling tool, able to represent any computable probability distribution. Unfortunately, probabilistic program inference is often intractable, and existing PPLs mostly rely on expensive, approximate sampling-based methods. To alleviate this problem, one could try to learn from past inferences, so that future inferences run faster. This strategy is known as amortized inference; it has recently been applied to Bayesian networks and deep generative models. This paper proposes a system for amortized inference in PPLs. In our system, amortiz"},"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":"1610.05735","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2016-10-18T18:35:09Z","cross_cats_sorted":["cs.LG","stat.ML"],"title_canon_sha256":"1b73861a93fb5bf786c87614ead975a70e188cbe8d88f37f9116d6ff2bf58cf4","abstract_canon_sha256":"379c383730e3923a84091279dd6dcd58b51c63ca4fcf8eebeff2aa66f9328b4d"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:01:58.499517Z","signature_b64":"aDXbbFTZWRe2m+D61p4KGWM16GD7UxvWmalTRinH1AfIs4PFIqo8M/Eiyq2mwS4Q2EMsmsbSHPyzz+oXcEJnBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"00c0854764c9cf1df2530ba1c4ee93a16582a8dbb95e9a5aa7d6f847dbba31e8","last_reissued_at":"2026-05-18T01:01:58.498947Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:01:58.498947Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Deep Amortized Inference for Probabilistic Programs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG","stat.ML"],"primary_cat":"cs.AI","authors_text":"Daniel Ritchie, Noah D. Goodman, Paul Horsfall","submitted_at":"2016-10-18T18:35:09Z","abstract_excerpt":"Probabilistic programming languages (PPLs) are a powerful modeling tool, able to represent any computable probability distribution. Unfortunately, probabilistic program inference is often intractable, and existing PPLs mostly rely on expensive, approximate sampling-based methods. To alleviate this problem, one could try to learn from past inferences, so that future inferences run faster. This strategy is known as amortized inference; it has recently been applied to Bayesian networks and deep generative models. This paper proposes a system for amortized inference in PPLs. In our system, amortiz"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1610.05735","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":"1610.05735","created_at":"2026-05-18T01:01:58.499046+00:00"},{"alias_kind":"arxiv_version","alias_value":"1610.05735v1","created_at":"2026-05-18T01:01:58.499046+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1610.05735","created_at":"2026-05-18T01:01:58.499046+00:00"},{"alias_kind":"pith_short_12","alias_value":"ADAIKR3EZHHR","created_at":"2026-05-18T12:30:07.202191+00:00"},{"alias_kind":"pith_short_16","alias_value":"ADAIKR3EZHHR34ST","created_at":"2026-05-18T12:30:07.202191+00:00"},{"alias_kind":"pith_short_8","alias_value":"ADAIKR3E","created_at":"2026-05-18T12:30:07.202191+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/ADAIKR3EZHHR34STBOQ4J3UTUF","json":"https://pith.science/pith/ADAIKR3EZHHR34STBOQ4J3UTUF.json","graph_json":"https://pith.science/api/pith-number/ADAIKR3EZHHR34STBOQ4J3UTUF/graph.json","events_json":"https://pith.science/api/pith-number/ADAIKR3EZHHR34STBOQ4J3UTUF/events.json","paper":"https://pith.science/paper/ADAIKR3E"},"agent_actions":{"view_html":"https://pith.science/pith/ADAIKR3EZHHR34STBOQ4J3UTUF","download_json":"https://pith.science/pith/ADAIKR3EZHHR34STBOQ4J3UTUF.json","view_paper":"https://pith.science/paper/ADAIKR3E","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1610.05735&json=true","fetch_graph":"https://pith.science/api/pith-number/ADAIKR3EZHHR34STBOQ4J3UTUF/graph.json","fetch_events":"https://pith.science/api/pith-number/ADAIKR3EZHHR34STBOQ4J3UTUF/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/ADAIKR3EZHHR34STBOQ4J3UTUF/action/timestamp_anchor","attest_storage":"https://pith.science/pith/ADAIKR3EZHHR34STBOQ4J3UTUF/action/storage_attestation","attest_author":"https://pith.science/pith/ADAIKR3EZHHR34STBOQ4J3UTUF/action/author_attestation","sign_citation":"https://pith.science/pith/ADAIKR3EZHHR34STBOQ4J3UTUF/action/citation_signature","submit_replication":"https://pith.science/pith/ADAIKR3EZHHR34STBOQ4J3UTUF/action/replication_record"}},"created_at":"2026-05-18T01:01:58.499046+00:00","updated_at":"2026-05-18T01:01:58.499046+00:00"}