{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2013:4FICGZIMIDLRYHV6AOMCMRZBJZ","short_pith_number":"pith:4FICGZIM","schema_version":"1.0","canonical_sha256":"e15023650c40d71c1ebe03982647214e743a5654d5b167623e2c2ab67e45919a","source":{"kind":"arxiv","id":"1303.5757","version":1},"attestation_state":"computed","paper":{"title":"A Monte-Carlo Algorithm for Dempster-Shafer Belief","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.AI","authors_text":"Nic Wilson","submitted_at":"2013-03-20T15:33:58Z","abstract_excerpt":"A very computationally-efficient Monte-Carlo algorithm for the calculation of Dempster-Shafer belief is described.  If Bel is the combination using Dempster's Rule of belief functions Bel, ..., Bel,7, then, for subset b of the frame C), Bel(b) can be calculated in time linear in 1(31 and m (given that the weight of conflict is bounded).  The algorithm can also be used to improve the complexity of the Shenoy-Shafer algorithms on Markov trees, and be generalised to calculate Dempster-Shafer Belief over other logics."},"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":"1303.5757","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2013-03-20T15:33:58Z","cross_cats_sorted":[],"title_canon_sha256":"a6f725b2d832d37f5ee7e42580739d85118bb24217b15762b546158dae12e96d","abstract_canon_sha256":"eccd089df7d68bf8f25193d524c985732cd120535d911ea0a40b39d98921d565"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:30:01.332131Z","signature_b64":"sGoDYS92o6JlZ9yb5oUmEXcXlwlm0Rr88Qj9k3PNrUrgDVcaPjDt9clEvAQZGMjTkYfggSmo8dGd/9sXPs43Cg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"e15023650c40d71c1ebe03982647214e743a5654d5b167623e2c2ab67e45919a","last_reissued_at":"2026-05-18T03:30:01.331554Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:30:01.331554Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A Monte-Carlo Algorithm for Dempster-Shafer Belief","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.AI","authors_text":"Nic Wilson","submitted_at":"2013-03-20T15:33:58Z","abstract_excerpt":"A very computationally-efficient Monte-Carlo algorithm for the calculation of Dempster-Shafer belief is described.  If Bel is the combination using Dempster's Rule of belief functions Bel, ..., Bel,7, then, for subset b of the frame C), Bel(b) can be calculated in time linear in 1(31 and m (given that the weight of conflict is bounded).  The algorithm can also be used to improve the complexity of the Shenoy-Shafer algorithms on Markov trees, and be generalised to calculate Dempster-Shafer Belief over other logics."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1303.5757","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":"1303.5757","created_at":"2026-05-18T03:30:01.331631+00:00"},{"alias_kind":"arxiv_version","alias_value":"1303.5757v1","created_at":"2026-05-18T03:30:01.331631+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1303.5757","created_at":"2026-05-18T03:30:01.331631+00:00"},{"alias_kind":"pith_short_12","alias_value":"4FICGZIMIDLR","created_at":"2026-05-18T12:27:34.582898+00:00"},{"alias_kind":"pith_short_16","alias_value":"4FICGZIMIDLRYHV6","created_at":"2026-05-18T12:27:34.582898+00:00"},{"alias_kind":"pith_short_8","alias_value":"4FICGZIM","created_at":"2026-05-18T12:27:34.582898+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/4FICGZIMIDLRYHV6AOMCMRZBJZ","json":"https://pith.science/pith/4FICGZIMIDLRYHV6AOMCMRZBJZ.json","graph_json":"https://pith.science/api/pith-number/4FICGZIMIDLRYHV6AOMCMRZBJZ/graph.json","events_json":"https://pith.science/api/pith-number/4FICGZIMIDLRYHV6AOMCMRZBJZ/events.json","paper":"https://pith.science/paper/4FICGZIM"},"agent_actions":{"view_html":"https://pith.science/pith/4FICGZIMIDLRYHV6AOMCMRZBJZ","download_json":"https://pith.science/pith/4FICGZIMIDLRYHV6AOMCMRZBJZ.json","view_paper":"https://pith.science/paper/4FICGZIM","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1303.5757&json=true","fetch_graph":"https://pith.science/api/pith-number/4FICGZIMIDLRYHV6AOMCMRZBJZ/graph.json","fetch_events":"https://pith.science/api/pith-number/4FICGZIMIDLRYHV6AOMCMRZBJZ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/4FICGZIMIDLRYHV6AOMCMRZBJZ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/4FICGZIMIDLRYHV6AOMCMRZBJZ/action/storage_attestation","attest_author":"https://pith.science/pith/4FICGZIMIDLRYHV6AOMCMRZBJZ/action/author_attestation","sign_citation":"https://pith.science/pith/4FICGZIMIDLRYHV6AOMCMRZBJZ/action/citation_signature","submit_replication":"https://pith.science/pith/4FICGZIMIDLRYHV6AOMCMRZBJZ/action/replication_record"}},"created_at":"2026-05-18T03:30:01.331631+00:00","updated_at":"2026-05-18T03:30:01.331631+00:00"}