{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2019:A3MG3BLMST4ZSCJPSH2CUL2NIB","short_pith_number":"pith:A3MG3BLM","schema_version":"1.0","canonical_sha256":"06d86d856c94f999092f91f42a2f4d404d3324106774d96ac96008664a96e06a","source":{"kind":"arxiv","id":"1903.02201","version":1},"attestation_state":"computed","paper":{"title":"Proving the NP-completeness of optimal moral graph triangulation","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM","cs.LG"],"primary_cat":"cs.CC","authors_text":"Kevin Korb, Lloyd Allison, Yang Li","submitted_at":"2019-03-06T06:52:21Z","abstract_excerpt":"Moral graphs were introduced in the 1980s as an intermediate step when transforming a Bayesian network to a junction tree, on which exact belief propagation can be efficiently done. The moral graph of a Bayesian network can be trivially obtained by connecting non-adjacent parents for each node in the Bayesian network and dropping the direction of each edge. Perhaps because the moralization process looks simple, there has been little attention on the properties of moral graphs and their impact in belief propagation on Bayesian networks. This paper addresses the mistaken claim that it has been p"},"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":"1903.02201","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2019-03-06T06:52:21Z","cross_cats_sorted":["cs.DM","cs.LG"],"title_canon_sha256":"cb367fc7e2f1eab54777366fd37ca634dcdde99d7665da6639f136158bb88406","abstract_canon_sha256":"29b543582ce396d7823469d0f84c4a094ceb2d02518dff2cd9fd9d1752e9e604"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:51:56.492460Z","signature_b64":"2lyccQfizDqUkjWVb2TxDiRbzEsJJ3OihXcwYobGE2hGRFBwi8lWaIcrHK4DgUMrB0CFoH/GnHMwOBGMJ5raAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"06d86d856c94f999092f91f42a2f4d404d3324106774d96ac96008664a96e06a","last_reissued_at":"2026-05-17T23:51:56.491973Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:51:56.491973Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Proving the NP-completeness of optimal moral graph triangulation","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM","cs.LG"],"primary_cat":"cs.CC","authors_text":"Kevin Korb, Lloyd Allison, Yang Li","submitted_at":"2019-03-06T06:52:21Z","abstract_excerpt":"Moral graphs were introduced in the 1980s as an intermediate step when transforming a Bayesian network to a junction tree, on which exact belief propagation can be efficiently done. The moral graph of a Bayesian network can be trivially obtained by connecting non-adjacent parents for each node in the Bayesian network and dropping the direction of each edge. Perhaps because the moralization process looks simple, there has been little attention on the properties of moral graphs and their impact in belief propagation on Bayesian networks. This paper addresses the mistaken claim that it has been p"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1903.02201","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":"1903.02201","created_at":"2026-05-17T23:51:56.492039+00:00"},{"alias_kind":"arxiv_version","alias_value":"1903.02201v1","created_at":"2026-05-17T23:51:56.492039+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1903.02201","created_at":"2026-05-17T23:51:56.492039+00:00"},{"alias_kind":"pith_short_12","alias_value":"A3MG3BLMST4Z","created_at":"2026-05-18T12:33:12.712433+00:00"},{"alias_kind":"pith_short_16","alias_value":"A3MG3BLMST4ZSCJP","created_at":"2026-05-18T12:33:12.712433+00:00"},{"alias_kind":"pith_short_8","alias_value":"A3MG3BLM","created_at":"2026-05-18T12:33:12.712433+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/A3MG3BLMST4ZSCJPSH2CUL2NIB","json":"https://pith.science/pith/A3MG3BLMST4ZSCJPSH2CUL2NIB.json","graph_json":"https://pith.science/api/pith-number/A3MG3BLMST4ZSCJPSH2CUL2NIB/graph.json","events_json":"https://pith.science/api/pith-number/A3MG3BLMST4ZSCJPSH2CUL2NIB/events.json","paper":"https://pith.science/paper/A3MG3BLM"},"agent_actions":{"view_html":"https://pith.science/pith/A3MG3BLMST4ZSCJPSH2CUL2NIB","download_json":"https://pith.science/pith/A3MG3BLMST4ZSCJPSH2CUL2NIB.json","view_paper":"https://pith.science/paper/A3MG3BLM","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1903.02201&json=true","fetch_graph":"https://pith.science/api/pith-number/A3MG3BLMST4ZSCJPSH2CUL2NIB/graph.json","fetch_events":"https://pith.science/api/pith-number/A3MG3BLMST4ZSCJPSH2CUL2NIB/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/A3MG3BLMST4ZSCJPSH2CUL2NIB/action/timestamp_anchor","attest_storage":"https://pith.science/pith/A3MG3BLMST4ZSCJPSH2CUL2NIB/action/storage_attestation","attest_author":"https://pith.science/pith/A3MG3BLMST4ZSCJPSH2CUL2NIB/action/author_attestation","sign_citation":"https://pith.science/pith/A3MG3BLMST4ZSCJPSH2CUL2NIB/action/citation_signature","submit_replication":"https://pith.science/pith/A3MG3BLMST4ZSCJPSH2CUL2NIB/action/replication_record"}},"created_at":"2026-05-17T23:51:56.492039+00:00","updated_at":"2026-05-17T23:51:56.492039+00:00"}