Most cited papers
- Verified
Distillation Scaling Laws
Busbridge, D., Shidani, A., Weers, F., Ramapuram, J., Littwin, E., & Webb, R. (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
TripleRE: Knowledge Graph Embeddings via Tripled Relation Vectors
Yu, L., Luo, Z., Liu, H., Lin, D., Li, H., & Deng, Y. (2022) · arXiv
- Verified
CARE: Experience-Guided Atomic Corrective Execution for Vision-Language-Action Policies
Xiao, J., Jiang, J., Zhang, Z., Wang, Y., Zhang, Z., Lu, H., & Wang, L. (2026) · arXiv
- Verified
Bridging Dynamics Gaps via Diffusion Schrödinger Bridge for Cross-Domain Reinforcement Learning
Zhang, H., & Guo, Y. (2026) · arXiv
- Verified
Retrieval-Augmented Score Distillation for Text-to-3D Generation
Seo, J., Hong, S., Jang, W., Kim, I. H., Kwak, M., Lee, D., & Kim, S. (2024) · arXiv
- Verified
Policy-Driven World Model Adaptation for Robust Offline Model-based Reinforcement Learning
Chen, J., Xu, L., Venugopal, A., & Schneider, J. (2025) · arXiv
- Verified
Conformal Prediction Under Covariate Shift
Tibshirani, R. J., Barber, R. F., Candes, E. J., & Ramdas, A. (2019) · 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
DiMuRe: Diagnosis-Guided Multilevel Recovery for Robotic Task Execution
Yi, R., Wu, Y., Zhang, H., Dai, P., Gao, Z., Chen, J., & Sun, C. (2026) · arXiv
- 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
RepoFusion: Training Code Models to Understand Your Repository
Shrivastava, D., Kocetkov, D., de Vries, H., Bahdanau, D., & Scholak, T. (2023) · 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
SUMONE: A Simple and Efficient Summarizer for Plug-and-Play Agent Memory
Zhang, J., Li, A., Zhang, C., & Wang, Y. (2026) · arXiv
- Verified
Validation of a Real-Time Manual Wheelchair Simulator through Biomechanical and Perceptual Measures: A Comparison with Overground Propulsion
Bayat, A., & Chénier, F. (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
Less is More: Learning to Refine Dialogue History for Personalized Dialogue Generation
Zhong, H., Dou, Z., Zhu, Y., Qian, H., & Wen, J.-R. (2022) · 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
Go further with a free account
Verify every reference, keep papers in a library, and ask questions across them.
Sign up - it is free