{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:LKAZKA5FV63IDEKDXS5QCAJWZ7","short_pith_number":"pith:LKAZKA5F","schema_version":"1.0","canonical_sha256":"5a819503a5afb6819143bcbb010136cfc5bf52105278148866196b4037d8940d","source":{"kind":"arxiv","id":"1606.09242","version":1},"attestation_state":"computed","paper":{"title":"Swift: Compiled Inference for Probabilistic Programming Languages","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.PL"],"primary_cat":"cs.AI","authors_text":"Lei Li, Rastislav Bodik, Stuart Russell, Yi Wu","submitted_at":"2016-06-30T08:30:54Z","abstract_excerpt":"A probabilistic program defines a probability measure over its semantic structures. One common goal of probabilistic programming languages (PPLs) is to compute posterior probabilities for arbitrary models and queries, given observed evidence, using a generic inference engine. Most PPL inference engines---even the compiled ones---incur significant runtime interpretation overhead, especially for contingent and open-universe models. This paper describes Swift, a compiler for the BLOG PPL. Swift-generated code incorporates optimizations that eliminate interpretation overhead, maintain dynamic depe"},"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":"1606.09242","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2016-06-30T08:30:54Z","cross_cats_sorted":["cs.PL"],"title_canon_sha256":"75d63e00be803d276cee328e7f96b018c7760bb2bcaeab1d7b4a0ac3ee647e95","abstract_canon_sha256":"75c2a35c2539d7c59fe0859b66988d11dabdecbef95a0bbce97c69d568164a16"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:11:40.760290Z","signature_b64":"F+YIlZLa4Jk0ICL2CivaV4vSEO+91sX3m29xrHFEq86wKhvQpPecG4yS7ezAMxxFkd9Gsy6aDeZdTkb5rPVQAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"5a819503a5afb6819143bcbb010136cfc5bf52105278148866196b4037d8940d","last_reissued_at":"2026-05-18T01:11:40.759880Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:11:40.759880Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Swift: Compiled Inference for Probabilistic Programming Languages","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.PL"],"primary_cat":"cs.AI","authors_text":"Lei Li, Rastislav Bodik, Stuart Russell, Yi Wu","submitted_at":"2016-06-30T08:30:54Z","abstract_excerpt":"A probabilistic program defines a probability measure over its semantic structures. One common goal of probabilistic programming languages (PPLs) is to compute posterior probabilities for arbitrary models and queries, given observed evidence, using a generic inference engine. Most PPL inference engines---even the compiled ones---incur significant runtime interpretation overhead, especially for contingent and open-universe models. This paper describes Swift, a compiler for the BLOG PPL. Swift-generated code incorporates optimizations that eliminate interpretation overhead, maintain dynamic depe"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1606.09242","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":"1606.09242","created_at":"2026-05-18T01:11:40.759950+00:00"},{"alias_kind":"arxiv_version","alias_value":"1606.09242v1","created_at":"2026-05-18T01:11:40.759950+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1606.09242","created_at":"2026-05-18T01:11:40.759950+00:00"},{"alias_kind":"pith_short_12","alias_value":"LKAZKA5FV63I","created_at":"2026-05-18T12:30:29.479603+00:00"},{"alias_kind":"pith_short_16","alias_value":"LKAZKA5FV63IDEKD","created_at":"2026-05-18T12:30:29.479603+00:00"},{"alias_kind":"pith_short_8","alias_value":"LKAZKA5F","created_at":"2026-05-18T12:30:29.479603+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"1907.05451","citing_title":"Compositional Inference Metaprogramming with Convergence Guarantees","ref_index":29,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/LKAZKA5FV63IDEKDXS5QCAJWZ7","json":"https://pith.science/pith/LKAZKA5FV63IDEKDXS5QCAJWZ7.json","graph_json":"https://pith.science/api/pith-number/LKAZKA5FV63IDEKDXS5QCAJWZ7/graph.json","events_json":"https://pith.science/api/pith-number/LKAZKA5FV63IDEKDXS5QCAJWZ7/events.json","paper":"https://pith.science/paper/LKAZKA5F"},"agent_actions":{"view_html":"https://pith.science/pith/LKAZKA5FV63IDEKDXS5QCAJWZ7","download_json":"https://pith.science/pith/LKAZKA5FV63IDEKDXS5QCAJWZ7.json","view_paper":"https://pith.science/paper/LKAZKA5F","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1606.09242&json=true","fetch_graph":"https://pith.science/api/pith-number/LKAZKA5FV63IDEKDXS5QCAJWZ7/graph.json","fetch_events":"https://pith.science/api/pith-number/LKAZKA5FV63IDEKDXS5QCAJWZ7/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/LKAZKA5FV63IDEKDXS5QCAJWZ7/action/timestamp_anchor","attest_storage":"https://pith.science/pith/LKAZKA5FV63IDEKDXS5QCAJWZ7/action/storage_attestation","attest_author":"https://pith.science/pith/LKAZKA5FV63IDEKDXS5QCAJWZ7/action/author_attestation","sign_citation":"https://pith.science/pith/LKAZKA5FV63IDEKDXS5QCAJWZ7/action/citation_signature","submit_replication":"https://pith.science/pith/LKAZKA5FV63IDEKDXS5QCAJWZ7/action/replication_record"}},"created_at":"2026-05-18T01:11:40.759950+00:00","updated_at":"2026-05-18T01:11:40.759950+00:00"}