{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:2CVV4TXRLWYIOWDXVXD426UA5O","short_pith_number":"pith:2CVV4TXR","schema_version":"1.0","canonical_sha256":"d0ab5e4ef15db0875877adc7cd7a80eba950ca42fabcb2af1037a274c6153d35","source":{"kind":"arxiv","id":"1702.08357","version":1},"attestation_state":"computed","paper":{"title":"A Message Passing Approach for Decision Fusion in Adversarial Multi-Sensor Networks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.SY","authors_text":"Andrea Abrardo, Benedetta Tondi, Kassem Kallas, Mauro Barni","submitted_at":"2017-02-27T16:26:02Z","abstract_excerpt":"We consider 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 byzantine nodes, i.e. nodes which deliberately alter the result of the local decision to induce an error at the fusion center. When independent states are considered, the optimum fusion rule over a batch of observations has already been derived, however its complexity prevents its use in conjunction with large observation windows.\n  In this paper, we propose a near-optimal algorithm based o"},"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":"1702.08357","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SY","submitted_at":"2017-02-27T16:26:02Z","cross_cats_sorted":[],"title_canon_sha256":"fa24e031872c338c5f3c35531f137bc91c52d9fb13aa524f5f06b616fe74a61f","abstract_canon_sha256":"26118ddb67a7fd5afbe2845ff95a4aae8073a4093604389079d17fb0d8d5eb79"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:49:55.131114Z","signature_b64":"twfbFO56jjIUMySn2tSoM2UHm4LCu5DD4HedQ7hSFzhCCeAs8bUfRDds49GrEOWwqrlE38StRfChIG0a/vOnAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"d0ab5e4ef15db0875877adc7cd7a80eba950ca42fabcb2af1037a274c6153d35","last_reissued_at":"2026-05-18T00:49:55.130492Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:49:55.130492Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A Message Passing Approach for Decision Fusion in Adversarial Multi-Sensor Networks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.SY","authors_text":"Andrea Abrardo, Benedetta Tondi, Kassem Kallas, Mauro Barni","submitted_at":"2017-02-27T16:26:02Z","abstract_excerpt":"We consider 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 byzantine nodes, i.e. nodes which deliberately alter the result of the local decision to induce an error at the fusion center. When independent states are considered, the optimum fusion rule over a batch of observations has already been derived, however its complexity prevents its use in conjunction with large observation windows.\n  In this paper, we propose a near-optimal algorithm based o"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1702.08357","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":"1702.08357","created_at":"2026-05-18T00:49:55.130603+00:00"},{"alias_kind":"arxiv_version","alias_value":"1702.08357v1","created_at":"2026-05-18T00:49:55.130603+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1702.08357","created_at":"2026-05-18T00:49:55.130603+00:00"},{"alias_kind":"pith_short_12","alias_value":"2CVV4TXRLWYI","created_at":"2026-05-18T12:30:55.937587+00:00"},{"alias_kind":"pith_short_16","alias_value":"2CVV4TXRLWYIOWDX","created_at":"2026-05-18T12:30:55.937587+00:00"},{"alias_kind":"pith_short_8","alias_value":"2CVV4TXR","created_at":"2026-05-18T12:30:55.937587+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/2CVV4TXRLWYIOWDXVXD426UA5O","json":"https://pith.science/pith/2CVV4TXRLWYIOWDXVXD426UA5O.json","graph_json":"https://pith.science/api/pith-number/2CVV4TXRLWYIOWDXVXD426UA5O/graph.json","events_json":"https://pith.science/api/pith-number/2CVV4TXRLWYIOWDXVXD426UA5O/events.json","paper":"https://pith.science/paper/2CVV4TXR"},"agent_actions":{"view_html":"https://pith.science/pith/2CVV4TXRLWYIOWDXVXD426UA5O","download_json":"https://pith.science/pith/2CVV4TXRLWYIOWDXVXD426UA5O.json","view_paper":"https://pith.science/paper/2CVV4TXR","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1702.08357&json=true","fetch_graph":"https://pith.science/api/pith-number/2CVV4TXRLWYIOWDXVXD426UA5O/graph.json","fetch_events":"https://pith.science/api/pith-number/2CVV4TXRLWYIOWDXVXD426UA5O/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/2CVV4TXRLWYIOWDXVXD426UA5O/action/timestamp_anchor","attest_storage":"https://pith.science/pith/2CVV4TXRLWYIOWDXVXD426UA5O/action/storage_attestation","attest_author":"https://pith.science/pith/2CVV4TXRLWYIOWDXVXD426UA5O/action/author_attestation","sign_citation":"https://pith.science/pith/2CVV4TXRLWYIOWDXVXD426UA5O/action/citation_signature","submit_replication":"https://pith.science/pith/2CVV4TXRLWYIOWDXVXD426UA5O/action/replication_record"}},"created_at":"2026-05-18T00:49:55.130603+00:00","updated_at":"2026-05-18T00:49:55.130603+00:00"}