{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2013:BW3DP6DWCRN4SFKJVFVLXGJSHL","short_pith_number":"pith:BW3DP6DW","schema_version":"1.0","canonical_sha256":"0db637f876145bc91549a96abb99323afa9c117d2c8fef81dedde79916313686","source":{"kind":"arxiv","id":"1301.7414","version":1},"attestation_state":"computed","paper":{"title":"Bayesian Networks from the Point of View of Chain Graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.AI","authors_text":"Milan Studeny","submitted_at":"2013-01-30T15:06:56Z","abstract_excerpt":"AThe paper gives a few arguments in favour of the use of chain graphs for description of probabilistic conditional independence structures.  Every Bayesian network model can be equivalently introduced by means of a factorization formula with respect to a chain graph which is Markov equivalent to the Bayesian network.  A graphical characterization of such graphs is given. The class of equivalent graphs can be represented by a distinguished graph which is called the largest chain graph. The factorization formula with respect to the largest chain graph is a basis of a proposal of how to represent"},"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.7414","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2013-01-30T15:06:56Z","cross_cats_sorted":[],"title_canon_sha256":"7bf00e742b3f9054139db64e9b64f3dc2d3fab3c620277301d23359a504e3d76","abstract_canon_sha256":"58da5bcbb2de903547f2d67e57f1e14480b902fd6424c11258ff012f036312ca"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:34:49.584226Z","signature_b64":"T0oWuzuLTuaXgdE984aKvf0JGMsmwePCOCoV6eARCXzk+VfqLeLbj+Edd+H0/LY3sieOMvjobh/KjAf3mbtzBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"0db637f876145bc91549a96abb99323afa9c117d2c8fef81dedde79916313686","last_reissued_at":"2026-05-18T03:34:49.583575Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:34:49.583575Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Bayesian Networks from the Point of View of Chain Graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.AI","authors_text":"Milan Studeny","submitted_at":"2013-01-30T15:06:56Z","abstract_excerpt":"AThe paper gives a few arguments in favour of the use of chain graphs for description of probabilistic conditional independence structures.  Every Bayesian network model can be equivalently introduced by means of a factorization formula with respect to a chain graph which is Markov equivalent to the Bayesian network.  A graphical characterization of such graphs is given. The class of equivalent graphs can be represented by a distinguished graph which is called the largest chain graph. The factorization formula with respect to the largest chain graph is a basis of a proposal of how to represent"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1301.7414","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.7414","created_at":"2026-05-18T03:34:49.583666+00:00"},{"alias_kind":"arxiv_version","alias_value":"1301.7414v1","created_at":"2026-05-18T03:34:49.583666+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1301.7414","created_at":"2026-05-18T03:34:49.583666+00:00"},{"alias_kind":"pith_short_12","alias_value":"BW3DP6DWCRN4","created_at":"2026-05-18T12:27:40.988391+00:00"},{"alias_kind":"pith_short_16","alias_value":"BW3DP6DWCRN4SFKJ","created_at":"2026-05-18T12:27:40.988391+00:00"},{"alias_kind":"pith_short_8","alias_value":"BW3DP6DW","created_at":"2026-05-18T12:27:40.988391+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/BW3DP6DWCRN4SFKJVFVLXGJSHL","json":"https://pith.science/pith/BW3DP6DWCRN4SFKJVFVLXGJSHL.json","graph_json":"https://pith.science/api/pith-number/BW3DP6DWCRN4SFKJVFVLXGJSHL/graph.json","events_json":"https://pith.science/api/pith-number/BW3DP6DWCRN4SFKJVFVLXGJSHL/events.json","paper":"https://pith.science/paper/BW3DP6DW"},"agent_actions":{"view_html":"https://pith.science/pith/BW3DP6DWCRN4SFKJVFVLXGJSHL","download_json":"https://pith.science/pith/BW3DP6DWCRN4SFKJVFVLXGJSHL.json","view_paper":"https://pith.science/paper/BW3DP6DW","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1301.7414&json=true","fetch_graph":"https://pith.science/api/pith-number/BW3DP6DWCRN4SFKJVFVLXGJSHL/graph.json","fetch_events":"https://pith.science/api/pith-number/BW3DP6DWCRN4SFKJVFVLXGJSHL/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/BW3DP6DWCRN4SFKJVFVLXGJSHL/action/timestamp_anchor","attest_storage":"https://pith.science/pith/BW3DP6DWCRN4SFKJVFVLXGJSHL/action/storage_attestation","attest_author":"https://pith.science/pith/BW3DP6DWCRN4SFKJVFVLXGJSHL/action/author_attestation","sign_citation":"https://pith.science/pith/BW3DP6DWCRN4SFKJVFVLXGJSHL/action/citation_signature","submit_replication":"https://pith.science/pith/BW3DP6DWCRN4SFKJVFVLXGJSHL/action/replication_record"}},"created_at":"2026-05-18T03:34:49.583666+00:00","updated_at":"2026-05-18T03:34:49.583666+00:00"}