{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2013:6P73QUEDWQ2UHX44AXDKEUUAKN","short_pith_number":"pith:6P73QUED","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"},"canonical_sha256":"f3ffb85083b43543df9c05c6a25280537ed62d5eb5eb3a48d0980e419364e9c4","source":{"kind":"arxiv","id":"1301.3862","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1301.3862","created_at":"2026-05-18T03:36:15Z"},{"alias_kind":"arxiv_version","alias_value":"1301.3862v1","created_at":"2026-05-18T03:36:15Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1301.3862","created_at":"2026-05-18T03:36:15Z"},{"alias_kind":"pith_short_12","alias_value":"6P73QUEDWQ2U","created_at":"2026-05-18T12:27:36Z"},{"alias_kind":"pith_short_16","alias_value":"6P73QUEDWQ2UHX44","created_at":"2026-05-18T12:27:36Z"},{"alias_kind":"pith_short_8","alias_value":"6P73QUED","created_at":"2026-05-18T12:27:36Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2013:6P73QUEDWQ2UHX44AXDKEUUAKN","target":"record","payload":{"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"},"canonical_sha256":"f3ffb85083b43543df9c05c6a25280537ed62d5eb5eb3a48d0980e419364e9c4","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"},"source_kind":"arxiv","source_id":"1301.3862","source_version":1,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T03:36:15Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"3P2Tonqu2bgirH8WAq1lIkcFwAMZnl3nmN6WZJRsZzL6XnowMyr3nrHdNeYNqBj9N6gd62Tp1bI4QeCM6XP6CA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T01:19:35.432194Z"},"content_sha256":"952679bad76fdedb9edce4b6b23227b842a29de65c4a29ea24817f9468b59224","schema_version":"1.0","event_id":"sha256:952679bad76fdedb9edce4b6b23227b842a29de65c4a29ea24817f9468b59224"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2013:6P73QUEDWQ2UHX44AXDKEUUAKN","target":"graph","payload":{"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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T03:36:15Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"3PLj/A+W9nNPIIDfBBUsy4YwvKKeLCHySlCCgioU3Xbr5HG4HtHtkwxjVZwUTJiU0I+VyYvHrRugFHpi/eLzDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T01:19:35.432886Z"},"content_sha256":"39da699078e9e7ef335c906d4aca8c9b9706eab78aaa223b6bc482e092c81e60","schema_version":"1.0","event_id":"sha256:39da699078e9e7ef335c906d4aca8c9b9706eab78aaa223b6bc482e092c81e60"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/6P73QUEDWQ2UHX44AXDKEUUAKN/bundle.json","state_url":"https://pith.science/pith/6P73QUEDWQ2UHX44AXDKEUUAKN/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/6P73QUEDWQ2UHX44AXDKEUUAKN/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-05-27T01:19:35Z","links":{"resolver":"https://pith.science/pith/6P73QUEDWQ2UHX44AXDKEUUAKN","bundle":"https://pith.science/pith/6P73QUEDWQ2UHX44AXDKEUUAKN/bundle.json","state":"https://pith.science/pith/6P73QUEDWQ2UHX44AXDKEUUAKN/state.json","well_known_bundle":"https://pith.science/.well-known/pith/6P73QUEDWQ2UHX44AXDKEUUAKN/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2013:6P73QUEDWQ2UHX44AXDKEUUAKN","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"325e341b9a14b60866caf0f67c2fcc9f8e7624d8132bc7ba1b65782062e172a8","cross_cats_sorted":["cs.IR","cs.LG"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2013-01-16T15:50:38Z","title_canon_sha256":"41bab91a83194544f36a0ff2e42dfae4e0e33ed8ddf7784525fecd4ec35629ab"},"schema_version":"1.0","source":{"id":"1301.3862","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1301.3862","created_at":"2026-05-18T03:36:15Z"},{"alias_kind":"arxiv_version","alias_value":"1301.3862v1","created_at":"2026-05-18T03:36:15Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1301.3862","created_at":"2026-05-18T03:36:15Z"},{"alias_kind":"pith_short_12","alias_value":"6P73QUEDWQ2U","created_at":"2026-05-18T12:27:36Z"},{"alias_kind":"pith_short_16","alias_value":"6P73QUEDWQ2UHX44","created_at":"2026-05-18T12:27:36Z"},{"alias_kind":"pith_short_8","alias_value":"6P73QUED","created_at":"2026-05-18T12:27:36Z"}],"graph_snapshots":[{"event_id":"sha256:39da699078e9e7ef335c906d4aca8c9b9706eab78aaa223b6bc482e092c81e60","target":"graph","created_at":"2026-05-18T03:36:15Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"paper":{"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","authors_text":"Carl Kadie, Christopher Meek, David Heckerman, David Maxwell Chickering, Robert Rounthwaite","cross_cats":["cs.IR","cs.LG"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2013-01-16T15:50:38Z","title":"Dependency Networks for Collaborative Filtering and Data Visualization"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1301.3862","kind":"arxiv","version":1},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:952679bad76fdedb9edce4b6b23227b842a29de65c4a29ea24817f9468b59224","target":"record","created_at":"2026-05-18T03:36:15Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"325e341b9a14b60866caf0f67c2fcc9f8e7624d8132bc7ba1b65782062e172a8","cross_cats_sorted":["cs.IR","cs.LG"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2013-01-16T15:50:38Z","title_canon_sha256":"41bab91a83194544f36a0ff2e42dfae4e0e33ed8ddf7784525fecd4ec35629ab"},"schema_version":"1.0","source":{"id":"1301.3862","kind":"arxiv","version":1}},"canonical_sha256":"f3ffb85083b43543df9c05c6a25280537ed62d5eb5eb3a48d0980e419364e9c4","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"f3ffb85083b43543df9c05c6a25280537ed62d5eb5eb3a48d0980e419364e9c4","first_computed_at":"2026-05-18T03:36:15.252452Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:36:15.252452Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"VtCaRzjSlyXwhNalbheWtgRgnuAqi90fY8/kBHYjyz0JEZN0spNYEu/cmTDwyssMkpbAqs19r62B42y4N/6VCg==","signature_status":"signed_v1","signed_at":"2026-05-18T03:36:15.253134Z","signed_message":"canonical_sha256_bytes"},"source_id":"1301.3862","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:952679bad76fdedb9edce4b6b23227b842a29de65c4a29ea24817f9468b59224","sha256:39da699078e9e7ef335c906d4aca8c9b9706eab78aaa223b6bc482e092c81e60"],"state_sha256":"f8f34357f6b4fa7d7bd6b78cbc19e00f7f3374f480c614a16dde305f7aa2de65"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"g82zL/HH6MP6pkYqRpExVveJMwF8BeycU0gsH1de2c2CIw1IpJ4NE4aVFnqtBi6oVPa+mxgGT1d8/9h9bh29AQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-27T01:19:35.436480Z","bundle_sha256":"d2a124eb133cd37735d9be8440227f247c9c6aa923a6c69334806d92b5818a6f"}}