Most cited papers
- Verified
DeepRetrieval: Hacking Real Search Engines and Retrievers with Large Language Models via Reinforcement Learning
Jiang, P., Lin, J., Cao, L., Tian, R., Kang, S., Wang, Z., Sun, J., & Han, J. (2025) · arXiv
- Verified
Development of an aspect of executive control: Development of the abilities to remember what I said and to ?Do as I say, not as I do?
Diamond, A., & Taylor, C. (1996) · Developmental Psychobiology
- Verified
D-SMART: Enhancing LLM Dialogue Consistency via Dynamic Structured Memory And Reasoning Tree
Lei, X., Li, Q., Zhang, M., & Zhang, M. (2025) · arXiv
- Verified
Selective serotonin reuptake inhibitors and withdrawal symptoms: a review of the literature
Therrien, F., & Markowitz, J. S. (1997) · Human Psychopharmacology: Clinical and Experimental
- Verified
Ripple Effect Protocol: Coordinating Agent Populations
Chopra, A., Sharma, A., Ahmad, F., Muscariello, L., Pandey, V., & Raskar, R. (2025) · arXiv
- Verified
Bridging graph data models: RDF, RDF-star, and property graphs as directed acyclic graphs
Gelling, E., Fletcher, G., & Schmidt, M. (2023) · arXiv
- Verified
Rheological and calorimetric evidences of the fractionated crystallization of iPP dispersed in ethylene/?-olefin copolymers
Manaure, A. C., Morales, R. A., S�nchez, J. J., & M�ller, A. J. (1997) · Journal of Applied Polymer Science
- Verified
Avoiding Haag's theorem with parameterized quantum field theory
Seidewitz, E. (2015) · arXiv
- Verified
Mapping the Exploitation Surface: A 10,000-Trial Taxonomy of What Makes LLM Agents Exploit Vulnerabilities
Mouzouni, C. (2026) · arXiv
- Verified
BiasScope: Towards Automated Detection of Bias in LLM-as-a-Judge Evaluation
Lai, P., Ou, Z., Wang, Y., Wang, L., Yang, J., Chen, Y., & Chen, G. (2026) · arXiv
- Verified
Reliable evaluation of adversarial robustness with an ensemble of diverse parameter-free attacks
Croce, F., & Hein, M. (2020) · arXiv
- Verified
Decentralized autonomous organizations – Evolution, challenges, and opportunities
Schneider, B., Ballesteros, R., Moriggl, P., & Asprion, P. (2022) · Fachhochschule Nordwestschweiz FHNW
- Verified
MixBench-TS: A Multivariate Time Series Forecasting Benchmark Where Channel Mixing Pays Off
Abdelmalak, I., Putzke, M., Choi, J., Hanika, T., Yalavarthi, V. K., & Schmidt-Thieme, L. (2026) · arXiv
- Verified
Can Agents Forget When Asked? A Benchmark for Memory Unlearning in LLM Agents
Xie, B., Wang, C., Ge, G., Wang, S., Niu, F., Zhang, H., & Wang, W. (2026) · arXiv
- Verified
International Best Track Archive for Climate Stewardship (IBTrACS) Project, Version 4
Kenneth, R., Howard, J., James, P., Michael, C., & Carl, J. (2019) · NOAA National Centers for Environmental Information
- Verified
Towards Explaining the Regularization Effect of Initial Large Learning Rate in Training Neural Networks
Li, Y., Wei, C., & Ma, T. (2019) · arXiv
- Verified
RQ-RAG: Learning to Refine Queries for Retrieval Augmented Generation
Chan, C.-M., Xu, C., Yuan, R., Luo, H., Xue, W., Guo, Y., & Fu, J. (2024) · arXiv
- Verified
Bridging Reinforcement Learning and Optimal Control via Feasible Action Mapping
Richter, S., Giammarino, A., Torrente, G., Blakeman, S., & Dürr, P. (2026) · arXiv
- Verified
Killing Horizons as Equipotential Hypersurfaces
Smolić, I. (2012) · arXiv
- Verified
Immortal polymerization: The outset, development, and application
Inoue, S. (2000) · Journal of Polymer Science Part A: Polymer Chemistry
- Verified
Medical Graph RAG: Towards Safe Medical Large Language Model via Graph Retrieval-Augmented Generation
Wu, J., Zhu, J., Qi, Y., Chen, J., Xu, M., Menolascina, F., & Grau, V. (2024) · arXiv
- Verified
Closing the Loop in Affect-Driven Game Adaptation: A Systematic Review
Lopes, P., Fachada, N., & Fonseca, M. (2025) · arXiv
- Verified
Evaluation of the fractionated crystallization of dispersed polyolefins in a polystyrene matrix
Arnal, M. L., Matos, M. E., Morales, R. A., Santana, O. O., & Müuller, A. J. (1998) · Macromolecular Chemistry and Physics
Go further with a free account
Verify every reference, keep papers in a library, and ask questions across them.
Sign up - it is free