{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2012:GBXVVKWANS75CKYBBJQ2DFVQZI","short_pith_number":"pith:GBXVVKWA","schema_version":"1.0","canonical_sha256":"306f5aaac06cbfd12b010a61a196b0ca1087a605b9c6677c10a2f3ce9e3e5002","source":{"kind":"arxiv","id":"1301.0597","version":1},"attestation_state":"computed","paper":{"title":"Inference with Seperately Specified Sets of Probabilities in Credal Networks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.AI","authors_text":"Fabio Gagliardi Cozman, Jose Carlos Ferreira da Rocha","submitted_at":"2012-12-12T15:58:09Z","abstract_excerpt":"We present new algorithms for inference in  credal networks --- directed acyclic graphs associated with sets of probabilities. Credal networks are here interpreted as encoding strong independence relations among variables. We first present a theory of credal networks based on separately specified sets of probabilities. We also show that inference with polytrees is NP-hard in this setting. We then introduce new techniques that reduce the computational effort demanded by inference, particularly in polytrees, by exploring separability of credal sets."},"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":"1301.0597","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2012-12-12T15:58:09Z","cross_cats_sorted":[],"title_canon_sha256":"b2f4fc388ce2c89f8f42290ce90369c1a0a2f61fe72da11f594d1651bfdaa5e3","abstract_canon_sha256":"a7d72c5d6e2a5935b062f7a5aa9def56f3b4d9565d8109b30f0de8f531c9f1d8"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:37:18.247149Z","signature_b64":"W/hvtpGA5hxPYPtKFdZhmLuaNsBRjf5jVGvwqs3XyBewL4HNmOkLH8WCuSuCRJzAMbzXoHtBVub2nfBZJwJuBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"306f5aaac06cbfd12b010a61a196b0ca1087a605b9c6677c10a2f3ce9e3e5002","last_reissued_at":"2026-05-18T03:37:18.246491Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:37:18.246491Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Inference with Seperately Specified Sets of Probabilities in Credal Networks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.AI","authors_text":"Fabio Gagliardi Cozman, Jose Carlos Ferreira da Rocha","submitted_at":"2012-12-12T15:58:09Z","abstract_excerpt":"We present new algorithms for inference in  credal networks --- directed acyclic graphs associated with sets of probabilities. Credal networks are here interpreted as encoding strong independence relations among variables. We first present a theory of credal networks based on separately specified sets of probabilities. We also show that inference with polytrees is NP-hard in this setting. We then introduce new techniques that reduce the computational effort demanded by inference, particularly in polytrees, by exploring separability of credal sets."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1301.0597","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":"1301.0597","created_at":"2026-05-18T03:37:18.246596+00:00"},{"alias_kind":"arxiv_version","alias_value":"1301.0597v1","created_at":"2026-05-18T03:37:18.246596+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1301.0597","created_at":"2026-05-18T03:37:18.246596+00:00"},{"alias_kind":"pith_short_12","alias_value":"GBXVVKWANS75","created_at":"2026-05-18T12:27:06.952714+00:00"},{"alias_kind":"pith_short_16","alias_value":"GBXVVKWANS75CKYB","created_at":"2026-05-18T12:27:06.952714+00:00"},{"alias_kind":"pith_short_8","alias_value":"GBXVVKWA","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/GBXVVKWANS75CKYBBJQ2DFVQZI","json":"https://pith.science/pith/GBXVVKWANS75CKYBBJQ2DFVQZI.json","graph_json":"https://pith.science/api/pith-number/GBXVVKWANS75CKYBBJQ2DFVQZI/graph.json","events_json":"https://pith.science/api/pith-number/GBXVVKWANS75CKYBBJQ2DFVQZI/events.json","paper":"https://pith.science/paper/GBXVVKWA"},"agent_actions":{"view_html":"https://pith.science/pith/GBXVVKWANS75CKYBBJQ2DFVQZI","download_json":"https://pith.science/pith/GBXVVKWANS75CKYBBJQ2DFVQZI.json","view_paper":"https://pith.science/paper/GBXVVKWA","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1301.0597&json=true","fetch_graph":"https://pith.science/api/pith-number/GBXVVKWANS75CKYBBJQ2DFVQZI/graph.json","fetch_events":"https://pith.science/api/pith-number/GBXVVKWANS75CKYBBJQ2DFVQZI/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/GBXVVKWANS75CKYBBJQ2DFVQZI/action/timestamp_anchor","attest_storage":"https://pith.science/pith/GBXVVKWANS75CKYBBJQ2DFVQZI/action/storage_attestation","attest_author":"https://pith.science/pith/GBXVVKWANS75CKYBBJQ2DFVQZI/action/author_attestation","sign_citation":"https://pith.science/pith/GBXVVKWANS75CKYBBJQ2DFVQZI/action/citation_signature","submit_replication":"https://pith.science/pith/GBXVVKWANS75CKYBBJQ2DFVQZI/action/replication_record"}},"created_at":"2026-05-18T03:37:18.246596+00:00","updated_at":"2026-05-18T03:37:18.246596+00:00"}