{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2019:7OUVFTYITPAAAFUMSNIVOFYVW7","short_pith_number":"pith:7OUVFTYI","schema_version":"1.0","canonical_sha256":"fba952cf089bc000168c9351571715b7e28b8fd9695a36ad1ce64faa994385c9","source":{"kind":"arxiv","id":"1909.05076","version":1},"attestation_state":"computed","paper":{"title":"Static Analysis for Probabilistic Programs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG","stat.ML"],"primary_cat":"cs.PL","authors_text":"Ryan Bernstein","submitted_at":"2019-09-10T15:34:10Z","abstract_excerpt":"Probabilistic programming is a powerful abstraction for statistical machine learning. Applying static analysis methods to probabilistic programs could serve to optimize the learning process, automatically verify properties of models, and improve the programming interface for users. This field of static analysis for probabilistic programming (SAPP) is young and unorganized, consisting of a constellation of techniques with various goals and limitations. The primary aim of this work is to synthesize the major contributions of the SAPP field within an organizing structure and context. We provide t"},"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":"1909.05076","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.PL","submitted_at":"2019-09-10T15:34:10Z","cross_cats_sorted":["cs.LG","stat.ML"],"title_canon_sha256":"208fdd7c0e8d8a8024e7a5b450c311f6b5dfea795af97e4fe7a83d27f6ae845a","abstract_canon_sha256":"45b6ce568e150b71be88740ab09061b83c8ed38b4ea179b78813507102c66d6e"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T00:04:02.813972Z","signature_b64":"V4t2jmuUdfz4EQDplxwZoO4uve/FnU0OFrLuXo5cIUKv/SUguSK1JPgHSzE8PmIJUUFaoJpr9ipH0Wk5q4oNBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"fba952cf089bc000168c9351571715b7e28b8fd9695a36ad1ce64faa994385c9","last_reissued_at":"2026-07-05T00:04:02.813571Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T00:04:02.813571Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Static Analysis for Probabilistic Programs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG","stat.ML"],"primary_cat":"cs.PL","authors_text":"Ryan Bernstein","submitted_at":"2019-09-10T15:34:10Z","abstract_excerpt":"Probabilistic programming is a powerful abstraction for statistical machine learning. Applying static analysis methods to probabilistic programs could serve to optimize the learning process, automatically verify properties of models, and improve the programming interface for users. This field of static analysis for probabilistic programming (SAPP) is young and unorganized, consisting of a constellation of techniques with various goals and limitations. The primary aim of this work is to synthesize the major contributions of the SAPP field within an organizing structure and context. We provide t"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1909.05076","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/1909.05076/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":"1909.05076","created_at":"2026-07-05T00:04:02.813630+00:00"},{"alias_kind":"arxiv_version","alias_value":"1909.05076v1","created_at":"2026-07-05T00:04:02.813630+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1909.05076","created_at":"2026-07-05T00:04:02.813630+00:00"},{"alias_kind":"pith_short_12","alias_value":"7OUVFTYITPAA","created_at":"2026-07-05T00:04:02.813630+00:00"},{"alias_kind":"pith_short_16","alias_value":"7OUVFTYITPAAAFUM","created_at":"2026-07-05T00:04:02.813630+00:00"},{"alias_kind":"pith_short_8","alias_value":"7OUVFTYI","created_at":"2026-07-05T00:04:02.813630+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2508.20922","citing_title":"Static Factorisation of Probabilistic Programs With User-Labelled Sample Statements and While Loops","ref_index":3,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/7OUVFTYITPAAAFUMSNIVOFYVW7","json":"https://pith.science/pith/7OUVFTYITPAAAFUMSNIVOFYVW7.json","graph_json":"https://pith.science/api/pith-number/7OUVFTYITPAAAFUMSNIVOFYVW7/graph.json","events_json":"https://pith.science/api/pith-number/7OUVFTYITPAAAFUMSNIVOFYVW7/events.json","paper":"https://pith.science/paper/7OUVFTYI"},"agent_actions":{"view_html":"https://pith.science/pith/7OUVFTYITPAAAFUMSNIVOFYVW7","download_json":"https://pith.science/pith/7OUVFTYITPAAAFUMSNIVOFYVW7.json","view_paper":"https://pith.science/paper/7OUVFTYI","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1909.05076&json=true","fetch_graph":"https://pith.science/api/pith-number/7OUVFTYITPAAAFUMSNIVOFYVW7/graph.json","fetch_events":"https://pith.science/api/pith-number/7OUVFTYITPAAAFUMSNIVOFYVW7/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/7OUVFTYITPAAAFUMSNIVOFYVW7/action/timestamp_anchor","attest_storage":"https://pith.science/pith/7OUVFTYITPAAAFUMSNIVOFYVW7/action/storage_attestation","attest_author":"https://pith.science/pith/7OUVFTYITPAAAFUMSNIVOFYVW7/action/author_attestation","sign_citation":"https://pith.science/pith/7OUVFTYITPAAAFUMSNIVOFYVW7/action/citation_signature","submit_replication":"https://pith.science/pith/7OUVFTYITPAAAFUMSNIVOFYVW7/action/replication_record"}},"created_at":"2026-07-05T00:04:02.813630+00:00","updated_at":"2026-07-05T00:04:02.813630+00:00"}