{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2014:VWCU57U4HNPHFX2YVYBZD4CNPJ","short_pith_number":"pith:VWCU57U4","schema_version":"1.0","canonical_sha256":"ad854efe9c3b5e72df58ae0391f04d7a68181e5cfba6bfcb2e4e340b72434f74","source":{"kind":"arxiv","id":"1403.2310","version":4},"attestation_state":"computed","paper":{"title":"Penalized Estimation of Directed Acyclic Graphs From Discrete Data","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["stat.ML"],"primary_cat":"stat.ME","authors_text":"Fei Fu, Jiaying Gu, Qing Zhou","submitted_at":"2014-03-10T17:26:40Z","abstract_excerpt":"Bayesian networks, with structure given by a directed acyclic graph (DAG), are a popular class of graphical models. However, learning Bayesian networks from discrete or categorical data is particularly challenging, due to the large parameter space and the difficulty in searching for a sparse structure. In this article, we develop a maximum penalized likelihood method to tackle this problem. Instead of the commonly used multinomial distribution, we model the conditional distribution of a node given its parents by multi-logit regression, in which an edge is parameterized by a set of coefficient "},"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":"1403.2310","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ME","submitted_at":"2014-03-10T17:26:40Z","cross_cats_sorted":["stat.ML"],"title_canon_sha256":"7632c1720945ccfb026a384f5199f3da0b0d7f60ea4a8fcf45847c5ab3fa43c3","abstract_canon_sha256":"5cb7a4a2fa282ab469fab6877abfe41ad127143f78e7e300de9cc100c689560e"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:24:32.164404Z","signature_b64":"AQgVEWmcw1C38cub196UfF7wls3fvo0l4aAh6FAAYqs3h2kQMjqpP9agnNUr85DIWv9AL91IQCOnnetu0ZoyBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"ad854efe9c3b5e72df58ae0391f04d7a68181e5cfba6bfcb2e4e340b72434f74","last_reissued_at":"2026-05-18T00:24:32.163902Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:24:32.163902Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Penalized Estimation of Directed Acyclic Graphs From Discrete Data","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["stat.ML"],"primary_cat":"stat.ME","authors_text":"Fei Fu, Jiaying Gu, Qing Zhou","submitted_at":"2014-03-10T17:26:40Z","abstract_excerpt":"Bayesian networks, with structure given by a directed acyclic graph (DAG), are a popular class of graphical models. However, learning Bayesian networks from discrete or categorical data is particularly challenging, due to the large parameter space and the difficulty in searching for a sparse structure. In this article, we develop a maximum penalized likelihood method to tackle this problem. Instead of the commonly used multinomial distribution, we model the conditional distribution of a node given its parents by multi-logit regression, in which an edge is parameterized by a set of coefficient "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1403.2310","kind":"arxiv","version":4},"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":"1403.2310","created_at":"2026-05-18T00:24:32.163976+00:00"},{"alias_kind":"arxiv_version","alias_value":"1403.2310v4","created_at":"2026-05-18T00:24:32.163976+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1403.2310","created_at":"2026-05-18T00:24:32.163976+00:00"},{"alias_kind":"pith_short_12","alias_value":"VWCU57U4HNPH","created_at":"2026-05-18T12:28:54.890064+00:00"},{"alias_kind":"pith_short_16","alias_value":"VWCU57U4HNPHFX2Y","created_at":"2026-05-18T12:28:54.890064+00:00"},{"alias_kind":"pith_short_8","alias_value":"VWCU57U4","created_at":"2026-05-18T12:28:54.890064+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/VWCU57U4HNPHFX2YVYBZD4CNPJ","json":"https://pith.science/pith/VWCU57U4HNPHFX2YVYBZD4CNPJ.json","graph_json":"https://pith.science/api/pith-number/VWCU57U4HNPHFX2YVYBZD4CNPJ/graph.json","events_json":"https://pith.science/api/pith-number/VWCU57U4HNPHFX2YVYBZD4CNPJ/events.json","paper":"https://pith.science/paper/VWCU57U4"},"agent_actions":{"view_html":"https://pith.science/pith/VWCU57U4HNPHFX2YVYBZD4CNPJ","download_json":"https://pith.science/pith/VWCU57U4HNPHFX2YVYBZD4CNPJ.json","view_paper":"https://pith.science/paper/VWCU57U4","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1403.2310&json=true","fetch_graph":"https://pith.science/api/pith-number/VWCU57U4HNPHFX2YVYBZD4CNPJ/graph.json","fetch_events":"https://pith.science/api/pith-number/VWCU57U4HNPHFX2YVYBZD4CNPJ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/VWCU57U4HNPHFX2YVYBZD4CNPJ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/VWCU57U4HNPHFX2YVYBZD4CNPJ/action/storage_attestation","attest_author":"https://pith.science/pith/VWCU57U4HNPHFX2YVYBZD4CNPJ/action/author_attestation","sign_citation":"https://pith.science/pith/VWCU57U4HNPHFX2YVYBZD4CNPJ/action/citation_signature","submit_replication":"https://pith.science/pith/VWCU57U4HNPHFX2YVYBZD4CNPJ/action/replication_record"}},"created_at":"2026-05-18T00:24:32.163976+00:00","updated_at":"2026-05-18T00:24:32.163976+00:00"}