{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2012:6A6MRGTJMMRPR5XUPS5JRRCL4C","short_pith_number":"pith:6A6MRGTJ","schema_version":"1.0","canonical_sha256":"f03cc89a696322f8f6f47cba98c44be0a0590bcbf6c51a98083bbb9c5c2cc57c","source":{"kind":"arxiv","id":"1212.2458","version":1},"attestation_state":"computed","paper":{"title":"Inference in Polytrees with Sets of Probabilities","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["stat.CO"],"primary_cat":"cs.AI","authors_text":"Cassio Polpo de Campos, Fabio Gagliardi Cozman, Jose Carlos Ferreira da Rocha","submitted_at":"2012-10-19T15:05:11Z","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 "},"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":"1212.2458","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2012-10-19T15:05:11Z","cross_cats_sorted":["stat.CO"],"title_canon_sha256":"7955625368c664980a4db83cc9435b8c7e7e7b714a3472126e8bdb0659da0c76","abstract_canon_sha256":"b621c5ae16138d5ab469a8d71bac6717c8093a76fb6936d850e4893829057396"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:38:04.646296Z","signature_b64":"8x+bDKWv+jLc939jGcft9OZOEv21KZ2TUAI8zo26tuJgL6j+fmmpCmaqveqR6cUp0v4B4xf5OxH0SOdtaI7oDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"f03cc89a696322f8f6f47cba98c44be0a0590bcbf6c51a98083bbb9c5c2cc57c","last_reissued_at":"2026-05-18T03:38:04.645626Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:38:04.645626Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Inference in Polytrees with Sets of Probabilities","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["stat.CO"],"primary_cat":"cs.AI","authors_text":"Cassio Polpo de Campos, Fabio Gagliardi Cozman, Jose Carlos Ferreira da Rocha","submitted_at":"2012-10-19T15:05:11Z","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 "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1212.2458","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":"1212.2458","created_at":"2026-05-18T03:38:04.645734+00:00"},{"alias_kind":"arxiv_version","alias_value":"1212.2458v1","created_at":"2026-05-18T03:38:04.645734+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1212.2458","created_at":"2026-05-18T03:38:04.645734+00:00"},{"alias_kind":"pith_short_12","alias_value":"6A6MRGTJMMRP","created_at":"2026-05-18T12:26:56.085431+00:00"},{"alias_kind":"pith_short_16","alias_value":"6A6MRGTJMMRPR5XU","created_at":"2026-05-18T12:26:56.085431+00:00"},{"alias_kind":"pith_short_8","alias_value":"6A6MRGTJ","created_at":"2026-05-18T12:26:56.085431+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/6A6MRGTJMMRPR5XUPS5JRRCL4C","json":"https://pith.science/pith/6A6MRGTJMMRPR5XUPS5JRRCL4C.json","graph_json":"https://pith.science/api/pith-number/6A6MRGTJMMRPR5XUPS5JRRCL4C/graph.json","events_json":"https://pith.science/api/pith-number/6A6MRGTJMMRPR5XUPS5JRRCL4C/events.json","paper":"https://pith.science/paper/6A6MRGTJ"},"agent_actions":{"view_html":"https://pith.science/pith/6A6MRGTJMMRPR5XUPS5JRRCL4C","download_json":"https://pith.science/pith/6A6MRGTJMMRPR5XUPS5JRRCL4C.json","view_paper":"https://pith.science/paper/6A6MRGTJ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1212.2458&json=true","fetch_graph":"https://pith.science/api/pith-number/6A6MRGTJMMRPR5XUPS5JRRCL4C/graph.json","fetch_events":"https://pith.science/api/pith-number/6A6MRGTJMMRPR5XUPS5JRRCL4C/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/6A6MRGTJMMRPR5XUPS5JRRCL4C/action/timestamp_anchor","attest_storage":"https://pith.science/pith/6A6MRGTJMMRPR5XUPS5JRRCL4C/action/storage_attestation","attest_author":"https://pith.science/pith/6A6MRGTJMMRPR5XUPS5JRRCL4C/action/author_attestation","sign_citation":"https://pith.science/pith/6A6MRGTJMMRPR5XUPS5JRRCL4C/action/citation_signature","submit_replication":"https://pith.science/pith/6A6MRGTJMMRPR5XUPS5JRRCL4C/action/replication_record"}},"created_at":"2026-05-18T03:38:04.645734+00:00","updated_at":"2026-05-18T03:38:04.645734+00:00"}