{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2013:6P73QUEDWQ2UHX44AXDKEUUAKN","short_pith_number":"pith:6P73QUED","schema_version":"1.0","canonical_sha256":"f3ffb85083b43543df9c05c6a25280537ed62d5eb5eb3a48d0980e419364e9c4","source":{"kind":"arxiv","id":"1301.3862","version":1},"attestation_state":"computed","paper":{"title":"Dependency Networks for Collaborative Filtering and Data Visualization","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.IR","cs.LG"],"primary_cat":"cs.AI","authors_text":"Carl Kadie, Christopher Meek, David Heckerman, David Maxwell Chickering, Robert Rounthwaite","submitted_at":"2013-01-16T15:50:38Z","abstract_excerpt":"We describe a graphical model for probabilistic relationships---an alternative to the Bayesian network---called a dependency network.  The graph of a dependency network, unlike a Bayesian network, is potentially cyclic.  The probability component of a dependency network, like a Bayesian network, is a set of conditional distributions, one for each node given its parents.  We identify several basic properties of this representation and describe a computationally efficient procedure for learning the graph and probability components from data.  We describe the application of this representation to"},"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.3862","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2013-01-16T15:50:38Z","cross_cats_sorted":["cs.IR","cs.LG"],"title_canon_sha256":"41bab91a83194544f36a0ff2e42dfae4e0e33ed8ddf7784525fecd4ec35629ab","abstract_canon_sha256":"325e341b9a14b60866caf0f67c2fcc9f8e7624d8132bc7ba1b65782062e172a8"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:36:15.253134Z","signature_b64":"VtCaRzjSlyXwhNalbheWtgRgnuAqi90fY8/kBHYjyz0JEZN0spNYEu/cmTDwyssMkpbAqs19r62B42y4N/6VCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"f3ffb85083b43543df9c05c6a25280537ed62d5eb5eb3a48d0980e419364e9c4","last_reissued_at":"2026-05-18T03:36:15.252452Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:36:15.252452Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Dependency Networks for Collaborative Filtering and Data Visualization","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.IR","cs.LG"],"primary_cat":"cs.AI","authors_text":"Carl Kadie, Christopher Meek, David Heckerman, David Maxwell Chickering, Robert Rounthwaite","submitted_at":"2013-01-16T15:50:38Z","abstract_excerpt":"We describe a graphical model for probabilistic relationships---an alternative to the Bayesian network---called a dependency network.  The graph of a dependency network, unlike a Bayesian network, is potentially cyclic.  The probability component of a dependency network, like a Bayesian network, is a set of conditional distributions, one for each node given its parents.  We identify several basic properties of this representation and describe a computationally efficient procedure for learning the graph and probability components from data.  We describe the application of this representation to"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1301.3862","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.3862","created_at":"2026-05-18T03:36:15.252590+00:00"},{"alias_kind":"arxiv_version","alias_value":"1301.3862v1","created_at":"2026-05-18T03:36:15.252590+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1301.3862","created_at":"2026-05-18T03:36:15.252590+00:00"},{"alias_kind":"pith_short_12","alias_value":"6P73QUEDWQ2U","created_at":"2026-05-18T12:27:36.564083+00:00"},{"alias_kind":"pith_short_16","alias_value":"6P73QUEDWQ2UHX44","created_at":"2026-05-18T12:27:36.564083+00:00"},{"alias_kind":"pith_short_8","alias_value":"6P73QUED","created_at":"2026-05-18T12:27:36.564083+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2602.16169","citing_title":"Discrete Stochastic Localization for Non-autoregressive Generation","ref_index":7,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/6P73QUEDWQ2UHX44AXDKEUUAKN","json":"https://pith.science/pith/6P73QUEDWQ2UHX44AXDKEUUAKN.json","graph_json":"https://pith.science/api/pith-number/6P73QUEDWQ2UHX44AXDKEUUAKN/graph.json","events_json":"https://pith.science/api/pith-number/6P73QUEDWQ2UHX44AXDKEUUAKN/events.json","paper":"https://pith.science/paper/6P73QUED"},"agent_actions":{"view_html":"https://pith.science/pith/6P73QUEDWQ2UHX44AXDKEUUAKN","download_json":"https://pith.science/pith/6P73QUEDWQ2UHX44AXDKEUUAKN.json","view_paper":"https://pith.science/paper/6P73QUED","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1301.3862&json=true","fetch_graph":"https://pith.science/api/pith-number/6P73QUEDWQ2UHX44AXDKEUUAKN/graph.json","fetch_events":"https://pith.science/api/pith-number/6P73QUEDWQ2UHX44AXDKEUUAKN/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/6P73QUEDWQ2UHX44AXDKEUUAKN/action/timestamp_anchor","attest_storage":"https://pith.science/pith/6P73QUEDWQ2UHX44AXDKEUUAKN/action/storage_attestation","attest_author":"https://pith.science/pith/6P73QUEDWQ2UHX44AXDKEUUAKN/action/author_attestation","sign_citation":"https://pith.science/pith/6P73QUEDWQ2UHX44AXDKEUUAKN/action/citation_signature","submit_replication":"https://pith.science/pith/6P73QUEDWQ2UHX44AXDKEUUAKN/action/replication_record"}},"created_at":"2026-05-18T03:36:15.252590+00:00","updated_at":"2026-05-18T03:36:15.252590+00:00"}