{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2004:K5CPST3B7JW7XAIFGMZFDH2AZU","short_pith_number":"pith:K5CPST3B","schema_version":"1.0","canonical_sha256":"5744f94f61fa6dfb81053332519f40cd33cf33fba50d368a87b9e9c54829d2de","source":{"kind":"arxiv","id":"cs/0408021","version":2},"attestation_state":"computed","paper":{"title":"An Algorithm for Quasi-Associative and Quasi-Markovian Rules of Combination in Information Fusion","license":"","headline":"","cross_cats":[],"primary_cat":"cs.AI","authors_text":"Florentin Smarandache, Jean Dezert","submitted_at":"2004-08-08T19:41:23Z","abstract_excerpt":"In this paper one proposes a simple algorithm of combining the fusion rules, those rules which first use the conjunctive rule and then the transfer of conflicting mass to the non-empty sets, in such a way that they gain the property of associativity and fulfill the Markovian requirement for dynamic fusion. Also, a new rule, SDL-improved, is presented."},"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":"cs/0408021","kind":"arxiv","version":2},"metadata":{"license":"","primary_cat":"cs.AI","submitted_at":"2004-08-08T19:41:23Z","cross_cats_sorted":[],"title_canon_sha256":"40eaa185abcad772d0b6095618f7e4d15ae750a3e2baeeeadf9d7fc427d40353","abstract_canon_sha256":"c649186791768b9ac7032edbc0b0cbd845f1e0239df61beb43ae8c3c4d7d0abb"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:41:04.169403Z","signature_b64":"TXOl3QCk4Dew+ocL2d6JIq73WRvJtCvkMWf7xEyu1vvc0Ik16VIlDIlFv9y5HLZV7OyotVUgqaXTEtCKFumeDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"5744f94f61fa6dfb81053332519f40cd33cf33fba50d368a87b9e9c54829d2de","last_reissued_at":"2026-05-18T04:41:04.168981Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:41:04.168981Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"An Algorithm for Quasi-Associative and Quasi-Markovian Rules of Combination in Information Fusion","license":"","headline":"","cross_cats":[],"primary_cat":"cs.AI","authors_text":"Florentin Smarandache, Jean Dezert","submitted_at":"2004-08-08T19:41:23Z","abstract_excerpt":"In this paper one proposes a simple algorithm of combining the fusion rules, those rules which first use the conjunctive rule and then the transfer of conflicting mass to the non-empty sets, in such a way that they gain the property of associativity and fulfill the Markovian requirement for dynamic fusion. Also, a new rule, SDL-improved, is presented."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"cs/0408021","kind":"arxiv","version":2},"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":"cs/0408021","created_at":"2026-05-18T04:41:04.169045+00:00"},{"alias_kind":"arxiv_version","alias_value":"cs/0408021v2","created_at":"2026-05-18T04:41:04.169045+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.cs/0408021","created_at":"2026-05-18T04:41:04.169045+00:00"},{"alias_kind":"pith_short_12","alias_value":"K5CPST3B7JW7","created_at":"2026-05-18T12:25:52.687210+00:00"},{"alias_kind":"pith_short_16","alias_value":"K5CPST3B7JW7XAIF","created_at":"2026-05-18T12:25:52.687210+00:00"},{"alias_kind":"pith_short_8","alias_value":"K5CPST3B","created_at":"2026-05-18T12:25:52.687210+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/K5CPST3B7JW7XAIFGMZFDH2AZU","json":"https://pith.science/pith/K5CPST3B7JW7XAIFGMZFDH2AZU.json","graph_json":"https://pith.science/api/pith-number/K5CPST3B7JW7XAIFGMZFDH2AZU/graph.json","events_json":"https://pith.science/api/pith-number/K5CPST3B7JW7XAIFGMZFDH2AZU/events.json","paper":"https://pith.science/paper/K5CPST3B"},"agent_actions":{"view_html":"https://pith.science/pith/K5CPST3B7JW7XAIFGMZFDH2AZU","download_json":"https://pith.science/pith/K5CPST3B7JW7XAIFGMZFDH2AZU.json","view_paper":"https://pith.science/paper/K5CPST3B","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=cs/0408021&json=true","fetch_graph":"https://pith.science/api/pith-number/K5CPST3B7JW7XAIFGMZFDH2AZU/graph.json","fetch_events":"https://pith.science/api/pith-number/K5CPST3B7JW7XAIFGMZFDH2AZU/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/K5CPST3B7JW7XAIFGMZFDH2AZU/action/timestamp_anchor","attest_storage":"https://pith.science/pith/K5CPST3B7JW7XAIFGMZFDH2AZU/action/storage_attestation","attest_author":"https://pith.science/pith/K5CPST3B7JW7XAIFGMZFDH2AZU/action/author_attestation","sign_citation":"https://pith.science/pith/K5CPST3B7JW7XAIFGMZFDH2AZU/action/citation_signature","submit_replication":"https://pith.science/pith/K5CPST3B7JW7XAIFGMZFDH2AZU/action/replication_record"}},"created_at":"2026-05-18T04:41:04.169045+00:00","updated_at":"2026-05-18T04:41:04.169045+00:00"}