{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:KYXU7DH436YT4VBNSEIPY4SOVH","short_pith_number":"pith:KYXU7DH4","schema_version":"1.0","canonical_sha256":"562f4f8cfcdfb13e542d9110fc724ea9d0daede305245ae0f91dad5ff8801468","source":{"kind":"arxiv","id":"1604.04729","version":1},"attestation_state":"computed","paper":{"title":"SIMPL: A DSL for Automatic Specialization of Inference Algorithms","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.PL","authors_text":"Emina Torlak, Rastislav Bodik, Rohin Shah","submitted_at":"2016-04-16T11:45:03Z","abstract_excerpt":"Inference algorithms in probabilistic programming languages (PPLs) can be thought of as interpreters, since an inference algorithm traverses a model given evidence to answer a query. As with interpreters, we can improve the efficiency of inference algorithms by compiling them once the model, evidence and query are known. We present SIMPL, a domain specific language for inference algorithms, which uses this idea in order to automatically specialize annotated inference algorithms. Due to the approach of specialization, unlike a traditional compiler, with SIMPL new inference algorithms can be add"},"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":"1604.04729","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.PL","submitted_at":"2016-04-16T11:45:03Z","cross_cats_sorted":[],"title_canon_sha256":"ea4a6ed6c8fead3845324155afeb8548fb43e9f6ef879a3cf5ec30a05de8a926","abstract_canon_sha256":"f072be1de6e90d40fa77863c6ccb3431167a604593e0053605bf99e6bfb444d5"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:16:58.800236Z","signature_b64":"PqeoBlAjWLbdIu/EH6u0zIRwFYmfMEvxqT4aWDCpLyQQnlPp/JLOmgO2O8DlYDguaB6pub/CXgeHcmI/V4/sBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"562f4f8cfcdfb13e542d9110fc724ea9d0daede305245ae0f91dad5ff8801468","last_reissued_at":"2026-05-18T01:16:58.799556Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:16:58.799556Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"SIMPL: A DSL for Automatic Specialization of Inference Algorithms","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.PL","authors_text":"Emina Torlak, Rastislav Bodik, Rohin Shah","submitted_at":"2016-04-16T11:45:03Z","abstract_excerpt":"Inference algorithms in probabilistic programming languages (PPLs) can be thought of as interpreters, since an inference algorithm traverses a model given evidence to answer a query. As with interpreters, we can improve the efficiency of inference algorithms by compiling them once the model, evidence and query are known. We present SIMPL, a domain specific language for inference algorithms, which uses this idea in order to automatically specialize annotated inference algorithms. Due to the approach of specialization, unlike a traditional compiler, with SIMPL new inference algorithms can be add"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1604.04729","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":"1604.04729","created_at":"2026-05-18T01:16:58.799656+00:00"},{"alias_kind":"arxiv_version","alias_value":"1604.04729v1","created_at":"2026-05-18T01:16:58.799656+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1604.04729","created_at":"2026-05-18T01:16:58.799656+00:00"},{"alias_kind":"pith_short_12","alias_value":"KYXU7DH436YT","created_at":"2026-05-18T12:30:29.479603+00:00"},{"alias_kind":"pith_short_16","alias_value":"KYXU7DH436YT4VBN","created_at":"2026-05-18T12:30:29.479603+00:00"},{"alias_kind":"pith_short_8","alias_value":"KYXU7DH4","created_at":"2026-05-18T12:30:29.479603+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/KYXU7DH436YT4VBNSEIPY4SOVH","json":"https://pith.science/pith/KYXU7DH436YT4VBNSEIPY4SOVH.json","graph_json":"https://pith.science/api/pith-number/KYXU7DH436YT4VBNSEIPY4SOVH/graph.json","events_json":"https://pith.science/api/pith-number/KYXU7DH436YT4VBNSEIPY4SOVH/events.json","paper":"https://pith.science/paper/KYXU7DH4"},"agent_actions":{"view_html":"https://pith.science/pith/KYXU7DH436YT4VBNSEIPY4SOVH","download_json":"https://pith.science/pith/KYXU7DH436YT4VBNSEIPY4SOVH.json","view_paper":"https://pith.science/paper/KYXU7DH4","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1604.04729&json=true","fetch_graph":"https://pith.science/api/pith-number/KYXU7DH436YT4VBNSEIPY4SOVH/graph.json","fetch_events":"https://pith.science/api/pith-number/KYXU7DH436YT4VBNSEIPY4SOVH/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/KYXU7DH436YT4VBNSEIPY4SOVH/action/timestamp_anchor","attest_storage":"https://pith.science/pith/KYXU7DH436YT4VBNSEIPY4SOVH/action/storage_attestation","attest_author":"https://pith.science/pith/KYXU7DH436YT4VBNSEIPY4SOVH/action/author_attestation","sign_citation":"https://pith.science/pith/KYXU7DH436YT4VBNSEIPY4SOVH/action/citation_signature","submit_replication":"https://pith.science/pith/KYXU7DH436YT4VBNSEIPY4SOVH/action/replication_record"}},"created_at":"2026-05-18T01:16:58.799656+00:00","updated_at":"2026-05-18T01:16:58.799656+00:00"}