{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2023:FZ7KJKY2OZKISZQQHMFIBATKEJ","short_pith_number":"pith:FZ7KJKY2","schema_version":"1.0","canonical_sha256":"2e7ea4ab1a76548966103b0a80826a22586b6481e58e770cb436b3b824cd2026","source":{"kind":"arxiv","id":"2310.03676","version":2},"attestation_state":"computed","paper":{"title":"PV-OSIMr: A Lowest Order Complexity Algorithm for Computing the Delassus Matrix","license":"http://creativecommons.org/licenses/by-sa/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.RO","authors_text":"Ajay Suresha Sathya, Jan Swevers, Wilm Decre","submitted_at":"2023-10-05T16:52:59Z","abstract_excerpt":"We present PV-OSIMr, an efficient algorithm for computing the Delassus matrix (also known as the inverse operational space inertia matrix) for a kinematic tree, with the lowest order computational complexity known in literature. PV-OSIMr is derived by optimizing the Popov-Vereshchagin (PV) solver computations using the compositionality of the force and motion propagators. It has a computational complexity of O(n + m^2 ) compared to O(n + m^2d) of the original PV-OSIM algorithm and O(n+md+m^2 ) of the extended force propagator algorithm (EFPA), where n is the number of joints, m is the number o"},"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":"2310.03676","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by-sa/4.0/","primary_cat":"cs.RO","submitted_at":"2023-10-05T16:52:59Z","cross_cats_sorted":[],"title_canon_sha256":"1abe30238f7daf55627212f7d85365357fa94c256e25d8cf39dfa1bb313a5783","abstract_canon_sha256":"fcc99247985827f50e104503dc03afb5841a2b8231c9cfcbd0eaa39b6a560718"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T08:50:07.937014Z","signature_b64":"rckFLEu0eQTxgggiJEE0kd7rjeeaMNNvzgQ4GgfgSRqUXTMXW04tHBo5mggedM0Qkru8YNe5KBMLQNvj9dJnAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"2e7ea4ab1a76548966103b0a80826a22586b6481e58e770cb436b3b824cd2026","last_reissued_at":"2026-07-05T08:50:07.936550Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T08:50:07.936550Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"PV-OSIMr: A Lowest Order Complexity Algorithm for Computing the Delassus Matrix","license":"http://creativecommons.org/licenses/by-sa/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.RO","authors_text":"Ajay Suresha Sathya, Jan Swevers, Wilm Decre","submitted_at":"2023-10-05T16:52:59Z","abstract_excerpt":"We present PV-OSIMr, an efficient algorithm for computing the Delassus matrix (also known as the inverse operational space inertia matrix) for a kinematic tree, with the lowest order computational complexity known in literature. PV-OSIMr is derived by optimizing the Popov-Vereshchagin (PV) solver computations using the compositionality of the force and motion propagators. It has a computational complexity of O(n + m^2 ) compared to O(n + m^2d) of the original PV-OSIM algorithm and O(n+md+m^2 ) of the extended force propagator algorithm (EFPA), where n is the number of joints, m is the number o"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2310.03676","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/2310.03676/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":"2310.03676","created_at":"2026-07-05T08:50:07.936605+00:00"},{"alias_kind":"arxiv_version","alias_value":"2310.03676v2","created_at":"2026-07-05T08:50:07.936605+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2310.03676","created_at":"2026-07-05T08:50:07.936605+00:00"},{"alias_kind":"pith_short_12","alias_value":"FZ7KJKY2OZKI","created_at":"2026-07-05T08:50:07.936605+00:00"},{"alias_kind":"pith_short_16","alias_value":"FZ7KJKY2OZKISZQQ","created_at":"2026-07-05T08:50:07.936605+00:00"},{"alias_kind":"pith_short_8","alias_value":"FZ7KJKY2","created_at":"2026-07-05T08:50:07.936605+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/FZ7KJKY2OZKISZQQHMFIBATKEJ","json":"https://pith.science/pith/FZ7KJKY2OZKISZQQHMFIBATKEJ.json","graph_json":"https://pith.science/api/pith-number/FZ7KJKY2OZKISZQQHMFIBATKEJ/graph.json","events_json":"https://pith.science/api/pith-number/FZ7KJKY2OZKISZQQHMFIBATKEJ/events.json","paper":"https://pith.science/paper/FZ7KJKY2"},"agent_actions":{"view_html":"https://pith.science/pith/FZ7KJKY2OZKISZQQHMFIBATKEJ","download_json":"https://pith.science/pith/FZ7KJKY2OZKISZQQHMFIBATKEJ.json","view_paper":"https://pith.science/paper/FZ7KJKY2","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2310.03676&json=true","fetch_graph":"https://pith.science/api/pith-number/FZ7KJKY2OZKISZQQHMFIBATKEJ/graph.json","fetch_events":"https://pith.science/api/pith-number/FZ7KJKY2OZKISZQQHMFIBATKEJ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/FZ7KJKY2OZKISZQQHMFIBATKEJ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/FZ7KJKY2OZKISZQQHMFIBATKEJ/action/storage_attestation","attest_author":"https://pith.science/pith/FZ7KJKY2OZKISZQQHMFIBATKEJ/action/author_attestation","sign_citation":"https://pith.science/pith/FZ7KJKY2OZKISZQQHMFIBATKEJ/action/citation_signature","submit_replication":"https://pith.science/pith/FZ7KJKY2OZKISZQQHMFIBATKEJ/action/replication_record"}},"created_at":"2026-07-05T08:50:07.936605+00:00","updated_at":"2026-07-05T08:50:07.936605+00:00"}