{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2012:TVVPXVQS3DEGYCJVYQABNMBDQO","short_pith_number":"pith:TVVPXVQS","canonical_record":{"source":{"id":"1207.4151","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2012-07-11T14:57:38Z","cross_cats_sorted":["cs.DS","stat.ML"],"title_canon_sha256":"39dd018fd909466095044d983849c81137b48923615ab6ec5a878bd3cdcdd556","abstract_canon_sha256":"9205aa9ba1665a7d04861ed2b13397c8ff3f4034a572d1ecff3f432d05e97265"},"schema_version":"1.0"},"canonical_sha256":"9d6afbd612d8c86c0935c40016b02383aad3f353b045ba35cebd3bb3c3ca18b4","source":{"kind":"arxiv","id":"1207.4151","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1207.4151","created_at":"2026-05-18T03:50:47Z"},{"alias_kind":"arxiv_version","alias_value":"1207.4151v1","created_at":"2026-05-18T03:50:47Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1207.4151","created_at":"2026-05-18T03:50:47Z"},{"alias_kind":"pith_short_12","alias_value":"TVVPXVQS3DEG","created_at":"2026-05-18T12:27:23Z"},{"alias_kind":"pith_short_16","alias_value":"TVVPXVQS3DEGYCJV","created_at":"2026-05-18T12:27:23Z"},{"alias_kind":"pith_short_8","alias_value":"TVVPXVQS","created_at":"2026-05-18T12:27:23Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2012:TVVPXVQS3DEGYCJVYQABNMBDQO","target":"record","payload":{"canonical_record":{"source":{"id":"1207.4151","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2012-07-11T14:57:38Z","cross_cats_sorted":["cs.DS","stat.ML"],"title_canon_sha256":"39dd018fd909466095044d983849c81137b48923615ab6ec5a878bd3cdcdd556","abstract_canon_sha256":"9205aa9ba1665a7d04861ed2b13397c8ff3f4034a572d1ecff3f432d05e97265"},"schema_version":"1.0"},"canonical_sha256":"9d6afbd612d8c86c0935c40016b02383aad3f353b045ba35cebd3bb3c3ca18b4","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:50:47.623195Z","signature_b64":"1r8FekbXNk/cO1xCz6GVyj2Nbo2qD+0U3yBl/RocVrk7Z+m0LdxnLkdEuL4RYBbYLP+uQTlggnruMj+IRr7rCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"9d6afbd612d8c86c0935c40016b02383aad3f353b045ba35cebd3bb3c3ca18b4","last_reissued_at":"2026-05-18T03:50:47.622500Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:50:47.622500Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1207.4151","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:50:47Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"6jOtaYcpeAQNIdxhAU/r1oTBraxQqlqn9ptgBfPSoUduU/KYZLIxFxn9Y/cs1fJ3H4OEff0btK4q2NAnbITzBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-04T22:26:49.996541Z"},"content_sha256":"7c1f0b4c9dfa37d3b652c2d93fc6c6d0039907b8055a8de96013267bf51b6977","schema_version":"1.0","event_id":"sha256:7c1f0b4c9dfa37d3b652c2d93fc6c6d0039907b8055a8de96013267bf51b6977"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2012:TVVPXVQS3DEGYCJVYQABNMBDQO","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"PAC-learning bounded tree-width Graphical Models","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS","stat.ML"],"primary_cat":"cs.LG","authors_text":"Jeff A. Bilmes, Mukund Narasimhan","submitted_at":"2012-07-11T14:57:38Z","abstract_excerpt":"We show that the class of strongly connected graphical models with treewidth at most k can be properly efficiently PAC-learnt with respect to the Kullback-Leibler Divergence. Previous approaches to this problem, such as those of Chow ([1]), and Ho gen ([7]) have shown that this class is PAC-learnable by reducing it to a combinatorial optimization problem. However, for k > 1, this problem is NP-complete ([15]), and so unless P=NP, these approaches will take exponential amounts of time. Our approach differs significantly from these, in that it first attempts to find approximate conditional indep"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1207.4151","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:50:47Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"p2+IPIZa28EZhcsu9ayM3b52tM+IWPfJh61r2/KapqdDnhVy8FSKpf1E2wB4QAK8lYWgNV/h8987XsJUyXRpCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-04T22:26:49.997169Z"},"content_sha256":"8ff9de5058992c4fbefb2a0ef16093b65008a8f64b13f7cc747c0c5d3f959c47","schema_version":"1.0","event_id":"sha256:8ff9de5058992c4fbefb2a0ef16093b65008a8f64b13f7cc747c0c5d3f959c47"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/TVVPXVQS3DEGYCJVYQABNMBDQO/bundle.json","state_url":"https://pith.science/pith/TVVPXVQS3DEGYCJVYQABNMBDQO/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/TVVPXVQS3DEGYCJVYQABNMBDQO/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-06-04T22:26:49Z","links":{"resolver":"https://pith.science/pith/TVVPXVQS3DEGYCJVYQABNMBDQO","bundle":"https://pith.science/pith/TVVPXVQS3DEGYCJVYQABNMBDQO/bundle.json","state":"https://pith.science/pith/TVVPXVQS3DEGYCJVYQABNMBDQO/state.json","well_known_bundle":"https://pith.science/.well-known/pith/TVVPXVQS3DEGYCJVYQABNMBDQO/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2012:TVVPXVQS3DEGYCJVYQABNMBDQO","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":"9205aa9ba1665a7d04861ed2b13397c8ff3f4034a572d1ecff3f432d05e97265","cross_cats_sorted":["cs.DS","stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2012-07-11T14:57:38Z","title_canon_sha256":"39dd018fd909466095044d983849c81137b48923615ab6ec5a878bd3cdcdd556"},"schema_version":"1.0","source":{"id":"1207.4151","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1207.4151","created_at":"2026-05-18T03:50:47Z"},{"alias_kind":"arxiv_version","alias_value":"1207.4151v1","created_at":"2026-05-18T03:50:47Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1207.4151","created_at":"2026-05-18T03:50:47Z"},{"alias_kind":"pith_short_12","alias_value":"TVVPXVQS3DEG","created_at":"2026-05-18T12:27:23Z"},{"alias_kind":"pith_short_16","alias_value":"TVVPXVQS3DEGYCJV","created_at":"2026-05-18T12:27:23Z"},{"alias_kind":"pith_short_8","alias_value":"TVVPXVQS","created_at":"2026-05-18T12:27:23Z"}],"graph_snapshots":[{"event_id":"sha256:8ff9de5058992c4fbefb2a0ef16093b65008a8f64b13f7cc747c0c5d3f959c47","target":"graph","created_at":"2026-05-18T03:50:47Z","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 show that the class of strongly connected graphical models with treewidth at most k can be properly efficiently PAC-learnt with respect to the Kullback-Leibler Divergence. Previous approaches to this problem, such as those of Chow ([1]), and Ho gen ([7]) have shown that this class is PAC-learnable by reducing it to a combinatorial optimization problem. However, for k > 1, this problem is NP-complete ([15]), and so unless P=NP, these approaches will take exponential amounts of time. Our approach differs significantly from these, in that it first attempts to find approximate conditional indep","authors_text":"Jeff A. Bilmes, Mukund Narasimhan","cross_cats":["cs.DS","stat.ML"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2012-07-11T14:57:38Z","title":"PAC-learning bounded tree-width Graphical Models"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1207.4151","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:7c1f0b4c9dfa37d3b652c2d93fc6c6d0039907b8055a8de96013267bf51b6977","target":"record","created_at":"2026-05-18T03:50:47Z","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":"9205aa9ba1665a7d04861ed2b13397c8ff3f4034a572d1ecff3f432d05e97265","cross_cats_sorted":["cs.DS","stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2012-07-11T14:57:38Z","title_canon_sha256":"39dd018fd909466095044d983849c81137b48923615ab6ec5a878bd3cdcdd556"},"schema_version":"1.0","source":{"id":"1207.4151","kind":"arxiv","version":1}},"canonical_sha256":"9d6afbd612d8c86c0935c40016b02383aad3f353b045ba35cebd3bb3c3ca18b4","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"9d6afbd612d8c86c0935c40016b02383aad3f353b045ba35cebd3bb3c3ca18b4","first_computed_at":"2026-05-18T03:50:47.622500Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:50:47.622500Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"1r8FekbXNk/cO1xCz6GVyj2Nbo2qD+0U3yBl/RocVrk7Z+m0LdxnLkdEuL4RYBbYLP+uQTlggnruMj+IRr7rCw==","signature_status":"signed_v1","signed_at":"2026-05-18T03:50:47.623195Z","signed_message":"canonical_sha256_bytes"},"source_id":"1207.4151","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:7c1f0b4c9dfa37d3b652c2d93fc6c6d0039907b8055a8de96013267bf51b6977","sha256:8ff9de5058992c4fbefb2a0ef16093b65008a8f64b13f7cc747c0c5d3f959c47"],"state_sha256":"eb948b69861f721daae8bc2d1b341b457a285188320b4b1e3d0b9491afba212f"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"uJqdjWaZPvT0Fal78mCRBNcPgxZG2OozIWKfMzQz6avEWGcTEPh7hF7KmQ2KyzwvQ2dOnMOaEeGFxNCitKyVCg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-04T22:26:50.000436Z","bundle_sha256":"4e49f5842876423e584724bf0cd05d1c74a11aca929aef8adc95b22fba54cd4d"}}