{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2022:33YFHASQFKFWEHULIJHJWPE52Q","short_pith_number":"pith:33YFHASQ","schema_version":"1.0","canonical_sha256":"def05382502a8b621e8b424e9b3c9dd41b0eecae029e6c9665a14b6258e4f29a","source":{"kind":"arxiv","id":"2209.02532","version":1},"attestation_state":"computed","paper":{"title":"A Combined Inverse Kinematics Algorithm Using FABRIK with Optimization","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.RO","authors_text":"Hong Liu, Jingdong Zhao, Xiaohang Yang, Yuntao Li, Zhiyuan Zhao, Zichun Xu","submitted_at":"2022-09-06T14:35:30Z","abstract_excerpt":"Forward and backward reaching inverse kinematics (FABRIK) is a heuristic inverse kinematics solver that is gradually applied to manipulators with the advantages of fast convergence and generating more realistic configurations. However, under the high error constraint, FABRIK exhibits unstable convergence behavior, which is unsatisfactory for the real-time motion planning of manipulators. In this paper, a novel inverse kinematics algorithm that combines FABRIK and the sequential quadratic programming (SQP) algorithm is presented, in which the joint angles deduced by FABRIK will be taken as the "},"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":"2209.02532","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.RO","submitted_at":"2022-09-06T14:35:30Z","cross_cats_sorted":[],"title_canon_sha256":"1afa29bf19a4281db499a82f6177f2dcfc2fa8f3ec6e70443e4ef52c32de8dff","abstract_canon_sha256":"524321ab833e9f1ca7dd1256e51132c46c8d815d4c383b58f1d58b580a7941d8"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T04:55:12.275427Z","signature_b64":"QBHEOb2ux8ZoXeoqLwwLz/ehP+yhwhanl0XJzPtkY10ysCbQVZ7/n3FbKo6ACr/vrdx0k/3FVe9uWZ92WH1XDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"def05382502a8b621e8b424e9b3c9dd41b0eecae029e6c9665a14b6258e4f29a","last_reissued_at":"2026-07-05T04:55:12.274984Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T04:55:12.274984Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A Combined Inverse Kinematics Algorithm Using FABRIK with Optimization","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.RO","authors_text":"Hong Liu, Jingdong Zhao, Xiaohang Yang, Yuntao Li, Zhiyuan Zhao, Zichun Xu","submitted_at":"2022-09-06T14:35:30Z","abstract_excerpt":"Forward and backward reaching inverse kinematics (FABRIK) is a heuristic inverse kinematics solver that is gradually applied to manipulators with the advantages of fast convergence and generating more realistic configurations. However, under the high error constraint, FABRIK exhibits unstable convergence behavior, which is unsatisfactory for the real-time motion planning of manipulators. In this paper, a novel inverse kinematics algorithm that combines FABRIK and the sequential quadratic programming (SQP) algorithm is presented, in which the joint angles deduced by FABRIK will be taken as the "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2209.02532","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/2209.02532/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":"2209.02532","created_at":"2026-07-05T04:55:12.275042+00:00"},{"alias_kind":"arxiv_version","alias_value":"2209.02532v1","created_at":"2026-07-05T04:55:12.275042+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2209.02532","created_at":"2026-07-05T04:55:12.275042+00:00"},{"alias_kind":"pith_short_12","alias_value":"33YFHASQFKFW","created_at":"2026-07-05T04:55:12.275042+00:00"},{"alias_kind":"pith_short_16","alias_value":"33YFHASQFKFWEHUL","created_at":"2026-07-05T04:55:12.275042+00:00"},{"alias_kind":"pith_short_8","alias_value":"33YFHASQ","created_at":"2026-07-05T04:55:12.275042+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/33YFHASQFKFWEHULIJHJWPE52Q","json":"https://pith.science/pith/33YFHASQFKFWEHULIJHJWPE52Q.json","graph_json":"https://pith.science/api/pith-number/33YFHASQFKFWEHULIJHJWPE52Q/graph.json","events_json":"https://pith.science/api/pith-number/33YFHASQFKFWEHULIJHJWPE52Q/events.json","paper":"https://pith.science/paper/33YFHASQ"},"agent_actions":{"view_html":"https://pith.science/pith/33YFHASQFKFWEHULIJHJWPE52Q","download_json":"https://pith.science/pith/33YFHASQFKFWEHULIJHJWPE52Q.json","view_paper":"https://pith.science/paper/33YFHASQ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2209.02532&json=true","fetch_graph":"https://pith.science/api/pith-number/33YFHASQFKFWEHULIJHJWPE52Q/graph.json","fetch_events":"https://pith.science/api/pith-number/33YFHASQFKFWEHULIJHJWPE52Q/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/33YFHASQFKFWEHULIJHJWPE52Q/action/timestamp_anchor","attest_storage":"https://pith.science/pith/33YFHASQFKFWEHULIJHJWPE52Q/action/storage_attestation","attest_author":"https://pith.science/pith/33YFHASQFKFWEHULIJHJWPE52Q/action/author_attestation","sign_citation":"https://pith.science/pith/33YFHASQFKFWEHULIJHJWPE52Q/action/citation_signature","submit_replication":"https://pith.science/pith/33YFHASQFKFWEHULIJHJWPE52Q/action/replication_record"}},"created_at":"2026-07-05T04:55:12.275042+00:00","updated_at":"2026-07-05T04:55:12.275042+00:00"}