{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:VIMF6RIV4KTVIJ3OPTB6YJECEU","short_pith_number":"pith:VIMF6RIV","schema_version":"1.0","canonical_sha256":"aa185f4515e2a754276e7cc3ec2482251fe6078a5cc834a06d91a9c23e5eac95","source":{"kind":"arxiv","id":"1809.10756","version":2},"attestation_state":"computed","paper":{"title":"An Introduction to Probabilistic Programming","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI","cs.LG","cs.PL"],"primary_cat":"stat.ML","authors_text":"Brooks Paige, Frank Wood, Hongseok Yang, Jan-Willem van de Meent","submitted_at":"2018-09-27T20:44:23Z","abstract_excerpt":"This book is a graduate-level introduction to probabilistic programming. It not only provides a thorough background for anyone wishing to use a probabilistic programming system, but also introduces the techniques needed to design and build these systems. It is aimed at people who have an undergraduate-level understanding of either or, ideally, both probabilistic machine learning and programming languages.\n  We start with a discussion of model-based reasoning and explain why conditioning is a foundational computation central to the fields of probabilistic machine learning and artificial intelli"},"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":"1809.10756","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2018-09-27T20:44:23Z","cross_cats_sorted":["cs.AI","cs.LG","cs.PL"],"title_canon_sha256":"0c96f7a20c22c6bbb4918a58acb86356f5275e072eae0b9a300f566e82e4eb4c","abstract_canon_sha256":"1280ed7cf9c807ad28143cb23c8a41ed7bf9877717129637efcc23164d5ee78c"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T03:23:35.350702Z","signature_b64":"iqwHJYTt9z7ud6LPpfXXgAbblx5sENl/buny1wI8EL0zOkKjgOO49VrbTmXKSzqcjVwe0RL1LVJNEqcNB0IzBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"aa185f4515e2a754276e7cc3ec2482251fe6078a5cc834a06d91a9c23e5eac95","last_reissued_at":"2026-07-05T03:23:35.350222Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T03:23:35.350222Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"An Introduction to Probabilistic Programming","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI","cs.LG","cs.PL"],"primary_cat":"stat.ML","authors_text":"Brooks Paige, Frank Wood, Hongseok Yang, Jan-Willem van de Meent","submitted_at":"2018-09-27T20:44:23Z","abstract_excerpt":"This book is a graduate-level introduction to probabilistic programming. It not only provides a thorough background for anyone wishing to use a probabilistic programming system, but also introduces the techniques needed to design and build these systems. It is aimed at people who have an undergraduate-level understanding of either or, ideally, both probabilistic machine learning and programming languages.\n  We start with a discussion of model-based reasoning and explain why conditioning is a foundational computation central to the fields of probabilistic machine learning and artificial intelli"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1809.10756","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/1809.10756/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":"1809.10756","created_at":"2026-07-05T03:23:35.350278+00:00"},{"alias_kind":"arxiv_version","alias_value":"1809.10756v2","created_at":"2026-07-05T03:23:35.350278+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1809.10756","created_at":"2026-07-05T03:23:35.350278+00:00"},{"alias_kind":"pith_short_12","alias_value":"VIMF6RIV4KTV","created_at":"2026-07-05T03:23:35.350278+00:00"},{"alias_kind":"pith_short_16","alias_value":"VIMF6RIV4KTVIJ3O","created_at":"2026-07-05T03:23:35.350278+00:00"},{"alias_kind":"pith_short_8","alias_value":"VIMF6RIV","created_at":"2026-07-05T03:23:35.350278+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":6,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"1906.11199","citing_title":"Deployable probabilistic programming","ref_index":55,"is_internal_anchor":false},{"citing_arxiv_id":"2509.01082","citing_title":"RefineStat: Efficient Exploration for Probabilistic Program Synthesis","ref_index":53,"is_internal_anchor":false},{"citing_arxiv_id":"1912.11554","citing_title":"Composable Effects for Flexible and Accelerated Probabilistic Programming in NumPyro","ref_index":2,"is_internal_anchor":false},{"citing_arxiv_id":"2603.26215","citing_title":"SuperDP: Differential Privacy Refutation via Supermartingales","ref_index":61,"is_internal_anchor":false},{"citing_arxiv_id":"2605.07259","citing_title":"Evidence-Tracked Tape Semantics for Probabilistic Computation","ref_index":22,"is_internal_anchor":false},{"citing_arxiv_id":"2604.05246","citing_title":"A Gradual Probabilistic Lambda Calculus","ref_index":67,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/VIMF6RIV4KTVIJ3OPTB6YJECEU","json":"https://pith.science/pith/VIMF6RIV4KTVIJ3OPTB6YJECEU.json","graph_json":"https://pith.science/api/pith-number/VIMF6RIV4KTVIJ3OPTB6YJECEU/graph.json","events_json":"https://pith.science/api/pith-number/VIMF6RIV4KTVIJ3OPTB6YJECEU/events.json","paper":"https://pith.science/paper/VIMF6RIV"},"agent_actions":{"view_html":"https://pith.science/pith/VIMF6RIV4KTVIJ3OPTB6YJECEU","download_json":"https://pith.science/pith/VIMF6RIV4KTVIJ3OPTB6YJECEU.json","view_paper":"https://pith.science/paper/VIMF6RIV","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1809.10756&json=true","fetch_graph":"https://pith.science/api/pith-number/VIMF6RIV4KTVIJ3OPTB6YJECEU/graph.json","fetch_events":"https://pith.science/api/pith-number/VIMF6RIV4KTVIJ3OPTB6YJECEU/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/VIMF6RIV4KTVIJ3OPTB6YJECEU/action/timestamp_anchor","attest_storage":"https://pith.science/pith/VIMF6RIV4KTVIJ3OPTB6YJECEU/action/storage_attestation","attest_author":"https://pith.science/pith/VIMF6RIV4KTVIJ3OPTB6YJECEU/action/author_attestation","sign_citation":"https://pith.science/pith/VIMF6RIV4KTVIJ3OPTB6YJECEU/action/citation_signature","submit_replication":"https://pith.science/pith/VIMF6RIV4KTVIJ3OPTB6YJECEU/action/replication_record"}},"created_at":"2026-07-05T03:23:35.350278+00:00","updated_at":"2026-07-05T03:23:35.350278+00:00"}