{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2012:TVVPXVQS3DEGYCJVYQABNMBDQO","short_pith_number":"pith:TVVPXVQS","schema_version":"1.0","canonical_sha256":"9d6afbd612d8c86c0935c40016b02383aad3f353b045ba35cebd3bb3c3ca18b4","source":{"kind":"arxiv","id":"1207.4151","version":1},"attestation_state":"computed","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"},"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":"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"},"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"},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1207.4151","created_at":"2026-05-18T03:50:47.622603+00:00"},{"alias_kind":"arxiv_version","alias_value":"1207.4151v1","created_at":"2026-05-18T03:50:47.622603+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1207.4151","created_at":"2026-05-18T03:50:47.622603+00:00"},{"alias_kind":"pith_short_12","alias_value":"TVVPXVQS3DEG","created_at":"2026-05-18T12:27:23.164592+00:00"},{"alias_kind":"pith_short_16","alias_value":"TVVPXVQS3DEGYCJV","created_at":"2026-05-18T12:27:23.164592+00:00"},{"alias_kind":"pith_short_8","alias_value":"TVVPXVQS","created_at":"2026-05-18T12:27:23.164592+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/TVVPXVQS3DEGYCJVYQABNMBDQO","json":"https://pith.science/pith/TVVPXVQS3DEGYCJVYQABNMBDQO.json","graph_json":"https://pith.science/api/pith-number/TVVPXVQS3DEGYCJVYQABNMBDQO/graph.json","events_json":"https://pith.science/api/pith-number/TVVPXVQS3DEGYCJVYQABNMBDQO/events.json","paper":"https://pith.science/paper/TVVPXVQS"},"agent_actions":{"view_html":"https://pith.science/pith/TVVPXVQS3DEGYCJVYQABNMBDQO","download_json":"https://pith.science/pith/TVVPXVQS3DEGYCJVYQABNMBDQO.json","view_paper":"https://pith.science/paper/TVVPXVQS","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1207.4151&json=true","fetch_graph":"https://pith.science/api/pith-number/TVVPXVQS3DEGYCJVYQABNMBDQO/graph.json","fetch_events":"https://pith.science/api/pith-number/TVVPXVQS3DEGYCJVYQABNMBDQO/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/TVVPXVQS3DEGYCJVYQABNMBDQO/action/timestamp_anchor","attest_storage":"https://pith.science/pith/TVVPXVQS3DEGYCJVYQABNMBDQO/action/storage_attestation","attest_author":"https://pith.science/pith/TVVPXVQS3DEGYCJVYQABNMBDQO/action/author_attestation","sign_citation":"https://pith.science/pith/TVVPXVQS3DEGYCJVYQABNMBDQO/action/citation_signature","submit_replication":"https://pith.science/pith/TVVPXVQS3DEGYCJVYQABNMBDQO/action/replication_record"}},"created_at":"2026-05-18T03:50:47.622603+00:00","updated_at":"2026-05-18T03:50:47.622603+00:00"}