{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:ATDFCRG6V2CHXRG3YHALACHDZM","short_pith_number":"pith:ATDFCRG6","schema_version":"1.0","canonical_sha256":"04c65144deae847bc4dbc1c0b008e3cb07f52dc91ab3149b10cd5b5af61c1b2b","source":{"kind":"arxiv","id":"1703.06045","version":5},"attestation_state":"computed","paper":{"title":"Approximation Complexity of Maximum A Posteriori Inference in Sum-Product Networks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.AI","authors_text":"Cassio P. de Campos, Denis D. Mau\\'a, Diarmaid Conaty","submitted_at":"2017-03-17T15:00:03Z","abstract_excerpt":"We discuss the computational complexity of approximating maximum a posteriori inference in sum-product networks. We first show NP-hardness in trees of height two by a reduction from maximum independent set; this implies non-approximability within a sublinear factor. We show that this is a tight bound, as we can find an approximation within a linear factor in networks of height two. We then show that, in trees of height three, it is NP-hard to approximate the problem within a factor $2^{f(n)}$ for any sublinear function $f$ of the size of the input $n$. Again, this bound is tight, as we prove t"},"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":"1703.06045","kind":"arxiv","version":5},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2017-03-17T15:00:03Z","cross_cats_sorted":[],"title_canon_sha256":"2d641f4d8a306e697522f964711afe9089dfca09a1c7596693dd1ec3dac524fa","abstract_canon_sha256":"3682854949a46c95ef17eb04da6247587d8c285296a4e77e8420abe087390673"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:36:03.431448Z","signature_b64":"FqeA5RFjglmsw9Hhi4sIEgYkjh7W1WrQKbwjCjCsIjJJkNZEbfIoVZoVMOxjSqi85EfbZ15Pr1sTST3e0xe8CQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"04c65144deae847bc4dbc1c0b008e3cb07f52dc91ab3149b10cd5b5af61c1b2b","last_reissued_at":"2026-05-18T00:36:03.431008Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:36:03.431008Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Approximation Complexity of Maximum A Posteriori Inference in Sum-Product Networks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.AI","authors_text":"Cassio P. de Campos, Denis D. Mau\\'a, Diarmaid Conaty","submitted_at":"2017-03-17T15:00:03Z","abstract_excerpt":"We discuss the computational complexity of approximating maximum a posteriori inference in sum-product networks. We first show NP-hardness in trees of height two by a reduction from maximum independent set; this implies non-approximability within a sublinear factor. We show that this is a tight bound, as we can find an approximation within a linear factor in networks of height two. We then show that, in trees of height three, it is NP-hard to approximate the problem within a factor $2^{f(n)}$ for any sublinear function $f$ of the size of the input $n$. Again, this bound is tight, as we prove t"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1703.06045","kind":"arxiv","version":5},"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":"1703.06045","created_at":"2026-05-18T00:36:03.431088+00:00"},{"alias_kind":"arxiv_version","alias_value":"1703.06045v5","created_at":"2026-05-18T00:36:03.431088+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1703.06045","created_at":"2026-05-18T00:36:03.431088+00:00"},{"alias_kind":"pith_short_12","alias_value":"ATDFCRG6V2CH","created_at":"2026-05-18T12:31:08.081275+00:00"},{"alias_kind":"pith_short_16","alias_value":"ATDFCRG6V2CHXRG3","created_at":"2026-05-18T12:31:08.081275+00:00"},{"alias_kind":"pith_short_8","alias_value":"ATDFCRG6","created_at":"2026-05-18T12:31:08.081275+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/ATDFCRG6V2CHXRG3YHALACHDZM","json":"https://pith.science/pith/ATDFCRG6V2CHXRG3YHALACHDZM.json","graph_json":"https://pith.science/api/pith-number/ATDFCRG6V2CHXRG3YHALACHDZM/graph.json","events_json":"https://pith.science/api/pith-number/ATDFCRG6V2CHXRG3YHALACHDZM/events.json","paper":"https://pith.science/paper/ATDFCRG6"},"agent_actions":{"view_html":"https://pith.science/pith/ATDFCRG6V2CHXRG3YHALACHDZM","download_json":"https://pith.science/pith/ATDFCRG6V2CHXRG3YHALACHDZM.json","view_paper":"https://pith.science/paper/ATDFCRG6","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1703.06045&json=true","fetch_graph":"https://pith.science/api/pith-number/ATDFCRG6V2CHXRG3YHALACHDZM/graph.json","fetch_events":"https://pith.science/api/pith-number/ATDFCRG6V2CHXRG3YHALACHDZM/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/ATDFCRG6V2CHXRG3YHALACHDZM/action/timestamp_anchor","attest_storage":"https://pith.science/pith/ATDFCRG6V2CHXRG3YHALACHDZM/action/storage_attestation","attest_author":"https://pith.science/pith/ATDFCRG6V2CHXRG3YHALACHDZM/action/author_attestation","sign_citation":"https://pith.science/pith/ATDFCRG6V2CHXRG3YHALACHDZM/action/citation_signature","submit_replication":"https://pith.science/pith/ATDFCRG6V2CHXRG3YHALACHDZM/action/replication_record"}},"created_at":"2026-05-18T00:36:03.431088+00:00","updated_at":"2026-05-18T00:36:03.431088+00:00"}