arXiv (All)
open access
A First-Principles Evaluation of Graph-Based Network Intrusion Detection Systems
Graph-based network intrusion detection systems (GIDS) report strong benchmark detection metrics, but those metrics establish little about deployability. We approach the problem from first principles: rather than inheriting the preprocessing, windowing, and thresholding conventions of each published
Conceptio Open Archive
Analyze & explore related research in Conceptio
Connect this record directly into your research workflow or AI agent. Explore citations across open repositories, query full text, and export structured proof bundles.
This document is indexed with metadata only: full text is not available in the archive for this record. Open the official source ↗
Related documents
- AutoGraphForge: Towards Automated Graph Theory Discovery#926397
- Locating-dominating partitions for some classes of graphs#147107
- A Survey of Densest Subgraph Discovery on Large Graphs#820128
- Reverse Engineering Compliance: A Dual-Graph Verification Framework for Auditing Legacy IT Security Concepts#352984
- Verifying Graceful Degradation in a Distributed Malware-Detection System with SPIN#1129486
Record · ID 1000223
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Bring this data into your agent: Connect via MCP or API · 20 free credits to start · no card required
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive