{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2012:6A6MRGTJMMRPR5XUPS5JRRCL4C","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":"b621c5ae16138d5ab469a8d71bac6717c8093a76fb6936d850e4893829057396","cross_cats_sorted":["stat.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2012-10-19T15:05:11Z","title_canon_sha256":"7955625368c664980a4db83cc9435b8c7e7e7b714a3472126e8bdb0659da0c76"},"schema_version":"1.0","source":{"id":"1212.2458","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1212.2458","created_at":"2026-05-18T03:38:04Z"},{"alias_kind":"arxiv_version","alias_value":"1212.2458v1","created_at":"2026-05-18T03:38:04Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1212.2458","created_at":"2026-05-18T03:38:04Z"},{"alias_kind":"pith_short_12","alias_value":"6A6MRGTJMMRP","created_at":"2026-05-18T12:26:56Z"},{"alias_kind":"pith_short_16","alias_value":"6A6MRGTJMMRPR5XU","created_at":"2026-05-18T12:26:56Z"},{"alias_kind":"pith_short_8","alias_value":"6A6MRGTJ","created_at":"2026-05-18T12:26:56Z"}],"graph_snapshots":[{"event_id":"sha256:16e53a9acf28e566071574a8a733dbe04b06da798ba4acf60b3d487c2f760ac3","target":"graph","created_at":"2026-05-18T03:38:04Z","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":"Inferences in directed acyclic graphs associated with probability sets and     probability intervals are NP-hard, even for polytrees. In this paper we focus     on such inferences, and propose: 1) a substantial improvement on Tessems A / R algorithm FOR polytrees WITH probability intervals; 2)     a new algorithm FOR     direction - based local search(IN sets OF probability)     that improves ON existing methods; 3) a collection OF branch - AND - bound algorithms that combine the previous techniques.The first two  techniques lead TO approximate solutions, WHILE branch - AND - bound procedures ","authors_text":"Cassio Polpo de Campos, Fabio Gagliardi Cozman, Jose Carlos Ferreira da Rocha","cross_cats":["stat.CO"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2012-10-19T15:05:11Z","title":"Inference in Polytrees with Sets of Probabilities"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1212.2458","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:2101ec9e44ed7f7e6b64b9cdea06ef203dfa9700bfe81d1b5338d591abfbe849","target":"record","created_at":"2026-05-18T03:38:04Z","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":"b621c5ae16138d5ab469a8d71bac6717c8093a76fb6936d850e4893829057396","cross_cats_sorted":["stat.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2012-10-19T15:05:11Z","title_canon_sha256":"7955625368c664980a4db83cc9435b8c7e7e7b714a3472126e8bdb0659da0c76"},"schema_version":"1.0","source":{"id":"1212.2458","kind":"arxiv","version":1}},"canonical_sha256":"f03cc89a696322f8f6f47cba98c44be0a0590bcbf6c51a98083bbb9c5c2cc57c","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"f03cc89a696322f8f6f47cba98c44be0a0590bcbf6c51a98083bbb9c5c2cc57c","first_computed_at":"2026-05-18T03:38:04.645626Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:38:04.645626Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"8x+bDKWv+jLc939jGcft9OZOEv21KZ2TUAI8zo26tuJgL6j+fmmpCmaqveqR6cUp0v4B4xf5OxH0SOdtaI7oDg==","signature_status":"signed_v1","signed_at":"2026-05-18T03:38:04.646296Z","signed_message":"canonical_sha256_bytes"},"source_id":"1212.2458","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:2101ec9e44ed7f7e6b64b9cdea06ef203dfa9700bfe81d1b5338d591abfbe849","sha256:16e53a9acf28e566071574a8a733dbe04b06da798ba4acf60b3d487c2f760ac3"],"state_sha256":"195236629f693b8495091b3ae697b3ce56c5fb2a52e14eb486a86aa41e1fa061"}