{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:346UB53OBNABAX5YTTTLOVXCHG","short_pith_number":"pith:346UB53O","canonical_record":{"source":{"id":"1606.03298","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2016-06-10T12:53:01Z","cross_cats_sorted":[],"title_canon_sha256":"1dd9c426de73be6a73126e4140e591a31d1c9a4fb557ff11c94148ed43a983e4","abstract_canon_sha256":"5bc157aef22e5a5754ec3aa9a1fa29f4454aea8cb158274d7ad27dbc4402ac17"},"schema_version":"1.0"},"canonical_sha256":"df3d40f76e0b40105fb89ce6b756e239925516f4b3be3c9fe52b4cde8e15ffb8","source":{"kind":"arxiv","id":"1606.03298","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1606.03298","created_at":"2026-05-18T01:12:37Z"},{"alias_kind":"arxiv_version","alias_value":"1606.03298v1","created_at":"2026-05-18T01:12:37Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1606.03298","created_at":"2026-05-18T01:12:37Z"},{"alias_kind":"pith_short_12","alias_value":"346UB53OBNAB","created_at":"2026-05-18T12:29:55Z"},{"alias_kind":"pith_short_16","alias_value":"346UB53OBNABAX5Y","created_at":"2026-05-18T12:29:55Z"},{"alias_kind":"pith_short_8","alias_value":"346UB53O","created_at":"2026-05-18T12:29:55Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:346UB53OBNABAX5YTTTLOVXCHG","target":"record","payload":{"canonical_record":{"source":{"id":"1606.03298","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2016-06-10T12:53:01Z","cross_cats_sorted":[],"title_canon_sha256":"1dd9c426de73be6a73126e4140e591a31d1c9a4fb557ff11c94148ed43a983e4","abstract_canon_sha256":"5bc157aef22e5a5754ec3aa9a1fa29f4454aea8cb158274d7ad27dbc4402ac17"},"schema_version":"1.0"},"canonical_sha256":"df3d40f76e0b40105fb89ce6b756e239925516f4b3be3c9fe52b4cde8e15ffb8","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:12:37.206544Z","signature_b64":"9Q5haE3aXyEQuPouad+uT/U/7Ag4fFNMevxvVp81a+crF7FlgUf2ZIF1infKS+iJLgoYGVtIQUmfHNqwyaitDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"df3d40f76e0b40105fb89ce6b756e239925516f4b3be3c9fe52b4cde8e15ffb8","last_reissued_at":"2026-05-18T01:12:37.206138Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:12:37.206138Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1606.03298","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:12:37Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"dDOj7oJr37VUxrlecXtVEsGdkPBCdUFuJi6yGb2IWcbajD3wWt5WIrAVa3i3ZUr0EoWjM5g05IrsDo2/z8ZtDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-25T06:43:00.373010Z"},"content_sha256":"306884b9bae8e270cba2414c0ba30d898e7ce743645524868557757d16dd11a8","schema_version":"1.0","event_id":"sha256:306884b9bae8e270cba2414c0ba30d898e7ce743645524868557757d16dd11a8"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:346UB53OBNABAX5YTTTLOVXCHG","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Structured Factored Inference: A Framework for Automated Reasoning in Probabilistic Programming Languages","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.AI","authors_text":"Avi Pfeffer, Brian Ruttenberg, William Kretschmer","submitted_at":"2016-06-10T12:53:01Z","abstract_excerpt":"Reasoning on large and complex real-world models is a computationally difficult task, yet one that is required for effective use of many AI applications. A plethora of inference algorithms have been developed that work well on specific models or only on parts of general models. Consequently, a system that can intelligently apply these inference algorithms to different parts of a model for fast reasoning is highly desirable. We introduce a new framework called structured factored inference (SFI) that provides the foundation for such a system. Using models encoded in a probabilistic programming "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1606.03298","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:12:37Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"xSC6rQjz0rJxh87W/5IaIDk4ihOjmKZFNofh3hmxNvy/EcWKNRtxy1pgxwNEzvwIVSKn/RTxAtKFQ9s+aeXxDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-25T06:43:00.373356Z"},"content_sha256":"16e8264b7dd54e01c93c76cf8be2c77a82fe0086d7a40a04dadd3752f7f3c7bc","schema_version":"1.0","event_id":"sha256:16e8264b7dd54e01c93c76cf8be2c77a82fe0086d7a40a04dadd3752f7f3c7bc"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/346UB53OBNABAX5YTTTLOVXCHG/bundle.json","state_url":"https://pith.science/pith/346UB53OBNABAX5YTTTLOVXCHG/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/346UB53OBNABAX5YTTTLOVXCHG/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-25T06:43:00Z","links":{"resolver":"https://pith.science/pith/346UB53OBNABAX5YTTTLOVXCHG","bundle":"https://pith.science/pith/346UB53OBNABAX5YTTTLOVXCHG/bundle.json","state":"https://pith.science/pith/346UB53OBNABAX5YTTTLOVXCHG/state.json","well_known_bundle":"https://pith.science/.well-known/pith/346UB53OBNABAX5YTTTLOVXCHG/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:346UB53OBNABAX5YTTTLOVXCHG","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":"5bc157aef22e5a5754ec3aa9a1fa29f4454aea8cb158274d7ad27dbc4402ac17","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2016-06-10T12:53:01Z","title_canon_sha256":"1dd9c426de73be6a73126e4140e591a31d1c9a4fb557ff11c94148ed43a983e4"},"schema_version":"1.0","source":{"id":"1606.03298","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1606.03298","created_at":"2026-05-18T01:12:37Z"},{"alias_kind":"arxiv_version","alias_value":"1606.03298v1","created_at":"2026-05-18T01:12:37Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1606.03298","created_at":"2026-05-18T01:12:37Z"},{"alias_kind":"pith_short_12","alias_value":"346UB53OBNAB","created_at":"2026-05-18T12:29:55Z"},{"alias_kind":"pith_short_16","alias_value":"346UB53OBNABAX5Y","created_at":"2026-05-18T12:29:55Z"},{"alias_kind":"pith_short_8","alias_value":"346UB53O","created_at":"2026-05-18T12:29:55Z"}],"graph_snapshots":[{"event_id":"sha256:16e8264b7dd54e01c93c76cf8be2c77a82fe0086d7a40a04dadd3752f7f3c7bc","target":"graph","created_at":"2026-05-18T01:12:37Z","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":"Reasoning on large and complex real-world models is a computationally difficult task, yet one that is required for effective use of many AI applications. A plethora of inference algorithms have been developed that work well on specific models or only on parts of general models. Consequently, a system that can intelligently apply these inference algorithms to different parts of a model for fast reasoning is highly desirable. We introduce a new framework called structured factored inference (SFI) that provides the foundation for such a system. Using models encoded in a probabilistic programming ","authors_text":"Avi Pfeffer, Brian Ruttenberg, William Kretschmer","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2016-06-10T12:53:01Z","title":"Structured Factored Inference: A Framework for Automated Reasoning in Probabilistic Programming Languages"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1606.03298","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:306884b9bae8e270cba2414c0ba30d898e7ce743645524868557757d16dd11a8","target":"record","created_at":"2026-05-18T01:12:37Z","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":"5bc157aef22e5a5754ec3aa9a1fa29f4454aea8cb158274d7ad27dbc4402ac17","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2016-06-10T12:53:01Z","title_canon_sha256":"1dd9c426de73be6a73126e4140e591a31d1c9a4fb557ff11c94148ed43a983e4"},"schema_version":"1.0","source":{"id":"1606.03298","kind":"arxiv","version":1}},"canonical_sha256":"df3d40f76e0b40105fb89ce6b756e239925516f4b3be3c9fe52b4cde8e15ffb8","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"df3d40f76e0b40105fb89ce6b756e239925516f4b3be3c9fe52b4cde8e15ffb8","first_computed_at":"2026-05-18T01:12:37.206138Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:12:37.206138Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"9Q5haE3aXyEQuPouad+uT/U/7Ag4fFNMevxvVp81a+crF7FlgUf2ZIF1infKS+iJLgoYGVtIQUmfHNqwyaitDw==","signature_status":"signed_v1","signed_at":"2026-05-18T01:12:37.206544Z","signed_message":"canonical_sha256_bytes"},"source_id":"1606.03298","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:306884b9bae8e270cba2414c0ba30d898e7ce743645524868557757d16dd11a8","sha256:16e8264b7dd54e01c93c76cf8be2c77a82fe0086d7a40a04dadd3752f7f3c7bc"],"state_sha256":"c8991af0056411f2082886fe3702ba2386c16c5f40fbf06357e4f0cde27899dc"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"u6qGqzfeBin9EypAk/FeDRNxqfGV3baf2YpSEVfQkcDQ/X2yL9dVUoT1lBfIwZeRywR/PaCnkE+/FNTf0hX4CQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-25T06:43:00.375258Z","bundle_sha256":"a8a85785b41df9dd9b0066ed2fbc5e6a287704afd0af389406e058515bb5c252"}}