{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2012:CKLUEFQB7BB4CMTQTDIXRD63RB","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"fb60e9fc6834d79ae8608a2b096f1876e431f8f9126556d4eba3fdb8eef4a378","cross_cats_sorted":["cs.DS"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2012-06-15T19:44:02Z","title_canon_sha256":"02f6266532d9adbb4a6eb7cab1817d872a1c5c64e556267062929224a45c473c"},"schema_version":"1.0","source":{"id":"1206.3555","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1206.3555","created_at":"2026-05-18T03:45:52Z"},{"alias_kind":"arxiv_version","alias_value":"1206.3555v2","created_at":"2026-05-18T03:45:52Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1206.3555","created_at":"2026-05-18T03:45:52Z"},{"alias_kind":"pith_short_12","alias_value":"CKLUEFQB7BB4","created_at":"2026-05-18T12:27:01Z"},{"alias_kind":"pith_short_16","alias_value":"CKLUEFQB7BB4CMTQ","created_at":"2026-05-18T12:27:01Z"},{"alias_kind":"pith_short_8","alias_value":"CKLUEFQB","created_at":"2026-05-18T12:27:01Z"}],"graph_snapshots":[{"event_id":"sha256:90b8f56bd3534b0b0022e5a390a48f46485c5f20b8e26a312e3637d126fc8acf","target":"graph","created_at":"2026-05-18T03:45:52Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"paper":{"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","authors_text":"Andreas Stuhlm\\\"uller, Noah D. Goodman","cross_cats":["cs.DS"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2012-06-15T19:44:02Z","title":"A Dynamic Programming Algorithm for Inference in Recursive Probabilistic Programs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1206.3555","kind":"arxiv","version":2},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:477fc847a1246f48cefbfd1f420ed3dfb70152fd610adf4cc3fe73482e5ff128","target":"record","created_at":"2026-05-18T03:45:52Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"fb60e9fc6834d79ae8608a2b096f1876e431f8f9126556d4eba3fdb8eef4a378","cross_cats_sorted":["cs.DS"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2012-06-15T19:44:02Z","title_canon_sha256":"02f6266532d9adbb4a6eb7cab1817d872a1c5c64e556267062929224a45c473c"},"schema_version":"1.0","source":{"id":"1206.3555","kind":"arxiv","version":2}},"canonical_sha256":"1297421601f843c1327098d1788fdb885b3e428a3d598443d2ac600c1609027a","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"1297421601f843c1327098d1788fdb885b3e428a3d598443d2ac600c1609027a","first_computed_at":"2026-05-18T03:45:52.885396Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:45:52.885396Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"RkEcMLO/mFS2CivV843JrJY6ZSMGfmR8f3Y9VQ6sxBT0snlfmKAYRlIeYvDmXvm1L8bVpNnT24VY/NeQwJQTDQ==","signature_status":"signed_v1","signed_at":"2026-05-18T03:45:52.885905Z","signed_message":"canonical_sha256_bytes"},"source_id":"1206.3555","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:477fc847a1246f48cefbfd1f420ed3dfb70152fd610adf4cc3fe73482e5ff128","sha256:90b8f56bd3534b0b0022e5a390a48f46485c5f20b8e26a312e3637d126fc8acf"],"state_sha256":"b06757548a521ceb0e1c210e9191297a6c2578597cb66e4c7933cbe7a431ee80"}