{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2019:766SOA4KQKAEF67FCECL3A2BF5","short_pith_number":"pith:766SOA4K","schema_version":"1.0","canonical_sha256":"ffbd27038a828042fbe51104bd83412f4bc7dc42fc8dee18baf69f5efb3043fb","source":{"kind":"arxiv","id":"1905.12945","version":1},"attestation_state":"computed","paper":{"title":"Handling robot constraints within a Set-Based Multi-Task Priority Inverse Kinematics Framework","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.RO","authors_text":"Gianluca Antonelli, Paolo Di Lillo, Stefano Chiaverini","submitted_at":"2019-05-30T10:19:04Z","abstract_excerpt":"Set-Based Multi-Task Priority is a recent framework to handle inverse kinematics for redundant structures. Both equality tasks, i.e., control objectives to be driven to a desired value, and set-bases tasks, i.e., control objectives to be satisfied with a set/range of values can be addressed in a rigorous manner within a priority framework. In addition, optimization tasks, driven by the gradient of a proper function, may be considered as well, usually as lower priority tasks. In this paper the proper design of the tasks, their priority and the use of a Set-Based Multi-Task Priority framework is"},"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":"1905.12945","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.RO","submitted_at":"2019-05-30T10:19:04Z","cross_cats_sorted":[],"title_canon_sha256":"cbea504681a3784eb8a93ba3313424f3237530bd516ba3dfa1efbcbcc3f326ec","abstract_canon_sha256":"5c16d3f459cfb363d8ccb18b3b46fd3bd1f8d0f4fe37232c08276b08e74199ff"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T01:16:39.254188Z","signature_b64":"MJGbN7bCgLEqy0NpmgUVWDjmULVDVRTr5tQB+9mfGXyoK8B3pv/l4RxViGVK/9+F5gFrlZwGM5MrT2CBQHhLCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"ffbd27038a828042fbe51104bd83412f4bc7dc42fc8dee18baf69f5efb3043fb","last_reissued_at":"2026-07-05T01:16:39.253789Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T01:16:39.253789Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Handling robot constraints within a Set-Based Multi-Task Priority Inverse Kinematics Framework","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.RO","authors_text":"Gianluca Antonelli, Paolo Di Lillo, Stefano Chiaverini","submitted_at":"2019-05-30T10:19:04Z","abstract_excerpt":"Set-Based Multi-Task Priority is a recent framework to handle inverse kinematics for redundant structures. Both equality tasks, i.e., control objectives to be driven to a desired value, and set-bases tasks, i.e., control objectives to be satisfied with a set/range of values can be addressed in a rigorous manner within a priority framework. In addition, optimization tasks, driven by the gradient of a proper function, may be considered as well, usually as lower priority tasks. In this paper the proper design of the tasks, their priority and the use of a Set-Based Multi-Task Priority framework is"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1905.12945","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/1905.12945/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":"1905.12945","created_at":"2026-07-05T01:16:39.253856+00:00"},{"alias_kind":"arxiv_version","alias_value":"1905.12945v1","created_at":"2026-07-05T01:16:39.253856+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1905.12945","created_at":"2026-07-05T01:16:39.253856+00:00"},{"alias_kind":"pith_short_12","alias_value":"766SOA4KQKAE","created_at":"2026-07-05T01:16:39.253856+00:00"},{"alias_kind":"pith_short_16","alias_value":"766SOA4KQKAEF67F","created_at":"2026-07-05T01:16:39.253856+00:00"},{"alias_kind":"pith_short_8","alias_value":"766SOA4K","created_at":"2026-07-05T01:16:39.253856+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/766SOA4KQKAEF67FCECL3A2BF5","json":"https://pith.science/pith/766SOA4KQKAEF67FCECL3A2BF5.json","graph_json":"https://pith.science/api/pith-number/766SOA4KQKAEF67FCECL3A2BF5/graph.json","events_json":"https://pith.science/api/pith-number/766SOA4KQKAEF67FCECL3A2BF5/events.json","paper":"https://pith.science/paper/766SOA4K"},"agent_actions":{"view_html":"https://pith.science/pith/766SOA4KQKAEF67FCECL3A2BF5","download_json":"https://pith.science/pith/766SOA4KQKAEF67FCECL3A2BF5.json","view_paper":"https://pith.science/paper/766SOA4K","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1905.12945&json=true","fetch_graph":"https://pith.science/api/pith-number/766SOA4KQKAEF67FCECL3A2BF5/graph.json","fetch_events":"https://pith.science/api/pith-number/766SOA4KQKAEF67FCECL3A2BF5/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/766SOA4KQKAEF67FCECL3A2BF5/action/timestamp_anchor","attest_storage":"https://pith.science/pith/766SOA4KQKAEF67FCECL3A2BF5/action/storage_attestation","attest_author":"https://pith.science/pith/766SOA4KQKAEF67FCECL3A2BF5/action/author_attestation","sign_citation":"https://pith.science/pith/766SOA4KQKAEF67FCECL3A2BF5/action/citation_signature","submit_replication":"https://pith.science/pith/766SOA4KQKAEF67FCECL3A2BF5/action/replication_record"}},"created_at":"2026-07-05T01:16:39.253856+00:00","updated_at":"2026-07-05T01:16:39.253856+00:00"}