{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2012:GBXVVKWANS75CKYBBJQ2DFVQZI","short_pith_number":"pith:GBXVVKWA","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"},"canonical_sha256":"306f5aaac06cbfd12b010a61a196b0ca1087a605b9c6677c10a2f3ce9e3e5002","source":{"kind":"arxiv","id":"1301.0597","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1301.0597","created_at":"2026-05-18T03:37:18Z"},{"alias_kind":"arxiv_version","alias_value":"1301.0597v1","created_at":"2026-05-18T03:37:18Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1301.0597","created_at":"2026-05-18T03:37:18Z"},{"alias_kind":"pith_short_12","alias_value":"GBXVVKWANS75","created_at":"2026-05-18T12:27:06Z"},{"alias_kind":"pith_short_16","alias_value":"GBXVVKWANS75CKYB","created_at":"2026-05-18T12:27:06Z"},{"alias_kind":"pith_short_8","alias_value":"GBXVVKWA","created_at":"2026-05-18T12:27:06Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2012:GBXVVKWANS75CKYBBJQ2DFVQZI","target":"record","payload":{"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"},"canonical_sha256":"306f5aaac06cbfd12b010a61a196b0ca1087a605b9c6677c10a2f3ce9e3e5002","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"},"source_kind":"arxiv","source_id":"1301.0597","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:37:18Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"rtSYso3jnIAkaViquUvBpzCT7/dLzQhdvWBwdtavftwfO6NhG91BzvgwEeShig9oGTSwwLroKWOhe6Eyx3sADw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T11:06:32.033154Z"},"content_sha256":"69e454b93a21837986b0deb06fb57bbefa5b3f011f70aa40f5ff4ad3191407e4","schema_version":"1.0","event_id":"sha256:69e454b93a21837986b0deb06fb57bbefa5b3f011f70aa40f5ff4ad3191407e4"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2012:GBXVVKWANS75CKYBBJQ2DFVQZI","target":"graph","payload":{"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"},"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:37:18Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"oySX27IIX3IOnM0jEB8Z7fZx/C2/wTFR1TjsWqKQjkeQ+G0Ol+RMlloJDUcpymF2ZkNAzMdz3mbe08sdVYy8CQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T11:06:32.033530Z"},"content_sha256":"e4901206f02dfbd4b26dd1405f57a3cc8477b7d2f0eb5b76e1d602d373fe547a","schema_version":"1.0","event_id":"sha256:e4901206f02dfbd4b26dd1405f57a3cc8477b7d2f0eb5b76e1d602d373fe547a"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/GBXVVKWANS75CKYBBJQ2DFVQZI/bundle.json","state_url":"https://pith.science/pith/GBXVVKWANS75CKYBBJQ2DFVQZI/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/GBXVVKWANS75CKYBBJQ2DFVQZI/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-05-31T11:06:32Z","links":{"resolver":"https://pith.science/pith/GBXVVKWANS75CKYBBJQ2DFVQZI","bundle":"https://pith.science/pith/GBXVVKWANS75CKYBBJQ2DFVQZI/bundle.json","state":"https://pith.science/pith/GBXVVKWANS75CKYBBJQ2DFVQZI/state.json","well_known_bundle":"https://pith.science/.well-known/pith/GBXVVKWANS75CKYBBJQ2DFVQZI/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2012:GBXVVKWANS75CKYBBJQ2DFVQZI","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":"a7d72c5d6e2a5935b062f7a5aa9def56f3b4d9565d8109b30f0de8f531c9f1d8","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2012-12-12T15:58:09Z","title_canon_sha256":"b2f4fc388ce2c89f8f42290ce90369c1a0a2f61fe72da11f594d1651bfdaa5e3"},"schema_version":"1.0","source":{"id":"1301.0597","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1301.0597","created_at":"2026-05-18T03:37:18Z"},{"alias_kind":"arxiv_version","alias_value":"1301.0597v1","created_at":"2026-05-18T03:37:18Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1301.0597","created_at":"2026-05-18T03:37:18Z"},{"alias_kind":"pith_short_12","alias_value":"GBXVVKWANS75","created_at":"2026-05-18T12:27:06Z"},{"alias_kind":"pith_short_16","alias_value":"GBXVVKWANS75CKYB","created_at":"2026-05-18T12:27:06Z"},{"alias_kind":"pith_short_8","alias_value":"GBXVVKWA","created_at":"2026-05-18T12:27:06Z"}],"graph_snapshots":[{"event_id":"sha256:e4901206f02dfbd4b26dd1405f57a3cc8477b7d2f0eb5b76e1d602d373fe547a","target":"graph","created_at":"2026-05-18T03:37:18Z","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":"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.","authors_text":"Fabio Gagliardi Cozman, Jose Carlos Ferreira da Rocha","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2012-12-12T15:58:09Z","title":"Inference with Seperately Specified Sets of Probabilities in Credal Networks"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1301.0597","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:69e454b93a21837986b0deb06fb57bbefa5b3f011f70aa40f5ff4ad3191407e4","target":"record","created_at":"2026-05-18T03:37:18Z","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":"a7d72c5d6e2a5935b062f7a5aa9def56f3b4d9565d8109b30f0de8f531c9f1d8","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2012-12-12T15:58:09Z","title_canon_sha256":"b2f4fc388ce2c89f8f42290ce90369c1a0a2f61fe72da11f594d1651bfdaa5e3"},"schema_version":"1.0","source":{"id":"1301.0597","kind":"arxiv","version":1}},"canonical_sha256":"306f5aaac06cbfd12b010a61a196b0ca1087a605b9c6677c10a2f3ce9e3e5002","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"306f5aaac06cbfd12b010a61a196b0ca1087a605b9c6677c10a2f3ce9e3e5002","first_computed_at":"2026-05-18T03:37:18.246491Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:37:18.246491Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"W/hvtpGA5hxPYPtKFdZhmLuaNsBRjf5jVGvwqs3XyBewL4HNmOkLH8WCuSuCRJzAMbzXoHtBVub2nfBZJwJuBA==","signature_status":"signed_v1","signed_at":"2026-05-18T03:37:18.247149Z","signed_message":"canonical_sha256_bytes"},"source_id":"1301.0597","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:69e454b93a21837986b0deb06fb57bbefa5b3f011f70aa40f5ff4ad3191407e4","sha256:e4901206f02dfbd4b26dd1405f57a3cc8477b7d2f0eb5b76e1d602d373fe547a"],"state_sha256":"58b7438285e2374fc0c0884f3068cfcf677e5ec1782260294258270cf460a21b"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"3UCjOTNrm4D0QSMMbPLP8wDF4Mq5s3A5iwShvr3vDixwjdC5wFl17Td1cAW5mQ8F28S0LzGUBSX2pdRT0ravAw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-31T11:06:32.035585Z","bundle_sha256":"72f658826c0e113846ef8605d77a22997b567dac0a38bb31c2e3c5b5aeab9712"}}