{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2012:Z7XBOYQZXXXCOQBX5SFKL3N7JS","short_pith_number":"pith:Z7XBOYQZ","schema_version":"1.0","canonical_sha256":"cfee176219bdee274037ec8aa5edbf4c8a6674182072c874c8b70cfb4861d2e5","source":{"kind":"arxiv","id":"1212.2486","version":1},"attestation_state":"computed","paper":{"title":"Extending Factor Graphs so as to Unify Directed and Undirected Graphical Models","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.AI","authors_text":"Brendan J. Frey","submitted_at":"2012-10-19T15:05:33Z","abstract_excerpt":"The two most popular types of graphical model are directed models (Bayesian     networks) and undirected models (Markov random fields, or MRFs). Directed and     undirected models offer complementary properties in model construction,     expressing conditional independencies, expressing arbitrary factorizations of     joint distributions, and formulating message-passing inference algorithms. We     show that the strengths of these two representations can be combined in a     single type of graphical model called a 'factor graph'. Every Bayesian     network or MRF can be easily converted to a f"},"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":"1212.2486","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2012-10-19T15:05:33Z","cross_cats_sorted":[],"title_canon_sha256":"c53f4f972b2d7c0b8d899df0950c29ee67476c4e04adf8257a15754f03dce873","abstract_canon_sha256":"3619f171fbc370d1cfbec14f92c6dcfeb5d0e502a6570f3df37194540e08e69e"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:38:44.628306Z","signature_b64":"plhDtxdkXgr5MhCsfXv41kpY4dS0QDKLuYOmRZYo9TvRJSDSJVltMrt9yBltlvxJRqQmjBX/kURr7RAp48jjAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"cfee176219bdee274037ec8aa5edbf4c8a6674182072c874c8b70cfb4861d2e5","last_reissued_at":"2026-05-18T03:38:44.627728Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:38:44.627728Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Extending Factor Graphs so as to Unify Directed and Undirected Graphical Models","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.AI","authors_text":"Brendan J. Frey","submitted_at":"2012-10-19T15:05:33Z","abstract_excerpt":"The two most popular types of graphical model are directed models (Bayesian     networks) and undirected models (Markov random fields, or MRFs). Directed and     undirected models offer complementary properties in model construction,     expressing conditional independencies, expressing arbitrary factorizations of     joint distributions, and formulating message-passing inference algorithms. We     show that the strengths of these two representations can be combined in a     single type of graphical model called a 'factor graph'. Every Bayesian     network or MRF can be easily converted to a f"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1212.2486","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":"1212.2486","created_at":"2026-05-18T03:38:44.627803+00:00"},{"alias_kind":"arxiv_version","alias_value":"1212.2486v1","created_at":"2026-05-18T03:38:44.627803+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1212.2486","created_at":"2026-05-18T03:38:44.627803+00:00"},{"alias_kind":"pith_short_12","alias_value":"Z7XBOYQZXXXC","created_at":"2026-05-18T12:27:30.460161+00:00"},{"alias_kind":"pith_short_16","alias_value":"Z7XBOYQZXXXCOQBX","created_at":"2026-05-18T12:27:30.460161+00:00"},{"alias_kind":"pith_short_8","alias_value":"Z7XBOYQZ","created_at":"2026-05-18T12:27:30.460161+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/Z7XBOYQZXXXCOQBX5SFKL3N7JS","json":"https://pith.science/pith/Z7XBOYQZXXXCOQBX5SFKL3N7JS.json","graph_json":"https://pith.science/api/pith-number/Z7XBOYQZXXXCOQBX5SFKL3N7JS/graph.json","events_json":"https://pith.science/api/pith-number/Z7XBOYQZXXXCOQBX5SFKL3N7JS/events.json","paper":"https://pith.science/paper/Z7XBOYQZ"},"agent_actions":{"view_html":"https://pith.science/pith/Z7XBOYQZXXXCOQBX5SFKL3N7JS","download_json":"https://pith.science/pith/Z7XBOYQZXXXCOQBX5SFKL3N7JS.json","view_paper":"https://pith.science/paper/Z7XBOYQZ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1212.2486&json=true","fetch_graph":"https://pith.science/api/pith-number/Z7XBOYQZXXXCOQBX5SFKL3N7JS/graph.json","fetch_events":"https://pith.science/api/pith-number/Z7XBOYQZXXXCOQBX5SFKL3N7JS/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/Z7XBOYQZXXXCOQBX5SFKL3N7JS/action/timestamp_anchor","attest_storage":"https://pith.science/pith/Z7XBOYQZXXXCOQBX5SFKL3N7JS/action/storage_attestation","attest_author":"https://pith.science/pith/Z7XBOYQZXXXCOQBX5SFKL3N7JS/action/author_attestation","sign_citation":"https://pith.science/pith/Z7XBOYQZXXXCOQBX5SFKL3N7JS/action/citation_signature","submit_replication":"https://pith.science/pith/Z7XBOYQZXXXCOQBX5SFKL3N7JS/action/replication_record"}},"created_at":"2026-05-18T03:38:44.627803+00:00","updated_at":"2026-05-18T03:38:44.627803+00:00"}