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

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

20
Science Prediction Universe
📄 Paper arXiv cs.AI 6 ngày trước

arXiv:2611.15049v1 Announce Type: new Abstract: Humanity has long sought to explain natural phenomena. Reliable prediction of experimental outcomes is a central test of our understanding of the processes that produce them. If artificial general intelligence (AGI) is to surpass h…

🅲 hạng C
20
Advancing Weighted Partial MaxSAT Solving via Differentiable GPU Guidance
📄 Paper arXiv cs.AI 6 ngày trước

arXiv:2611.15091v1 Announce Type: new Abstract: We present a GPU-CPU hybrid framework for Weighted Partial MaxSAT (WPMAX-SAT) that complements state-of-the-art CPU solvers with differentiable GPU optimization. The GPU stage directly optimizes instance-specific categorical decisi…

🅲 hạng C
20
MIGRO: A Decoupled and Portable Long-Term Memory System for Language Models
📄 Paper arXiv cs.AI 6 ngày trước

arXiv:2611.15315v1 Announce Type: new Abstract: Language models evolve, but the observations, revisions, and context accumulated through user interactions should remain usable. Each new model must be able to retrieve past evidence, track revisions, and add new observations. We p…

🅲 hạng C
20
Incrementally Verifiable Oracle Aided Computation
📄 Paper arXiv cs.CR 6 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
20
Stress-Testing Sandbagging Detection Under Adaptive Attack
📄 Paper arXiv cs.CR 6 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
20
obfsgen: Generative Tunnel Obfuscation
📄 Paper arXiv cs.CR 6 ngày trước

arXiv:2611.15019v1 Announce Type: new Abstract: Encrypted tunnels are widely used to circumvent censorship, which has drawn censors' efforts to detect and block them. As the circumvention tunnels in widest use have largely converged on TLS, detection has shifted from the content…

🅲 hạng C
20
IoTPwnBench: A Synthetic Benchmark for IoT Firmware Security Analysis
📄 Paper arXiv cs.CR 6 ngày trước

arXiv:2611.15316v1 Announce Type: new Abstract: Building and evaluating security tools for IoT firmware requires targets whose weaknesses are known in ad- vance and can be reproduced in a running device. Two problems remain: (1) firmware collected from real-world products provid…

🅲 hạng C
20
Weak Unit Reducibility of the Eleventh Cyclotomic Field
📄 Paper arXiv cs.CR 6 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
20
Chinese Whispers About Vulnerabilities
📄 Paper arXiv cs.CR 6 ngày trước

arXiv:2611.15462v1 Announce Type: new Abstract: The dissemination of information about known software vulnerabilities occurs online in various ways. Everything from email and development systems to social media are used. Given this variety and a dataset of about 382 thousand onl…

🅲 hạng C
20
Your Secrets Are Showing: Deep Image Hiding Models Are Surprisingly Easy to Attack
📄 Paper arXiv cs.CR 6 ngày trước

arXiv:2611.15583v1 Announce Type: new Abstract: In this work, we ask whether an attacker can go beyond detecting a hidden image and tell what it depicts, even without knowing which model hid it. We show that, for deep image hiding, this is surprisingly easy. To test this, we bui…

🅲 hạng C
20
CoordX Types: A Trustless, Swappable Type System for Shared Records
📄 Paper arXiv cs.CR 6 ngày trước

arXiv:2611.16128v1 Announce Type: new Abstract: The CoordX Protocol carries signed and encrypted entries between parties. It proves who wrote each entry and who had permission to write it. It does not say what an entry means. That task belongs above the protocol layer. This pape…

🅲 hạng C
20
SEC: One-Share Everywhere-Short Secret Sharing from Lossless Expanders
📄 Paper arXiv cs.CR 6 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
20
Batch, Pack, and Prove: More Efficient Verifiable Computation for CKKS
📄 Paper arXiv cs.CR 6 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
Maturity$^2$: Assessing the Maturity of Crypto Agility Maturity Models
📄 Paper arXiv cs.CR 6 ngày trước

arXiv:2611.17003v1 Announce Type: new Abstract: Crypto agility maturity models aim to support organizations in preparing for cryptographic transitions, such as migrating to post-quantum cryptography. Recognizing the importance of measurable maturity, NIST references several such…

🅲 hạng C
20
JustRUA: A Controlled Study of GPT-6 Robot-Use Agents
📄 Paper HF Daily Papers 9 ngày trước

GPT-6 Astra can drive a robot arm directly through a fixed harness, and scores of such robot-use agents on RoboDojo have risen quickly since. Reported systems differ in harness and test subset and often change several designs at once, so it is hard to tell which choices produce t…

🅲 hạng C
20
Learning Anisotropic Prediction Targets for Flow Models
📄 Paper HF Daily Papers 7 ngày trước

Flow-based generative models are trained on a hand-chosen prediction target, such as the velocity, the noise, or the clean data. This choice strongly affects training and sample quality. We introduce Anisotropic Flow Models (AnisoFlow), which replaces a fixed prediction target wi…

🅲 hạng C
20
AgentProofBench: Benchmarking Reusable Verifiers for Web Agents
📄 Paper HF Daily Papers 26 ngày trước

Reusable Web-agent verification requires a rule to follow changing requirements and support subsequent execution. We introduce AgentProofBench, which connects paired tests of a frozen acceptance rule to execution from identical saved openings. The resource spans 97 tasks, 79 fami…

🅲 hạng C
20
ThinkBit: Search Codewords, Recalibrate Scales, Select by Reasoning
📄 Paper HF Daily Papers 25 ngày trước

Reasoning language models generate thousands of tokens per answer, and generation speed is limited by memory bandwidth, so storing weights in two bits instead of bfloat16 can potentially make inference 8times cheaper. Two-bit methods are usually judged by perplexity and multiple-…

🅲 hạng C
20
Vision-Language-Action or World-Action? Just Action Models
📄 Paper HF Daily Papers 24 ngày trước

The vision-language-action (VLA) and world-action model (WAM) communities debate whether control policies should inherit pretrained knowledge from vision-language models or from visual generators. The debate, however, bundles three separable choices: backbone initialization, the …

🅲 hạng C
20
SearchHorizonBench: A Benchmark for Search Value in AI Agents
📄 Paper HF Daily Papers 25 ngày trước

AI agents must decide when another search is worth its cost. Answer-success probabilities capture question difficulty, while this decision requires estimating the additional benefit of search. We introduce SearchHorizonBench, a benchmark for learning and evaluating search value f…

🅲 hạng C