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

⏱ Độ trễ thật của tab này: trung bình 7.3 giờ sau khi CVE được công bố (n = 5336, 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
23
AutoAssumption: Searching over Assumptions Discovers ML-Systems Algorithms
📄 Paper arXiv cs.AI 3 ngày trước

arXiv:2611.14844v1 Announce Type: new Abstract: Many advances in ML systems came from breaking an assumption that earlier methods took for granted: speculative decoding dropped the assumption that a model needs one forward pass per token. Yet algorithms rarely state their assump…

🅲 hạng C
23
VRMaaS: Verifiable Reward-Model-as-a-Service for Trustworthy LLM Alignment
📄 Paper arXiv cs.CR 3 ngày trước

arXiv:2611.14984v1 Announce Type: new Abstract: Reward models (RMs) are increasingly deployed as service components in LLM alignment pipelines, where payment, audit, moderation, and governance workflows act on the scores they return. An inference proof alone does not show whethe…

🅲 hạng C
21
Incrementally Verifiable Oracle Aided Computation
📄 Paper arXiv cs.CR 3 ngày trước

arXiv:2611.14698v1 Announce Type: new Abstract: Incrementally verifiable computation (IVC) allows a prover to maintain a short proof that can be efficiently updated after each computation step, without retaining or recomputing the preceding execution. Standard IVC schemes do not…

🅲 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
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
Sable: A Small-Field Sumcheck Argument for Bit-Exact Inference of Large Language Models
📄 Paper arXiv cs.CR 5 ngày trước cũng có trên: HF Daily Papers

arXiv:2611.14083v1 Announce Type: new Abstract: We present Sable, an argument system and single-GPU prover for the statement that a committed, integer-quantized transformer produced a given token sequence from a given prompt, bit for bit. Sable fixes an integer function F_O with…

🅲 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
ScreenProof: Where Is This Screen Wrong? Finding UI Faults Without a Reference
📄 Paper arXiv cs.AI 6 ngày trước

arXiv:2611.10234v1 Announce Type: new Abstract: A phone screen can be wrong in ways that need no reference: a label that runs off the screen, letters that touch, a line that breaks one character before its end, one button with sharp corners among round ones. We ask whether a mod…

🅲 hạng C
20
zk-DEAP: A Zero-Knowledge Decentralized Encrypted Aggregation Protocol
📄 Paper arXiv cs.CR 6 ngày trước

arXiv:2611.10020v1 Announce Type: new Abstract: Secure aggregation in domains such as federated learning, Internet of Things, and voting requires operating on private inputs while preserving confidentiality, verifying that each input satisfies constraints, and avoiding trusted p…

🅲 hạng C