EdTech Discovery
Argus

Named after the hundred-eyed watchman of Greek myth, Argus watches the education landscape: spotting new opportunities, pressure-testing the ventures we're building, and tracing every read back to the real-world signals behind it.

Updated Aug 31, 2026 · 36 ideas · 18164 signals
← All ideas
Field brief · generated Aug 17, 2026

Automated science curriculum assessment generation with built-in pedagogical safeguards

Why now

TeachMateGPT (signal 66) demonstrated that multi-agent knowledge-grounded frameworks for pedagogical assessment generation from science curricula are feasible but remain incomplete prototypes—representing an open product gap. Legal RAG hallucination findings (signal 52) and advances in proactive multi-problem discovery by agents (signal 6) together point to both the risk that must be mitigated and the agentic capability now available to do so. Teacher workload burnout is a documented crisis accelerating demand.

Problem

Science teachers spend enormous time writing assessment items aligned to specific curriculum materials, and existing LLM-based tools hallucinate content, lack curriculum grounding, and cannot generate the diversity of question types (lab-based, multi-step, cross-concept) that good science education requires.

Audience

Middle and high school science teachers in under-resourced districts and curriculum directors at K-12 school networks

Concept

A platform that ingests a school's actual curriculum materials (textbooks, lab guides, state standards) and uses a multi-agent RAG pipeline to generate textbook-grounded, pedagogically validated assessment items across question types, difficulty levels, and cognitive tiers—with a human-review layer that flags low-confidence items. Unlike generic quiz generators, it reasons about knowledge dependencies within the curriculum graph to ensure assessments test prerequisite concepts before advanced ones, and it produces rationales teachers can audit.

The signals behind this idea

The real-world evidence the pipeline drew on to generate this idea.

technology Mon, 17 Aug 2026 00:00:00 -0400
arXiv cs.CL

TeachMateGPT: A Multi-Agent Knowledge-Grounded Framework for Pedagogical Assessment Generation from Science Curriculum Materials

arXiv:2608.13708v1 Announce Type: new Abstract: Automatically generating textbook-grounded assessment items can reduce science teachers' workload, but existing retrieval-augmented generation (RAG) systems rely on flat retrieval, support only single-question generation, lack safeguards against weak evidence, and are ill-suited to low-resource, board-exam-structured curricula. We address these limitations with TeachMateGPT, a multi-agent system contributing four advances to curriculum-grounded science-assessment authoring. (i) COPE, a hierarchical knowledge base replacing token-window chunking with a multi-resolution index that segments documents along syllabus structure and links them at three granularities via a traversable graph-based lineage, matching evidence to each topic's instructional level. (ii) A staged, fail-closed agent pipeline replacing one-shot retrieve-then-generate: routing gates search, retrieval fuses dense and lexical evidence under a coverage gate that withholds gen

Source ↗
technology Mon, 17 Aug 2026 00:00:00 -0400
arXiv cs.CL

TIDE: Proactive Multi-Problem Discovery via Template-Guided Iteration

arXiv:2606.04743v2 Announce Type: replace Abstract: Agents are widely deployed as assistants over documents, tools, and code. However, they typically act only on explicit user requests, which surface only the problems the user has noticed, while many other important problems coexist, hidden in plain sight, within the broader user context, with their total number unknown in advance. We frame this as the task of discovering multiple hidden problems from context, in which coexisting problems should be uncovered, grounded in supporting evidence, and paired with concrete actions. To this end, we introduce TIDE, a template-guided iterative framework with two complementary mechanisms. Specifically, motivated by the observation that single-pass prediction anchors on the most salient cases and yields generic claims, we propose iterative discovery, which surfaces a small batch of candidates per round while conditioning on what has already been found, so subsequent rounds extend coverage; and tho

Source ↗
technology Mon, 17 Aug 2026 00:00:00 -0400
arXiv cs.CL

How Much Do Legal RAG Systems Still Hallucinate?

arXiv:2608.14210v1 Announce Type: new Abstract: Hallucination is a major challenge for retrieval-augmented generation (RAG) systems in the legal domain, where ungrounded answers can lead to serious consequences. To better understand this problem, we conduct a fine-grained analysis of hallucination behavior in eight legal RAG systems across two legal corpora, the GDPR (in English) and a national civil law (in French). Using claim-level and answer-level evaluation, we report on hallucination density and severity, analyze performance across question categories and user personas, and validate our findings on an independent set of 142 legal-expert-authored questions. Our results show that hallucinations remain pervasive, ranging from less than 10% of responses for the best-performing systems to nearly half in the worst case. We further find that false-premise questions, containing incorrect assumptions that must be rejected, produce high hallucination rates on the manually-drafted questions

Source ↗
technology Mon, 17 Aug 2026 00:00:00 -0400
arXiv cs.CL

Decoding Student Minds: Leveraging Conversational Agents for Psychological and Learning Analysis

arXiv:2512.10441v2 Announce Type: replace Abstract: This paper presents a psychologically-aware conversational agent designed to enhance both learning performance and emotional well-being in educational settings. The system combines Large Language Models (LLMs), a knowledge graph-enhanced BERT (KG-BERT), and a bidirectional Long Short-Term Memory (LSTM) network with attention to classify students' cognitive and affective states in real time. Unlike prior chatbots limited to either tutoring or affective support, our approach leverages multimodal data-including textual semantics, prosodic speech features, and temporal behavioral trends-to infer engagement, stress, and conceptual understanding. A pilot study with 45 university students demonstrated improved motivation, reduced stress, and moderate academic gains compared to unimodal baselines. We explicitly discuss the exploratory nature of this small-sample pilot, report effect sizes and inter-rater reliability alongside significance tes

Source ↗
technology Mon, 17 Aug 2026 00:00:00 -0400
arXiv cs.CL

Split the Labor: Separating Evidence Interpretation from Decision Aggregation

arXiv:2608.14509v1 Announce Type: cross Abstract: Systems that ask a language model to reach a conclusion from many sources usually concatenate them into one prompt. This conflates two operations with different requirements. Interpreting a source rewards capacity and context. Combining interpretations rewards fixed arithmetic, comparability across instances, and the option to return nothing. Once separated, the design problem becomes the interface between them. We propose a four-field evidence tuple (hypothesis, reliability bucket, rationale, provenance) and show that fixing it determines both halves. The separation also reveals a failure mode in how such systems combine, which we call count-scale drift. Thresholding a sum of unnormalized weights is exactly posterior thresholding, but at an operating point that slides with the number of sources consulted. The slide grows with reader reliability. When source reliabilities differ, the vote rule and the posterior order instances different

Source ↗
technology Mon, 17 Aug 2026 00:00:00 -0400
arXiv cs.CL

IterCOMP: Reasoning-aware Adaptive Prompt Compression for Multi-hop Question Answering

arXiv:2608.13588v1 Announce Type: new Abstract: Multi-hop question answering requires complex reasoning across multiple evidence segments, which often overwhelms retrieval-augmented generation systems with lengthy and noisy contexts, thereby undermining both efficiency and accuracy. While existing prompt compression methods attempt to address this issue, they are typically designed for single-turn queries and fail to capture interdependent reasoning steps. We propose IterCOMP, a unified, training-free prompt compression framework that incorporates multi-hop reasoning within an iterative compression loop. IterCOMP decomposes documents into evidence segments, evaluates question answerability, and generates targeted follow-up questions to iteratively integrate essential evidence, producing a compact, reasoning-oriented prompt. Experiments on MusiQue, 2WikiMultiHopQA, and HotpotQA demonstrate that IterCOMP achieves substantial improvements in Exact Match and F1 scores while reducing the to

Source ↗