跳到正文
研踪PaperTrail

论文库

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

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

全站更新概况

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

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

统计口径与数据新鲜度

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

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

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

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

浏览论文库

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

找到 2 篇论文 · 按版本更新时间排序上轮扫描起点 2026-11-16 01:33(北京时间)
版本更新 · v2arXiv:2606.29553

An annihilation-number Caro-Wei bound: a TxGraffiti conjecture and an independence-number bracket

Chakshu Gupta

原文摘要

The independence number $α$ of a finite simple graph lies between the polynomial-time computable Havel-Hakimi residue $R$ and annihilation number $a$. The Caro-Wei sum $W$ gives another lower bound and the known upper bound $α\le(Δ+1)W/2$ for maximum degree $Δ\ge1$. This upper bound does not by itself control the larger quantity $a$. This note proves $a\le(Δ+1)W/2$ for $Δ\ge1$, with equality attained, for example, by regular graphs of positive degree and even order. Together with $R\ge W$, this bound shows that the interval from $R$ to $a$ improves or matches both Caro-Wei endpoints. Its sharp worst-case endpoint ratio remains $(Δ+1)/2$, even among connected graphs. For maximum degree at least three, the bound also proves the inequality $α\ge(a+R)/Δ$ conjectured by TxGraffiti, an automated conjecturing program. A direct calculation handles connected graphs of maximum degree two. Together these cases resolve the conjecture for every connected graph with at least three vertices. The single edge is the only nontrivial connected exception. Equality holds for exactly eight connected graphs up to isomorphism. For maximum degree at least three, the conjectured lower bound never exceeds the residue, so it gives no stronger independence estimate.

math.CO · cs.DM

版本更新 · v3arXiv:2610.30383

Rank Ceiling for Twiddle-Perturbation Faults on the Forward NTT

Chakshu Gupta

原文摘要

ML-KEM and ML-DSA compute forward number-theoretic transforms on secret polynomials. Their fixed multipliers, or twiddles, are a documented fault-attack target. This paper characterises the linear map from a secret polynomial to the difference between correct and faulted transform outputs. Each selected twiddle takes a fixed changed field value at every use during one call; zero and nonzero replacements are covered. For one replacement, rank equals the number of butterflies sharing its twiddle, halving by layer from 128 to 2 for ML-KEM and to 1 for ML-DSA. With one replacement per layer, known fault positions, replacement values and a raw transform difference determine every coefficient except the constant and linear coefficients for ML-KEM, or the constant for ML-DSA. Lean 4 certifies this result for both 256-coefficient shapes over fields of characteristic other than two, with nonzero original twiddles. Those coefficients cancel from the difference for every allowed fault set and replacement choice. Seed storage motivates comparing a known correct public key with a released faulty key from the same seed. If only one ML-KEM secret-polynomial transform is affected and all other computations are unchanged, the decoded key difference is a known matrix column times the transform difference. An invertible column entry reconstructs the latter. For ML-DSA, reconstruction and exact candidate counts from paired compressed keys remain unestablished.

cs.CR