{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2026:L7UN5C3HQGCBAOP7WA7AOW3HRL","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":"46466f2e282e5a891b77c7e8aa106a0b88bfdb865c21f6bd8831d16ef1671224","cross_cats_sorted":["cs.SY","eess.SY"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.RO","submitted_at":"2026-05-07T16:17:39Z","title_canon_sha256":"39695d43ad45088424252fad1c7c15db369a0b79e0b8c35de72995c8c91f4b19"},"schema_version":"1.0","source":{"id":"2605.06498","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2605.06498","created_at":"2026-05-25T02:01:22Z"},{"alias_kind":"arxiv_version","alias_value":"2605.06498v1","created_at":"2026-05-25T02:01:22Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2605.06498","created_at":"2026-05-25T02:01:22Z"},{"alias_kind":"pith_short_12","alias_value":"L7UN5C3HQGCB","created_at":"2026-05-25T02:01:22Z"},{"alias_kind":"pith_short_16","alias_value":"L7UN5C3HQGCBAOP7","created_at":"2026-05-25T02:01:22Z"},{"alias_kind":"pith_short_8","alias_value":"L7UN5C3H","created_at":"2026-05-25T02:01:22Z"}],"graph_snapshots":[{"event_id":"sha256:7494f4deb78e34d897954f90f9a5ce1f65f74827f3c81d461356e01acffb30a8","target":"graph","created_at":"2026-05-25T02:01:22Z","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":"their computational cost scales quadratically with the derivative order, whereas the automatic-differentiation baseline exhibits exponential scaling"},{"attestation":"unclaimed","claim_id":"C2","kind":"weakest_assumption","source":"verdict.weakest_assumption","status":"machine_extracted","text":"The recursive procedures for higher-order derivatives can be collected into closed-form equations while preserving an admissible Coriolis matrix that satisfies passivity and leaving the articulated inertia tensor unchanged across derivatives."},{"attestation":"unclaimed","claim_id":"C3","kind":"one_line_summary","source":"verdict.one_line_summary","status":"machine_extracted","text":"Lie-group recursive dynamics algorithms are extended to higher-order time derivatives for floating-base robots, with quadratic computational scaling shown versus exponential for automatic differentiation on a 12-DoF aerial manipulator."},{"attestation":"unclaimed","claim_id":"C4","kind":"headline","source":"verdict.pith_extraction.headline","status":"machine_extracted","text":"Recursive Lie-group algorithms enable higher-order dynamics computation for floating-base robots at quadratic cost."}],"snapshot_sha256":"dc72b622cd20f868dae4c2a7b9f5b1b7da04468ecb071bb27eef057d7f8a1738"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"integrity":{"available":true,"clean":true,"detectors_run":[{"findings_count":0,"name":"claim_evidence","ran_at":"2026-05-20T12:22:03.893672Z","status":"completed","version":"1.0.0"},{"findings_count":0,"name":"ai_meta_artifact","ran_at":"2026-05-20T07:41:00.608200Z","status":"completed","version":"1.0.0"},{"findings_count":0,"name":"doi_title_agreement","ran_at":"2026-05-19T18:01:19.751302Z","status":"completed","version":"1.0.0"},{"findings_count":0,"name":"doi_compliance","ran_at":"2026-05-19T12:37:06.624603Z","status":"completed","version":"1.0.0"}],"endpoint":"/pith/2605.06498/integrity.json","findings":[],"snapshot_sha256":"6c7e99023fe3520ed7d2b2330476c2058259fadf70b77d46e1148ee66444e6ed","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"In this paper, we describe procedures for computing higher-order time derivatives of the Lie-group Newton-Euler, Articulated-Body Inertia, and hybrid dynamics algorithms for floating-base trees, where the base configuration evolves on SE(3) and the attached mechanism is an open kinematic tree with configuration on the (n1+n2)-dimensional manifold T^{n1} \\times R^{n2}, using spatial representation of twists. After presenting the algorithms, we collect the resulting recursions into closed-form equations of motion, identifying an admissible Coriolis matrix satisfying the passivity property, and s","authors_text":"Ahmed Ali, Antonio Franchi, Chiara Gabellieri","cross_cats":["cs.SY","eess.SY"],"headline":"Recursive Lie-group algorithms enable higher-order dynamics computation for floating-base robots at quadratic cost.","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.RO","submitted_at":"2026-05-07T16:17:39Z","title":"Lie Group Formulation of Recursive Dynamics Algorithms of Higher Order for Floating-Base Robots"},"references":{"count":71,"internal_anchors":0,"resolved_work":7,"sample":[{"cited_arxiv_id":"","doi":"","is_internal_anchor":false,"ref_index":1,"title":"and Roth, B., 1990,Theoretical kinematics, Vol","work_id":"","year":1990},{"cited_arxiv_id":"","doi":"","is_internal_anchor":false,"ref_index":2,"title":"Siciliano, B., Sciavicco, L., Villani, L., and Oriolo, G., 2010,Robotics: Mod- elling, Planning and Control, Advanced Textbooks in Control and Signal Pro- cessing, Springer London","work_id":"","year":2010},{"cited_arxiv_id":"","doi":"","is_internal_anchor":false,"ref_index":3,"title":"Angeles, J., 2003,Fundamentals of robotic mechanical systems: theory, meth- ods, and algorithms, Springer","work_id":"","year":2003},{"cited_arxiv_id":"","doi":"","is_internal_anchor":false,"ref_index":4,"title":"A Recursive Lagrangian Formulation of Maniputator Dynamics and a Comparative Study of Dynamics Formulation Complexity,","work_id":"","year":1980},{"cited_arxiv_id":"","doi":"","is_internal_anchor":false,"ref_index":5,"title":"Dynamics of articulated open- chain active mechanisms,","work_id":"","year":1976}],"snapshot_sha256":"4dbbb8fb8e4dd7ed60630d873426cf931c5a4ea39fc79afac24c01d1738c03e0"},"source":{"id":"2605.06498","kind":"arxiv","version":1},"verdict":{"created_at":"2026-05-08T08:42:03.863570Z","id":"c338b9ea-d471-4433-9a31-40f40da0669a","model_set":{"reader":"grok-4.3"},"one_line_summary":"Lie-group recursive dynamics algorithms are extended to higher-order time derivatives for floating-base robots, with quadratic computational scaling shown versus exponential for automatic differentiation on a 12-DoF aerial manipulator.","pipeline_version":"pith-pipeline@v0.9.0","pith_extraction_headline":"Recursive Lie-group algorithms enable higher-order dynamics computation for floating-base robots at quadratic cost.","strongest_claim":"their computational cost scales quadratically with the derivative order, whereas the automatic-differentiation baseline exhibits exponential scaling","weakest_assumption":"The recursive procedures for higher-order derivatives can be collected into closed-form equations while preserving an admissible Coriolis matrix that satisfies passivity and leaving the articulated inertia tensor unchanged across derivatives."}},"verdict_id":"c338b9ea-d471-4433-9a31-40f40da0669a"}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:00970ad53016b4a09aea9a49137f90d402447de69aae4fab0343280fd79bd4a4","target":"record","created_at":"2026-05-25T02:01:22Z","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":"46466f2e282e5a891b77c7e8aa106a0b88bfdb865c21f6bd8831d16ef1671224","cross_cats_sorted":["cs.SY","eess.SY"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.RO","submitted_at":"2026-05-07T16:17:39Z","title_canon_sha256":"39695d43ad45088424252fad1c7c15db369a0b79e0b8c35de72995c8c91f4b19"},"schema_version":"1.0","source":{"id":"2605.06498","kind":"arxiv","version":1}},"canonical_sha256":"5fe8de8b6781841039ffb03e075b678aead1e8c1312209b654d4f528910cc806","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"5fe8de8b6781841039ffb03e075b678aead1e8c1312209b654d4f528910cc806","first_computed_at":"2026-05-25T02:01:22.214830Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-25T02:01:22.214830Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"ZkYS+ZMuwix/JEBar5R6jqMhKvuscaxR3AMYozDTm7/ok1gA+Ser2oiAcA7r9k/XY8acGQEDR+1rUyMnNnybBQ==","signature_status":"signed_v1","signed_at":"2026-05-25T02:01:22.215633Z","signed_message":"canonical_sha256_bytes"},"source_id":"2605.06498","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:00970ad53016b4a09aea9a49137f90d402447de69aae4fab0343280fd79bd4a4","sha256:7494f4deb78e34d897954f90f9a5ce1f65f74827f3c81d461356e01acffb30a8"],"state_sha256":"6cc070fd101f913007016f557d71b5a3d87f65422ad0ae9205c1a9b3ed30823b"}