{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2026:LW2MF4YFBQDLCPV323T4XDNFC2","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"58d303fb09aedd932f07f820c45dd6454e7cb4d53d143b466b00c606e9e7c0aa","cross_cats_sorted":["cs.AI","cs.CV"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.RO","submitted_at":"2026-05-15T02:16:34Z","title_canon_sha256":"173048e56d0a7b73aa755ddbda2f4b4ace439114a051037b04a2788348b1bb78"},"schema_version":"1.0","source":{"id":"2605.15536","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2605.15536","created_at":"2026-05-20T00:01:04Z"},{"alias_kind":"arxiv_version","alias_value":"2605.15536v1","created_at":"2026-05-20T00:01:04Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2605.15536","created_at":"2026-05-20T00:01:04Z"},{"alias_kind":"pith_short_12","alias_value":"LW2MF4YFBQDL","created_at":"2026-05-20T00:01:04Z"},{"alias_kind":"pith_short_16","alias_value":"LW2MF4YFBQDLCPV3","created_at":"2026-05-20T00:01:04Z"},{"alias_kind":"pith_short_8","alias_value":"LW2MF4YF","created_at":"2026-05-20T00:01:04Z"}],"graph_snapshots":[{"event_id":"sha256:a7ccb3470550a81083f7594a1568acb1162bd80d1ecb69838ee0f396749775d7","target":"graph","created_at":"2026-05-20T00:01:04Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":4,"items":[{"attestation":"unclaimed","claim_id":"C1","kind":"strongest_claim","source":"verdict.strongest_claim","status":"machine_extracted","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."},{"attestation":"unclaimed","claim_id":"C2","kind":"weakest_assumption","source":"verdict.weakest_assumption","status":"machine_extracted","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."},{"attestation":"unclaimed","claim_id":"C3","kind":"one_line_summary","source":"verdict.one_line_summary","status":"machine_extracted","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."},{"attestation":"unclaimed","claim_id":"C4","kind":"headline","source":"verdict.pith_extraction.headline","status":"machine_extracted","text":"SkiP lets a single robot policy learn to skip low-information steps by relabeling actions to the next key segment."}],"snapshot_sha256":"1c3a479fa055f8374b43474cb498ef8fc8cdcbb4c9559b3caaea0d1d30d67510"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"integrity":{"available":true,"clean":true,"detectors_run":[{"findings_count":0,"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"}],"endpoint":"/pith/2605.15536/integrity.json","findings":[],"snapshot_sha256":"c86c0b58b8891eac92500ad23b77e861695f00f96d8422e5622a32585011b7af","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"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 ","authors_text":"Chunjie Chen, Feng Yan, Guanqi Peng, Liang Lin, Lingbo Liu, Mingtong Dai, Xinyu Wu, Yongjie Bai","cross_cats":["cs.AI","cs.CV"],"headline":"SkiP lets a single robot policy learn to skip low-information steps by relabeling actions to the next key segment.","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.RO","submitted_at":"2026-05-15T02:16:34Z","title":"SkiP: When to Skip and When to Refine for Efficient Robot Manipulation"},"references":{"count":43,"internal_anchors":10,"resolved_work":43,"sample":[{"cited_arxiv_id":"","doi":"","is_internal_anchor":false,"ref_index":1,"title":"Sail: Faster-than-demonstration ex- ecution of imitation learning policies","work_id":"b0ac09a5-d73c-4af7-a4c3-1f6dac0c9b8a","year":2025},{"cited_arxiv_id":"","doi":"","is_internal_anchor":false,"ref_index":2,"title":"Learning to see and act: Task-aware virtual view exploration for robotic manipulation, 2025","work_id":"7144d840-b4a4-4515-9a0b-47446511206e","year":2025},{"cited_arxiv_id":"2410.24164","doi":"","is_internal_anchor":true,"ref_index":3,"title":"$\\pi_0$: A Vision-Language-Action Flow Model for General Robot Control","work_id":"f790abdc-a796-482f-a40d-f8ee035ecfc2","year":2024},{"cited_arxiv_id":"","doi":"10.15607/rss.2023.xix.025","is_internal_anchor":false,"ref_index":4,"title":"RT-1: Robotics Transformer for Real-World Control at Scale","work_id":"659dc47f-4ba2-43a2-9839-898f038dd21c","year":2023},{"cited_arxiv_id":"","doi":"","is_internal_anchor":false,"ref_index":5,"title":"Diffusion policy: Visuomotor policy learning via action diffusion,","work_id":"5d704eb2-ea49-46f9-8912-57d37e638c86","year":null}],"snapshot_sha256":"0966a44cd1dd5850c2ba8a0de418aec9f0fc8b61affb14f171feaff9ab739b2d"},"source":{"id":"2605.15536","kind":"arxiv","version":1},"verdict":{"created_at":"2026-05-19T14:43:37.646871Z","id":"3fa46dd3-3f9e-4390-8d4a-753614261df7","model_set":{"reader":"grok-4.3"},"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","pith_extraction_headline":"SkiP lets a single robot policy learn to skip low-information steps by relabeling actions to the next key segment.","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.","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."}},"verdict_id":"3fa46dd3-3f9e-4390-8d4a-753614261df7"}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:c7c036c6eb3358f91147a4fe9ad6a930778bb6a8b0e9c6b07d458baee41ccbac","target":"record","created_at":"2026-05-20T00:01:04Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"58d303fb09aedd932f07f820c45dd6454e7cb4d53d143b466b00c606e9e7c0aa","cross_cats_sorted":["cs.AI","cs.CV"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.RO","submitted_at":"2026-05-15T02:16:34Z","title_canon_sha256":"173048e56d0a7b73aa755ddbda2f4b4ace439114a051037b04a2788348b1bb78"},"schema_version":"1.0","source":{"id":"2605.15536","kind":"arxiv","version":1}},"canonical_sha256":"5db4c2f3050c06b13ebbd6e7cb8da516a3f3902ef963ceb44b563d19b101d77a","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"5db4c2f3050c06b13ebbd6e7cb8da516a3f3902ef963ceb44b563d19b101d77a","first_computed_at":"2026-05-20T00:01:04.089484Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-20T00:01:04.089484Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"n4EklD3FUOFkUlV1+tjZW4m5j9P0w1hw7m84LUVUvstL+/dRr4DUeb0kxB2Y8lou+/QG9sASrozpDZ0nnI4PBQ==","signature_status":"signed_v1","signed_at":"2026-05-20T00:01:04.090251Z","signed_message":"canonical_sha256_bytes"},"source_id":"2605.15536","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:c7c036c6eb3358f91147a4fe9ad6a930778bb6a8b0e9c6b07d458baee41ccbac","sha256:a7ccb3470550a81083f7594a1568acb1162bd80d1ecb69838ee0f396749775d7"],"state_sha256":"bd21509d548b99814b669bb27924d6273c605d39f69000018a2b890e8a477e67"}