cập nhật 1 giờ trước

⏱ Độ trễ thật của tab này: trung bình 7.1 giờ sau khi CVE được công bố (n = 5350, sớm nhất 0.1 giờ). Số âm nghĩa là ta thấy trước ngày công bố.

23
When Is Proof-Step Verification Worth Its Cost? Operating Requirements of Certify-or-Decline Verification for Open-Weight Mathematical Reasoning
📄 Paper arXiv cs.AI 3 ngày trước

arXiv:2611.14794v1 Announce Type: new Abstract: Proof-step verification rewrites a solver's answer into typed steps and uses LLM judges to certify or decline. We evaluate this pipeline on open-weight models across GPQA, AIME-2025, and a MATH-500 subset. Certification raises answ…

🅲 hạng C
21
Stress-Testing Sandbagging Detection Under Adaptive Attack
📄 Paper arXiv cs.CR 3 ngày trước

arXiv:2611.14950v1 Announce Type: new Abstract: Developers, auditors and researchers read evaluation scores as evidence of what a model can do. A model that sandbags, scoring low on purpose while keeping the capability, turns a low score into false reassurance. Sandbagging detec…

🅲 hạng C
21
Weak Unit Reducibility of the Eleventh Cyclotomic Field
📄 Paper arXiv cs.CR 3 ngày trước

arXiv:2611.15432v1 Announce Type: new Abstract: We prove that the cyclotomic field $K_{11}=\mathbb{Q}(\zeta_{11})$ is unit reducible but not strongly unit reducible. So every nonzero principal fractional ideal of $K_{11}$ has a generator that is a shortest nonzero vector. For $I…

🅲 hạng C
21
SEC: One-Share Everywhere-Short Secret Sharing from Lossless Expanders
📄 Paper arXiv cs.CR 3 ngày trước

arXiv:2611.16244v1 Announce Type: new Abstract: We introduce SEC, an expander-code-based ramp secret sharing scheme over $\mathbb{Z}$-modules, particularly suitable for lattice-based distributed cryptography. It is everywhere-short: bounded secret coefficients yield bounded shar…

🅲 hạng C
21
Batch, Pack, and Prove: More Efficient Verifiable Computation for CKKS
📄 Paper arXiv cs.CR 3 ngày trước

arXiv:2611.16922v1 Announce Type: new Abstract: An important challenge in homomorphic encryption (HE) is ensuring the integrity of the encrypted computations. Although verifiable computation can address this in theory, making it practical is far from trivial. [Cascudo et al. CRY…

🅲 hạng C
20
Monitoring One Channel Is Not Communication Control: Causal Evidence for Adaptive Reallocation of Joint Message--Route Codes
📄 Paper arXiv cs.AI 5 ngày trước

arXiv:2611.12959v1 Announce Type: new Abstract: Monitoring a visible channel can change how learned agents communicate without removing why communication is useful. We test this distinction in an end-to-end game where a sender and receiver learn a discrete protocol and route pol…

🅲 hạng C
20
ProofDiff: Auditable Argument-Level Comparison of AI-Generated Mathematical Proofs
📄 Paper arXiv cs.AI 6 ngày trước

arXiv:2611.10233v1 Announce Type: new Abstract: Mathematical understanding depends on the route from hypotheses to conclusion: how the parts of a proof function and which dependencies carry the argument forward. This structure can persist when wording or notation changes, while …

🅲 hạng C
20
Is Recursive Self-Improvement Safe?
📄 Paper arXiv cs.AI 6 ngày trước

arXiv:2611.10261v1 Announce Type: new Abstract: The phrase recursive self-improvement (RSI) refers to the idea of an AI system designing and creating another, better AI system, which in turn designs and creates an even better one, and so on. While the idea has a long history, it…

🅲 hạng C
20
Beyond Prompt Attacks: Least-Action Auditing of Concept Erasure
📄 Paper arXiv cs.CR 6 ngày trước

arXiv:2611.10106v1 Announce Type: new Abstract: Concept erasure, or concept unlearning, in text-to-image diffusion models is usually audited with prompt attacks. A prompt attack tests whether one conditioning string still retrieves the erased concept. It does not measure the pro…

🅲 hạng C