{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2021:T5RF7DN64JXAEJJWNH5PKYE2QZ","short_pith_number":"pith:T5RF7DN6","schema_version":"1.0","canonical_sha256":"9f625f8dbee26e02253669faf5609a864bf50804c6b60e0746d448016095ddc8","source":{"kind":"arxiv","id":"2109.09163","version":2},"attestation_state":"computed","paper":{"title":"CaTGrasp: Learning Category-Level Task-Relevant Grasping in Clutter from Simulation","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.AI","cs.CV","cs.SY","eess.SY"],"primary_cat":"cs.RO","authors_text":"Bowen Wen, Kostas Bekris, Stefan Schaal, Wenzhao Lian","submitted_at":"2021-09-19T16:48:33Z","abstract_excerpt":"Task-relevant grasping is critical for industrial assembly, where downstream manipulation tasks constrain the set of valid grasps. Learning how to perform this task, however, is challenging, since task-relevant grasp labels are hard to define and annotate. There is also yet no consensus on proper representations for modeling or off-the-shelf tools for performing task-relevant grasps. This work proposes a framework to learn task-relevant grasping for industrial objects without the need of time-consuming real-world data collection or manual annotation. To achieve this, the entire framework is tr"},"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":"2109.09163","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.RO","submitted_at":"2021-09-19T16:48:33Z","cross_cats_sorted":["cs.AI","cs.CV","cs.SY","eess.SY"],"title_canon_sha256":"4733a4af00b812c801f2e5c9ca5090e46ff1dc216ff3ce8a023a86e485c879be","abstract_canon_sha256":"7601c70e3b5821e0bdbd5c1c4ea11a3e0df22e4279eac4df4cf90db92068e9d3"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T04:00:18.152559Z","signature_b64":"qq+lK1w4O8j+chIitqSc2I/fQL/Wih2+HFp/MU0qVclmGDTLTizJ6U9PCKYGpLrVKd/e1tzvr0UDCpcacqPGBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"9f625f8dbee26e02253669faf5609a864bf50804c6b60e0746d448016095ddc8","last_reissued_at":"2026-07-05T04:00:18.152150Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T04:00:18.152150Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"CaTGrasp: Learning Category-Level Task-Relevant Grasping in Clutter from Simulation","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.AI","cs.CV","cs.SY","eess.SY"],"primary_cat":"cs.RO","authors_text":"Bowen Wen, Kostas Bekris, Stefan Schaal, Wenzhao Lian","submitted_at":"2021-09-19T16:48:33Z","abstract_excerpt":"Task-relevant grasping is critical for industrial assembly, where downstream manipulation tasks constrain the set of valid grasps. Learning how to perform this task, however, is challenging, since task-relevant grasp labels are hard to define and annotate. There is also yet no consensus on proper representations for modeling or off-the-shelf tools for performing task-relevant grasps. This work proposes a framework to learn task-relevant grasping for industrial objects without the need of time-consuming real-world data collection or manual annotation. To achieve this, the entire framework is tr"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2109.09163","kind":"arxiv","version":2},"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/2109.09163/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":"2109.09163","created_at":"2026-07-05T04:00:18.152206+00:00"},{"alias_kind":"arxiv_version","alias_value":"2109.09163v2","created_at":"2026-07-05T04:00:18.152206+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2109.09163","created_at":"2026-07-05T04:00:18.152206+00:00"},{"alias_kind":"pith_short_12","alias_value":"T5RF7DN64JXA","created_at":"2026-07-05T04:00:18.152206+00:00"},{"alias_kind":"pith_short_16","alias_value":"T5RF7DN64JXAEJJW","created_at":"2026-07-05T04:00:18.152206+00:00"},{"alias_kind":"pith_short_8","alias_value":"T5RF7DN6","created_at":"2026-07-05T04:00:18.152206+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2412.15398","citing_title":"Tabletop Object Rearrangement: Structure, Complexity, and Efficient Combinatorial Search-Based Solutions","ref_index":83,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/T5RF7DN64JXAEJJWNH5PKYE2QZ","json":"https://pith.science/pith/T5RF7DN64JXAEJJWNH5PKYE2QZ.json","graph_json":"https://pith.science/api/pith-number/T5RF7DN64JXAEJJWNH5PKYE2QZ/graph.json","events_json":"https://pith.science/api/pith-number/T5RF7DN64JXAEJJWNH5PKYE2QZ/events.json","paper":"https://pith.science/paper/T5RF7DN6"},"agent_actions":{"view_html":"https://pith.science/pith/T5RF7DN64JXAEJJWNH5PKYE2QZ","download_json":"https://pith.science/pith/T5RF7DN64JXAEJJWNH5PKYE2QZ.json","view_paper":"https://pith.science/paper/T5RF7DN6","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2109.09163&json=true","fetch_graph":"https://pith.science/api/pith-number/T5RF7DN64JXAEJJWNH5PKYE2QZ/graph.json","fetch_events":"https://pith.science/api/pith-number/T5RF7DN64JXAEJJWNH5PKYE2QZ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/T5RF7DN64JXAEJJWNH5PKYE2QZ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/T5RF7DN64JXAEJJWNH5PKYE2QZ/action/storage_attestation","attest_author":"https://pith.science/pith/T5RF7DN64JXAEJJWNH5PKYE2QZ/action/author_attestation","sign_citation":"https://pith.science/pith/T5RF7DN64JXAEJJWNH5PKYE2QZ/action/citation_signature","submit_replication":"https://pith.science/pith/T5RF7DN64JXAEJJWNH5PKYE2QZ/action/replication_record"}},"created_at":"2026-07-05T04:00:18.152206+00:00","updated_at":"2026-07-05T04:00:18.152206+00:00"}