A shared humanoid policy reported higher success than LHM-Humanoid on seen and unseen object-transport tasks, but success fell as the number of objects increased.
A preprint describes a robot that watches for meaningful changes after human-object interactions and uses a vision-language model to plan assistance without a task request. The reported comparison is described as comparable, but the available extraction omits the numerical results and uncertainty estimates needed to judge how close the systems were.
CrashSim generated safety-critical scenarios that tracked real-world crash behavior and crash-type statistics more closely than competing methods. In closed-loop tests, the resulting nuCrash set produced much wider performance differences among five autonomous-driving planners.
The tested methods reached more than 99% of the study's HVmax on several graph sets, while the preprint says they may not recover every best trade-off.
A review of public discussions, interviews and repositories finds that many software specifications mix requirements with implementation detail, while practitioners use the workflow selectively.
A preprint study of software repositories found that coding-agent adoption coincided with more activity, but repositories with more structured committed AI practices had smaller increases in some static-analysis quality measures. The authors stress that the findings are associations, not proof that configuration caused the difference.
In a laboratory test with one human collaborator and a seven-degree-of-freedom robot, an adaptive controller recorded a 95% average success rate, compared with 83% for a fixed-stiffness version and 69% for a deterministic baseline.
A preprint reports that cached Event Tokens produced the best reported ranking score and higher retrieval scores across several industrial recommendation comparisons.
A mathematical preprint gives deterministic bounds linking a code’s excess quadratic discrepancy to how unevenly its correction-radius balls cover a finite Hamming space. The result does not show closeness to any particular perfect code or establish that all admissible perfect codes exist.
LM-X recorded higher average task success than the tested controls while exposing three online signals for progress, next events and local action reliability.
TacForcing updates unfinished action blocks with execution-time tactile feedback and reported the highest average success rates in both simulated and real-world evaluations. The study was limited to six tasks in each setting and two robot platforms.
Six vision-language models showed more agreement when ranking 3D objects along affective, or feeling-related, adjective pairs than along unrelated pairs, but less than on geometric controls. The pattern varied sharply across object categories and changed when researchers altered the text used to define each axis.
EVEREST recorded the strongest overall mask-overlap and pixel-level precision-recall scores on SocioSeg, while the study does not show whether the result generalizes beyond that benchmark.
A preprint study reports that CRAMER adapted a frozen sequential recommender to natural-language requests, outperforming the strongest baseline in most tested settings while adding less reported inference overhead.
A test-time adaptation method for vision-language navigation recorded higher reported scores than the cited baseline on three unseen-environment benchmarks, while its real-world evidence remained qualitative.
A preprint examines two io_uring vulnerabilities alongside Linux 6.18's SLUB sheaf/barn caching and reports three exploitation techniques, including a configuration-specific local privilege escalation.
A robotics preprint reports higher success and shorter solver times when a planner branches as other agents' intentions are revealed, while stressing that the evidence comes from simulations.
A small benchmark found that coding agents could turn detailed specifications and empty workspaces into mostly working repositories, but the last few failures often came from narrow, easy-to-miss requirements.
A small observational study found that software-development tasks involving generative AI were associated with higher self-rated cognitive load, but task type mattered more and wearable data added little.
A failure-bank method reported higher success and lower policy-induced cost than base policies in ten-task averages for π0.5 and π0, but its mean policy cost was higher than AEGIS.
A modeling comparison on a reconstructed 2015 Ukraine Power Grid network found that CVSS, EPSS, SSVC and IronMiner can produce different priorities. The authors said the systems capture overlapping but non-equivalent dimensions of vulnerability risk.
A new benchmark found that coding agents spent much of their effort locating relevant code across large systems, while the best tested setup completed 26.3% of tasks.
A recommender-system method called Mult-BiW reported stronger offline accuracy and larger gains for less-popular items, while falling short of the strongest baseline on two Google metrics.
The paper reports higher measured throughput in 37 of 40 GLM 5.2 and MiniMax M2.7 settings and the highest measured throughput in 21 of 28 Kimi K3 settings, while throughput fell in one reuse ablation after the combined MPU phase.
A single-host benchmark found that a separate assurance layer could refresh security posture below a five-second software delivery gate, while leaving detection accuracy untested.
A preprint presents a symbolic-numeric eigensolver that recovered repeated solutions in a two-equation polynomial example and reconstructed a sample symmetric tensor. The reported results illustrate the method, but do not establish broad speed, stability, or accuracy.
An arXiv preprint defines one-, three- and six-component probability functions for LET+K and reports formal equivalence results for its semantic and syntactic updates.
A theoretical and computational preprint examines how the Bernard-Letac construction turns repeated draws from a biased source into a uniform outcome. It reports exact fairness, sharper prime-modulus cost results, and favorable results against two procedural comparators in the listed benchmark configurations.
A theoretical analysis says Khatri-Rao sketches can reach a nearly linear dependence on subspace dimension, narrowing a gap with unstructured random sketches.
A preprint reports that BERT had the strongest overall scores for assigning cyber threat intelligence events to sectors, with a caveat about unequal sector coverage.
A test-suite-free framework built around an AI model produced C candidates that often compiled and matched held-out input-output checks, but the benchmark also exposed false acceptances and weaker results on stripped binaries.
A theoretical preprint offers a direct Haar-based analysis of randomized quasi-Monte Carlo integration and derives an expected squared-error bound under specified function assumptions, but reports no experiments.
HubMixer sends recommendation features through compact learned hubs before mixing them and writing them back to individual tokens. The preprint reports the best offline AUC on four objectives, fewer parameters than RankMixer and TokenMixer, and a 5.48% online conversion improvement before full deployment in the tested business.
An updated Magma benchmark separates reaching a bug, satisfying its trigger condition, and detecting the resulting fault. In reported 24-hour campaigns, 77 of 127 bugs were reached and 43 were triggered, while AFL++ recorded the highest observed trigger count.
An arXiv preprint presents a unified Rényi framework for composite binary testing, combining finite-sample bounds with asymptotic results that separate two Type II error regimes.