{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2010:CSCBTATPDXBC6ORP7ZR3GXK2H5","short_pith_number":"pith:CSCBTATP","schema_version":"1.0","canonical_sha256":"148419826f1dc22f3a2ffe63b35d5a3f51acff0c520a340fda8650320605664f","source":{"kind":"arxiv","id":"1002.3190","version":1},"attestation_state":"computed","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. "},"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":"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"},"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"},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1002.3190","created_at":"2026-05-18T01:04:58.505880+00:00"},{"alias_kind":"arxiv_version","alias_value":"1002.3190v1","created_at":"2026-05-18T01:04:58.505880+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1002.3190","created_at":"2026-05-18T01:04:58.505880+00:00"},{"alias_kind":"pith_short_12","alias_value":"CSCBTATPDXBC","created_at":"2026-05-18T12:26:06.534383+00:00"},{"alias_kind":"pith_short_16","alias_value":"CSCBTATPDXBC6ORP","created_at":"2026-05-18T12:26:06.534383+00:00"},{"alias_kind":"pith_short_8","alias_value":"CSCBTATP","created_at":"2026-05-18T12:26:06.534383+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/CSCBTATPDXBC6ORP7ZR3GXK2H5","json":"https://pith.science/pith/CSCBTATPDXBC6ORP7ZR3GXK2H5.json","graph_json":"https://pith.science/api/pith-number/CSCBTATPDXBC6ORP7ZR3GXK2H5/graph.json","events_json":"https://pith.science/api/pith-number/CSCBTATPDXBC6ORP7ZR3GXK2H5/events.json","paper":"https://pith.science/paper/CSCBTATP"},"agent_actions":{"view_html":"https://pith.science/pith/CSCBTATPDXBC6ORP7ZR3GXK2H5","download_json":"https://pith.science/pith/CSCBTATPDXBC6ORP7ZR3GXK2H5.json","view_paper":"https://pith.science/paper/CSCBTATP","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1002.3190&json=true","fetch_graph":"https://pith.science/api/pith-number/CSCBTATPDXBC6ORP7ZR3GXK2H5/graph.json","fetch_events":"https://pith.science/api/pith-number/CSCBTATPDXBC6ORP7ZR3GXK2H5/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/CSCBTATPDXBC6ORP7ZR3GXK2H5/action/timestamp_anchor","attest_storage":"https://pith.science/pith/CSCBTATPDXBC6ORP7ZR3GXK2H5/action/storage_attestation","attest_author":"https://pith.science/pith/CSCBTATPDXBC6ORP7ZR3GXK2H5/action/author_attestation","sign_citation":"https://pith.science/pith/CSCBTATPDXBC6ORP7ZR3GXK2H5/action/citation_signature","submit_replication":"https://pith.science/pith/CSCBTATPDXBC6ORP7ZR3GXK2H5/action/replication_record"}},"created_at":"2026-05-18T01:04:58.505880+00:00","updated_at":"2026-05-18T01:04:58.505880+00:00"}