{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2013:NWSZJDEO6BFPLOCPNPJMMXBFCR","short_pith_number":"pith:NWSZJDEO","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"},"canonical_sha256":"6da5948c8ef04af5b84f6bd2c65c25146b4fabf7f8beb0647a310cf7b6097652","source":{"kind":"arxiv","id":"1309.6845","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1309.6845","created_at":"2026-05-18T03:12:10Z"},{"alias_kind":"arxiv_version","alias_value":"1309.6845v1","created_at":"2026-05-18T03:12:10Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1309.6845","created_at":"2026-05-18T03:12:10Z"},{"alias_kind":"pith_short_12","alias_value":"NWSZJDEO6BFP","created_at":"2026-05-18T12:27:52Z"},{"alias_kind":"pith_short_16","alias_value":"NWSZJDEO6BFPLOCP","created_at":"2026-05-18T12:27:52Z"},{"alias_kind":"pith_short_8","alias_value":"NWSZJDEO","created_at":"2026-05-18T12:27:52Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2013:NWSZJDEO6BFPLOCPNPJMMXBFCR","target":"record","payload":{"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"},"canonical_sha256":"6da5948c8ef04af5b84f6bd2c65c25146b4fabf7f8beb0647a310cf7b6097652","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"},"source_kind":"arxiv","source_id":"1309.6845","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:12:10Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"7EucQg3/zEVphRqGBgkYql829oD0/Iy8Jnjq7hCUnMu7k744mgHKd+0nj5wv+HkMkg9WtyiGKOZPosAMjS07Aw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-20T20:54:29.484452Z"},"content_sha256":"84728227b8503bf292f81292295c43a12412647a6b419bbde7b64582b10cf547","schema_version":"1.0","event_id":"sha256:84728227b8503bf292f81292295c43a12412647a6b419bbde7b64582b10cf547"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2013:NWSZJDEO6BFPLOCPNPJMMXBFCR","target":"graph","payload":{"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"},"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:12:10Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"1Rt5lq9HBsBRkzMJTYauI1mDfKb815s61Kcu8j051RsE+cKt93b08N9o+B10jXhbcIxcMyjmBpWt0Mq2nxUECw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-20T20:54:29.484791Z"},"content_sha256":"c60f112b87acebcb4dcdf428a0ccb03d7340384d0b05ff7c4a5ac61f23fa2e8d","schema_version":"1.0","event_id":"sha256:c60f112b87acebcb4dcdf428a0ccb03d7340384d0b05ff7c4a5ac61f23fa2e8d"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/NWSZJDEO6BFPLOCPNPJMMXBFCR/bundle.json","state_url":"https://pith.science/pith/NWSZJDEO6BFPLOCPNPJMMXBFCR/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/NWSZJDEO6BFPLOCPNPJMMXBFCR/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-20T20:54:29Z","links":{"resolver":"https://pith.science/pith/NWSZJDEO6BFPLOCPNPJMMXBFCR","bundle":"https://pith.science/pith/NWSZJDEO6BFPLOCPNPJMMXBFCR/bundle.json","state":"https://pith.science/pith/NWSZJDEO6BFPLOCPNPJMMXBFCR/state.json","well_known_bundle":"https://pith.science/.well-known/pith/NWSZJDEO6BFPLOCPNPJMMXBFCR/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2013:NWSZJDEO6BFPLOCPNPJMMXBFCR","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":"ea6faa74b4e39c90d3b5ac006191e6b3fdb72704a2d4ed0a1d614b74a14d5b9b","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2013-09-26T12:44:14Z","title_canon_sha256":"785536ea241b6ce72c218ba6765cfb9e38ce0d9aef599ac48ccbc0fcf6428de3"},"schema_version":"1.0","source":{"id":"1309.6845","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1309.6845","created_at":"2026-05-18T03:12:10Z"},{"alias_kind":"arxiv_version","alias_value":"1309.6845v1","created_at":"2026-05-18T03:12:10Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1309.6845","created_at":"2026-05-18T03:12:10Z"},{"alias_kind":"pith_short_12","alias_value":"NWSZJDEO6BFP","created_at":"2026-05-18T12:27:52Z"},{"alias_kind":"pith_short_16","alias_value":"NWSZJDEO6BFPLOCP","created_at":"2026-05-18T12:27:52Z"},{"alias_kind":"pith_short_8","alias_value":"NWSZJDEO","created_at":"2026-05-18T12:27:52Z"}],"graph_snapshots":[{"event_id":"sha256:c60f112b87acebcb4dcdf428a0ccb03d7340384d0b05ff7c4a5ac61f23fa2e8d","target":"graph","created_at":"2026-05-18T03:12:10Z","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":"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","authors_text":"Alessandro Antonucci, Alessio Benavoli, Cassio Polpo de Campos, Denis D. Maua","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2013-09-26T12:44:14Z","title":"On the Complexity of Strong and Epistemic Credal Networks"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1309.6845","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:84728227b8503bf292f81292295c43a12412647a6b419bbde7b64582b10cf547","target":"record","created_at":"2026-05-18T03:12:10Z","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":"ea6faa74b4e39c90d3b5ac006191e6b3fdb72704a2d4ed0a1d614b74a14d5b9b","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2013-09-26T12:44:14Z","title_canon_sha256":"785536ea241b6ce72c218ba6765cfb9e38ce0d9aef599ac48ccbc0fcf6428de3"},"schema_version":"1.0","source":{"id":"1309.6845","kind":"arxiv","version":1}},"canonical_sha256":"6da5948c8ef04af5b84f6bd2c65c25146b4fabf7f8beb0647a310cf7b6097652","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"6da5948c8ef04af5b84f6bd2c65c25146b4fabf7f8beb0647a310cf7b6097652","first_computed_at":"2026-05-18T03:12:10.126920Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:12:10.126920Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"6ItsSbhMuwmIjTWQSGqPyra8lRtx2/UT8Ved/CUIjPyHpYfD5oAQ5OmziM2WL1sREZqpMdequM+9yO5pm6SADg==","signature_status":"signed_v1","signed_at":"2026-05-18T03:12:10.127691Z","signed_message":"canonical_sha256_bytes"},"source_id":"1309.6845","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:84728227b8503bf292f81292295c43a12412647a6b419bbde7b64582b10cf547","sha256:c60f112b87acebcb4dcdf428a0ccb03d7340384d0b05ff7c4a5ac61f23fa2e8d"],"state_sha256":"be85b20bf689a01e56b7780593da0c303bfcd0adf161d1c17f0cec4cbbff736b"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"9nRssEj+gnMd/J4HKKVCwv8v8ue4fXK3UgkoO9oVgRn6ruHb8ltlRg9dGY1QopqthB/ux876N6L8WACD8yGSCw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-20T20:54:29.486710Z","bundle_sha256":"8722eb9cb69c69937a209558bc5a0a72a5b3f4edb8b14e8a81aff1cf4ad3b56e"}}