{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2020:657ZYI2VDRA4EKQF6KLVTPOZAU","short_pith_number":"pith:657ZYI2V","schema_version":"1.0","canonical_sha256":"f77f9c23551c41c22a05f29759bdd90506789487a767ba6d6fd9d2bd71995763","source":{"kind":"arxiv","id":"2011.04999","version":1},"attestation_state":"computed","paper":{"title":"Untangling Dense Knots by Learning Task-Relevant Keypoints","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI","cs.LG"],"primary_cat":"cs.RO","authors_text":"Ashwin Balakrishna, Brijen Thananjeyan, Jeffrey Ichnowski, Jennifer Grannen, Joseph E. Gonzalez, Ken Goldberg, Michael Laskey, Minho Hwang, Priya Sundaresan, Vainavi Viswanath","submitted_at":"2020-11-10T09:29:01Z","abstract_excerpt":"Untangling ropes, wires, and cables is a challenging task for robots due to the high-dimensional configuration space, visual homogeneity, self-occlusions, and complex dynamics. We consider dense (tight) knots that lack space between self-intersections and present an iterative approach that uses learned geometric structure in configurations. We instantiate this into an algorithm, HULK: Hierarchical Untangling from Learned Keypoints, which combines learning-based perception with a geometric planner into a policy that guides a bilateral robot to untangle knots. To evaluate the policy, we perform "},"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":"2011.04999","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.RO","submitted_at":"2020-11-10T09:29:01Z","cross_cats_sorted":["cs.AI","cs.LG"],"title_canon_sha256":"fc107974669c88b69c6ecb0e54b0ee7a730e3ca9ebd7d74d748371bd03b71573","abstract_canon_sha256":"147971a30537b69c49bf1d17df5bead859926159b32410592c27f3263e42e514"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T01:50:42.743015Z","signature_b64":"AuAKv/Mq7dPMxci0LMdQolAACdTqD4NLGRHJoppNcOqo+gk3HcbvlbWxYIaVPujDhakl/7bThejYXKGn4NuFBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"f77f9c23551c41c22a05f29759bdd90506789487a767ba6d6fd9d2bd71995763","last_reissued_at":"2026-07-05T01:50:42.742584Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T01:50:42.742584Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Untangling Dense Knots by Learning Task-Relevant Keypoints","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI","cs.LG"],"primary_cat":"cs.RO","authors_text":"Ashwin Balakrishna, Brijen Thananjeyan, Jeffrey Ichnowski, Jennifer Grannen, Joseph E. Gonzalez, Ken Goldberg, Michael Laskey, Minho Hwang, Priya Sundaresan, Vainavi Viswanath","submitted_at":"2020-11-10T09:29:01Z","abstract_excerpt":"Untangling ropes, wires, and cables is a challenging task for robots due to the high-dimensional configuration space, visual homogeneity, self-occlusions, and complex dynamics. We consider dense (tight) knots that lack space between self-intersections and present an iterative approach that uses learned geometric structure in configurations. We instantiate this into an algorithm, HULK: Hierarchical Untangling from Learned Keypoints, which combines learning-based perception with a geometric planner into a policy that guides a bilateral robot to untangle knots. To evaluate the policy, we perform "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2011.04999","kind":"arxiv","version":1},"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/2011.04999/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":"2011.04999","created_at":"2026-07-05T01:50:42.742639+00:00"},{"alias_kind":"arxiv_version","alias_value":"2011.04999v1","created_at":"2026-07-05T01:50:42.742639+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2011.04999","created_at":"2026-07-05T01:50:42.742639+00:00"},{"alias_kind":"pith_short_12","alias_value":"657ZYI2VDRA4","created_at":"2026-07-05T01:50:42.742639+00:00"},{"alias_kind":"pith_short_16","alias_value":"657ZYI2VDRA4EKQF","created_at":"2026-07-05T01:50:42.742639+00:00"},{"alias_kind":"pith_short_8","alias_value":"657ZYI2V","created_at":"2026-07-05T01:50:42.742639+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2606.04206","citing_title":"DLO-Lab: Benchmarking Deformable Linear Object Manipulations with Differentiable Physics","ref_index":43,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/657ZYI2VDRA4EKQF6KLVTPOZAU","json":"https://pith.science/pith/657ZYI2VDRA4EKQF6KLVTPOZAU.json","graph_json":"https://pith.science/api/pith-number/657ZYI2VDRA4EKQF6KLVTPOZAU/graph.json","events_json":"https://pith.science/api/pith-number/657ZYI2VDRA4EKQF6KLVTPOZAU/events.json","paper":"https://pith.science/paper/657ZYI2V"},"agent_actions":{"view_html":"https://pith.science/pith/657ZYI2VDRA4EKQF6KLVTPOZAU","download_json":"https://pith.science/pith/657ZYI2VDRA4EKQF6KLVTPOZAU.json","view_paper":"https://pith.science/paper/657ZYI2V","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2011.04999&json=true","fetch_graph":"https://pith.science/api/pith-number/657ZYI2VDRA4EKQF6KLVTPOZAU/graph.json","fetch_events":"https://pith.science/api/pith-number/657ZYI2VDRA4EKQF6KLVTPOZAU/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/657ZYI2VDRA4EKQF6KLVTPOZAU/action/timestamp_anchor","attest_storage":"https://pith.science/pith/657ZYI2VDRA4EKQF6KLVTPOZAU/action/storage_attestation","attest_author":"https://pith.science/pith/657ZYI2VDRA4EKQF6KLVTPOZAU/action/author_attestation","sign_citation":"https://pith.science/pith/657ZYI2VDRA4EKQF6KLVTPOZAU/action/citation_signature","submit_replication":"https://pith.science/pith/657ZYI2VDRA4EKQF6KLVTPOZAU/action/replication_record"}},"created_at":"2026-07-05T01:50:42.742639+00:00","updated_at":"2026-07-05T01:50:42.742639+00:00"}