{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:NWL3XHXE6JD53MGNQY76HZDF24","short_pith_number":"pith:NWL3XHXE","canonical_record":{"source":{"id":"1611.04227","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CR","submitted_at":"2016-11-14T02:28:01Z","cross_cats_sorted":[],"title_canon_sha256":"49684f401969d9cf286405a6136bc640d1ac22293114b192276717ec792e5541","abstract_canon_sha256":"d54621c5b2a98f8f2c01e83675b097eadd7e407ebe72e173cb24ef49e0c1fc87"},"schema_version":"1.0"},"canonical_sha256":"6d97bb9ee4f247ddb0cd863fe3e465d733e8ac60739481cce713b6888fb532d5","source":{"kind":"arxiv","id":"1611.04227","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1611.04227","created_at":"2026-05-18T00:59:17Z"},{"alias_kind":"arxiv_version","alias_value":"1611.04227v1","created_at":"2026-05-18T00:59:17Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1611.04227","created_at":"2026-05-18T00:59:17Z"},{"alias_kind":"pith_short_12","alias_value":"NWL3XHXE6JD5","created_at":"2026-05-18T12:30:36Z"},{"alias_kind":"pith_short_16","alias_value":"NWL3XHXE6JD53MGN","created_at":"2026-05-18T12:30:36Z"},{"alias_kind":"pith_short_8","alias_value":"NWL3XHXE","created_at":"2026-05-18T12:30:36Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:NWL3XHXE6JD53MGNQY76HZDF24","target":"record","payload":{"canonical_record":{"source":{"id":"1611.04227","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CR","submitted_at":"2016-11-14T02:28:01Z","cross_cats_sorted":[],"title_canon_sha256":"49684f401969d9cf286405a6136bc640d1ac22293114b192276717ec792e5541","abstract_canon_sha256":"d54621c5b2a98f8f2c01e83675b097eadd7e407ebe72e173cb24ef49e0c1fc87"},"schema_version":"1.0"},"canonical_sha256":"6d97bb9ee4f247ddb0cd863fe3e465d733e8ac60739481cce713b6888fb532d5","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:59:17.140350Z","signature_b64":"S+Zy5xb7ec01Suhfj+Kb4UEtu/cM8mhttceRAtGEMSXX4kK0tstvOraQIQFE4TI+V3jp/9ddJGCeKFw59pGtBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"6d97bb9ee4f247ddb0cd863fe3e465d733e8ac60739481cce713b6888fb532d5","last_reissued_at":"2026-05-18T00:59:17.139614Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:59:17.139614Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1611.04227","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-18T00:59:17Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"GmWQEXg7ydL1yzTmDQhL69sAvaXVEu7tRtqyD/T/kePaeAX/K2rSS6Pip2DfPart+7QMheYVnjDI6zf/fZlHAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-24T15:40:36.676140Z"},"content_sha256":"619b1f68d0f1e09a3f3393120f7e0ccc1cd29488c983c28b51c66568ba42610a","schema_version":"1.0","event_id":"sha256:619b1f68d0f1e09a3f3393120f7e0ccc1cd29488c983c28b51c66568ba42610a"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:NWL3XHXE6JD53MGNQY76HZDF24","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Robust Consensus-Based Network Intrusion Detection in Presence of Byzantine Attacks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CR","authors_text":"Cao Vien Phung, Denis Hock, Hai Le, Michel Toulouse","submitted_at":"2016-11-14T02:28:01Z","abstract_excerpt":"Consensus algorithms provide strategies to solve problems in a distributed system with the added constraint that data can only be shared between adjacent computing nodes. We find these algorithms in applications for wireless and sensor networks, spectrum sensing for cognitive radio, even for some IoT services. However, consensus-based applications are not resilient to compromised nodes sending falsified data to their neighbors, i.e. they can be the target of Byzantine attacks. Several solutions have been proposed in the literature inspired from reputation based systems, outlier detection or mo"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1611.04227","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-18T00:59:17Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"c5WMRa+nGSQDKwPvIIorr313px+zj9oMfmfmBAhV6WmjzQkFJd8uoy2MC0v8t6qbjVIljg/XLU/Gsn/kjpepBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-24T15:40:36.676503Z"},"content_sha256":"e1f9d02308ca2aed3c5f7e54945fc3191eb39ef8650e397021605cb9656dac54","schema_version":"1.0","event_id":"sha256:e1f9d02308ca2aed3c5f7e54945fc3191eb39ef8650e397021605cb9656dac54"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/NWL3XHXE6JD53MGNQY76HZDF24/bundle.json","state_url":"https://pith.science/pith/NWL3XHXE6JD53MGNQY76HZDF24/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/NWL3XHXE6JD53MGNQY76HZDF24/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-24T15:40:36Z","links":{"resolver":"https://pith.science/pith/NWL3XHXE6JD53MGNQY76HZDF24","bundle":"https://pith.science/pith/NWL3XHXE6JD53MGNQY76HZDF24/bundle.json","state":"https://pith.science/pith/NWL3XHXE6JD53MGNQY76HZDF24/state.json","well_known_bundle":"https://pith.science/.well-known/pith/NWL3XHXE6JD53MGNQY76HZDF24/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:NWL3XHXE6JD53MGNQY76HZDF24","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":"d54621c5b2a98f8f2c01e83675b097eadd7e407ebe72e173cb24ef49e0c1fc87","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CR","submitted_at":"2016-11-14T02:28:01Z","title_canon_sha256":"49684f401969d9cf286405a6136bc640d1ac22293114b192276717ec792e5541"},"schema_version":"1.0","source":{"id":"1611.04227","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1611.04227","created_at":"2026-05-18T00:59:17Z"},{"alias_kind":"arxiv_version","alias_value":"1611.04227v1","created_at":"2026-05-18T00:59:17Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1611.04227","created_at":"2026-05-18T00:59:17Z"},{"alias_kind":"pith_short_12","alias_value":"NWL3XHXE6JD5","created_at":"2026-05-18T12:30:36Z"},{"alias_kind":"pith_short_16","alias_value":"NWL3XHXE6JD53MGN","created_at":"2026-05-18T12:30:36Z"},{"alias_kind":"pith_short_8","alias_value":"NWL3XHXE","created_at":"2026-05-18T12:30:36Z"}],"graph_snapshots":[{"event_id":"sha256:e1f9d02308ca2aed3c5f7e54945fc3191eb39ef8650e397021605cb9656dac54","target":"graph","created_at":"2026-05-18T00:59:17Z","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":"Consensus algorithms provide strategies to solve problems in a distributed system with the added constraint that data can only be shared between adjacent computing nodes. We find these algorithms in applications for wireless and sensor networks, spectrum sensing for cognitive radio, even for some IoT services. However, consensus-based applications are not resilient to compromised nodes sending falsified data to their neighbors, i.e. they can be the target of Byzantine attacks. Several solutions have been proposed in the literature inspired from reputation based systems, outlier detection or mo","authors_text":"Cao Vien Phung, Denis Hock, Hai Le, Michel Toulouse","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CR","submitted_at":"2016-11-14T02:28:01Z","title":"Robust Consensus-Based Network Intrusion Detection in Presence of Byzantine Attacks"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1611.04227","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:619b1f68d0f1e09a3f3393120f7e0ccc1cd29488c983c28b51c66568ba42610a","target":"record","created_at":"2026-05-18T00:59:17Z","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":"d54621c5b2a98f8f2c01e83675b097eadd7e407ebe72e173cb24ef49e0c1fc87","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CR","submitted_at":"2016-11-14T02:28:01Z","title_canon_sha256":"49684f401969d9cf286405a6136bc640d1ac22293114b192276717ec792e5541"},"schema_version":"1.0","source":{"id":"1611.04227","kind":"arxiv","version":1}},"canonical_sha256":"6d97bb9ee4f247ddb0cd863fe3e465d733e8ac60739481cce713b6888fb532d5","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"6d97bb9ee4f247ddb0cd863fe3e465d733e8ac60739481cce713b6888fb532d5","first_computed_at":"2026-05-18T00:59:17.139614Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:59:17.139614Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"S+Zy5xb7ec01Suhfj+Kb4UEtu/cM8mhttceRAtGEMSXX4kK0tstvOraQIQFE4TI+V3jp/9ddJGCeKFw59pGtBQ==","signature_status":"signed_v1","signed_at":"2026-05-18T00:59:17.140350Z","signed_message":"canonical_sha256_bytes"},"source_id":"1611.04227","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:619b1f68d0f1e09a3f3393120f7e0ccc1cd29488c983c28b51c66568ba42610a","sha256:e1f9d02308ca2aed3c5f7e54945fc3191eb39ef8650e397021605cb9656dac54"],"state_sha256":"0c78af2ce03cb97cef746d2354415c92c08925541c5e2754a247c63f376cf5bc"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"UJutCnaW2VmKkcRHpTo/5uRxnFExJGGm1dDQWHGJDoz5jkxoliKNUWx+6gYsyaJC0WLAJ+faYRs3Tk80eAbRBA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-24T15:40:36.678452Z","bundle_sha256":"2037bf845bd011727e5878ff03b0db993746964ddf7ce4f2b308da10f86a8796"}}