{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2012:PYYODQNMXQZ2VSIPFP456YMQQV","short_pith_number":"pith:PYYODQNM","schema_version":"1.0","canonical_sha256":"7e30e1c1acbc33aac90f2bf9df6190856a22f6b27b6b68d379f7b89eb842f35e","source":{"kind":"arxiv","id":"1206.6823","version":1},"attestation_state":"computed","paper":{"title":"An Efficient Triplet-based Algorithm for Evidential Reasoning","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.AI","authors_text":"Jiwen W. Guan, Yaxin Bi","submitted_at":"2012-06-27T15:40:48Z","abstract_excerpt":"Linear-time computational techniques have been developed for combining evidence which is available on a number of contending hypotheses. They offer a means of making the computation-intensive calculations involved more efficient in certain circumstances. Unfortunately, they restrict the orthogonal sum of evidential functions to the dichotomous structure applies only to elements and their complements. In this paper, we present a novel evidence structure in terms of a triplet and a set of algorithms for evidential reasoning. The merit of this structure is that it divides a set of evidence into t"},"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":"1206.6823","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2012-06-27T15:40:48Z","cross_cats_sorted":[],"title_canon_sha256":"9b0ede5f15e5a21c668a8efe460fc3fd27b22c76bb9bf6820a9911aa8b646a4b","abstract_canon_sha256":"d11ddf569958951a1b1a0daaecf99809a86a03ea97207f63694365c6907a44be"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:52:15.800491Z","signature_b64":"Kfzyx+vy0dDZiDz8wevIKu93ForyL1bnyeyhbWdqWVBSf3bYKFW55Sf8MsmnV829USkUMxXEdSpIa4BbAlfzAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"7e30e1c1acbc33aac90f2bf9df6190856a22f6b27b6b68d379f7b89eb842f35e","last_reissued_at":"2026-05-18T03:52:15.799867Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:52:15.799867Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"An Efficient Triplet-based Algorithm for Evidential Reasoning","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.AI","authors_text":"Jiwen W. Guan, Yaxin Bi","submitted_at":"2012-06-27T15:40:48Z","abstract_excerpt":"Linear-time computational techniques have been developed for combining evidence which is available on a number of contending hypotheses. They offer a means of making the computation-intensive calculations involved more efficient in certain circumstances. Unfortunately, they restrict the orthogonal sum of evidential functions to the dichotomous structure applies only to elements and their complements. In this paper, we present a novel evidence structure in terms of a triplet and a set of algorithms for evidential reasoning. The merit of this structure is that it divides a set of evidence into t"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1206.6823","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":"1206.6823","created_at":"2026-05-18T03:52:15.799960+00:00"},{"alias_kind":"arxiv_version","alias_value":"1206.6823v1","created_at":"2026-05-18T03:52:15.799960+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1206.6823","created_at":"2026-05-18T03:52:15.799960+00:00"},{"alias_kind":"pith_short_12","alias_value":"PYYODQNMXQZ2","created_at":"2026-05-18T12:27:18.751474+00:00"},{"alias_kind":"pith_short_16","alias_value":"PYYODQNMXQZ2VSIP","created_at":"2026-05-18T12:27:18.751474+00:00"},{"alias_kind":"pith_short_8","alias_value":"PYYODQNM","created_at":"2026-05-18T12:27:18.751474+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/PYYODQNMXQZ2VSIPFP456YMQQV","json":"https://pith.science/pith/PYYODQNMXQZ2VSIPFP456YMQQV.json","graph_json":"https://pith.science/api/pith-number/PYYODQNMXQZ2VSIPFP456YMQQV/graph.json","events_json":"https://pith.science/api/pith-number/PYYODQNMXQZ2VSIPFP456YMQQV/events.json","paper":"https://pith.science/paper/PYYODQNM"},"agent_actions":{"view_html":"https://pith.science/pith/PYYODQNMXQZ2VSIPFP456YMQQV","download_json":"https://pith.science/pith/PYYODQNMXQZ2VSIPFP456YMQQV.json","view_paper":"https://pith.science/paper/PYYODQNM","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1206.6823&json=true","fetch_graph":"https://pith.science/api/pith-number/PYYODQNMXQZ2VSIPFP456YMQQV/graph.json","fetch_events":"https://pith.science/api/pith-number/PYYODQNMXQZ2VSIPFP456YMQQV/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/PYYODQNMXQZ2VSIPFP456YMQQV/action/timestamp_anchor","attest_storage":"https://pith.science/pith/PYYODQNMXQZ2VSIPFP456YMQQV/action/storage_attestation","attest_author":"https://pith.science/pith/PYYODQNMXQZ2VSIPFP456YMQQV/action/author_attestation","sign_citation":"https://pith.science/pith/PYYODQNMXQZ2VSIPFP456YMQQV/action/citation_signature","submit_replication":"https://pith.science/pith/PYYODQNMXQZ2VSIPFP456YMQQV/action/replication_record"}},"created_at":"2026-05-18T03:52:15.799960+00:00","updated_at":"2026-05-18T03:52:15.799960+00:00"}