|
| 1 | +{ |
| 2 | + "role": "Default", |
| 3 | + "scorer": "BM25", |
| 4 | + "description": "20-document corpus for default role BM25 regression gate", |
| 5 | + "documents": [ |
| 6 | + { |
| 7 | + "id": "doc_001", |
| 8 | + "title": "Rust Programming Language", |
| 9 | + "body": "Rust is a systems programming language focused on safety concurrency and performance. It prevents segfaults and guarantees thread safety.", |
| 10 | + "description": "Official guide to the Rust programming language" |
| 11 | + }, |
| 12 | + { |
| 13 | + "id": "doc_002", |
| 14 | + "title": "Knowledge Graph Systems", |
| 15 | + "body": "Knowledge graphs represent entities and their relationships in a structured graph format. They enable semantic reasoning over connected data.", |
| 16 | + "description": "Introduction to knowledge graph design and querying" |
| 17 | + }, |
| 18 | + { |
| 19 | + "id": "doc_003", |
| 20 | + "title": "Search Engine Design", |
| 21 | + "body": "Modern search engines use inverted indexes BM25 ranking and neural reranking to deliver relevant results to user queries.", |
| 22 | + "description": "Architecture and algorithms behind web search engines" |
| 23 | + }, |
| 24 | + { |
| 25 | + "id": "doc_004", |
| 26 | + "title": "Automata Theory Fundamentals", |
| 27 | + "body": "Finite automata recognise regular languages. Pushdown automata handle context-free grammars. Turing machines compute all computable functions.", |
| 28 | + "description": "Theoretical foundations of computation and automata" |
| 29 | + }, |
| 30 | + { |
| 31 | + "id": "doc_005", |
| 32 | + "title": "Graph Algorithms and Data Structures", |
| 33 | + "body": "Graph traversal algorithms include depth-first search and breadth-first search. Shortest path algorithms include Dijkstra and A-star.", |
| 34 | + "description": "Algorithmic techniques for graph problems" |
| 35 | + }, |
| 36 | + { |
| 37 | + "id": "doc_006", |
| 38 | + "title": "Async Rust with Tokio", |
| 39 | + "body": "Tokio provides an asynchronous runtime for Rust. Async await syntax enables non-blocking IO operations without callback hell.", |
| 40 | + "description": "Asynchronous programming patterns in Rust using Tokio" |
| 41 | + }, |
| 42 | + { |
| 43 | + "id": "doc_007", |
| 44 | + "title": "Semantic Search with Embeddings", |
| 45 | + "body": "Semantic search uses dense vector embeddings to find conceptually similar documents. Vector databases store and query these embeddings efficiently.", |
| 46 | + "description": "Embedding-based semantic search systems" |
| 47 | + }, |
| 48 | + { |
| 49 | + "id": "doc_008", |
| 50 | + "title": "Finite State Machines", |
| 51 | + "body": "A finite state machine consists of states transitions and actions. Automata theory provides formal models for sequential logic systems.", |
| 52 | + "description": "Design and implementation of finite state machines" |
| 53 | + }, |
| 54 | + { |
| 55 | + "id": "doc_009", |
| 56 | + "title": "Rust Web Frameworks", |
| 57 | + "body": "Axum Actix-web and Salvo are popular Rust web frameworks. They offer async request handling middleware and routing capabilities.", |
| 58 | + "description": "Comparison of Rust web development frameworks" |
| 59 | + }, |
| 60 | + { |
| 61 | + "id": "doc_010", |
| 62 | + "title": "Graph Database Systems", |
| 63 | + "body": "Graph databases like Neo4j store data as nodes and edges. Property graphs support rich metadata on both nodes and relationships.", |
| 64 | + "description": "Survey of graph database technologies" |
| 65 | + }, |
| 66 | + { |
| 67 | + "id": "doc_011", |
| 68 | + "title": "Machine Learning Fundamentals", |
| 69 | + "body": "Neural networks learn representations through backpropagation. Gradient descent optimises the loss function over training examples.", |
| 70 | + "description": "Core concepts in machine learning and deep learning" |
| 71 | + }, |
| 72 | + { |
| 73 | + "id": "doc_012", |
| 74 | + "title": "Distributed Systems Design", |
| 75 | + "body": "The CAP theorem states distributed systems cannot simultaneously guarantee consistency availability and partition tolerance.", |
| 76 | + "description": "Principles and patterns for distributed system architecture" |
| 77 | + }, |
| 78 | + { |
| 79 | + "id": "doc_013", |
| 80 | + "title": "Python for Data Science", |
| 81 | + "body": "Python libraries NumPy Pandas and Matplotlib are standard tools for data analysis visualisation and scientific computing.", |
| 82 | + "description": "Python ecosystem for data science workflows" |
| 83 | + }, |
| 84 | + { |
| 85 | + "id": "doc_014", |
| 86 | + "title": "Database Indexing Strategies", |
| 87 | + "body": "B-tree indexes support range queries efficiently. Hash indexes excel at equality lookups. Covering indexes eliminate table scans.", |
| 88 | + "description": "Indexing techniques for relational and NoSQL databases" |
| 89 | + }, |
| 90 | + { |
| 91 | + "id": "doc_015", |
| 92 | + "title": "Compiler Design Principles", |
| 93 | + "body": "Compilers consist of lexers parsers semantic analysers and code generators. LLVM provides a widely used compiler backend infrastructure.", |
| 94 | + "description": "Phases and techniques in compiler construction" |
| 95 | + }, |
| 96 | + { |
| 97 | + "id": "doc_016", |
| 98 | + "title": "Rust Memory Safety", |
| 99 | + "body": "Rust ownership borrow checker and lifetimes enforce memory safety at compile time. No garbage collector means deterministic performance.", |
| 100 | + "description": "How Rust achieves memory safety without runtime overhead" |
| 101 | + }, |
| 102 | + { |
| 103 | + "id": "doc_017", |
| 104 | + "title": "Information Retrieval Methods", |
| 105 | + "body": "Information retrieval systems rank documents by relevance to queries using BM25 TF-IDF and learned ranking models.", |
| 106 | + "description": "Classic and modern information retrieval techniques" |
| 107 | + }, |
| 108 | + { |
| 109 | + "id": "doc_018", |
| 110 | + "title": "Aho-Corasick String Matching", |
| 111 | + "body": "The Aho-Corasick automaton enables simultaneous multi-pattern string matching in linear time. It is used in network intrusion detection and text search.", |
| 112 | + "description": "Efficient multi-pattern string matching with automata" |
| 113 | + }, |
| 114 | + { |
| 115 | + "id": "doc_019", |
| 116 | + "title": "Rust Error Handling", |
| 117 | + "body": "Rust uses Result and Option types for explicit error handling. The question mark operator propagates errors ergonomically through call chains.", |
| 118 | + "description": "Idiomatic error handling patterns in Rust" |
| 119 | + }, |
| 120 | + { |
| 121 | + "id": "doc_020", |
| 122 | + "title": "Knowledge Representation Languages", |
| 123 | + "body": "OWL RDF and SPARQL are W3C standards for knowledge representation and querying. They underpin the semantic web and linked data initiatives.", |
| 124 | + "description": "Formal languages for knowledge representation" |
| 125 | + } |
| 126 | + ] |
| 127 | +} |
0 commit comments