{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2012:FN633W4WTFPW26IO4LVRJ2UHHV","short_pith_number":"pith:FN633W4W","schema_version":"1.0","canonical_sha256":"2b7dbddb96995f6d790ee2eb14ea873d78478acbb73f2b89d36e7f7248039c21","source":{"kind":"arxiv","id":"1208.1692","version":2},"attestation_state":"computed","paper":{"title":"On Finding Optimal Polytrees","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI","cs.CC"],"primary_cat":"cs.DS","authors_text":"Mathieu Liedloff, Mikko Koivisto, Sebastian Ordyniak, Serge Gaspers, Stefan Szeider","submitted_at":"2012-08-08T15:32:42Z","abstract_excerpt":"Inferring probabilistic networks from data is a notoriously difficult task. Under various goodness-of-fit measures, finding an optimal network is NP-hard, even if restricted to polytrees of bounded in-degree. Polynomial-time algorithms are known only for rare special cases, perhaps most notably for branchings, that is, polytrees in which the in-degree of every node is at most one. Here, we study the complexity of finding an optimal polytree that can be turned into a branching by deleting some number of arcs or nodes, treated as a parameter.\n  We show that the problem can be solved via a matroi"},"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":"1208.1692","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2012-08-08T15:32:42Z","cross_cats_sorted":["cs.AI","cs.CC"],"title_canon_sha256":"dcddc8c1c2bf9e0b772d9fd5c597414c9c4812f7f7bed1e2c285f99bde7fb158","abstract_canon_sha256":"8863eae01fc824885d688f79b59838214ba4e83474486fbe9f553c7a5795cd6c"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:48:45.965240Z","signature_b64":"j+F10EeqeO1kIKjrcQDp1Fq2fgU8lM8Hora+/mt4sdiNdk2YQSxtbhhwtXSQZcdnWc4niNRcJFg5XP7IK6SiAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"2b7dbddb96995f6d790ee2eb14ea873d78478acbb73f2b89d36e7f7248039c21","last_reissued_at":"2026-05-18T03:48:45.964859Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:48:45.964859Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"On Finding Optimal Polytrees","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI","cs.CC"],"primary_cat":"cs.DS","authors_text":"Mathieu Liedloff, Mikko Koivisto, Sebastian Ordyniak, Serge Gaspers, Stefan Szeider","submitted_at":"2012-08-08T15:32:42Z","abstract_excerpt":"Inferring probabilistic networks from data is a notoriously difficult task. Under various goodness-of-fit measures, finding an optimal network is NP-hard, even if restricted to polytrees of bounded in-degree. Polynomial-time algorithms are known only for rare special cases, perhaps most notably for branchings, that is, polytrees in which the in-degree of every node is at most one. Here, we study the complexity of finding an optimal polytree that can be turned into a branching by deleting some number of arcs or nodes, treated as a parameter.\n  We show that the problem can be solved via a matroi"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1208.1692","kind":"arxiv","version":2},"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":"1208.1692","created_at":"2026-05-18T03:48:45.964913+00:00"},{"alias_kind":"arxiv_version","alias_value":"1208.1692v2","created_at":"2026-05-18T03:48:45.964913+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1208.1692","created_at":"2026-05-18T03:48:45.964913+00:00"},{"alias_kind":"pith_short_12","alias_value":"FN633W4WTFPW","created_at":"2026-05-18T12:27:06.952714+00:00"},{"alias_kind":"pith_short_16","alias_value":"FN633W4WTFPW26IO","created_at":"2026-05-18T12:27:06.952714+00:00"},{"alias_kind":"pith_short_8","alias_value":"FN633W4W","created_at":"2026-05-18T12:27:06.952714+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/FN633W4WTFPW26IO4LVRJ2UHHV","json":"https://pith.science/pith/FN633W4WTFPW26IO4LVRJ2UHHV.json","graph_json":"https://pith.science/api/pith-number/FN633W4WTFPW26IO4LVRJ2UHHV/graph.json","events_json":"https://pith.science/api/pith-number/FN633W4WTFPW26IO4LVRJ2UHHV/events.json","paper":"https://pith.science/paper/FN633W4W"},"agent_actions":{"view_html":"https://pith.science/pith/FN633W4WTFPW26IO4LVRJ2UHHV","download_json":"https://pith.science/pith/FN633W4WTFPW26IO4LVRJ2UHHV.json","view_paper":"https://pith.science/paper/FN633W4W","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1208.1692&json=true","fetch_graph":"https://pith.science/api/pith-number/FN633W4WTFPW26IO4LVRJ2UHHV/graph.json","fetch_events":"https://pith.science/api/pith-number/FN633W4WTFPW26IO4LVRJ2UHHV/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/FN633W4WTFPW26IO4LVRJ2UHHV/action/timestamp_anchor","attest_storage":"https://pith.science/pith/FN633W4WTFPW26IO4LVRJ2UHHV/action/storage_attestation","attest_author":"https://pith.science/pith/FN633W4WTFPW26IO4LVRJ2UHHV/action/author_attestation","sign_citation":"https://pith.science/pith/FN633W4WTFPW26IO4LVRJ2UHHV/action/citation_signature","submit_replication":"https://pith.science/pith/FN633W4WTFPW26IO4LVRJ2UHHV/action/replication_record"}},"created_at":"2026-05-18T03:48:45.964913+00:00","updated_at":"2026-05-18T03:48:45.964913+00:00"}