{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2013:NWSZJDEO6BFPLOCPNPJMMXBFCR","short_pith_number":"pith:NWSZJDEO","schema_version":"1.0","canonical_sha256":"6da5948c8ef04af5b84f6bd2c65c25146b4fabf7f8beb0647a310cf7b6097652","source":{"kind":"arxiv","id":"1309.6845","version":1},"attestation_state":"computed","paper":{"title":"On the Complexity of Strong and Epistemic Credal Networks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.AI","authors_text":"Alessandro Antonucci, Alessio Benavoli, Cassio Polpo de Campos, Denis D. Maua","submitted_at":"2013-09-26T12:44:14Z","abstract_excerpt":"Credal networks are graph-based statistical models whose parameters take values in a set, instead of being sharply specified as in traditional statistical models (e.g., Bayesian networks). The computational complexity of inferences on such models depends on the irrelevance/independence concept adopted. In this paper, we study inferential complexity under the concepts of epistemic irrelevance and strong independence. We show that inferences under strong independence are NP-hard even in trees with ternary variables. We prove that under epistemic irrelevance the polynomial time complexity of infe"},"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":"1309.6845","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2013-09-26T12:44:14Z","cross_cats_sorted":[],"title_canon_sha256":"785536ea241b6ce72c218ba6765cfb9e38ce0d9aef599ac48ccbc0fcf6428de3","abstract_canon_sha256":"ea6faa74b4e39c90d3b5ac006191e6b3fdb72704a2d4ed0a1d614b74a14d5b9b"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:12:10.127691Z","signature_b64":"6ItsSbhMuwmIjTWQSGqPyra8lRtx2/UT8Ved/CUIjPyHpYfD5oAQ5OmziM2WL1sREZqpMdequM+9yO5pm6SADg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"6da5948c8ef04af5b84f6bd2c65c25146b4fabf7f8beb0647a310cf7b6097652","last_reissued_at":"2026-05-18T03:12:10.126920Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:12:10.126920Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"On the Complexity of Strong and Epistemic Credal Networks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.AI","authors_text":"Alessandro Antonucci, Alessio Benavoli, Cassio Polpo de Campos, Denis D. Maua","submitted_at":"2013-09-26T12:44:14Z","abstract_excerpt":"Credal networks are graph-based statistical models whose parameters take values in a set, instead of being sharply specified as in traditional statistical models (e.g., Bayesian networks). The computational complexity of inferences on such models depends on the irrelevance/independence concept adopted. In this paper, we study inferential complexity under the concepts of epistemic irrelevance and strong independence. We show that inferences under strong independence are NP-hard even in trees with ternary variables. We prove that under epistemic irrelevance the polynomial time complexity of infe"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1309.6845","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":"1309.6845","created_at":"2026-05-18T03:12:10.127055+00:00"},{"alias_kind":"arxiv_version","alias_value":"1309.6845v1","created_at":"2026-05-18T03:12:10.127055+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1309.6845","created_at":"2026-05-18T03:12:10.127055+00:00"},{"alias_kind":"pith_short_12","alias_value":"NWSZJDEO6BFP","created_at":"2026-05-18T12:27:52.871228+00:00"},{"alias_kind":"pith_short_16","alias_value":"NWSZJDEO6BFPLOCP","created_at":"2026-05-18T12:27:52.871228+00:00"},{"alias_kind":"pith_short_8","alias_value":"NWSZJDEO","created_at":"2026-05-18T12:27:52.871228+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/NWSZJDEO6BFPLOCPNPJMMXBFCR","json":"https://pith.science/pith/NWSZJDEO6BFPLOCPNPJMMXBFCR.json","graph_json":"https://pith.science/api/pith-number/NWSZJDEO6BFPLOCPNPJMMXBFCR/graph.json","events_json":"https://pith.science/api/pith-number/NWSZJDEO6BFPLOCPNPJMMXBFCR/events.json","paper":"https://pith.science/paper/NWSZJDEO"},"agent_actions":{"view_html":"https://pith.science/pith/NWSZJDEO6BFPLOCPNPJMMXBFCR","download_json":"https://pith.science/pith/NWSZJDEO6BFPLOCPNPJMMXBFCR.json","view_paper":"https://pith.science/paper/NWSZJDEO","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1309.6845&json=true","fetch_graph":"https://pith.science/api/pith-number/NWSZJDEO6BFPLOCPNPJMMXBFCR/graph.json","fetch_events":"https://pith.science/api/pith-number/NWSZJDEO6BFPLOCPNPJMMXBFCR/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/NWSZJDEO6BFPLOCPNPJMMXBFCR/action/timestamp_anchor","attest_storage":"https://pith.science/pith/NWSZJDEO6BFPLOCPNPJMMXBFCR/action/storage_attestation","attest_author":"https://pith.science/pith/NWSZJDEO6BFPLOCPNPJMMXBFCR/action/author_attestation","sign_citation":"https://pith.science/pith/NWSZJDEO6BFPLOCPNPJMMXBFCR/action/citation_signature","submit_replication":"https://pith.science/pith/NWSZJDEO6BFPLOCPNPJMMXBFCR/action/replication_record"}},"created_at":"2026-05-18T03:12:10.127055+00:00","updated_at":"2026-05-18T03:12:10.127055+00:00"}