{"arxiv_id":"2603.22991","incoming":{"papers":2,"sentences":4,"groups":[{"kind":"supports_this_paper","label":"Cites it as support","papers":1,"sentences":1,"quotes":[{"arxiv_id":"2606.02735","title":"See Less, Specify More: Visual Evidence Budgets for Generalizable VLAs","url":"/paper/2606.02735","section":"Introduction","sentence":"In finite-data robot learning, this bottleneck is introduced not for efficiency but to reduce nuisance dependence and improve generalization [ref] .","intent_p":0.97,"contests_p":null}]},{"kind":"background","label":"Cites it as background","papers":2,"sentences":2,"quotes":[{"arxiv_id":"2608.00391","title":"The Gate, Not the Cache: Gate Provenance Bounds the Closed-Loop Reliability of Training-Free VLA Token Skipping","url":"/paper/2608.00391","section":"Related Work","sentence":"The pruning route removes those tokens altogether, with a saliency score deciding which patches carry too little task-relevant information to keep [ref] , and token merging is a close relative that folds redundant patches together rather than dropping them [ref] .","intent_p":0.99,"contests_p":null},{"arxiv_id":"2606.02735","title":"See Less, Specify More: Visual Evidence Budgets for Generalizable VLAs","url":"/paper/2606.02735","section":"Related Work","sentence":"In parallel, the vision literature and recent VLA work use token selection and token pruning to reduce redundancy or improve efficiency [ref] .","intent_p":0.92,"contests_p":null}]}],"unlabelled_sentences":1},"outgoing":{"papers":14,"sentences":30,"groups":[{"kind":"method_or_tool","label":"Uses the method or tool of","papers":4,"sentences":4,"quotes":[{"arxiv_id":"2410.24164","title":"$\\pi_0$: A Vision-Language-Action Flow Model for General Robot Control","url":"/paper/2410.24164","section":"Experiments Setup","sentence":"Specifically, within the simulation environment, we integrate VLA-IAP with established open-source VLA backbones, including OpenVLA-OFT [ref] , DreamVLA [ref] , $π_0$ [ref] and $π_0.5$ [ref] , and benchmark performance on LIBERO [ref] , VLABench [ref] , and CALVIN [ref] .","intent_p":0.95,"contests_p":null},{"arxiv_id":"2502.19645","title":"Fine-Tuning Vision-Language-Action Models: Optimizing Speed and Success","url":"/paper/2502.19645","section":"Experiments Setup","sentence":"Specifically, within the simulation environment, we integrate VLA-IAP with established open-source VLA backbones, including OpenVLA-OFT [ref] , DreamVLA [ref] , $π_0$ [ref] and $π_0.5$ [ref] , and benchmark performance on LIBERO [ref] , VLABench [ref] , and CALVIN [ref] .","intent_p":0.95,"contests_p":null},{"arxiv_id":"2504.16054","title":"$\\pi_{0.5}$: a Vision-Language-Action Model with Open-World Generalization","url":"/paper/2504.16054","section":"Experiments Setup","sentence":"Specifically, within the simulation environment, we integrate VLA-IAP with established open-source VLA backbones, including OpenVLA-OFT [ref] , DreamVLA [ref] , $π_0$ [ref] and $π_0.5$ [ref] , and benchmark performance on LIBERO [ref] , VLABench [ref] , and CALVIN [ref] .","intent_p":0.95,"contests_p":null},{"arxiv_id":"2507.04447","title":"DreamVLA: A Vision-Language-Action Model Dreamed with Comprehensive World Knowledge","url":"/paper/2507.04447","section":"Experiments Setup","sentence":"Specifically, within the simulation environment, we integrate VLA-IAP with established open-source VLA backbones, including OpenVLA-OFT [ref] , DreamVLA [ref] , $π_0$ [ref] and $π_0.5$ [ref] , and benchmark performance on LIBERO [ref] , VLABench [ref] , and CALVIN [ref] .","intent_p":0.95,"contests_p":null}]},{"kind":"background","label":"Cites as background","papers":11,"sentences":16,"quotes":[{"arxiv_id":"2509.22093","title":null,"url":"/paper/2509.22093","section":"Motion Prior.","sentence":"Existing dynamic pruning methods [ref] typically rely on both first-order velocity signals in action space and visual attention scores to regulate pruning strategies.","intent_p":0.96,"contests_p":null},{"arxiv_id":"2509.05614","title":"SpecPrune-VLA: Accelerating Vision-Language-Action Models via Action-Aware Self-Speculative Pruning","url":"/paper/2509.05614","section":"Motion Prior.","sentence":"Existing dynamic pruning methods [ref] typically rely on both first-order velocity signals in action space and visual attention scores to regulate pruning strategies.","intent_p":0.96,"contests_p":null},{"arxiv_id":"2410.24164","title":"$\\pi_0$: A Vision-Language-Action Flow Model for General Robot Control","url":"/paper/2410.24164","section":"Vision-Language-Action Models","sentence":"Recent works adopt continuous action representations: $π_0$ [ref] employs diffusion policies for precise motor control, while OpenVLA [ref] integrates diverse robotic datasets for instruction-following tasks, including object manipulation and container handling.","intent_p":0.98,"contests_p":null},{"arxiv_id":"2406.09246","title":"OpenVLA: An Open-Source Vision-Language-Action Model","url":"/paper/2406.09246","section":"Vision-Language-Action Models","sentence":"Recent works adopt continuous action representations: $π_0$ [ref] employs diffusion policies for precise motor control, while OpenVLA [ref] integrates diverse robotic datasets for instruction-following tasks, including object manipulation and container handling.","intent_p":0.98,"contests_p":null},{"arxiv_id":"2506.10100","title":"EfficientVLA: Training-Free Acceleration and Compression for Vision-Language-Action Models","url":"/paper/2506.10100","section":"Introduction","sentence":"Later works (e.g., VLA-Cache [ref] , EfficientVLA [ref] , SpecPrune-VLA [ref] , VLA-ADP [ref] ) incorporated spatiotemporal and action cues to enable dynamic pruning regulation (Fig. [ref], Temporal stage).","intent_p":0.95,"contests_p":null}]}],"unlabelled_sentences":10},"claims":[],"thresholds":{"intent_p":0.8,"supports_p":0.95,"contests_p":0.7},"method":"Citing sentences come from each paper's LaTeX source; every \\cite marks the sentence and the works it cites. Pith's classifier typed each sentence. A label is shown at intent probability 0.8 or more (0.95 for support), a contest at 0.7 or more. Measured accuracy against two blind model families is at https://pith.science/accuracy. The quoted sentences are the citing authors' own.","held_up":null,"_links":{"html":"https://pith.science/paper/2603.22991"}}