Your Benchmark Is an Empirical Measure Over DifficultyThe paper treats a benchmark as an empirical measure over item difficulty and formalizes two failure modes: measure mismatch (benchmark difficulty distribution differs from the intended one) and coverage gaps (uncovered difficulty regions that hide localized training progress). It proposes two diagnostic metrics with theoretical guarantees and analyzes 25 popular benchmarks across 7 domains using estimated item difficulties. It also introduces BenchFill, a difficulty-targeted item rewriting algorithm that reduces local coverage gaps.
huggingface.copaperAdded 31 Oct 2026π§ AI
Retrieving from Your Own Mistakes: On-Policy Training of Embedding Models for Multi-Hop Retrieval-Augmented GenerationOn-policy state training is a method for training chain embedding retrievers for multi-hop RAG on the states the encoder itself reaches, including those built on its own wrong retrievals. Each state is labeled with the earliest missing gold passage, other missing gold passages are masked, and updates are contrastive and mixed with teacher-forced states. It retrieves complete evidence more often than teacher-forced training and graph-based systems, and transfers to harder long-chain HotpotQA and 2WikiMultiHopQA variants the authors built.
arxiv.orgpaperAdded 31 Oct 2026, published 29 Oct 2026π§ AI- Understanding and Mitigating Role Spoofing in LLMs
Understanding and Mitigating Role Spoofing in LLMs is an arXiv paper (October 2026) on role spoofing, a prompt injection where malicious tool output impersonates the user. It shows models track "who said what" using both content cues (semantics, style) and structure cues (control tokens, formatting). Attacks combining fake structure and content succeed often, adversarial training stops only content-based attacks, and linear probes trained to predict conversation roles detect spoofing across settings.
arxiv.orgpaperAdded 31 Oct 2026, published 29 Oct 2026π‘οΈ Security - A Unified Hessian-Guided Framework for Post-Training Quantization
This preprint proposes a unified post-training quantization framework for large language models. It derives a Hessian-guided approximation of the output change caused by joint weight and activation quantization, using a tractable Fisher approximation. Quantization ranges, linear transformations and weight rounding are optimized together under one output-sensitivity objective. The authors report gains over state-of-the-art transformation and rounding methods in channel-wise and block-wise settings.
arxiv.orgpaperAdded 31 Oct 2026, published 29 Oct 2026π§ AI - MAServeBench: Benchmarking Multi-Agent LLM Serving Systems with Hierarchical Collaboration Workloads
MAServeBench is a benchmark that treats multi-agent collaboration as a configurable dimension of LLM serving workloads. Its composable stages model how agents coordinate and exchange context in documented multi-agent workflows, and Hierarchical Semantic Traces record operations and dependencies for reproducible comparisons. Task-linked measurements tie workloads to GPU/NPU behavior, showing serving efficiency does not always mean timely task completion. Code is released.
arxiv.orgpaperAdded 31 Oct 2026, published 29 Oct 2026π§ AI - Benchmarking color judgment in multimodal LLMs with CIE-computable ground truth
A five-task benchmark tests multimodal LLM color judgment against CIE colorimetric ground truth: AWB pair judgment, skin-tone bias direction, CCT estimation, Delta E 2000 pair ordering, and color naming under changing illuminants. Eight endpoints were tested. On ColorChecker-24 stimuli, closed frontier models reach CCT MAE of 715-1056 K versus 1358-2133 K for open-weight models, and a non-ColorChecker control shows this gap is partly template-dependent.
arxiv.orgpaperAdded 31 Oct 2026, published 29 Oct 2026π§ AI - DICE: Decentralized Incentive-driven Federated Learning for Efficient & Scalable Customization of Pretrained Models in Web3
DICE is a blockchain-powered federated learning (BCFL) algorithm for customizing large pretrained models among untrusted Web3 participants. It combines dynamic progressive learning and model slice verification, so hardware-limited participants can train part of the model, with a tree-structured committee consensus protocol and an efficiency-driven incentive scheme to scale to more data holders. Experiments cover vision and language models.
arxiv.orgpaperAdded 31 Oct 2026, published 29 Oct 2026π§ AI - Cryptography and Security Papers (@FSFG) on X
PrivacyEvalClaw is a tool-augmented deliberative agent that audits privacy leakage in LLM jailbreak responses. The paper is by Krishna Kanth Nakka and co-authors, and it was accepted to AACL-IJCNLP 2026 (arXiv 2610.36711, cs.CR). The tweet gives only the title, authors and venue, so the method and results are not described.
x.compaperAdded 30 Oct 2026, published 29 Oct 2026π‘οΈ Security - Cryptography and Security Papers (@FSFG) on X
PrivacyEvalClaw is a tool-augmented deliberative agent for auditing privacy leakage in LLM responses produced under jailbreak prompts. By Krishna Kanth Nakka and five co-authors, the paper is on arXiv (cs.CR) and accepted to AACL-IJCNLP 2026. The fetched post gives only the title, authors and venue, so method details and results are not available here.
x.compaperAdded 30 Oct 2026, published 29 Oct 2026π§ AI - Quantize by Doing: Task-Guided Mixed-Precision Quantization of Vision-Language-Action Models
QbD-VLA is a mixed-precision post-training quantization method for vision-language-action models. It uses task success from short closed-loop evaluations to assign weight and activation bit widths, accounting for interactions between components. On four VLA models across all four LIBERO suites it holds task performance at about 4-bit weights and under 6-bit activations. The gain on SIMPLER is small. On a Franka Research 3 arm, X-VLA shows no detected loss, but Ο0.5 fails.
arxiv.orgpaperAdded 30 Oct 2026, published 28 Oct 2026π§ AI 
Secure Transaction Verification and Authorization (STVA)Secure Transaction Verification and Authorization (STVA) is a draft Standards Track ERC (created October 2026) by @MATOBOYCRYPTO65. It proposes structured human-readable metadata and semantic intent for transactions and UserOperations, an independent simulation and verification interface, and scoped, revocable capability tokens for privileged operations. It targets blind signing and frontend supply-chain attacks, citing the February 2025 Bybit Safe multisig theft. The page gives only the abstract, motivation and core concepts.
ethresear.chpaperPublished and added 28 Oct 2026π‘οΈ Security- Session-Bound Behavioral Watermarking for Autonomous LLM Agents
AgentAnchor is a session-keyed behavioral watermark for attributing LLM agent trajectory logs to an owner. It derives per-step keys from a secret key, a fresh public session ID and semantic observation states, and embeds parity evidence through a KL-bounded exponential tilt. The paper formalizes learned cross-session forgery, and a trusted verifier checks disputed logs using wrong-key calibration and abstention.
arxiv.orgpaperAdded 30 Oct 2026, published 28 Oct 2026π‘οΈ Security - Session-Bound Behavioral Watermarking for Autonomous LLM Agents
AgentAnchor is a session-keyed behavioral watermark that lets an agent owner prove ownership of a trajectory log. Each step key comes from a secret key, a fresh public session identifier and semantic states of recent observations. Parity evidence is embedded through a KL-bounded exponential tilt of action choices. A trusted verifier checks disputed logs without rerunning the agent, using wrong-key calibration and abstention. The paper also formulates a learned cross-session forgery threat.
arxiv.orgpaperAdded 30 Oct 2026, published 28 Oct 2026π§ AI - Post-Training Large Language Models with LLMON
LLMON (LLM Object Notation) is a framework that separates instructions from data and requires explicit identifier-based execution. The authors post-train Granite-4.1 3B and 8B base models with SFT then RL on a 4.6B-token structured corpus covering general, RAG and tool-calling data, with distractor variants. Attack success rates on indirect prompt-injection benchmarks fall from 53-100% to 0.02-5.6%, and general capability is preserved. Attention-based metrics diagnose failures per transformer layer.
arxiv.orgpaperAdded 30 Oct 2026, published 28 Oct 2026π‘οΈ Security - Post-Training Large Language Models with LLMON
LLMON (LLM Object Notation) is a framework that separates executable instructions from passive data and requires explicit identifier-based execution. The paper post-trains Granite-4.1 3B and 8B base models on a 4.6B-token corpus of general, RAG and tool-calling data with distractor variants, using SFT then RL. Attack success rates on indirect prompt-injection benchmarks fall from 53-100% to 0.02-5.6%, with general capabilities preserved. It also adds attention-based per-layer diagnostics.
arxiv.orgpaperAdded 30 Oct 2026, published 28 Oct 2026π§ AI - Statistical Detection of Positional Bias in LLM-Based Recommender Systems: Methodologies and Empirical Evidence
The paper proposes POB-ICM (contingency matrix with Chi-square independence testing) and POB-UNBP (a uniformity null model under permutation-based evaluation) to detect positional bias in top-1, single-turn LLM recommenders. On a RAG product-recommendation testbed with 2000 queries and 20 permutations each (40,000 instances), both methods reject positional independence in all evaluated models. Three metrics quantify the effect, and the bias persists across candidate-set size and temperature. Code is public.
arxiv.orgpaperAdded 30 Oct 2026, published 27 Oct 2026π§ AI - Know, then Draw: A New Learning Paradigm for Visual Generation
Know, then Draw is a learning paradigm for visual generation that uses autoregressive pretraining to acquire semantic knowledge and diffusion post-training for high-fidelity rendering. Controlled comparisons find autoregression the stronger pretraining objective, and semantic quality matters more than AR-only generation quality. This motivates a purely semantic tokenizer trained with language supervision only. A 3B text-to-image model trained in 6,600 H100 GPU-hours scores 86 on GenEval and 87 on DPG-Bench.
arxiv.orgpaperAdded 28 Oct 2026, published 27 Oct 2026π§ AI - VideoLVR: Latent Visual Reasoning over Grounded Video Evidence
VideoLVR is a method that lets video multimodal LLMs build latent visual evidence from local regions at relevant moments and reason over it interleaved with text tokens. A visual token prediction objective, defined over a vocabulary derived from the input video, supervises the latents. It extends to reinforcement learning with sampled visual tokens as actions and final-answer rewards, and improves fine-grained video benchmarks without much context growth.
arxiv.orgpaperAdded 28 Oct 2026, published 27 Oct 2026π§ AI 
Towards Quantum Sensing for Side-Channel AnalysisPreprint on using nitrogen-vacancy (NV) center quantum sensing for electromagnetic side-channel analysis of ICs. The authors build an NV-based RF spectrometer with 1.1 GHz real-time bandwidth and adjustable center frequency, which reads the spectrum in the time domain without Fourier transforms or frequency sweeps. They use it on RSA decryption emanations and for leakage detection on a software Number Theoretic Transform running on a Cortex-M4 microcontroller.
eprint.iacr.orgpaperAdded 28 Oct 2026, published 27 Oct 2026π‘οΈ Security- Tessera: Structure-Completed Evidence Units for Web Retrieval-Augmented Generation
Tessera is a training-free evidence delivery layer for web retrieval-augmented generation. It rebuilds retrieved pages' HTML into fine-grained evidence units, each completed with page title, section path and table headers, then packs the relevant units into the reader context at the same token budget. Tracing evidence over full English Wikipedia shows chunking loses table and infobox content. Tessera adds 5 to 6 accuracy points on three QA benchmarks and carries over to agentic search.
arxiv.orgpaperAdded 28 Oct 2026, published 27 Oct 2026π§ AI - DCKV: Learned Transform Coding of the Prompt KV Cache in Hybrid Language Models
DCKV is a differentiable codec for the prompt KV cache of hybrid language models, which keep a KV cache only in their few full-attention layers. Transform, quantizer and entropy models (conditioned on prompt tokens and already decoded neighbouring positions) are trained end to end against a frozen model. On Qwen3.5-2B it stores a token in over 55 times fewer bytes than bf16 with at most 1.8 points lost on three long-context benchmarks, and over 100 times fewer with at most 3.6 points lost.
arxiv.orgpaperAdded 28 Oct 2026, published 27 Oct 2026π§ AI - AxisQ: Depth-Adaptive Channel--Frequency Quantization for Camouflaged Object Detection
AxisQ is a post-training quantization framework for camouflaged object detection (COD) that allocates activation bits by feature depth. It uses the channel domain for shallow features and the local-frequency domain for deep features, under a fixed per-layer average bit budget. It adds a boundary-aware Hessian approximation for reconstruction. On CAMO at W2A2, weighted F-measure improves 12.7% for CFRN and 33.3% for CamoFormer-P over the strongest baselines.
arxiv.orgpaperAdded 28 Oct 2026, published 27 Oct 2026π§ AI - Alg\{Ossa\}: Decentralized Secure Aggregation with Rotating Committees and Eventual Delivery
AlgOssa is a decentralized secure aggregation protocol built on Ossa, a generic committee-aided, single-server construction for one-shot clients (following OPA and Willow, CRYPTO 2025). Ossa realizes secure aggregation with non-selective abort against a malicious server. AlgOssa adds Algorand-style sortition to rotate leaders and committees, bounds the chance of an honest server, and gives eventual delivery. Classical and post-quantum routes are evaluated.
eprint.iacr.orgpaperAdded 28 Oct 2026, published 27 Oct 2026π‘οΈ Security - Poly2MsgLeaks: Certified Key Recovery from Polynomial-to-Message Leakage
Poly2MsgLeaks is a profiled chosen-ciphertext power-analysis attack on the SMAUG-T (TiMER parameter set) post-quantum KEM that recovers the full 512-coefficient PKE secret from six traces on an STM32F415. It recovers 999 of 1,000 unseen secrets and proves an incorrect key is released with probability at most 2^-2095.6. Single-write message assembly and a two-share masked P2M resisted the evaluated six-execution attack.
eprint.iacr.orgpaperAdded 28 Oct 2026, published 27 Oct 2026π‘οΈ Security - Your Wish Is My Commit: Over-Compliant Refactoring in AI Coding Agents
Your Wish Is My Commit is a controlled study of over-compliant refactoring in Codex and Claude Code, run across five models, 50 algorithmic tasks and 10 object-oriented tasks. Over 3,000 turns of repeated "refactor further" prompts, no model stopped on its own: each rewrote up to 31x the original codebase before first stopping and resumed edits after declaring the task complete. The paper defines six behavioral signals for detecting over-compliance.
arxiv.orgpaperAdded 28 Oct 2026, published 26 Oct 2026π§ AI - Analyzing Compiler-induced Constant-time Violations with Compiler at Scale
CTGREP is a compiler-based framework that applies differential analysis across the whole Clang/LLVM compilation chain to find where, how and under which configurations compiler optimizations break constant-time cryptographic code. Applied to seven libraries, three Clang versions, six targets and thousands of configurations, it led to 48 cases fixed with developers. It also identified seven new problematic LLVM passes and bypassed existing compiler-flag mitigations.
eprint.iacr.orgpaperAdded 27 Oct 2026, published 26 Oct 2026π‘οΈ Security - Cheap AI-Assisted Reverse Engineering and What It Will Do
"Cheap AI-Assisted Reverse Engineering and What It Will Do" is an October 2026 arXiv paper (Computers and Society) arguing that generative AI strains the law of reverse engineering. AI systems can identify hardware components, extract firmware, decompile object code and clone apps, which removes the cost barrier that laws rely on. The authors map these practices onto trade secret, copyright, anti-circumvention, computer misuse and contract law, and sketch possible legal responses with their trade-offs.
arxiv.orgpaperAdded 28 Oct 2026, published 26 Oct 2026π‘οΈ Security - Revisiting ZMAC+: Birthday-Bound Attacks and a Beyond-Birthday-Bound Repair
ZMAC+ is a tweakable-block-cipher MAC (List and Nandi, ToSC 2017) with claimed beyond-birthday-bound security. This ePrint paper (2026/2647) shows a tag-swap attack: for two-block tags, a distinguisher and a fresh-message forgery with constant success probability using O(2^{n/2}) queries in the ideal-TBC model. It also corrects a counting error in the published Lemma 4 and proposes a repaired variant with an adaptive PRF bound of order q^2/2^{n+min(n,t)}.
eprint.iacr.orgpaperPublished and added 26 Oct 2026π‘οΈ Security - Then there is prompt injection, a malicious email, ...: The Wild Wide West of OpenClaw Agentic System Security
An empirical study of security concerns in the OpenClaw AI personal assistant framework, using 25K+ posts from 13 subreddits (162 security-relevant) and 358 security-tagged GitHub issues (180 retained). It maps 521 CWE instances across 59 weakness types, concentrated in access control, sensitive-data exposure, injection and unsafe execution. It extracts 543 practitioner mitigations into seven strategies and reconstructs a sensitive-data exposure path with dummy secrets.
arxiv.orgpaperAdded 28 Oct 2026, published 26 Oct 2026π‘οΈ Security - Cryptanalysis and Repair of "Decentralized Multi-authority ABE for NC$^1$ from BDH"
Cryptology ePrint 2026/2642 presents a plaintext-recovery attack on the DBDH and CBDH variants of the Datta, Komargodski and Waters multi-authority ABE for NC1 (Journal of Cryptology, 2023). It needs one corrupt authority and two users, and succeeds with probability one in the static model. The flaw is an invalid extension of the Rouselakis-Waters LSSS matrix-normalization lemma. The paper also attacks two Datta-Pal (PKC 2023) attribute-based inner-product schemes and proves repaired versions secure in the random oracle model.
eprint.iacr.orgpaperPublished and added 26 Oct 2026π‘οΈ Security
Showing 30 of 422
Show more