{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:5A5GHJ3PWVUNJHJKHYQQLWJYHF","short_pith_number":"pith:5A5GHJ3P","schema_version":"1.0","canonical_sha256":"e83a63a76fb568d49d2a3e2105d938395fc310031efb6ba2c23a97bd1ec18eff","source":{"kind":"arxiv","id":"1507.00400","version":1},"attestation_state":"computed","paper":{"title":"A Game-Theoretic Framework for Optimum Decision Fusion in the Presence of Byzantines","license":"http://creativecommons.org/publicdomain/zero/1.0/","headline":"","cross_cats":["cs.GT"],"primary_cat":"cs.SY","authors_text":"Andrea Abrardo, Benedetta Tondi, Kassem Kallas, Mauro Barni","submitted_at":"2015-07-02T00:41:07Z","abstract_excerpt":"Optimum decision fusion in the presence of malicious nodes - often referred to as Byzantines - is hindered by the necessity of exactly knowing the statistical behavior of Byzantines. By focusing on a simple, yet widely studied, set-up in which a Fusion Center (FC) is asked to make a binary decision about a sequence of system states by relying on the possibly corrupted decisions provided by local nodes, we propose a game-theoretic framework which permits to exploit the superior performance provided by optimum decision fusion, while limiting the amount of a-priori knowledge required. We first de"},"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":"1507.00400","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/publicdomain/zero/1.0/","primary_cat":"cs.SY","submitted_at":"2015-07-02T00:41:07Z","cross_cats_sorted":["cs.GT"],"title_canon_sha256":"2ace82890134c225b2f0013e6f8c5a89962a8881082149928230d7cffca2b05c","abstract_canon_sha256":"5e8b417e356e64a4212f110546e50d569b2add32ab0fe926c0a69457c78adcd9"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:37:24.889585Z","signature_b64":"Q0ieqLax1/FSSUbuekv5g/wuzaFs8N+Cvj/ea9CKxLpttMmYvjP4PlBAfAb7l6O+IsVSgOWU/CZ9GtaOhTj/Ag==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"e83a63a76fb568d49d2a3e2105d938395fc310031efb6ba2c23a97bd1ec18eff","last_reissued_at":"2026-05-18T01:37:24.888872Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:37:24.888872Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A Game-Theoretic Framework for Optimum Decision Fusion in the Presence of Byzantines","license":"http://creativecommons.org/publicdomain/zero/1.0/","headline":"","cross_cats":["cs.GT"],"primary_cat":"cs.SY","authors_text":"Andrea Abrardo, Benedetta Tondi, Kassem Kallas, Mauro Barni","submitted_at":"2015-07-02T00:41:07Z","abstract_excerpt":"Optimum decision fusion in the presence of malicious nodes - often referred to as Byzantines - is hindered by the necessity of exactly knowing the statistical behavior of Byzantines. By focusing on a simple, yet widely studied, set-up in which a Fusion Center (FC) is asked to make a binary decision about a sequence of system states by relying on the possibly corrupted decisions provided by local nodes, we propose a game-theoretic framework which permits to exploit the superior performance provided by optimum decision fusion, while limiting the amount of a-priori knowledge required. We first de"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1507.00400","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":"1507.00400","created_at":"2026-05-18T01:37:24.888987+00:00"},{"alias_kind":"arxiv_version","alias_value":"1507.00400v1","created_at":"2026-05-18T01:37:24.888987+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1507.00400","created_at":"2026-05-18T01:37:24.888987+00:00"},{"alias_kind":"pith_short_12","alias_value":"5A5GHJ3PWVUN","created_at":"2026-05-18T12:29:05.191682+00:00"},{"alias_kind":"pith_short_16","alias_value":"5A5GHJ3PWVUNJHJK","created_at":"2026-05-18T12:29:05.191682+00:00"},{"alias_kind":"pith_short_8","alias_value":"5A5GHJ3P","created_at":"2026-05-18T12:29:05.191682+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/5A5GHJ3PWVUNJHJKHYQQLWJYHF","json":"https://pith.science/pith/5A5GHJ3PWVUNJHJKHYQQLWJYHF.json","graph_json":"https://pith.science/api/pith-number/5A5GHJ3PWVUNJHJKHYQQLWJYHF/graph.json","events_json":"https://pith.science/api/pith-number/5A5GHJ3PWVUNJHJKHYQQLWJYHF/events.json","paper":"https://pith.science/paper/5A5GHJ3P"},"agent_actions":{"view_html":"https://pith.science/pith/5A5GHJ3PWVUNJHJKHYQQLWJYHF","download_json":"https://pith.science/pith/5A5GHJ3PWVUNJHJKHYQQLWJYHF.json","view_paper":"https://pith.science/paper/5A5GHJ3P","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1507.00400&json=true","fetch_graph":"https://pith.science/api/pith-number/5A5GHJ3PWVUNJHJKHYQQLWJYHF/graph.json","fetch_events":"https://pith.science/api/pith-number/5A5GHJ3PWVUNJHJKHYQQLWJYHF/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/5A5GHJ3PWVUNJHJKHYQQLWJYHF/action/timestamp_anchor","attest_storage":"https://pith.science/pith/5A5GHJ3PWVUNJHJKHYQQLWJYHF/action/storage_attestation","attest_author":"https://pith.science/pith/5A5GHJ3PWVUNJHJKHYQQLWJYHF/action/author_attestation","sign_citation":"https://pith.science/pith/5A5GHJ3PWVUNJHJKHYQQLWJYHF/action/citation_signature","submit_replication":"https://pith.science/pith/5A5GHJ3PWVUNJHJKHYQQLWJYHF/action/replication_record"}},"created_at":"2026-05-18T01:37:24.888987+00:00","updated_at":"2026-05-18T01:37:24.888987+00:00"}