{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2024:QMLOHJ62NVY65ZTRVUCWMFBN6X","short_pith_number":"pith:QMLOHJ62","canonical_record":{"source":{"id":"2412.01324","kind":"arxiv","version":5},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.RO","submitted_at":"2024-12-02T09:45:32Z","cross_cats_sorted":[],"title_canon_sha256":"f87b912ab3092a5ce1506a4900dc6564333afc9c146ee215d58ad4d7d5846dfd","abstract_canon_sha256":"896501078efa2c17d7f51daf386f34ccaf110eb48b714eacc6c384dd39456230"},"schema_version":"1.0"},"canonical_sha256":"8316e3a7da6d71eee671ad0566142df5de2ba6b1530124876d5834e05dc3f2be","source":{"kind":"arxiv","id":"2412.01324","version":5},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2412.01324","created_at":"2026-06-09T01:04:37Z"},{"alias_kind":"arxiv_version","alias_value":"2412.01324v5","created_at":"2026-06-09T01:04:37Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2412.01324","created_at":"2026-06-09T01:04:37Z"},{"alias_kind":"pith_short_12","alias_value":"QMLOHJ62NVY6","created_at":"2026-06-09T01:04:37Z"},{"alias_kind":"pith_short_16","alias_value":"QMLOHJ62NVY65ZTR","created_at":"2026-06-09T01:04:37Z"},{"alias_kind":"pith_short_8","alias_value":"QMLOHJ62","created_at":"2026-06-09T01:04:37Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2024:QMLOHJ62NVY65ZTRVUCWMFBN6X","target":"record","payload":{"canonical_record":{"source":{"id":"2412.01324","kind":"arxiv","version":5},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.RO","submitted_at":"2024-12-02T09:45:32Z","cross_cats_sorted":[],"title_canon_sha256":"f87b912ab3092a5ce1506a4900dc6564333afc9c146ee215d58ad4d7d5846dfd","abstract_canon_sha256":"896501078efa2c17d7f51daf386f34ccaf110eb48b714eacc6c384dd39456230"},"schema_version":"1.0"},"canonical_sha256":"8316e3a7da6d71eee671ad0566142df5de2ba6b1530124876d5834e05dc3f2be","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-06-09T01:04:37.736495Z","signature_b64":"wqfI+Kdnc7+q0pVGrc7B7yRbNXnzCsGYK1vDKppRGJsi+imI60YwZKzwuxIJtUyZR6EvO7huYzeAV5mcScvACQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"8316e3a7da6d71eee671ad0566142df5de2ba6b1530124876d5834e05dc3f2be","last_reissued_at":"2026-06-09T01:04:37.736016Z","signature_status":"signed_v1","first_computed_at":"2026-06-09T01:04:37.736016Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2412.01324","source_version":5,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-06-09T01:04:37Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"/tMRbMUpgCzgVH66HgXvvN56D9yY/rF+Ez3ILgpUiEPwH0GpnVvTXsIYFa8Hm3FNbjIeSxe7tc+qNbQj/NyxAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-11T08:12:12.430924Z"},"content_sha256":"4e3d062249587403809e41cac1fe53a3a779d70ff40c93a7e728b5c0c49a3b4a","schema_version":"1.0","event_id":"sha256:4e3d062249587403809e41cac1fe53a3a779d70ff40c93a7e728b5c0c49a3b4a"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2024:QMLOHJ62NVY65ZTRVUCWMFBN6X","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Integrated Hierarchical Decision-Making in Inverse Kinematic Planning and Control","license":"http://creativecommons.org/licenses/by/4.0/","headline":"A sparse hierarchical nonlinear programming solver integrates decision-making with inverse kinematic planning and control via the ℓ0-norm.","cross_cats":[],"primary_cat":"cs.RO","authors_text":"Aberrahmane Kheddar, Gordon Boateng, Kai Pfeiffer, Quan Zhang, Vincent Bonnet, Yuqing Chen, Yuquan Wang","submitted_at":"2024-12-02T09:45:32Z","abstract_excerpt":"This work presents a novel and efficient nonlinear programming framework that tightly integrates hierarchical decision-making with whole-body inverse kinematic planning and control. Decision-making plays a central role in many aspects of robotics, from sparse inverse kinematic control with a minimal number of joints, to inverse kinematic planning while simultaneously selecting a discrete end-effector location from multiple candidates. Current approaches often rely on heavy computations using mixed-integer nonlinear programming, separate decision-making from inverse kinematics (some times appro"},"claims":{"count":4,"items":[{"kind":"strongest_claim","text":"The proposed sparse hierarchical nonlinear programming solver is efficient, versatile, and accurate by exploiting sparse hierarchical structure and leveraging the ℓ0-norm which is rarely used in robotics. The solver efficiently tackles complex nonlinear hierarchical decision-making problems previously unaddressed in the literature, such as inverse kinematic planning with simultaneous prioritized selection of end-effector locations from a large set of candidates, or inverse kinematic control with simultaneous selection of bi-manual grasp locations on a randomly rotated box.","source":"verdict.strongest_claim","status":"machine_extracted","claim_id":"C1","attestation":"unclaimed"},{"kind":"weakest_assumption","text":"The assumption that leveraging the ℓ0-norm in a nonlinear programming formulation will yield an efficient and accurate solver for these integrated hierarchical problems without introducing intractable non-convexity or requiring approximations that undermine the claimed advantages over mixed-integer methods.","source":"verdict.weakest_assumption","status":"machine_extracted","claim_id":"C2","attestation":"unclaimed"},{"kind":"one_line_summary","text":"A sparse hierarchical nonlinear programming solver integrates decision-making with inverse kinematic planning and control in robotics using l0-norm sparsity.","source":"verdict.one_line_summary","status":"machine_extracted","claim_id":"C3","attestation":"unclaimed"},{"kind":"headline","text":"A sparse hierarchical nonlinear programming solver integrates decision-making with inverse kinematic planning and control via the ℓ0-norm.","source":"verdict.pith_extraction.headline","status":"machine_extracted","claim_id":"C4","attestation":"unclaimed"}],"snapshot_sha256":"22e278e8eaacf40c65e91bda8eedca4a51bcfd30d884f73b6232797a4765751d"},"source":{"id":"2412.01324","kind":"arxiv","version":5},"verdict":{"id":"01be88f2-2730-47b3-b154-8a102c0f46fa","model_set":{"reader":"grok-4.3"},"created_at":"2026-05-23T07:59:43.975370Z","strongest_claim":"The proposed sparse hierarchical nonlinear programming solver is efficient, versatile, and accurate by exploiting sparse hierarchical structure and leveraging the ℓ0-norm which is rarely used in robotics. The solver efficiently tackles complex nonlinear hierarchical decision-making problems previously unaddressed in the literature, such as inverse kinematic planning with simultaneous prioritized selection of end-effector locations from a large set of candidates, or inverse kinematic control with simultaneous selection of bi-manual grasp locations on a randomly rotated box.","one_line_summary":"A sparse hierarchical nonlinear programming solver integrates decision-making with inverse kinematic planning and control in robotics using l0-norm sparsity.","pipeline_version":"pith-pipeline@v0.9.0","weakest_assumption":"The assumption that leveraging the ℓ0-norm in a nonlinear programming formulation will yield an efficient and accurate solver for these integrated hierarchical problems without introducing intractable non-convexity or requiring approximations that undermine the claimed advantages over mixed-integer methods.","pith_extraction_headline":"A sparse hierarchical nonlinear programming solver integrates decision-making with inverse kinematic planning and control via the ℓ0-norm."},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2412.01324/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"},"verdict_id":"01be88f2-2730-47b3-b154-8a102c0f46fa"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-06-09T01:04:37Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"IZpoqAeFbN3YFnR3tb7VBqtAH57xVuM7Ed8UNfZHYYL/sFHose/FuWoIB2VOHRym5su24JMWrv8W5kOivttMCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-11T08:12:12.432112Z"},"content_sha256":"6d76c23932642b7f8c66541afaf35a837e443ecdc47e8a45aebebea378483dc3","schema_version":"1.0","event_id":"sha256:6d76c23932642b7f8c66541afaf35a837e443ecdc47e8a45aebebea378483dc3"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/QMLOHJ62NVY65ZTRVUCWMFBN6X/bundle.json","state_url":"https://pith.science/pith/QMLOHJ62NVY65ZTRVUCWMFBN6X/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/QMLOHJ62NVY65ZTRVUCWMFBN6X/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-06-11T08:12:12Z","links":{"resolver":"https://pith.science/pith/QMLOHJ62NVY65ZTRVUCWMFBN6X","bundle":"https://pith.science/pith/QMLOHJ62NVY65ZTRVUCWMFBN6X/bundle.json","state":"https://pith.science/pith/QMLOHJ62NVY65ZTRVUCWMFBN6X/state.json","well_known_bundle":"https://pith.science/.well-known/pith/QMLOHJ62NVY65ZTRVUCWMFBN6X/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2024:QMLOHJ62NVY65ZTRVUCWMFBN6X","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"896501078efa2c17d7f51daf386f34ccaf110eb48b714eacc6c384dd39456230","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.RO","submitted_at":"2024-12-02T09:45:32Z","title_canon_sha256":"f87b912ab3092a5ce1506a4900dc6564333afc9c146ee215d58ad4d7d5846dfd"},"schema_version":"1.0","source":{"id":"2412.01324","kind":"arxiv","version":5}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2412.01324","created_at":"2026-06-09T01:04:37Z"},{"alias_kind":"arxiv_version","alias_value":"2412.01324v5","created_at":"2026-06-09T01:04:37Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2412.01324","created_at":"2026-06-09T01:04:37Z"},{"alias_kind":"pith_short_12","alias_value":"QMLOHJ62NVY6","created_at":"2026-06-09T01:04:37Z"},{"alias_kind":"pith_short_16","alias_value":"QMLOHJ62NVY65ZTR","created_at":"2026-06-09T01:04:37Z"},{"alias_kind":"pith_short_8","alias_value":"QMLOHJ62","created_at":"2026-06-09T01:04:37Z"}],"graph_snapshots":[{"event_id":"sha256:6d76c23932642b7f8c66541afaf35a837e443ecdc47e8a45aebebea378483dc3","target":"graph","created_at":"2026-06-09T01:04:37Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":4,"items":[{"attestation":"unclaimed","claim_id":"C1","kind":"strongest_claim","source":"verdict.strongest_claim","status":"machine_extracted","text":"The proposed sparse hierarchical nonlinear programming solver is efficient, versatile, and accurate by exploiting sparse hierarchical structure and leveraging the ℓ0-norm which is rarely used in robotics. The solver efficiently tackles complex nonlinear hierarchical decision-making problems previously unaddressed in the literature, such as inverse kinematic planning with simultaneous prioritized selection of end-effector locations from a large set of candidates, or inverse kinematic control with simultaneous selection of bi-manual grasp locations on a randomly rotated box."},{"attestation":"unclaimed","claim_id":"C2","kind":"weakest_assumption","source":"verdict.weakest_assumption","status":"machine_extracted","text":"The assumption that leveraging the ℓ0-norm in a nonlinear programming formulation will yield an efficient and accurate solver for these integrated hierarchical problems without introducing intractable non-convexity or requiring approximations that undermine the claimed advantages over mixed-integer methods."},{"attestation":"unclaimed","claim_id":"C3","kind":"one_line_summary","source":"verdict.one_line_summary","status":"machine_extracted","text":"A sparse hierarchical nonlinear programming solver integrates decision-making with inverse kinematic planning and control in robotics using l0-norm sparsity."},{"attestation":"unclaimed","claim_id":"C4","kind":"headline","source":"verdict.pith_extraction.headline","status":"machine_extracted","text":"A sparse hierarchical nonlinear programming solver integrates decision-making with inverse kinematic planning and control via the ℓ0-norm."}],"snapshot_sha256":"22e278e8eaacf40c65e91bda8eedca4a51bcfd30d884f73b6232797a4765751d"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2412.01324/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"This work presents a novel and efficient nonlinear programming framework that tightly integrates hierarchical decision-making with whole-body inverse kinematic planning and control. Decision-making plays a central role in many aspects of robotics, from sparse inverse kinematic control with a minimal number of joints, to inverse kinematic planning while simultaneously selecting a discrete end-effector location from multiple candidates. Current approaches often rely on heavy computations using mixed-integer nonlinear programming, separate decision-making from inverse kinematics (some times appro","authors_text":"Aberrahmane Kheddar, Gordon Boateng, Kai Pfeiffer, Quan Zhang, Vincent Bonnet, Yuqing Chen, Yuquan Wang","cross_cats":[],"headline":"A sparse hierarchical nonlinear programming solver integrates decision-making with inverse kinematic planning and control via the ℓ0-norm.","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.RO","submitted_at":"2024-12-02T09:45:32Z","title":"Integrated Hierarchical Decision-Making in Inverse Kinematic Planning and Control"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2412.01324","kind":"arxiv","version":5},"verdict":{"created_at":"2026-05-23T07:59:43.975370Z","id":"01be88f2-2730-47b3-b154-8a102c0f46fa","model_set":{"reader":"grok-4.3"},"one_line_summary":"A sparse hierarchical nonlinear programming solver integrates decision-making with inverse kinematic planning and control in robotics using l0-norm sparsity.","pipeline_version":"pith-pipeline@v0.9.0","pith_extraction_headline":"A sparse hierarchical nonlinear programming solver integrates decision-making with inverse kinematic planning and control via the ℓ0-norm.","strongest_claim":"The proposed sparse hierarchical nonlinear programming solver is efficient, versatile, and accurate by exploiting sparse hierarchical structure and leveraging the ℓ0-norm which is rarely used in robotics. The solver efficiently tackles complex nonlinear hierarchical decision-making problems previously unaddressed in the literature, such as inverse kinematic planning with simultaneous prioritized selection of end-effector locations from a large set of candidates, or inverse kinematic control with simultaneous selection of bi-manual grasp locations on a randomly rotated box.","weakest_assumption":"The assumption that leveraging the ℓ0-norm in a nonlinear programming formulation will yield an efficient and accurate solver for these integrated hierarchical problems without introducing intractable non-convexity or requiring approximations that undermine the claimed advantages over mixed-integer methods."}},"verdict_id":"01be88f2-2730-47b3-b154-8a102c0f46fa"}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:4e3d062249587403809e41cac1fe53a3a779d70ff40c93a7e728b5c0c49a3b4a","target":"record","created_at":"2026-06-09T01:04:37Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"896501078efa2c17d7f51daf386f34ccaf110eb48b714eacc6c384dd39456230","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.RO","submitted_at":"2024-12-02T09:45:32Z","title_canon_sha256":"f87b912ab3092a5ce1506a4900dc6564333afc9c146ee215d58ad4d7d5846dfd"},"schema_version":"1.0","source":{"id":"2412.01324","kind":"arxiv","version":5}},"canonical_sha256":"8316e3a7da6d71eee671ad0566142df5de2ba6b1530124876d5834e05dc3f2be","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"8316e3a7da6d71eee671ad0566142df5de2ba6b1530124876d5834e05dc3f2be","first_computed_at":"2026-06-09T01:04:37.736016Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-06-09T01:04:37.736016Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"wqfI+Kdnc7+q0pVGrc7B7yRbNXnzCsGYK1vDKppRGJsi+imI60YwZKzwuxIJtUyZR6EvO7huYzeAV5mcScvACQ==","signature_status":"signed_v1","signed_at":"2026-06-09T01:04:37.736495Z","signed_message":"canonical_sha256_bytes"},"source_id":"2412.01324","source_kind":"arxiv","source_version":5}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:4e3d062249587403809e41cac1fe53a3a779d70ff40c93a7e728b5c0c49a3b4a","sha256:6d76c23932642b7f8c66541afaf35a837e443ecdc47e8a45aebebea378483dc3"],"state_sha256":"7ce4b09c6e1137927d8fb4be783f5de16c49f8f9e446480a46aca7b7c5e144f7"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"yEQ72kknOMQ2SsnPO9iiQCYs0Km+zJnX1OsJddY7XbycfxwypFCQuZR1+j0zZjH+NCjJzpfV/HCZD6PXuvoKCg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-11T08:12:12.437117Z","bundle_sha256":"bb1bb2f27368d53057a6f42a5c0851beb4070a5767d96bccb2185dc9ef52077d"}}