{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2023:FZ7KJKY2OZKISZQQHMFIBATKEJ","short_pith_number":"pith:FZ7KJKY2","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"},"canonical_sha256":"2e7ea4ab1a76548966103b0a80826a22586b6481e58e770cb436b3b824cd2026","source":{"kind":"arxiv","id":"2310.03676","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2310.03676","created_at":"2026-07-05T08:50:07Z"},{"alias_kind":"arxiv_version","alias_value":"2310.03676v2","created_at":"2026-07-05T08:50:07Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2310.03676","created_at":"2026-07-05T08:50:07Z"},{"alias_kind":"pith_short_12","alias_value":"FZ7KJKY2OZKI","created_at":"2026-07-05T08:50:07Z"},{"alias_kind":"pith_short_16","alias_value":"FZ7KJKY2OZKISZQQ","created_at":"2026-07-05T08:50:07Z"},{"alias_kind":"pith_short_8","alias_value":"FZ7KJKY2","created_at":"2026-07-05T08:50:07Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2023:FZ7KJKY2OZKISZQQHMFIBATKEJ","target":"record","payload":{"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"},"canonical_sha256":"2e7ea4ab1a76548966103b0a80826a22586b6481e58e770cb436b3b824cd2026","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"},"source_kind":"arxiv","source_id":"2310.03676","source_version":2,"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-07-05T08:50:07Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"08dk7YKigUFg0Ybas/hY43lryECzoBiC1+CnOq+iYvm6Mj8Koopr0u877KNhBmdfVkyUBj2Hv0DE3/rg1wUDBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-03T17:31:37.560731Z"},"content_sha256":"244d654dea54e3075bb235fd603c8b9821b943cc124bbe7cff6964afdb601319","schema_version":"1.0","event_id":"sha256:244d654dea54e3075bb235fd603c8b9821b943cc124bbe7cff6964afdb601319"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2023:FZ7KJKY2OZKISZQQHMFIBATKEJ","target":"graph","payload":{"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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-07-05T08:50:07Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"TQTbq1ybl0aO6v0Zn1fb6MqXk6mo5ACzE2uqkoBJe8+Ns8aovq8EvWGtYGhZG3IOJSXDeWwdn4oUXQobGHfoDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-03T17:31:37.561234Z"},"content_sha256":"97dab773df24f700049ef4d18829f7b1fdc3a4a8c3e2b30e6f530f85e9edd7ff","schema_version":"1.0","event_id":"sha256:97dab773df24f700049ef4d18829f7b1fdc3a4a8c3e2b30e6f530f85e9edd7ff"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/FZ7KJKY2OZKISZQQHMFIBATKEJ/bundle.json","state_url":"https://pith.science/pith/FZ7KJKY2OZKISZQQHMFIBATKEJ/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/FZ7KJKY2OZKISZQQHMFIBATKEJ/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-08-03T17:31:37Z","links":{"resolver":"https://pith.science/pith/FZ7KJKY2OZKISZQQHMFIBATKEJ","bundle":"https://pith.science/pith/FZ7KJKY2OZKISZQQHMFIBATKEJ/bundle.json","state":"https://pith.science/pith/FZ7KJKY2OZKISZQQHMFIBATKEJ/state.json","well_known_bundle":"https://pith.science/.well-known/pith/FZ7KJKY2OZKISZQQHMFIBATKEJ/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2023:FZ7KJKY2OZKISZQQHMFIBATKEJ","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":"fcc99247985827f50e104503dc03afb5841a2b8231c9cfcbd0eaa39b6a560718","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by-sa/4.0/","primary_cat":"cs.RO","submitted_at":"2023-10-05T16:52:59Z","title_canon_sha256":"1abe30238f7daf55627212f7d85365357fa94c256e25d8cf39dfa1bb313a5783"},"schema_version":"1.0","source":{"id":"2310.03676","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2310.03676","created_at":"2026-07-05T08:50:07Z"},{"alias_kind":"arxiv_version","alias_value":"2310.03676v2","created_at":"2026-07-05T08:50:07Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2310.03676","created_at":"2026-07-05T08:50:07Z"},{"alias_kind":"pith_short_12","alias_value":"FZ7KJKY2OZKI","created_at":"2026-07-05T08:50:07Z"},{"alias_kind":"pith_short_16","alias_value":"FZ7KJKY2OZKISZQQ","created_at":"2026-07-05T08:50:07Z"},{"alias_kind":"pith_short_8","alias_value":"FZ7KJKY2","created_at":"2026-07-05T08:50:07Z"}],"graph_snapshots":[{"event_id":"sha256:97dab773df24f700049ef4d18829f7b1fdc3a4a8c3e2b30e6f530f85e9edd7ff","target":"graph","created_at":"2026-07-05T08:50:07Z","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":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2310.03676/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"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","authors_text":"Ajay Suresha Sathya, Jan Swevers, Wilm Decre","cross_cats":[],"headline":"","license":"http://creativecommons.org/licenses/by-sa/4.0/","primary_cat":"cs.RO","submitted_at":"2023-10-05T16:52:59Z","title":"PV-OSIMr: A Lowest Order Complexity Algorithm for Computing the Delassus Matrix"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2310.03676","kind":"arxiv","version":2},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:244d654dea54e3075bb235fd603c8b9821b943cc124bbe7cff6964afdb601319","target":"record","created_at":"2026-07-05T08:50:07Z","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":"fcc99247985827f50e104503dc03afb5841a2b8231c9cfcbd0eaa39b6a560718","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by-sa/4.0/","primary_cat":"cs.RO","submitted_at":"2023-10-05T16:52:59Z","title_canon_sha256":"1abe30238f7daf55627212f7d85365357fa94c256e25d8cf39dfa1bb313a5783"},"schema_version":"1.0","source":{"id":"2310.03676","kind":"arxiv","version":2}},"canonical_sha256":"2e7ea4ab1a76548966103b0a80826a22586b6481e58e770cb436b3b824cd2026","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"2e7ea4ab1a76548966103b0a80826a22586b6481e58e770cb436b3b824cd2026","first_computed_at":"2026-07-05T08:50:07.936550Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T08:50:07.936550Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"rckFLEu0eQTxgggiJEE0kd7rjeeaMNNvzgQ4GgfgSRqUXTMXW04tHBo5mggedM0Qkru8YNe5KBMLQNvj9dJnAQ==","signature_status":"signed_v1","signed_at":"2026-07-05T08:50:07.937014Z","signed_message":"canonical_sha256_bytes"},"source_id":"2310.03676","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:244d654dea54e3075bb235fd603c8b9821b943cc124bbe7cff6964afdb601319","sha256:97dab773df24f700049ef4d18829f7b1fdc3a4a8c3e2b30e6f530f85e9edd7ff"],"state_sha256":"a16502efe952bb8097034e1888db7eca58b717e6002d9fdc60a4429a100671e6"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"qPzTEmmc47E3dSPLG3bL53z8dFLc9bW+j7T50OiVnE0uquw6dTBx2eKKyB4E/UepB76tOz5agyKlOGiDhQnHDA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-03T17:31:37.566672Z","bundle_sha256":"6cb73c95af420c1bd10e6c9cf258c921a7bdfac1146bfe1ce49bb938c299d4df"}}