{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2023:ZSZHIT36MIIKTEOHY7GC657DMO","short_pith_number":"pith:ZSZHIT36","schema_version":"1.0","canonical_sha256":"ccb2744f7e6210a991c7c7cc2f77e363b83fe487c3c91466a00c35e5c270dfda","source":{"kind":"arxiv","id":"2307.08927","version":5},"attestation_state":"computed","paper":{"title":"Multi-Stage Cable Routing through Hierarchical Imitation Learning","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.AI"],"primary_cat":"cs.RO","authors_text":"Charles Xu, Gilbert Feng, Jianlan Luo, Kuan Fang, Liam Tan, Sergey Levine, Stefan Schaal, Xinyang Geng","submitted_at":"2023-07-18T02:14:49Z","abstract_excerpt":"We study the problem of learning to perform multi-stage robotic manipulation tasks, with applications to cable routing, where the robot must route a cable through a series of clips. This setting presents challenges representative of complex multi-stage robotic manipulation scenarios: handling deformable objects, closing the loop on visual perception, and handling extended behaviors consisting of multiple steps that must be executed successfully to complete the entire task. In such settings, learning individual primitives for each stage that succeed with a high enough rate to perform a complete"},"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":false,"formal_links_present":false},"canonical_record":{"source":{"id":"2307.08927","kind":"arxiv","version":5},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.RO","submitted_at":"2023-07-18T02:14:49Z","cross_cats_sorted":["cs.AI"],"title_canon_sha256":"9cf887ebc3ed4922967cbfa0b43d2525e90e39f1fa7082db6c22fdfd147f79c7","abstract_canon_sha256":"4c3f4708257e95c63d63dd5e28eaa8c228907eaba67aa1aea20331c5512a4d12"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T07:33:17.989428Z","signature_b64":"yUvhZ31tfe9wkni2eNobNTuH9q17Bx/XEzbX4V2qQT8updHk5npWjNooGsaSOuTk61mhPaPBlVEnqzYOzSLnBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"ccb2744f7e6210a991c7c7cc2f77e363b83fe487c3c91466a00c35e5c270dfda","last_reissued_at":"2026-07-05T07:33:17.988889Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T07:33:17.988889Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Multi-Stage Cable Routing through Hierarchical Imitation Learning","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.AI"],"primary_cat":"cs.RO","authors_text":"Charles Xu, Gilbert Feng, Jianlan Luo, Kuan Fang, Liam Tan, Sergey Levine, Stefan Schaal, Xinyang Geng","submitted_at":"2023-07-18T02:14:49Z","abstract_excerpt":"We study the problem of learning to perform multi-stage robotic manipulation tasks, with applications to cable routing, where the robot must route a cable through a series of clips. This setting presents challenges representative of complex multi-stage robotic manipulation scenarios: handling deformable objects, closing the loop on visual perception, and handling extended behaviors consisting of multiple steps that must be executed successfully to complete the entire task. In such settings, learning individual primitives for each stage that succeed with a high enough rate to perform a complete"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2307.08927","kind":"arxiv","version":5},"verdict":{"id":null,"model_set":{},"created_at":null,"strongest_claim":"","one_line_summary":"","pipeline_version":null,"weakest_assumption":"","pith_extraction_headline":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2307.08927/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"references":{"count":0,"sample":[],"resolved_work":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","internal_anchors":0},"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":"2307.08927","created_at":"2026-07-05T07:33:17.988955+00:00"},{"alias_kind":"arxiv_version","alias_value":"2307.08927v5","created_at":"2026-07-05T07:33:17.988955+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2307.08927","created_at":"2026-07-05T07:33:17.988955+00:00"},{"alias_kind":"pith_short_12","alias_value":"ZSZHIT36MIIK","created_at":"2026-07-05T07:33:17.988955+00:00"},{"alias_kind":"pith_short_16","alias_value":"ZSZHIT36MIIKTEOH","created_at":"2026-07-05T07:33:17.988955+00:00"},{"alias_kind":"pith_short_8","alias_value":"ZSZHIT36","created_at":"2026-07-05T07:33:17.988955+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":7,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2503.10631","citing_title":"HybridVLA: Collaborative Diffusion and Autoregression in a Unified Vision-Language-Action Model","ref_index":90,"is_internal_anchor":false},{"citing_arxiv_id":"2603.02115","citing_title":"Robometer: Scaling General-Purpose Robotic Reward Models via Trajectory Comparisons","ref_index":108,"is_internal_anchor":false},{"citing_arxiv_id":"2605.12090","citing_title":"World Action Models: The Next Frontier in Embodied AI","ref_index":130,"is_internal_anchor":false},{"citing_arxiv_id":"2310.08864","citing_title":"Open X-Embodiment: Robotic Learning Datasets and RT-X Models","ref_index":130,"is_internal_anchor":false},{"citing_arxiv_id":"2410.07864","citing_title":"RDT-1B: a Diffusion Foundation Model for Bimanual Manipulation","ref_index":9,"is_internal_anchor":false},{"citing_arxiv_id":"2405.12213","citing_title":"Octo: An Open-Source Generalist Robot Policy","ref_index":53,"is_internal_anchor":false},{"citing_arxiv_id":"2406.09246","citing_title":"OpenVLA: An Open-Source Vision-Language-Action Model","ref_index":97,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/ZSZHIT36MIIKTEOHY7GC657DMO","json":"https://pith.science/pith/ZSZHIT36MIIKTEOHY7GC657DMO.json","graph_json":"https://pith.science/api/pith-number/ZSZHIT36MIIKTEOHY7GC657DMO/graph.json","events_json":"https://pith.science/api/pith-number/ZSZHIT36MIIKTEOHY7GC657DMO/events.json","paper":"https://pith.science/paper/ZSZHIT36"},"agent_actions":{"view_html":"https://pith.science/pith/ZSZHIT36MIIKTEOHY7GC657DMO","download_json":"https://pith.science/pith/ZSZHIT36MIIKTEOHY7GC657DMO.json","view_paper":"https://pith.science/paper/ZSZHIT36","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2307.08927&json=true","fetch_graph":"https://pith.science/api/pith-number/ZSZHIT36MIIKTEOHY7GC657DMO/graph.json","fetch_events":"https://pith.science/api/pith-number/ZSZHIT36MIIKTEOHY7GC657DMO/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/ZSZHIT36MIIKTEOHY7GC657DMO/action/timestamp_anchor","attest_storage":"https://pith.science/pith/ZSZHIT36MIIKTEOHY7GC657DMO/action/storage_attestation","attest_author":"https://pith.science/pith/ZSZHIT36MIIKTEOHY7GC657DMO/action/author_attestation","sign_citation":"https://pith.science/pith/ZSZHIT36MIIKTEOHY7GC657DMO/action/citation_signature","submit_replication":"https://pith.science/pith/ZSZHIT36MIIKTEOHY7GC657DMO/action/replication_record"}},"created_at":"2026-07-05T07:33:17.988955+00:00","updated_at":"2026-07-05T07:33:17.988955+00:00"}