{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2013:7LUP4OFLSCFFNEPMMLLETUFCSY","short_pith_number":"pith:7LUP4OFL","canonical_record":{"source":{"id":"1301.2311","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2013-01-10T16:26:35Z","cross_cats_sorted":["cs.AI","stat.ML"],"title_canon_sha256":"f57114d15ee0eb2f7fa7723c52bf19ffdba1d5cf5e86d67273fb1cf1d8d26cb0","abstract_canon_sha256":"cd268d0e5804e12e58dd30e934332b4ecf244f537787ba318cb0dd1e3bf0990b"},"schema_version":"1.0"},"canonical_sha256":"fae8fe38ab908a5691ec62d649d0a2962d3e0c9300b17bdaed8f13a8a8cd3c62","source":{"kind":"arxiv","id":"1301.2311","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1301.2311","created_at":"2026-05-18T03:36:45Z"},{"alias_kind":"arxiv_version","alias_value":"1301.2311v1","created_at":"2026-05-18T03:36:45Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1301.2311","created_at":"2026-05-18T03:36:45Z"},{"alias_kind":"pith_short_12","alias_value":"7LUP4OFLSCFF","created_at":"2026-05-18T12:27:36Z"},{"alias_kind":"pith_short_16","alias_value":"7LUP4OFLSCFFNEPM","created_at":"2026-05-18T12:27:36Z"},{"alias_kind":"pith_short_8","alias_value":"7LUP4OFL","created_at":"2026-05-18T12:27:36Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2013:7LUP4OFLSCFFNEPMMLLETUFCSY","target":"record","payload":{"canonical_record":{"source":{"id":"1301.2311","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2013-01-10T16:26:35Z","cross_cats_sorted":["cs.AI","stat.ML"],"title_canon_sha256":"f57114d15ee0eb2f7fa7723c52bf19ffdba1d5cf5e86d67273fb1cf1d8d26cb0","abstract_canon_sha256":"cd268d0e5804e12e58dd30e934332b4ecf244f537787ba318cb0dd1e3bf0990b"},"schema_version":"1.0"},"canonical_sha256":"fae8fe38ab908a5691ec62d649d0a2962d3e0c9300b17bdaed8f13a8a8cd3c62","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:36:45.372387Z","signature_b64":"f4VPiJOkBNaM4yMnzGVKEIOVXyvWkSrWToqdu81UA4DMuuieUaeTWEuiuF9LnepNznZFunkHgwwg66GoVC1bCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"fae8fe38ab908a5691ec62d649d0a2962d3e0c9300b17bdaed8f13a8a8cd3c62","last_reissued_at":"2026-05-18T03:36:45.371790Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:36:45.371790Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1301.2311","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:45Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"DYKzuUG9NNwOC1ovHRwsf90MrDh/XKa6E81C/9TLI08c1pc7vpnrYJxq+CmXfkdTQTRt0raQKGE5bn/J9rk+Ag==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T00:10:25.442871Z"},"content_sha256":"4f969430303e207165483739a54d7fb7dd8045e6e57b986eb364ca6388b15550","schema_version":"1.0","event_id":"sha256:4f969430303e207165483739a54d7fb7dd8045e6e57b986eb364ca6388b15550"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2013:7LUP4OFLSCFFNEPMMLLETUFCSY","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Maximum Likelihood Bounded Tree-Width Markov Networks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI","stat.ML"],"primary_cat":"cs.LG","authors_text":"Nathan Srebro","submitted_at":"2013-01-10T16:26:35Z","abstract_excerpt":"Chow and Liu (1968) studied the problem of learning a maximumlikelihood Markov tree. We generalize their work to more complexMarkov networks by considering the problem of learning a maximumlikelihood Markov network of bounded complexity. We discuss howtree-width is in many ways the appropriate measure of complexity andthus analyze the problem of learning a maximum likelihood Markovnetwork of bounded tree-width.Similar to the work of Chow and Liu, we are able to formalize thelearning problem as a combinatorial optimization problem on graphs. Weshow that learning a maximum likelihood Markov netw"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1301.2311","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:45Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"XZ8UM1t8pvfBcx/sjxGSvxoS3btwPI277fIDhlHtGx3IsTA2QjgooyvWIKzJVFxIzPkV8oAQLN0Y7IbA+DFLCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T00:10:25.443545Z"},"content_sha256":"f0c03668e981020133d9ecea57672d4be11c8ff838872e0df771125dc1ac59bc","schema_version":"1.0","event_id":"sha256:f0c03668e981020133d9ecea57672d4be11c8ff838872e0df771125dc1ac59bc"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/7LUP4OFLSCFFNEPMMLLETUFCSY/bundle.json","state_url":"https://pith.science/pith/7LUP4OFLSCFFNEPMMLLETUFCSY/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/7LUP4OFLSCFFNEPMMLLETUFCSY/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-28T00:10:25Z","links":{"resolver":"https://pith.science/pith/7LUP4OFLSCFFNEPMMLLETUFCSY","bundle":"https://pith.science/pith/7LUP4OFLSCFFNEPMMLLETUFCSY/bundle.json","state":"https://pith.science/pith/7LUP4OFLSCFFNEPMMLLETUFCSY/state.json","well_known_bundle":"https://pith.science/.well-known/pith/7LUP4OFLSCFFNEPMMLLETUFCSY/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2013:7LUP4OFLSCFFNEPMMLLETUFCSY","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":"cd268d0e5804e12e58dd30e934332b4ecf244f537787ba318cb0dd1e3bf0990b","cross_cats_sorted":["cs.AI","stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2013-01-10T16:26:35Z","title_canon_sha256":"f57114d15ee0eb2f7fa7723c52bf19ffdba1d5cf5e86d67273fb1cf1d8d26cb0"},"schema_version":"1.0","source":{"id":"1301.2311","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1301.2311","created_at":"2026-05-18T03:36:45Z"},{"alias_kind":"arxiv_version","alias_value":"1301.2311v1","created_at":"2026-05-18T03:36:45Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1301.2311","created_at":"2026-05-18T03:36:45Z"},{"alias_kind":"pith_short_12","alias_value":"7LUP4OFLSCFF","created_at":"2026-05-18T12:27:36Z"},{"alias_kind":"pith_short_16","alias_value":"7LUP4OFLSCFFNEPM","created_at":"2026-05-18T12:27:36Z"},{"alias_kind":"pith_short_8","alias_value":"7LUP4OFL","created_at":"2026-05-18T12:27:36Z"}],"graph_snapshots":[{"event_id":"sha256:f0c03668e981020133d9ecea57672d4be11c8ff838872e0df771125dc1ac59bc","target":"graph","created_at":"2026-05-18T03:36:45Z","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":"Chow and Liu (1968) studied the problem of learning a maximumlikelihood Markov tree. We generalize their work to more complexMarkov networks by considering the problem of learning a maximumlikelihood Markov network of bounded complexity. We discuss howtree-width is in many ways the appropriate measure of complexity andthus analyze the problem of learning a maximum likelihood Markovnetwork of bounded tree-width.Similar to the work of Chow and Liu, we are able to formalize thelearning problem as a combinatorial optimization problem on graphs. Weshow that learning a maximum likelihood Markov netw","authors_text":"Nathan Srebro","cross_cats":["cs.AI","stat.ML"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2013-01-10T16:26:35Z","title":"Maximum Likelihood Bounded Tree-Width Markov Networks"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1301.2311","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:4f969430303e207165483739a54d7fb7dd8045e6e57b986eb364ca6388b15550","target":"record","created_at":"2026-05-18T03:36:45Z","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":"cd268d0e5804e12e58dd30e934332b4ecf244f537787ba318cb0dd1e3bf0990b","cross_cats_sorted":["cs.AI","stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2013-01-10T16:26:35Z","title_canon_sha256":"f57114d15ee0eb2f7fa7723c52bf19ffdba1d5cf5e86d67273fb1cf1d8d26cb0"},"schema_version":"1.0","source":{"id":"1301.2311","kind":"arxiv","version":1}},"canonical_sha256":"fae8fe38ab908a5691ec62d649d0a2962d3e0c9300b17bdaed8f13a8a8cd3c62","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"fae8fe38ab908a5691ec62d649d0a2962d3e0c9300b17bdaed8f13a8a8cd3c62","first_computed_at":"2026-05-18T03:36:45.371790Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:36:45.371790Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"f4VPiJOkBNaM4yMnzGVKEIOVXyvWkSrWToqdu81UA4DMuuieUaeTWEuiuF9LnepNznZFunkHgwwg66GoVC1bCA==","signature_status":"signed_v1","signed_at":"2026-05-18T03:36:45.372387Z","signed_message":"canonical_sha256_bytes"},"source_id":"1301.2311","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:4f969430303e207165483739a54d7fb7dd8045e6e57b986eb364ca6388b15550","sha256:f0c03668e981020133d9ecea57672d4be11c8ff838872e0df771125dc1ac59bc"],"state_sha256":"15f86a0c50676aa6055c3433ad95b0f82e0c3dc319782b83ff837b143ae926ee"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Sw8HuljpSyGo+0DnrqnHL8SNgqa5GMsIx+u61sxp4rgxf8/fc1YK9wpxUI9x5xYYQgk3NeL0Z1TxNgdhRDanBw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-28T00:10:25.446848Z","bundle_sha256":"15530b22b11df16d46a1cef9abc41db4ab058c7f356aa6bbb614a13874f9571a"}}