{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2026:LW2MF4YFBQDLCPV323T4XDNFC2","short_pith_number":"pith:LW2MF4YF","schema_version":"1.0","canonical_sha256":"5db4c2f3050c06b13ebbd6e7cb8da516a3f3902ef963ceb44b563d19b101d77a","source":{"kind":"arxiv","id":"2605.15536","version":1},"attestation_state":"computed","paper":{"title":"SkiP: When to Skip and When to Refine for Efficient Robot Manipulation","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"SkiP lets a single robot policy learn to skip low-information steps by relabeling actions to the next key segment.","cross_cats":["cs.AI","cs.CV"],"primary_cat":"cs.RO","authors_text":"Chunjie Chen, Feng Yan, Guanqi Peng, Liang Lin, Lingbo Liu, Mingtong Dai, Xinyu Wu, Yongjie Bai","submitted_at":"2026-05-15T02:16:34Z","abstract_excerpt":"Previous imitation learning policies predict future actions at every control step, whether in smooth motion phases or precise, contact-rich operation phases. This uniform treatment is wasteful: most steps in a manipulation trajectory traverse free space and carry little task-relevant information, while a small fraction of \\emph{key} steps around contacts, grasps, and alignment demand dense, high-resolution prediction. We propose a novel \\emph{action relabeling} mechanism: at each timestep in a skip segment, we replace the behavior cloning target with the action at the entrance of the next key "},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":true,"formal_links_present":false},"canonical_record":{"source":{"id":"2605.15536","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.RO","submitted_at":"2026-05-15T02:16:34Z","cross_cats_sorted":["cs.AI","cs.CV"],"title_canon_sha256":"173048e56d0a7b73aa755ddbda2f4b4ace439114a051037b04a2788348b1bb78","abstract_canon_sha256":"58d303fb09aedd932f07f820c45dd6454e7cb4d53d143b466b00c606e9e7c0aa"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-20T00:01:04.090251Z","signature_b64":"n4EklD3FUOFkUlV1+tjZW4m5j9P0w1hw7m84LUVUvstL+/dRr4DUeb0kxB2Y8lou+/QG9sASrozpDZ0nnI4PBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"5db4c2f3050c06b13ebbd6e7cb8da516a3f3902ef963ceb44b563d19b101d77a","last_reissued_at":"2026-05-20T00:01:04.089484Z","signature_status":"signed_v1","first_computed_at":"2026-05-20T00:01:04.089484Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"SkiP: When to Skip and When to Refine for Efficient Robot Manipulation","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"SkiP lets a single robot policy learn to skip low-information steps by relabeling actions to the next key segment.","cross_cats":["cs.AI","cs.CV"],"primary_cat":"cs.RO","authors_text":"Chunjie Chen, Feng Yan, Guanqi Peng, Liang Lin, Lingbo Liu, Mingtong Dai, Xinyu Wu, Yongjie Bai","submitted_at":"2026-05-15T02:16:34Z","abstract_excerpt":"Previous imitation learning policies predict future actions at every control step, whether in smooth motion phases or precise, contact-rich operation phases. This uniform treatment is wasteful: most steps in a manipulation trajectory traverse free space and carry little task-relevant information, while a small fraction of \\emph{key} steps around contacts, grasps, and alignment demand dense, high-resolution prediction. We propose a novel \\emph{action relabeling} mechanism: at each timestep in a skip segment, we replace the behavior cloning target with the action at the entrance of the next key "},"claims":{"count":4,"items":[{"kind":"strongest_claim","text":"The resulting Skip Policy (SkiP) dynamically leaps over skip segments and intensively refines actions in key segments, within a single unified network requiring no learned skip planner or hierarchical structure.","source":"verdict.strongest_claim","status":"machine_extracted","claim_id":"C1","attestation":"unclaimed"},{"kind":"weakest_assumption","text":"That replacing the behavior cloning target at each timestep in a skip segment with the action at the entrance of the next key segment still produces a policy that can be executed safely and successfully in closed-loop control without additional safety mechanisms or recovery behaviors.","source":"verdict.weakest_assumption","status":"machine_extracted","claim_id":"C2","attestation":"unclaimed"},{"kind":"one_line_summary","text":"SkiP introduces action relabeling and Motion Spectrum Keying to skip redundant steps in robot trajectories, cutting executed steps by 15-40% while maintaining success rates across 72 simulated and 3 real tasks.","source":"verdict.one_line_summary","status":"machine_extracted","claim_id":"C3","attestation":"unclaimed"},{"kind":"headline","text":"SkiP lets a single robot policy learn to skip low-information steps by relabeling actions to the next key segment.","source":"verdict.pith_extraction.headline","status":"machine_extracted","claim_id":"C4","attestation":"unclaimed"}],"snapshot_sha256":"1c3a479fa055f8374b43474cb498ef8fc8cdcbb4c9559b3caaea0d1d30d67510"},"source":{"id":"2605.15536","kind":"arxiv","version":1},"verdict":{"id":"3fa46dd3-3f9e-4390-8d4a-753614261df7","model_set":{"reader":"grok-4.3"},"created_at":"2026-05-19T14:43:37.646871Z","strongest_claim":"The resulting Skip Policy (SkiP) dynamically leaps over skip segments and intensively refines actions in key segments, within a single unified network requiring no learned skip planner or hierarchical structure.","one_line_summary":"SkiP introduces action relabeling and Motion Spectrum Keying to skip redundant steps in robot trajectories, cutting executed steps by 15-40% while maintaining success rates across 72 simulated and 3 real tasks.","pipeline_version":"pith-pipeline@v0.9.0","weakest_assumption":"That replacing the behavior cloning target at each timestep in a skip segment with the action at the entrance of the next key segment still produces a policy that can be executed safely and successfully in closed-loop control without additional safety mechanisms or recovery behaviors.","pith_extraction_headline":"SkiP lets a single robot policy learn to skip low-information steps by relabeling actions to the next key segment."},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2605.15536/integrity.json","findings":[],"available":true,"detectors_run":[{"name":"doi_title_agreement","ran_at":"2026-05-19T15:01:17.508280Z","status":"completed","version":"1.0.0","findings_count":0},{"name":"doi_compliance","ran_at":"2026-05-19T14:49:57.498206Z","status":"completed","version":"1.0.0","findings_count":0},{"name":"cited_work_retraction","ran_at":"2026-05-19T14:22:01.596129Z","status":"completed","version":"1.0.0","findings_count":0},{"name":"claim_evidence","ran_at":"2026-05-19T14:21:54.031797Z","status":"completed","version":"1.0.0","findings_count":0},{"name":"shingle_duplication","ran_at":"2026-05-19T13:49:41.831018Z","status":"skipped","version":"0.1.0","findings_count":0},{"name":"citation_quote_validity","ran_at":"2026-05-19T13:49:41.368291Z","status":"skipped","version":"0.1.0","findings_count":0},{"name":"ai_meta_artifact","ran_at":"2026-05-19T13:33:22.616410Z","status":"skipped","version":"1.0.0","findings_count":0}],"snapshot_sha256":"c86c0b58b8891eac92500ad23b77e861695f00f96d8422e5622a32585011b7af"},"references":{"count":43,"sample":[{"doi":"","year":2025,"title":"Sail: Faster-than-demonstration ex- ecution of imitation learning policies","work_id":"b0ac09a5-d73c-4af7-a4c3-1f6dac0c9b8a","ref_index":1,"cited_arxiv_id":"","is_internal_anchor":false},{"doi":"","year":2025,"title":"Learning to see and act: Task-aware virtual view exploration for robotic manipulation, 2025","work_id":"7144d840-b4a4-4515-9a0b-47446511206e","ref_index":2,"cited_arxiv_id":"","is_internal_anchor":false},{"doi":"","year":2024,"title":"$\\pi_0$: A Vision-Language-Action Flow Model for General Robot Control","work_id":"f790abdc-a796-482f-a40d-f8ee035ecfc2","ref_index":3,"cited_arxiv_id":"2410.24164","is_internal_anchor":true},{"doi":"10.15607/rss.2023.xix.025","year":2023,"title":"RT-1: Robotics Transformer for Real-World Control at Scale","work_id":"659dc47f-4ba2-43a2-9839-898f038dd21c","ref_index":4,"cited_arxiv_id":"","is_internal_anchor":false},{"doi":"","year":null,"title":"Diffusion policy: Visuomotor policy learning via action diffusion,","work_id":"5d704eb2-ea49-46f9-8912-57d37e638c86","ref_index":5,"cited_arxiv_id":"","is_internal_anchor":false}],"resolved_work":43,"snapshot_sha256":"0966a44cd1dd5850c2ba8a0de418aec9f0fc8b61affb14f171feaff9ab739b2d","internal_anchors":10},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"author_claims":{"count":0,"strong_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"builder_version":"pith-number-builder-2026-05-17-v1"},"aliases":[{"alias_kind":"arxiv","alias_value":"2605.15536","created_at":"2026-05-20T00:01:04.089609+00:00"},{"alias_kind":"arxiv_version","alias_value":"2605.15536v1","created_at":"2026-05-20T00:01:04.089609+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2605.15536","created_at":"2026-05-20T00:01:04.089609+00:00"},{"alias_kind":"pith_short_12","alias_value":"LW2MF4YFBQDL","created_at":"2026-05-20T00:01:04.089609+00:00"},{"alias_kind":"pith_short_16","alias_value":"LW2MF4YFBQDLCPV3","created_at":"2026-05-20T00:01:04.089609+00:00"},{"alias_kind":"pith_short_8","alias_value":"LW2MF4YF","created_at":"2026-05-20T00:01:04.089609+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/LW2MF4YFBQDLCPV323T4XDNFC2","json":"https://pith.science/pith/LW2MF4YFBQDLCPV323T4XDNFC2.json","graph_json":"https://pith.science/api/pith-number/LW2MF4YFBQDLCPV323T4XDNFC2/graph.json","events_json":"https://pith.science/api/pith-number/LW2MF4YFBQDLCPV323T4XDNFC2/events.json","paper":"https://pith.science/paper/LW2MF4YF"},"agent_actions":{"view_html":"https://pith.science/pith/LW2MF4YFBQDLCPV323T4XDNFC2","download_json":"https://pith.science/pith/LW2MF4YFBQDLCPV323T4XDNFC2.json","view_paper":"https://pith.science/paper/LW2MF4YF","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2605.15536&json=true","fetch_graph":"https://pith.science/api/pith-number/LW2MF4YFBQDLCPV323T4XDNFC2/graph.json","fetch_events":"https://pith.science/api/pith-number/LW2MF4YFBQDLCPV323T4XDNFC2/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/LW2MF4YFBQDLCPV323T4XDNFC2/action/timestamp_anchor","attest_storage":"https://pith.science/pith/LW2MF4YFBQDLCPV323T4XDNFC2/action/storage_attestation","attest_author":"https://pith.science/pith/LW2MF4YFBQDLCPV323T4XDNFC2/action/author_attestation","sign_citation":"https://pith.science/pith/LW2MF4YFBQDLCPV323T4XDNFC2/action/citation_signature","submit_replication":"https://pith.science/pith/LW2MF4YFBQDLCPV323T4XDNFC2/action/replication_record"}},"created_at":"2026-05-20T00:01:04.089609+00:00","updated_at":"2026-05-20T00:01:04.089609+00:00"}