{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2014:ADFVDPCOEYDVZJY5KQWSNOFKPV","short_pith_number":"pith:ADFVDPCO","canonical_record":{"source":{"id":"1410.5904","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CR","submitted_at":"2014-10-22T03:00:10Z","cross_cats_sorted":["cs.DC","math.OC","stat.AP"],"title_canon_sha256":"3f2fb68b5246835677b88f9c23b9f5a3db977ebcdacc41c79f077da024f8576b","abstract_canon_sha256":"ff6c296dff14e71d5ff1364810343c38934b878ac975c3561d4dc36c8b44b43a"},"schema_version":"1.0"},"canonical_sha256":"00cb51bc4e26075ca71d542d26b8aa7d53b71136ca2eb01c3e68fbbaa1fa16c5","source":{"kind":"arxiv","id":"1410.5904","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1410.5904","created_at":"2026-05-18T02:39:32Z"},{"alias_kind":"arxiv_version","alias_value":"1410.5904v1","created_at":"2026-05-18T02:39:32Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1410.5904","created_at":"2026-05-18T02:39:32Z"},{"alias_kind":"pith_short_12","alias_value":"ADFVDPCOEYDV","created_at":"2026-05-18T12:28:19Z"},{"alias_kind":"pith_short_16","alias_value":"ADFVDPCOEYDVZJY5","created_at":"2026-05-18T12:28:19Z"},{"alias_kind":"pith_short_8","alias_value":"ADFVDPCO","created_at":"2026-05-18T12:28:19Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2014:ADFVDPCOEYDVZJY5KQWSNOFKPV","target":"record","payload":{"canonical_record":{"source":{"id":"1410.5904","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CR","submitted_at":"2014-10-22T03:00:10Z","cross_cats_sorted":["cs.DC","math.OC","stat.AP"],"title_canon_sha256":"3f2fb68b5246835677b88f9c23b9f5a3db977ebcdacc41c79f077da024f8576b","abstract_canon_sha256":"ff6c296dff14e71d5ff1364810343c38934b878ac975c3561d4dc36c8b44b43a"},"schema_version":"1.0"},"canonical_sha256":"00cb51bc4e26075ca71d542d26b8aa7d53b71136ca2eb01c3e68fbbaa1fa16c5","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:39:32.970989Z","signature_b64":"qgByJKqhZeprUwnMUj2YhycKjftvIpE/4zNvzFDwwaOj2Ye4YvnGWRUqihPGrXIdrzBbFeYVHxbg/BTaw9YFAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"00cb51bc4e26075ca71d542d26b8aa7d53b71136ca2eb01c3e68fbbaa1fa16c5","last_reissued_at":"2026-05-18T02:39:32.970480Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:39:32.970480Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1410.5904","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-18T02:39:32Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Ow/KzSoR2bgqbfWzb/QHU2tbexrxGNhaSIlnid0czCK6HgFSoiKVwgrmHj9dhse+HdaWVlIL9N2pKvm2NQwvBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-03T03:35:33.523461Z"},"content_sha256":"f562995cf7e1fdb354b96efde88775db9fa72cd9105da2fdc3e5511ecb145164","schema_version":"1.0","event_id":"sha256:f562995cf7e1fdb354b96efde88775db9fa72cd9105da2fdc3e5511ecb145164"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2014:ADFVDPCOEYDVZJY5KQWSNOFKPV","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Distributed Detection in Tree Networks: Byzantines and Mitigation Techniques","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DC","math.OC","stat.AP"],"primary_cat":"cs.CR","authors_text":"Berkan Dulek, Bhavya Kailkhura, Pramod K. Varshney, Swastik Brahma, Yunghsiang S Han","submitted_at":"2014-10-22T03:00:10Z","abstract_excerpt":"In this paper, the problem of distributed detection in tree networks in the presence of Byzantines is considered. Closed form expressions for optimal attacking strategies that minimize the miss detection error exponent at the fusion center (FC) are obtained. We also look at the problem from the network designer's (FC's) perspective. We study the problem of designing optimal distributed detection parameters in a tree network in the presence of Byzantines. Next, we model the strategic interaction between the FC and the attacker as a Leader-Follower (Stackelberg) game. This formulation provides a"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1410.5904","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-18T02:39:32Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"axVE7LRsGTVMj/8cVVA+qo+C30+NrZ/YglTn1bhW5VlfQlWJMD+2UllRMGcx1TR3DqSomv+jdL8eofV2nTf+Bg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-03T03:35:33.523795Z"},"content_sha256":"e550aaca38f965f118b0157102145ef639a0483a21c6e5f27754e4be88e6d10c","schema_version":"1.0","event_id":"sha256:e550aaca38f965f118b0157102145ef639a0483a21c6e5f27754e4be88e6d10c"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/ADFVDPCOEYDVZJY5KQWSNOFKPV/bundle.json","state_url":"https://pith.science/pith/ADFVDPCOEYDVZJY5KQWSNOFKPV/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/ADFVDPCOEYDVZJY5KQWSNOFKPV/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-03T03:35:33Z","links":{"resolver":"https://pith.science/pith/ADFVDPCOEYDVZJY5KQWSNOFKPV","bundle":"https://pith.science/pith/ADFVDPCOEYDVZJY5KQWSNOFKPV/bundle.json","state":"https://pith.science/pith/ADFVDPCOEYDVZJY5KQWSNOFKPV/state.json","well_known_bundle":"https://pith.science/.well-known/pith/ADFVDPCOEYDVZJY5KQWSNOFKPV/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:ADFVDPCOEYDVZJY5KQWSNOFKPV","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":"ff6c296dff14e71d5ff1364810343c38934b878ac975c3561d4dc36c8b44b43a","cross_cats_sorted":["cs.DC","math.OC","stat.AP"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CR","submitted_at":"2014-10-22T03:00:10Z","title_canon_sha256":"3f2fb68b5246835677b88f9c23b9f5a3db977ebcdacc41c79f077da024f8576b"},"schema_version":"1.0","source":{"id":"1410.5904","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1410.5904","created_at":"2026-05-18T02:39:32Z"},{"alias_kind":"arxiv_version","alias_value":"1410.5904v1","created_at":"2026-05-18T02:39:32Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1410.5904","created_at":"2026-05-18T02:39:32Z"},{"alias_kind":"pith_short_12","alias_value":"ADFVDPCOEYDV","created_at":"2026-05-18T12:28:19Z"},{"alias_kind":"pith_short_16","alias_value":"ADFVDPCOEYDVZJY5","created_at":"2026-05-18T12:28:19Z"},{"alias_kind":"pith_short_8","alias_value":"ADFVDPCO","created_at":"2026-05-18T12:28:19Z"}],"graph_snapshots":[{"event_id":"sha256:e550aaca38f965f118b0157102145ef639a0483a21c6e5f27754e4be88e6d10c","target":"graph","created_at":"2026-05-18T02:39:32Z","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":"In this paper, the problem of distributed detection in tree networks in the presence of Byzantines is considered. Closed form expressions for optimal attacking strategies that minimize the miss detection error exponent at the fusion center (FC) are obtained. We also look at the problem from the network designer's (FC's) perspective. We study the problem of designing optimal distributed detection parameters in a tree network in the presence of Byzantines. Next, we model the strategic interaction between the FC and the attacker as a Leader-Follower (Stackelberg) game. This formulation provides a","authors_text":"Berkan Dulek, Bhavya Kailkhura, Pramod K. Varshney, Swastik Brahma, Yunghsiang S Han","cross_cats":["cs.DC","math.OC","stat.AP"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CR","submitted_at":"2014-10-22T03:00:10Z","title":"Distributed Detection in Tree Networks: Byzantines and Mitigation Techniques"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1410.5904","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:f562995cf7e1fdb354b96efde88775db9fa72cd9105da2fdc3e5511ecb145164","target":"record","created_at":"2026-05-18T02:39:32Z","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":"ff6c296dff14e71d5ff1364810343c38934b878ac975c3561d4dc36c8b44b43a","cross_cats_sorted":["cs.DC","math.OC","stat.AP"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CR","submitted_at":"2014-10-22T03:00:10Z","title_canon_sha256":"3f2fb68b5246835677b88f9c23b9f5a3db977ebcdacc41c79f077da024f8576b"},"schema_version":"1.0","source":{"id":"1410.5904","kind":"arxiv","version":1}},"canonical_sha256":"00cb51bc4e26075ca71d542d26b8aa7d53b71136ca2eb01c3e68fbbaa1fa16c5","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"00cb51bc4e26075ca71d542d26b8aa7d53b71136ca2eb01c3e68fbbaa1fa16c5","first_computed_at":"2026-05-18T02:39:32.970480Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:39:32.970480Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"qgByJKqhZeprUwnMUj2YhycKjftvIpE/4zNvzFDwwaOj2Ye4YvnGWRUqihPGrXIdrzBbFeYVHxbg/BTaw9YFAw==","signature_status":"signed_v1","signed_at":"2026-05-18T02:39:32.970989Z","signed_message":"canonical_sha256_bytes"},"source_id":"1410.5904","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:f562995cf7e1fdb354b96efde88775db9fa72cd9105da2fdc3e5511ecb145164","sha256:e550aaca38f965f118b0157102145ef639a0483a21c6e5f27754e4be88e6d10c"],"state_sha256":"8804f4b292c2ec83e0fdcd35da260477dada9648640d4a8221e30032d9699676"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"+wwom91HnvsSIr6kMN/cZMhUpjW3l7lFnbI+OFphmaiRyIUSYxmuqWbxBL5Nq7HVTZ1H8JGoKmccgLCVR7fmCQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-03T03:35:33.525715Z","bundle_sha256":"f5338c6e77fcaa64450f5c0a39d34fe5b14acdbe790b950f305aff696c1a985f"}}