{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2013:BDJZDRAGPUR663FI2CX54URDSK","short_pith_number":"pith:BDJZDRAG","canonical_record":{"source":{"id":"1301.2296","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2013-01-10T16:25:29Z","cross_cats_sorted":[],"title_canon_sha256":"3a930bdacc2dad61d1603b60e29c687b542481ff94efcca370924d855a2b0c2b","abstract_canon_sha256":"1908d1be36a6f0d26075c96cde2da2ea06265a551f44e188a9faec53fb9891cc"},"schema_version":"1.0"},"canonical_sha256":"08d391c4067d23ef6ca8d0afde522392802e099f1f1e26ca6880656e2a2b927f","source":{"kind":"arxiv","id":"1301.2296","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1301.2296","created_at":"2026-05-18T03:36:45Z"},{"alias_kind":"arxiv_version","alias_value":"1301.2296v1","created_at":"2026-05-18T03:36:45Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1301.2296","created_at":"2026-05-18T03:36:45Z"},{"alias_kind":"pith_short_12","alias_value":"BDJZDRAGPUR6","created_at":"2026-05-18T12:27:38Z"},{"alias_kind":"pith_short_16","alias_value":"BDJZDRAGPUR663FI","created_at":"2026-05-18T12:27:38Z"},{"alias_kind":"pith_short_8","alias_value":"BDJZDRAG","created_at":"2026-05-18T12:27:38Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2013:BDJZDRAGPUR663FI2CX54URDSK","target":"record","payload":{"canonical_record":{"source":{"id":"1301.2296","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2013-01-10T16:25:29Z","cross_cats_sorted":[],"title_canon_sha256":"3a930bdacc2dad61d1603b60e29c687b542481ff94efcca370924d855a2b0c2b","abstract_canon_sha256":"1908d1be36a6f0d26075c96cde2da2ea06265a551f44e188a9faec53fb9891cc"},"schema_version":"1.0"},"canonical_sha256":"08d391c4067d23ef6ca8d0afde522392802e099f1f1e26ca6880656e2a2b927f","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:36:45.500640Z","signature_b64":"Amgui90b9teQxiv/wFMBu11PMA/CVmNggUm9EeX0yjHP3gJfDUa/rjpNgzYrIUNf/3Tf8FpfOIVKME5N8oWYBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"08d391c4067d23ef6ca8d0afde522392802e099f1f1e26ca6880656e2a2b927f","last_reissued_at":"2026-05-18T03:36:45.500003Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:36:45.500003Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1301.2296","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-18T03:36:45Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ezqsOtW/0qXzRftqxHo+oMZq4pB8k+hogBkTOU+DGqkwTFV9Jx1ezmChI4Zs2yqLkUbC/4ri5RZUquU0ZIxXBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-01T11:37:32.123148Z"},"content_sha256":"8081729030c46a79cac4ce4da919b85cc2dda271ac94c6a288416fef0aa4b783","schema_version":"1.0","event_id":"sha256:8081729030c46a79cac4ce4da919b85cc2dda271ac94c6a288416fef0aa4b783"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2013:BDJZDRAGPUR663FI2CX54URDSK","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"The Factored Frontier Algorithm for Approximate Inference in DBNs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.AI","authors_text":"Kevin Murphy, Yair Weiss","submitted_at":"2013-01-10T16:25:29Z","abstract_excerpt":"The Factored Frontier (FF) algorithm is a simple approximate inferencealgorithm for Dynamic Bayesian Networks (DBNs).  It is very similar tothe fully factorized version of the Boyen-Koller (BK) algorithm, butinstead of doing an exact update at every step followed bymarginalisation (projection), it always works with factoreddistributions.  Hence it can be applied to models for which the exactupdate step is intractable.  We show that FF is equivalent to (oneiteration of) loopy belief propagation (LBP) on the original DBN, andthat BK is equivalent (to one iteration of) LBP on a DBN where wecluste"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1301.2296","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-18T03:36:45Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"fAo2o6f0ITDBE97+KJnp9KnWTfr+QnMd7wtAlTlMpt7x9a1crTPXYNmjBrsRQi71QBqOPmYBth+MjMI4Z3S8AA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-01T11:37:32.123506Z"},"content_sha256":"a31bdff0bc691b11fff31ea51595a4c61884ab999391d3378a6f7258ae857be9","schema_version":"1.0","event_id":"sha256:a31bdff0bc691b11fff31ea51595a4c61884ab999391d3378a6f7258ae857be9"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/BDJZDRAGPUR663FI2CX54URDSK/bundle.json","state_url":"https://pith.science/pith/BDJZDRAGPUR663FI2CX54URDSK/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/BDJZDRAGPUR663FI2CX54URDSK/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-01T11:37:32Z","links":{"resolver":"https://pith.science/pith/BDJZDRAGPUR663FI2CX54URDSK","bundle":"https://pith.science/pith/BDJZDRAGPUR663FI2CX54URDSK/bundle.json","state":"https://pith.science/pith/BDJZDRAGPUR663FI2CX54URDSK/state.json","well_known_bundle":"https://pith.science/.well-known/pith/BDJZDRAGPUR663FI2CX54URDSK/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2013:BDJZDRAGPUR663FI2CX54URDSK","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":"1908d1be36a6f0d26075c96cde2da2ea06265a551f44e188a9faec53fb9891cc","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2013-01-10T16:25:29Z","title_canon_sha256":"3a930bdacc2dad61d1603b60e29c687b542481ff94efcca370924d855a2b0c2b"},"schema_version":"1.0","source":{"id":"1301.2296","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1301.2296","created_at":"2026-05-18T03:36:45Z"},{"alias_kind":"arxiv_version","alias_value":"1301.2296v1","created_at":"2026-05-18T03:36:45Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1301.2296","created_at":"2026-05-18T03:36:45Z"},{"alias_kind":"pith_short_12","alias_value":"BDJZDRAGPUR6","created_at":"2026-05-18T12:27:38Z"},{"alias_kind":"pith_short_16","alias_value":"BDJZDRAGPUR663FI","created_at":"2026-05-18T12:27:38Z"},{"alias_kind":"pith_short_8","alias_value":"BDJZDRAG","created_at":"2026-05-18T12:27:38Z"}],"graph_snapshots":[{"event_id":"sha256:a31bdff0bc691b11fff31ea51595a4c61884ab999391d3378a6f7258ae857be9","target":"graph","created_at":"2026-05-18T03:36:45Z","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":"The Factored Frontier (FF) algorithm is a simple approximate inferencealgorithm for Dynamic Bayesian Networks (DBNs).  It is very similar tothe fully factorized version of the Boyen-Koller (BK) algorithm, butinstead of doing an exact update at every step followed bymarginalisation (projection), it always works with factoreddistributions.  Hence it can be applied to models for which the exactupdate step is intractable.  We show that FF is equivalent to (oneiteration of) loopy belief propagation (LBP) on the original DBN, andthat BK is equivalent (to one iteration of) LBP on a DBN where wecluste","authors_text":"Kevin Murphy, Yair Weiss","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2013-01-10T16:25:29Z","title":"The Factored Frontier Algorithm for Approximate Inference in DBNs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1301.2296","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:8081729030c46a79cac4ce4da919b85cc2dda271ac94c6a288416fef0aa4b783","target":"record","created_at":"2026-05-18T03:36:45Z","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":"1908d1be36a6f0d26075c96cde2da2ea06265a551f44e188a9faec53fb9891cc","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2013-01-10T16:25:29Z","title_canon_sha256":"3a930bdacc2dad61d1603b60e29c687b542481ff94efcca370924d855a2b0c2b"},"schema_version":"1.0","source":{"id":"1301.2296","kind":"arxiv","version":1}},"canonical_sha256":"08d391c4067d23ef6ca8d0afde522392802e099f1f1e26ca6880656e2a2b927f","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"08d391c4067d23ef6ca8d0afde522392802e099f1f1e26ca6880656e2a2b927f","first_computed_at":"2026-05-18T03:36:45.500003Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:36:45.500003Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"Amgui90b9teQxiv/wFMBu11PMA/CVmNggUm9EeX0yjHP3gJfDUa/rjpNgzYrIUNf/3Tf8FpfOIVKME5N8oWYBQ==","signature_status":"signed_v1","signed_at":"2026-05-18T03:36:45.500640Z","signed_message":"canonical_sha256_bytes"},"source_id":"1301.2296","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:8081729030c46a79cac4ce4da919b85cc2dda271ac94c6a288416fef0aa4b783","sha256:a31bdff0bc691b11fff31ea51595a4c61884ab999391d3378a6f7258ae857be9"],"state_sha256":"de9b5b30fdfa577cd80cba85b988572f3830f149f7072723c5c9e5fe3717ebd6"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"/6jsMC2fbJ99HMTVyyXXJuib33AOUXQr+ca2OIqP1rNP7IvihoJT6ei3DkXQ85iNfk1dAkAuoOd7LkYQ2aukCg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-01T11:37:32.125570Z","bundle_sha256":"3bac1febfa49787976e46ad37ca3e43d64757148df7c3c2992875e9579b67a66"}}