跳到正文
研踪PaperTrail

论文库

检索计算机领域论文,按研究方向、作者或关键词筛选。

部分采集异常
正在读取账号与研究记录…

全站更新概况

+0新增论文
+0其中 AI 相关
+2已有论文修订
+100新增 AI 导读

arXiv 最近完成扫描:2026-11-15 09:49 · 全站最近入库:2026-11-14 15:09各信源进度 →

统计口径与数据新鲜度

统计 2026-11-14 09:57 — 2026-11-15 09:57(北京时间) · 点击数字查看对应简报;AI 相关包含在新增论文内。

最近完成检查:2026-11-15 09:49最近发现新增版本:2026-11-14 15:09库内论文最新更新时间:2026-11-13 02:59

每分钟刷新已保存的数据。空检查不代表采集异常;新收录可能包含历史论文。AI 导读按新增版本计数。

23,348 已收录论文19,580 AI 相关6,729 有修订112 HF 社区发现

浏览论文库

时间范围跟随排序:版本更新、本站收录或首次发表。最新收录可能包含历史论文。部分信源异常,查看状态 →

找到 3 篇论文 · 按版本更新时间排序上轮扫描起点 2026-11-15 09:48(北京时间)
新论文 · v1arXiv:2611.14376

保留量子服务结果的引用更新操作极限

Operational limits of reference renewal for retained quantum-service results

Roberto Fernández-Barrios, Iker Pastor-López, Amaia Pikatza-Huerga, Pablo García Bringas

AI 速读 基于摘要

作者报告了一项按预设协议对保留的量子服务结果实施引用更新的实验,结果显示该更新未能确立恢复假设,并暴露出若干操作限制。

quant-ph · cs.SE

查看原文摘要

We implement reference renewal to reconsider retained physical quantum-service results under a prespecified protocol. Twelve transitions retained six results each; ten completed renewal, eight met the prespecified endpoint, and five succeeded using retained results alone. The exact one-sided p=0.0546875 does not establish the recovery hypothesis. Incomplete references, binding failures and sequential waits expose operational limits. Offline reconstruction recovers decisions from preserved counts. Retrospective binding-plus-oracle checking accepts all 60 usable-transition results without renewal. With the exact oracle also supplying calibration scores, the study does not demonstrate incremental numerical-correctness utility of renewal.

新论文 · v1arXiv:2611.01712

When Disagreement Labels Do Not Identify F1 Rankings

Roberto Fernández-Barrios, Iker Pastor-López, Asier González-Santocildes, Pablo García Bringas

原文摘要

Agreement labels cancel from an accuracy comparison but can change an F1 ranking. We specialize partial identification to an explicit audit after labeling disagreements: two agreement counts give exact bounds, certifying a ranking or a choice within a specified F1 tolerance under every completion. Across 3,200 frozen model pairs, shared completions tighten bounds and a 0.01 tolerance reduces labeling costs. A zero-loss (weak-winner) control attributes most savings to positive tolerance, not ties. Guarantees concern the evaluated batch, not future data.

cs.LG

版本更新 · v2arXiv:2610.35235

False-Alarm Improvements and Detection Trade-Offs in Quantum Machine Learning for Intrusion Detection: A Reproducible Secondary Analysis

Roberto Fernández-Barrios, Iker Pastor-López, Asier González-Santocildes, Pablo García Bringas

原文摘要

Published results in quantum machine learning for intrusion detection (QML-IDS) require joint interpretation of false-positive rate (FPR), attack true-positive rate (TPR), and evaluation provenance. We reconstruct operating points in the 25-entry frame selected by Kaissar and colleagues: 21 included articles, 20 identified documentary families, substantive methodological material consulted for 15, and 24 descriptive points from five. In one test-labelled comparison, a quantum support vector machine reduces FPR from 6.875% for random forest to 3.329%, while TPR decreases from 93.955% to 93.682%; both rates improve against three other comparators. In another study, a complete benign row identifies FPR as 12/6000 (0.200%), despite incomplete attack-side allocation that requires additional assumptions for TPR. Normalized matrices identify detection ranges rather than a unique aggregate rate. A uniform provenance rule separates training-described and test-adjusted results from six conditional illustrations whose independence remains unverified. The contribution is a reproducible interpretation of favorable comparisons and detection trade-offs, without converting descriptive results or hypothetical calculations into operational guarantees.

cs.CR