{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2010:CSCBTATPDXBC6ORP7ZR3GXK2H5","short_pith_number":"pith:CSCBTATP","canonical_record":{"source":{"id":"1002.3190","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/3.0/","primary_cat":"cs.CR","submitted_at":"2010-02-17T00:36:16Z","cross_cats_sorted":["cs.NI"],"title_canon_sha256":"172e06b94e036eee4c962fb1923380398f7317f0351f6dc03278fac35ee2758f","abstract_canon_sha256":"45be5c02bcbfa9e6c3d0b7c68857022738818a521df4c16a6059b2b1a4e9e37b"},"schema_version":"1.0"},"canonical_sha256":"148419826f1dc22f3a2ffe63b35d5a3f51acff0c520a340fda8650320605664f","source":{"kind":"arxiv","id":"1002.3190","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1002.3190","created_at":"2026-05-18T01:04:58Z"},{"alias_kind":"arxiv_version","alias_value":"1002.3190v1","created_at":"2026-05-18T01:04:58Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1002.3190","created_at":"2026-05-18T01:04:58Z"},{"alias_kind":"pith_short_12","alias_value":"CSCBTATPDXBC","created_at":"2026-05-18T12:26:06Z"},{"alias_kind":"pith_short_16","alias_value":"CSCBTATPDXBC6ORP","created_at":"2026-05-18T12:26:06Z"},{"alias_kind":"pith_short_8","alias_value":"CSCBTATP","created_at":"2026-05-18T12:26:06Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2010:CSCBTATPDXBC6ORP7ZR3GXK2H5","target":"record","payload":{"canonical_record":{"source":{"id":"1002.3190","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/3.0/","primary_cat":"cs.CR","submitted_at":"2010-02-17T00:36:16Z","cross_cats_sorted":["cs.NI"],"title_canon_sha256":"172e06b94e036eee4c962fb1923380398f7317f0351f6dc03278fac35ee2758f","abstract_canon_sha256":"45be5c02bcbfa9e6c3d0b7c68857022738818a521df4c16a6059b2b1a4e9e37b"},"schema_version":"1.0"},"canonical_sha256":"148419826f1dc22f3a2ffe63b35d5a3f51acff0c520a340fda8650320605664f","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:04:58.506436Z","signature_b64":"5HSZzzACPdKWYPgj3dvnR1VFdMa4/B2SRZOOZC3fFMFauHTuQxUrNOkjgO8G4lUXxXd1RmEaKSSp9DLgAclCDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"148419826f1dc22f3a2ffe63b35d5a3f51acff0c520a340fda8650320605664f","last_reissued_at":"2026-05-18T01:04:58.505786Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:04:58.505786Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1002.3190","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-18T01:04:58Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"KLX/Llh6lkbk6MHAQyPFajw6tsXpIx+fvJH5JcQUhhSpwnNNpRTTPJQJmPOKoisxK44fOAtRaEcN+vAV2FDtDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T19:20:54.576538Z"},"content_sha256":"27adee3f995201dbfcbb1bd2d38e565fdb19abfe7ee554d396b274eee8462a2f","schema_version":"1.0","event_id":"sha256:27adee3f995201dbfcbb1bd2d38e565fdb19abfe7ee554d396b274eee8462a2f"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2010:CSCBTATPDXBC6ORP7ZR3GXK2H5","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"A Distributed Sequential Algorithm for Collaborative Intrusion Detection Networks","license":"http://creativecommons.org/licenses/by/3.0/","headline":"","cross_cats":["cs.NI"],"primary_cat":"cs.CR","authors_text":"Carol J. Fung, Quanyan Zhu, Raouf Boutaba, Tamer Basar","submitted_at":"2010-02-17T00:36:16Z","abstract_excerpt":"Collaborative intrusion detection networks are often used to gain better detection accuracy and cost efficiency as compared to a single host-based intrusion detection system (IDS). Through cooperation, it is possible for a local IDS to detect new attacks that may be known to other experienced acquaintances. In this paper, we present a sequential hypothesis testing method for feedback aggregation for each individual IDS in the net- work. Our simulation results corroborate our theoretical results and demonstrate the properties of cost efficiency and accuracy compared to other heuristic methods. "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1002.3190","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-18T01:04:58Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"7zM5pTAiZsB/tP9GQAt01NUxQhuJ9HN3C4DQtzVx+vq913t2HrVSDNir4eGHskbLykl2UFlzMqw25oNf/kvcAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T19:20:54.577135Z"},"content_sha256":"d66e220d9460d28888c6ba4632f1e3d75e0fab33e3a6b3d71ca6c58d5e9694e4","schema_version":"1.0","event_id":"sha256:d66e220d9460d28888c6ba4632f1e3d75e0fab33e3a6b3d71ca6c58d5e9694e4"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/CSCBTATPDXBC6ORP7ZR3GXK2H5/bundle.json","state_url":"https://pith.science/pith/CSCBTATPDXBC6ORP7ZR3GXK2H5/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/CSCBTATPDXBC6ORP7ZR3GXK2H5/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-05-31T19:20:54Z","links":{"resolver":"https://pith.science/pith/CSCBTATPDXBC6ORP7ZR3GXK2H5","bundle":"https://pith.science/pith/CSCBTATPDXBC6ORP7ZR3GXK2H5/bundle.json","state":"https://pith.science/pith/CSCBTATPDXBC6ORP7ZR3GXK2H5/state.json","well_known_bundle":"https://pith.science/.well-known/pith/CSCBTATPDXBC6ORP7ZR3GXK2H5/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2010:CSCBTATPDXBC6ORP7ZR3GXK2H5","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":"45be5c02bcbfa9e6c3d0b7c68857022738818a521df4c16a6059b2b1a4e9e37b","cross_cats_sorted":["cs.NI"],"license":"http://creativecommons.org/licenses/by/3.0/","primary_cat":"cs.CR","submitted_at":"2010-02-17T00:36:16Z","title_canon_sha256":"172e06b94e036eee4c962fb1923380398f7317f0351f6dc03278fac35ee2758f"},"schema_version":"1.0","source":{"id":"1002.3190","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1002.3190","created_at":"2026-05-18T01:04:58Z"},{"alias_kind":"arxiv_version","alias_value":"1002.3190v1","created_at":"2026-05-18T01:04:58Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1002.3190","created_at":"2026-05-18T01:04:58Z"},{"alias_kind":"pith_short_12","alias_value":"CSCBTATPDXBC","created_at":"2026-05-18T12:26:06Z"},{"alias_kind":"pith_short_16","alias_value":"CSCBTATPDXBC6ORP","created_at":"2026-05-18T12:26:06Z"},{"alias_kind":"pith_short_8","alias_value":"CSCBTATP","created_at":"2026-05-18T12:26:06Z"}],"graph_snapshots":[{"event_id":"sha256:d66e220d9460d28888c6ba4632f1e3d75e0fab33e3a6b3d71ca6c58d5e9694e4","target":"graph","created_at":"2026-05-18T01:04:58Z","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":"Collaborative intrusion detection networks are often used to gain better detection accuracy and cost efficiency as compared to a single host-based intrusion detection system (IDS). Through cooperation, it is possible for a local IDS to detect new attacks that may be known to other experienced acquaintances. In this paper, we present a sequential hypothesis testing method for feedback aggregation for each individual IDS in the net- work. Our simulation results corroborate our theoretical results and demonstrate the properties of cost efficiency and accuracy compared to other heuristic methods. ","authors_text":"Carol J. Fung, Quanyan Zhu, Raouf Boutaba, Tamer Basar","cross_cats":["cs.NI"],"headline":"","license":"http://creativecommons.org/licenses/by/3.0/","primary_cat":"cs.CR","submitted_at":"2010-02-17T00:36:16Z","title":"A Distributed Sequential Algorithm for Collaborative Intrusion Detection Networks"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1002.3190","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:27adee3f995201dbfcbb1bd2d38e565fdb19abfe7ee554d396b274eee8462a2f","target":"record","created_at":"2026-05-18T01:04:58Z","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":"45be5c02bcbfa9e6c3d0b7c68857022738818a521df4c16a6059b2b1a4e9e37b","cross_cats_sorted":["cs.NI"],"license":"http://creativecommons.org/licenses/by/3.0/","primary_cat":"cs.CR","submitted_at":"2010-02-17T00:36:16Z","title_canon_sha256":"172e06b94e036eee4c962fb1923380398f7317f0351f6dc03278fac35ee2758f"},"schema_version":"1.0","source":{"id":"1002.3190","kind":"arxiv","version":1}},"canonical_sha256":"148419826f1dc22f3a2ffe63b35d5a3f51acff0c520a340fda8650320605664f","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"148419826f1dc22f3a2ffe63b35d5a3f51acff0c520a340fda8650320605664f","first_computed_at":"2026-05-18T01:04:58.505786Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:04:58.505786Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"5HSZzzACPdKWYPgj3dvnR1VFdMa4/B2SRZOOZC3fFMFauHTuQxUrNOkjgO8G4lUXxXd1RmEaKSSp9DLgAclCDA==","signature_status":"signed_v1","signed_at":"2026-05-18T01:04:58.506436Z","signed_message":"canonical_sha256_bytes"},"source_id":"1002.3190","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:27adee3f995201dbfcbb1bd2d38e565fdb19abfe7ee554d396b274eee8462a2f","sha256:d66e220d9460d28888c6ba4632f1e3d75e0fab33e3a6b3d71ca6c58d5e9694e4"],"state_sha256":"6038d85f15ff1797ce6ff9f11c2f688ff5650005857bb2bd3834f22b8f3f7d21"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ltuPnDkcQzrPPKHQQXB0pKJx0YJZa85Vpnomf9Y2qR5tO8eoXpuUpcniBMmsP7/0F1H2Pxt3eonxGGTCgwzeCg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-31T19:20:54.581084Z","bundle_sha256":"642f83515affea7739165d716405e58cc526c751dda78c57add453f9a7b5355e"}}