{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:5P2JD6EWYDXA3QON2SOURPVIKY","short_pith_number":"pith:5P2JD6EW","canonical_record":{"source":{"id":"1509.03564","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2015-09-11T15:45:39Z","cross_cats_sorted":[],"title_canon_sha256":"29e7677e38f5e4aead96957829014175d1bdada63697519bff9b0f34227106cb","abstract_canon_sha256":"06f30a6bad8d69c9b975e85e757f8611ab4846ac4526decf332265696a580e13"},"schema_version":"1.0"},"canonical_sha256":"ebf491f896c0ee0dc1cdd49d48bea85607f9958648925c23e7ff3202a276a15f","source":{"kind":"arxiv","id":"1509.03564","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1509.03564","created_at":"2026-05-18T01:33:17Z"},{"alias_kind":"arxiv_version","alias_value":"1509.03564v1","created_at":"2026-05-18T01:33:17Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1509.03564","created_at":"2026-05-18T01:33:17Z"},{"alias_kind":"pith_short_12","alias_value":"5P2JD6EWYDXA","created_at":"2026-05-18T12:29:05Z"},{"alias_kind":"pith_short_16","alias_value":"5P2JD6EWYDXA3QON","created_at":"2026-05-18T12:29:05Z"},{"alias_kind":"pith_short_8","alias_value":"5P2JD6EW","created_at":"2026-05-18T12:29:05Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:5P2JD6EWYDXA3QON2SOURPVIKY","target":"record","payload":{"canonical_record":{"source":{"id":"1509.03564","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2015-09-11T15:45:39Z","cross_cats_sorted":[],"title_canon_sha256":"29e7677e38f5e4aead96957829014175d1bdada63697519bff9b0f34227106cb","abstract_canon_sha256":"06f30a6bad8d69c9b975e85e757f8611ab4846ac4526decf332265696a580e13"},"schema_version":"1.0"},"canonical_sha256":"ebf491f896c0ee0dc1cdd49d48bea85607f9958648925c23e7ff3202a276a15f","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:33:17.500756Z","signature_b64":"yV/DGxQoqYVLQdSlhrEHeM+yO2XYSUEOAswZP3crzPFjv9uTXrz3Sa0yfXpOmNwpVn4mJ3mdewnGQlExrOrtCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"ebf491f896c0ee0dc1cdd49d48bea85607f9958648925c23e7ff3202a276a15f","last_reissued_at":"2026-05-18T01:33:17.500144Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:33:17.500144Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1509.03564","source_version":1,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T01:33:17Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"yZdqfzlKLWfnMv2GMwORuggnG7YvfOU8laY5qryoKABiANq3gTuADsYkY3ZuZ+jA/8AOXEEHCvx0E8t/DL+MAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-25T09:45:19.233488Z"},"content_sha256":"c70dfbbd4c4b8712dfc2fd42e5434f742058a90083b2a6319d0da9c5afa09522","schema_version":"1.0","event_id":"sha256:c70dfbbd4c4b8712dfc2fd42e5434f742058a90083b2a6319d0da9c5afa09522"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:5P2JD6EWYDXA3QON2SOURPVIKY","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Lazy Factored Inference for Functional Probabilistic Programming","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.AI","authors_text":"Amy Sliva, Avi Pfeffer, Brian Ruttenberg, Glenn Takata, Michael Howard","submitted_at":"2015-09-11T15:45:39Z","abstract_excerpt":"Probabilistic programming provides the means to represent and reason about complex probabilistic models using programming language constructs. Even simple probabilistic programs can produce models with infinitely many variables. Factored inference algorithms are widely used for probabilistic graphical models, but cannot be applied to these programs because all the variables and factors have to be enumerated. In this paper, we present a new inference framework, lazy factored inference (LFI), that enables factored algorithms to be used for models with infinitely many variables. LFI expands the m"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1509.03564","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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T01:33:17Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"qlznUZ2Icx7R9wZZi2JoLmo7Cc7XRGfP7z+HeOlemzZMi58F33jcC/flv3C5qwJwsCI8F87XC4s24r3vbqaLDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-25T09:45:19.233834Z"},"content_sha256":"56d52d9dadf89850d6bae1ecee2cce0254e545aca07c4e90d4bccec3ffbd0e5e","schema_version":"1.0","event_id":"sha256:56d52d9dadf89850d6bae1ecee2cce0254e545aca07c4e90d4bccec3ffbd0e5e"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/5P2JD6EWYDXA3QON2SOURPVIKY/bundle.json","state_url":"https://pith.science/pith/5P2JD6EWYDXA3QON2SOURPVIKY/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/5P2JD6EWYDXA3QON2SOURPVIKY/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-06-25T09:45:19Z","links":{"resolver":"https://pith.science/pith/5P2JD6EWYDXA3QON2SOURPVIKY","bundle":"https://pith.science/pith/5P2JD6EWYDXA3QON2SOURPVIKY/bundle.json","state":"https://pith.science/pith/5P2JD6EWYDXA3QON2SOURPVIKY/state.json","well_known_bundle":"https://pith.science/.well-known/pith/5P2JD6EWYDXA3QON2SOURPVIKY/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:5P2JD6EWYDXA3QON2SOURPVIKY","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":"06f30a6bad8d69c9b975e85e757f8611ab4846ac4526decf332265696a580e13","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2015-09-11T15:45:39Z","title_canon_sha256":"29e7677e38f5e4aead96957829014175d1bdada63697519bff9b0f34227106cb"},"schema_version":"1.0","source":{"id":"1509.03564","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1509.03564","created_at":"2026-05-18T01:33:17Z"},{"alias_kind":"arxiv_version","alias_value":"1509.03564v1","created_at":"2026-05-18T01:33:17Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1509.03564","created_at":"2026-05-18T01:33:17Z"},{"alias_kind":"pith_short_12","alias_value":"5P2JD6EWYDXA","created_at":"2026-05-18T12:29:05Z"},{"alias_kind":"pith_short_16","alias_value":"5P2JD6EWYDXA3QON","created_at":"2026-05-18T12:29:05Z"},{"alias_kind":"pith_short_8","alias_value":"5P2JD6EW","created_at":"2026-05-18T12:29:05Z"}],"graph_snapshots":[{"event_id":"sha256:56d52d9dadf89850d6bae1ecee2cce0254e545aca07c4e90d4bccec3ffbd0e5e","target":"graph","created_at":"2026-05-18T01:33:17Z","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":"Probabilistic programming provides the means to represent and reason about complex probabilistic models using programming language constructs. Even simple probabilistic programs can produce models with infinitely many variables. Factored inference algorithms are widely used for probabilistic graphical models, but cannot be applied to these programs because all the variables and factors have to be enumerated. In this paper, we present a new inference framework, lazy factored inference (LFI), that enables factored algorithms to be used for models with infinitely many variables. LFI expands the m","authors_text":"Amy Sliva, Avi Pfeffer, Brian Ruttenberg, Glenn Takata, Michael Howard","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2015-09-11T15:45:39Z","title":"Lazy Factored Inference for Functional Probabilistic Programming"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1509.03564","kind":"arxiv","version":1},"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:c70dfbbd4c4b8712dfc2fd42e5434f742058a90083b2a6319d0da9c5afa09522","target":"record","created_at":"2026-05-18T01:33:17Z","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":"06f30a6bad8d69c9b975e85e757f8611ab4846ac4526decf332265696a580e13","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2015-09-11T15:45:39Z","title_canon_sha256":"29e7677e38f5e4aead96957829014175d1bdada63697519bff9b0f34227106cb"},"schema_version":"1.0","source":{"id":"1509.03564","kind":"arxiv","version":1}},"canonical_sha256":"ebf491f896c0ee0dc1cdd49d48bea85607f9958648925c23e7ff3202a276a15f","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"ebf491f896c0ee0dc1cdd49d48bea85607f9958648925c23e7ff3202a276a15f","first_computed_at":"2026-05-18T01:33:17.500144Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:33:17.500144Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"yV/DGxQoqYVLQdSlhrEHeM+yO2XYSUEOAswZP3crzPFjv9uTXrz3Sa0yfXpOmNwpVn4mJ3mdewnGQlExrOrtCQ==","signature_status":"signed_v1","signed_at":"2026-05-18T01:33:17.500756Z","signed_message":"canonical_sha256_bytes"},"source_id":"1509.03564","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:c70dfbbd4c4b8712dfc2fd42e5434f742058a90083b2a6319d0da9c5afa09522","sha256:56d52d9dadf89850d6bae1ecee2cce0254e545aca07c4e90d4bccec3ffbd0e5e"],"state_sha256":"4b7fb6af7ab16209721042bf197d04123ec5befec5289f728a6d5baf04b16a6d"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"QI+dyYED2unbAPdh/x/fg9ICa5kYXtZUKzydZyZejUQd8veQjhn+1RRAozNW7Kk6lh9uojTwBibopm+mwuhZBA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-25T09:45:19.235851Z","bundle_sha256":"9efdb1415d77afa92390ffb3b33ef2e4a5f72a92f01bb033d1e18cdddb85c2cb"}}