{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2013:BDJZDRAGPUR663FI2CX54URDSK","short_pith_number":"pith:BDJZDRAG","schema_version":"1.0","canonical_sha256":"08d391c4067d23ef6ca8d0afde522392802e099f1f1e26ca6880656e2a2b927f","source":{"kind":"arxiv","id":"1301.2296","version":1},"attestation_state":"computed","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"},"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":"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"},"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"},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1301.2296","created_at":"2026-05-18T03:36:45.500099+00:00"},{"alias_kind":"arxiv_version","alias_value":"1301.2296v1","created_at":"2026-05-18T03:36:45.500099+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1301.2296","created_at":"2026-05-18T03:36:45.500099+00:00"},{"alias_kind":"pith_short_12","alias_value":"BDJZDRAGPUR6","created_at":"2026-05-18T12:27:38.830355+00:00"},{"alias_kind":"pith_short_16","alias_value":"BDJZDRAGPUR663FI","created_at":"2026-05-18T12:27:38.830355+00:00"},{"alias_kind":"pith_short_8","alias_value":"BDJZDRAG","created_at":"2026-05-18T12:27:38.830355+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/BDJZDRAGPUR663FI2CX54URDSK","json":"https://pith.science/pith/BDJZDRAGPUR663FI2CX54URDSK.json","graph_json":"https://pith.science/api/pith-number/BDJZDRAGPUR663FI2CX54URDSK/graph.json","events_json":"https://pith.science/api/pith-number/BDJZDRAGPUR663FI2CX54URDSK/events.json","paper":"https://pith.science/paper/BDJZDRAG"},"agent_actions":{"view_html":"https://pith.science/pith/BDJZDRAGPUR663FI2CX54URDSK","download_json":"https://pith.science/pith/BDJZDRAGPUR663FI2CX54URDSK.json","view_paper":"https://pith.science/paper/BDJZDRAG","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1301.2296&json=true","fetch_graph":"https://pith.science/api/pith-number/BDJZDRAGPUR663FI2CX54URDSK/graph.json","fetch_events":"https://pith.science/api/pith-number/BDJZDRAGPUR663FI2CX54URDSK/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/BDJZDRAGPUR663FI2CX54URDSK/action/timestamp_anchor","attest_storage":"https://pith.science/pith/BDJZDRAGPUR663FI2CX54URDSK/action/storage_attestation","attest_author":"https://pith.science/pith/BDJZDRAGPUR663FI2CX54URDSK/action/author_attestation","sign_citation":"https://pith.science/pith/BDJZDRAGPUR663FI2CX54URDSK/action/citation_signature","submit_replication":"https://pith.science/pith/BDJZDRAGPUR663FI2CX54URDSK/action/replication_record"}},"created_at":"2026-05-18T03:36:45.500099+00:00","updated_at":"2026-05-18T03:36:45.500099+00:00"}