Quipu: A Governed Bitemporal Knowledge Graph Store That Turns Audits Into Queries
Score
77反转四项默认设定并把审计化为查询，视角新颖且直击Agent写入场景的治理盲区。
理论设计、多个基准评测与真实缺口发现形成完整闭环，证据充分。
提供可嵌入的存储级治理层，对Agent基础设施、知识图谱与合规系统有直接工程参考意义。
针对Agent大规模写入知识图谱的当前痛点，时效性很强。
arXiv预印本经结构化基准验证，但尚未明确经过同行评审，信源可信度中等偏上。
Base 85 × T2 Source weight ×0.9 = 77
Curation line 70Selected
Why selected
It systematically inverts core governance defaults for agent-written knowledge graphs, backed by rigorous evaluation and a real gap discovery, combining academic and engineering value.
AI commentary
「Quipu's value is not another graph store; it moves governance from dashboards and middleware into the store kernel, turning audits into queries. It matters for agent-infrastructure, knowledge-graph, and compliance engineers; if you want trustworthiness and accountability for multi-agent facts, its lattice and signed-verdict design are directly worth borrowing.」
Quick overview
The paper presents Quipu, an embeddable knowledge-graph store designed for agent-driven writes. It inverts four defaults of human-curated stores: no fact enters without passing a gate that evaluates the pending post-state; data, trust labels, verdicts, and rules are all bitemporal; named graphs become the unit of authority and trust, composed under a lattice whose invariant is that composition never widens; and the governance specification, trace, and signed verdicts are themselves facts in the store, making audit T ⊨ Σ a query. Evaluated on Census and DEMM-Bench, Quipu eliminates planted defects, re-derives all satisfied verdicts faithfully as of their instant, and surfaces a live enforcement gap that the audit names with its remediation.
- Quipu combines write gates, a bitemporal data model, a named-graph trust lattice, and governance-as-in-store-queries, making audit T ⊨ Σ a query.
- In the Census multi-writer lifecycle, the gated store ends with 0 of 6 planted defects versus 6 of 6 ungated; all 7 composition probes uphold the lattice contract.
- 50 of 50 satisfied verdicts re-derive faithfully as of their instant, while all 50 would be misreported under a latest-only rule set; the SARC reference checker agrees verdict-for-verdict.
- On DEMM-Bench, content-only reading answers all 512 property-level questions with zero overclaim under all eight degradation conditions, and surfaced a gap in what a denial's verdict attests.
Full text
This is an AI-generated Chinese digest; use "View original" for the source text.
Related items
85
FeaturedSetoka: A Benchmark for Hierarchical User Understanding in Personalized Agents over Heterogeneous Data
Setoka：面向异构数据个性化Agent的层级用户理解基准
This paper is well worth attention, especially for researchers and engineers working on personalized agents, dialogue systems, and memory-augmented AI. It not only provides a benchmark but defines levels of user understanding from psychology, revealing systematic failures of current systems at higher levels. If you are designing memory-based agents, this paper reminds you that memory systems need to support cross-temporal, cross-source abstract reasoning, not just retrieval.
85
FeaturedBAND: Bayesian Network Distribution Regression for High-Dimensional Distribution Estimation – Breaking the Curse
BAND：高维分布估计的贝叶斯网络回归方法——打破维度诅咒
This paper is a must-read for anyone working on high-dimensional statistics, probabilistic modeling, and generative AI. It provides a simple yet powerful theoretical answer: sparsity can break the curse of dimensionality, and Bayesian networks offer a natural framework. Compared to black-box methods like VAEs and GANs, BAND is interpretable and provably convergent, especially valuable for industry needs like reliable confidence intervals. If you research time series forecasting or risk management, this paper may change how you approach high-dimensional density estimation.
84
FeaturedCycle-Consistent and Uncertainty-Aware Neural Surrogates for Tokamak Edge Plasmas
循环一致与不确定性感知的托卡马克边缘等离子体神经代理模型
This paper is worth attention because it demonstrates how advanced AI techniques (cycle consistency, uncertainty quantification) directly address a core computational bottleneck in nuclear fusion. For fusion researchers and engineers, it offers a practical tool to speed up simulations by orders of magnitude without sacrificing accuracy; for AI practitioners, it provides an excellent case of self-supervised learning and inverse problem solving in scientific applications.
83
FeaturedEquivariant Learning of a Transferable Three-Dimensional Classical Density Functional
等变学习可迁移的三维经典密度泛函
The most striking aspect of this paper is its direct coupling of machine learning to a core problem in statistical mechanics, using equivariant networks to learn a transferable density functional without any labels. For researchers in liquid physics or soft matter, this could be a new paradigm: do we need to run separate simulations for every new system anymore? For AI researchers, it also shows how to embed physical symmetries and variational principles into models rather than just fitting data. I recommend focusing on the methods, especially how equivariance and variational consistency are implemented—that's the real essence.
83
FeaturedComputational and Statistical Guarantees of the c-Rectified Flow
c-Rectified Flow 的计算与统计保证
This paper moves rectified flow from 'works in practice' to 'theoretically controllable,' which is especially important for those working on the underlying algorithms of generative models. If you are tuning pipelines like FLUX or SD3, understanding that ordinary rectified flow can fail when covariances do not commute may help you avoid hidden training pitfalls.
83
FeaturedLearning Deployable Manipulation Policies from High-Fidelity UMI Data Alone
从高保真UMI数据学习可部署操作策略
The most striking point of this paper is proving that pure robot-free data can match real teleoperation performance, breaking the convention of needing a small real-robot anchor for post-training. For research groups looking to reduce hardware costs and industrial robot application developers, HiFi-UMI's data production system and open-source dataset are directly usable resources. Pay attention to the engineering details of head-mounted SLAM and microsecond synchronization—they are key to achieving the reported accuracy.
83
FeaturedCapital Markets LLM Reliability Score: From Plausible to Bankable
资本市场LLM可靠性评分：从“看似合理”到“可银行化”
This paper is valuable for both finance and AI communities: it provides an actionable, workflow-oriented evaluation framework that's closer to real needs than generic benchmarks. If you're deploying LLMs in fintech or responsible for explainability/auditability, this is a must-read. The finding on decision usefulness is particularly striking—judges agree it's critical, yet models vary the most on it.
83
FeaturedWhere Should Optimizer State Live? Tiered State Allocation for Memory-Efficient Mixture-of-Experts Training
优化器状态应放在哪里？面向内存高效MoE训练的分层状态分配
This paper is highly valuable for teams training MoE models: it demonstrates that with careful optimizer state allocation, one can dramatically reduce memory without sacrificing accuracy—and even improve performance. It is especially relevant for labs or enterprises constrained by 40 GB or 80 GB GPU memory. The tiered strategy and ablation on momentum retention are worth studying for optimizing training frameworks like DeepSpeed or Megatron.