{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2012:PYYODQNMXQZ2VSIPFP456YMQQV","short_pith_number":"pith:PYYODQNM","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"},"canonical_sha256":"7e30e1c1acbc33aac90f2bf9df6190856a22f6b27b6b68d379f7b89eb842f35e","source":{"kind":"arxiv","id":"1206.6823","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1206.6823","created_at":"2026-05-18T03:52:15Z"},{"alias_kind":"arxiv_version","alias_value":"1206.6823v1","created_at":"2026-05-18T03:52:15Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1206.6823","created_at":"2026-05-18T03:52:15Z"},{"alias_kind":"pith_short_12","alias_value":"PYYODQNMXQZ2","created_at":"2026-05-18T12:27:18Z"},{"alias_kind":"pith_short_16","alias_value":"PYYODQNMXQZ2VSIP","created_at":"2026-05-18T12:27:18Z"},{"alias_kind":"pith_short_8","alias_value":"PYYODQNM","created_at":"2026-05-18T12:27:18Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2012:PYYODQNMXQZ2VSIPFP456YMQQV","target":"record","payload":{"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"},"canonical_sha256":"7e30e1c1acbc33aac90f2bf9df6190856a22f6b27b6b68d379f7b89eb842f35e","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"},"source_kind":"arxiv","source_id":"1206.6823","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:52:15Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"2K3WGsTqC4ith1vATs+o9SUe8BYbtzMBq4sAEcmd7Y6OGNwTgkXx3MAP8e1jChYuQtGvwOCu21IEbw6wMCIjCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-03T21:49:22.215391Z"},"content_sha256":"9abddbea72addd53f3860a527e2c1e763bdf900de1489cb78ed9c0205590b1a3","schema_version":"1.0","event_id":"sha256:9abddbea72addd53f3860a527e2c1e763bdf900de1489cb78ed9c0205590b1a3"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2012:PYYODQNMXQZ2VSIPFP456YMQQV","target":"graph","payload":{"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"},"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:52:15Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"FJL0E+XdG7cdEWaO3RIgwz4KPXxQ2N8q8iKUICyuJkwiteDDcbU5MUBMDcU6CPiArKCtWeAsxfzmH4TUuRZ/CQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-03T21:49:22.215767Z"},"content_sha256":"b273e2d3679015a10ef5b371d546e67c1ac230f2b76d9187ec8995a9ed46169e","schema_version":"1.0","event_id":"sha256:b273e2d3679015a10ef5b371d546e67c1ac230f2b76d9187ec8995a9ed46169e"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/PYYODQNMXQZ2VSIPFP456YMQQV/bundle.json","state_url":"https://pith.science/pith/PYYODQNMXQZ2VSIPFP456YMQQV/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/PYYODQNMXQZ2VSIPFP456YMQQV/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-06-03T21:49:22Z","links":{"resolver":"https://pith.science/pith/PYYODQNMXQZ2VSIPFP456YMQQV","bundle":"https://pith.science/pith/PYYODQNMXQZ2VSIPFP456YMQQV/bundle.json","state":"https://pith.science/pith/PYYODQNMXQZ2VSIPFP456YMQQV/state.json","well_known_bundle":"https://pith.science/.well-known/pith/PYYODQNMXQZ2VSIPFP456YMQQV/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2012:PYYODQNMXQZ2VSIPFP456YMQQV","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":"d11ddf569958951a1b1a0daaecf99809a86a03ea97207f63694365c6907a44be","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2012-06-27T15:40:48Z","title_canon_sha256":"9b0ede5f15e5a21c668a8efe460fc3fd27b22c76bb9bf6820a9911aa8b646a4b"},"schema_version":"1.0","source":{"id":"1206.6823","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1206.6823","created_at":"2026-05-18T03:52:15Z"},{"alias_kind":"arxiv_version","alias_value":"1206.6823v1","created_at":"2026-05-18T03:52:15Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1206.6823","created_at":"2026-05-18T03:52:15Z"},{"alias_kind":"pith_short_12","alias_value":"PYYODQNMXQZ2","created_at":"2026-05-18T12:27:18Z"},{"alias_kind":"pith_short_16","alias_value":"PYYODQNMXQZ2VSIP","created_at":"2026-05-18T12:27:18Z"},{"alias_kind":"pith_short_8","alias_value":"PYYODQNM","created_at":"2026-05-18T12:27:18Z"}],"graph_snapshots":[{"event_id":"sha256:b273e2d3679015a10ef5b371d546e67c1ac230f2b76d9187ec8995a9ed46169e","target":"graph","created_at":"2026-05-18T03:52:15Z","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":"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","authors_text":"Jiwen W. Guan, Yaxin Bi","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2012-06-27T15:40:48Z","title":"An Efficient Triplet-based Algorithm for Evidential Reasoning"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1206.6823","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:9abddbea72addd53f3860a527e2c1e763bdf900de1489cb78ed9c0205590b1a3","target":"record","created_at":"2026-05-18T03:52:15Z","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":"d11ddf569958951a1b1a0daaecf99809a86a03ea97207f63694365c6907a44be","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2012-06-27T15:40:48Z","title_canon_sha256":"9b0ede5f15e5a21c668a8efe460fc3fd27b22c76bb9bf6820a9911aa8b646a4b"},"schema_version":"1.0","source":{"id":"1206.6823","kind":"arxiv","version":1}},"canonical_sha256":"7e30e1c1acbc33aac90f2bf9df6190856a22f6b27b6b68d379f7b89eb842f35e","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"7e30e1c1acbc33aac90f2bf9df6190856a22f6b27b6b68d379f7b89eb842f35e","first_computed_at":"2026-05-18T03:52:15.799867Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:52:15.799867Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"Kfzyx+vy0dDZiDz8wevIKu93ForyL1bnyeyhbWdqWVBSf3bYKFW55Sf8MsmnV829USkUMxXEdSpIa4BbAlfzAQ==","signature_status":"signed_v1","signed_at":"2026-05-18T03:52:15.800491Z","signed_message":"canonical_sha256_bytes"},"source_id":"1206.6823","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:9abddbea72addd53f3860a527e2c1e763bdf900de1489cb78ed9c0205590b1a3","sha256:b273e2d3679015a10ef5b371d546e67c1ac230f2b76d9187ec8995a9ed46169e"],"state_sha256":"4c2ef30905cb6f15b618a325b49890a13366026983b10cdfe9cb68d1a95cd114"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"YLdA+Rly/K/xp84gcCYZo05U6dgAQI4b/+hos1Ko9I5cOewXQPHXz9ymTAJ70nQrBZTHeSRwXv4mRYqsjKdEAg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-03T21:49:22.218076Z","bundle_sha256":"5e13fb1f47c2d00df94a906e3c508826d1835caf9d110f36e91c59e0b36fa151"}}