{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2012:CKLUEFQB7BB4CMTQTDIXRD63RB","short_pith_number":"pith:CKLUEFQB","schema_version":"1.0","canonical_sha256":"1297421601f843c1327098d1788fdb885b3e428a3d598443d2ac600c1609027a","source":{"kind":"arxiv","id":"1206.3555","version":2},"attestation_state":"computed","paper":{"title":"A Dynamic Programming Algorithm for Inference in Recursive Probabilistic Programs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS"],"primary_cat":"cs.AI","authors_text":"Andreas Stuhlm\\\"uller, Noah D. Goodman","submitted_at":"2012-06-15T19:44:02Z","abstract_excerpt":"We describe a dynamic programming algorithm for computing the marginal distribution of discrete probabilistic programs. This algorithm takes a functional interpreter for an arbitrary probabilistic programming language and turns it into an efficient marginalizer. Because direct caching of sub-distributions is impossible in the presence of recursion, we build a graph of dependencies between sub-distributions. This factored sum-product network makes (potentially cyclic) dependencies between subproblems explicit, and corresponds to a system of equations for the marginal distribution. We solve thes"},"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":"1206.3555","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2012-06-15T19:44:02Z","cross_cats_sorted":["cs.DS"],"title_canon_sha256":"02f6266532d9adbb4a6eb7cab1817d872a1c5c64e556267062929224a45c473c","abstract_canon_sha256":"fb60e9fc6834d79ae8608a2b096f1876e431f8f9126556d4eba3fdb8eef4a378"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:45:52.885905Z","signature_b64":"RkEcMLO/mFS2CivV843JrJY6ZSMGfmR8f3Y9VQ6sxBT0snlfmKAYRlIeYvDmXvm1L8bVpNnT24VY/NeQwJQTDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"1297421601f843c1327098d1788fdb885b3e428a3d598443d2ac600c1609027a","last_reissued_at":"2026-05-18T03:45:52.885396Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:45:52.885396Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A Dynamic Programming Algorithm for Inference in Recursive Probabilistic Programs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS"],"primary_cat":"cs.AI","authors_text":"Andreas Stuhlm\\\"uller, Noah D. Goodman","submitted_at":"2012-06-15T19:44:02Z","abstract_excerpt":"We describe a dynamic programming algorithm for computing the marginal distribution of discrete probabilistic programs. This algorithm takes a functional interpreter for an arbitrary probabilistic programming language and turns it into an efficient marginalizer. Because direct caching of sub-distributions is impossible in the presence of recursion, we build a graph of dependencies between sub-distributions. This factored sum-product network makes (potentially cyclic) dependencies between subproblems explicit, and corresponds to a system of equations for the marginal distribution. We solve thes"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1206.3555","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":""},"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":"1206.3555","created_at":"2026-05-18T03:45:52.885463+00:00"},{"alias_kind":"arxiv_version","alias_value":"1206.3555v2","created_at":"2026-05-18T03:45:52.885463+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1206.3555","created_at":"2026-05-18T03:45:52.885463+00:00"},{"alias_kind":"pith_short_12","alias_value":"CKLUEFQB7BB4","created_at":"2026-05-18T12:27:01.376967+00:00"},{"alias_kind":"pith_short_16","alias_value":"CKLUEFQB7BB4CMTQ","created_at":"2026-05-18T12:27:01.376967+00:00"},{"alias_kind":"pith_short_8","alias_value":"CKLUEFQB","created_at":"2026-05-18T12:27:01.376967+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/CKLUEFQB7BB4CMTQTDIXRD63RB","json":"https://pith.science/pith/CKLUEFQB7BB4CMTQTDIXRD63RB.json","graph_json":"https://pith.science/api/pith-number/CKLUEFQB7BB4CMTQTDIXRD63RB/graph.json","events_json":"https://pith.science/api/pith-number/CKLUEFQB7BB4CMTQTDIXRD63RB/events.json","paper":"https://pith.science/paper/CKLUEFQB"},"agent_actions":{"view_html":"https://pith.science/pith/CKLUEFQB7BB4CMTQTDIXRD63RB","download_json":"https://pith.science/pith/CKLUEFQB7BB4CMTQTDIXRD63RB.json","view_paper":"https://pith.science/paper/CKLUEFQB","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1206.3555&json=true","fetch_graph":"https://pith.science/api/pith-number/CKLUEFQB7BB4CMTQTDIXRD63RB/graph.json","fetch_events":"https://pith.science/api/pith-number/CKLUEFQB7BB4CMTQTDIXRD63RB/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/CKLUEFQB7BB4CMTQTDIXRD63RB/action/timestamp_anchor","attest_storage":"https://pith.science/pith/CKLUEFQB7BB4CMTQTDIXRD63RB/action/storage_attestation","attest_author":"https://pith.science/pith/CKLUEFQB7BB4CMTQTDIXRD63RB/action/author_attestation","sign_citation":"https://pith.science/pith/CKLUEFQB7BB4CMTQTDIXRD63RB/action/citation_signature","submit_replication":"https://pith.science/pith/CKLUEFQB7BB4CMTQTDIXRD63RB/action/replication_record"}},"created_at":"2026-05-18T03:45:52.885463+00:00","updated_at":"2026-05-18T03:45:52.885463+00:00"}