{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:RDNHAYKJCTJOHTB2PG76MKBQRB","short_pith_number":"pith:RDNHAYKJ","canonical_record":{"source":{"id":"1803.09493","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.RO","submitted_at":"2018-03-26T10:04:54Z","cross_cats_sorted":[],"title_canon_sha256":"42419c4b9f0126607558104e86284d5cdfb81f3dd521f0b75cb3dac9c3065454","abstract_canon_sha256":"2f9eccf2ed885ef40cda2a6e930e470303f70442e6204372403bc1f588e991dc"},"schema_version":"1.0"},"canonical_sha256":"88da70614914d2e3cc3a79bfe62830887c1183f54594895c3f210eef7d794b67","source":{"kind":"arxiv","id":"1803.09493","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1803.09493","created_at":"2026-05-18T00:06:04Z"},{"alias_kind":"arxiv_version","alias_value":"1803.09493v3","created_at":"2026-05-18T00:06:04Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1803.09493","created_at":"2026-05-18T00:06:04Z"},{"alias_kind":"pith_short_12","alias_value":"RDNHAYKJCTJO","created_at":"2026-05-18T12:32:50Z"},{"alias_kind":"pith_short_16","alias_value":"RDNHAYKJCTJOHTB2","created_at":"2026-05-18T12:32:50Z"},{"alias_kind":"pith_short_8","alias_value":"RDNHAYKJ","created_at":"2026-05-18T12:32:50Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:RDNHAYKJCTJOHTB2PG76MKBQRB","target":"record","payload":{"canonical_record":{"source":{"id":"1803.09493","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.RO","submitted_at":"2018-03-26T10:04:54Z","cross_cats_sorted":[],"title_canon_sha256":"42419c4b9f0126607558104e86284d5cdfb81f3dd521f0b75cb3dac9c3065454","abstract_canon_sha256":"2f9eccf2ed885ef40cda2a6e930e470303f70442e6204372403bc1f588e991dc"},"schema_version":"1.0"},"canonical_sha256":"88da70614914d2e3cc3a79bfe62830887c1183f54594895c3f210eef7d794b67","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:06:04.692623Z","signature_b64":"zguTZCy45448Qvx6aRbzCG3k+gfHCEYceI5I6ZJq8dUp998bWH3/lQ92cojY2jgff/tsy3lGaSG3ozYBacglCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"88da70614914d2e3cc3a79bfe62830887c1183f54594895c3f210eef7d794b67","last_reissued_at":"2026-05-18T00:06:04.692145Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:06:04.692145Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1803.09493","source_version":3,"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-05-18T00:06:04Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"rtX9KRlfYTKneDr6/oYiBojGhByx4Sv4ZLzPGadtCVs3R8H+t9bOQjmcULBpcQwYjL47KCKTAiL8mvn7Hc1CCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T17:30:59.211170Z"},"content_sha256":"18faa71b2f03791636661314a1439e26ce9d8867a91473cd2b33bcda6dce0c31","schema_version":"1.0","event_id":"sha256:18faa71b2f03791636661314a1439e26ce9d8867a91473cd2b33bcda6dce0c31"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:RDNHAYKJCTJOHTB2PG76MKBQRB","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Manipulability Maximization Using Continuous-Time Gaussian Processes","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.RO","authors_text":"Filip Mari\\'c, Ivan Petrovi\\'c, Jonathan Kelly, Luka Petrovi\\'c, Oliver Limoyo","submitted_at":"2018-03-26T10:04:54Z","abstract_excerpt":"A significant challenge in motion planning is to avoid being in or near \\emph{singular configurations} (\\textit{singularities}), that is, joint configurations that result in the loss of the ability to move in certain directions in task space. A robotic system's capacity for motion is reduced even in regions that are in close proximity to (i.e., neighbouring) a singularity. In this work we examine singularity avoidance in a motion planning context, finding trajectories which minimize proximity to singular regions, subject to constraints. We define a manipulability-based likelihood associated wi"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1803.09493","kind":"arxiv","version":3},"verdict":{"id":null,"model_set":{},"created_at":null,"strongest_claim":"","one_line_summary":"","pipeline_version":null,"weakest_assumption":"","pith_extraction_headline":""},"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-05-18T00:06:04Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"6cXORWmINuOqWs7L7U4EXkYuOIXB2VQXSMWXGGjBhPVaeCc/dF1HMk0XvFGCSZS/EgK9AqJd86uU9XZvEucxCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T17:30:59.211547Z"},"content_sha256":"eae42bc4baa6b661241c2edd38da28a38e57e7124bd84757bfc4aed19844c222","schema_version":"1.0","event_id":"sha256:eae42bc4baa6b661241c2edd38da28a38e57e7124bd84757bfc4aed19844c222"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/RDNHAYKJCTJOHTB2PG76MKBQRB/bundle.json","state_url":"https://pith.science/pith/RDNHAYKJCTJOHTB2PG76MKBQRB/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/RDNHAYKJCTJOHTB2PG76MKBQRB/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-05-27T17:30:59Z","links":{"resolver":"https://pith.science/pith/RDNHAYKJCTJOHTB2PG76MKBQRB","bundle":"https://pith.science/pith/RDNHAYKJCTJOHTB2PG76MKBQRB/bundle.json","state":"https://pith.science/pith/RDNHAYKJCTJOHTB2PG76MKBQRB/state.json","well_known_bundle":"https://pith.science/.well-known/pith/RDNHAYKJCTJOHTB2PG76MKBQRB/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:RDNHAYKJCTJOHTB2PG76MKBQRB","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":"2f9eccf2ed885ef40cda2a6e930e470303f70442e6204372403bc1f588e991dc","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.RO","submitted_at":"2018-03-26T10:04:54Z","title_canon_sha256":"42419c4b9f0126607558104e86284d5cdfb81f3dd521f0b75cb3dac9c3065454"},"schema_version":"1.0","source":{"id":"1803.09493","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1803.09493","created_at":"2026-05-18T00:06:04Z"},{"alias_kind":"arxiv_version","alias_value":"1803.09493v3","created_at":"2026-05-18T00:06:04Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1803.09493","created_at":"2026-05-18T00:06:04Z"},{"alias_kind":"pith_short_12","alias_value":"RDNHAYKJCTJO","created_at":"2026-05-18T12:32:50Z"},{"alias_kind":"pith_short_16","alias_value":"RDNHAYKJCTJOHTB2","created_at":"2026-05-18T12:32:50Z"},{"alias_kind":"pith_short_8","alias_value":"RDNHAYKJ","created_at":"2026-05-18T12:32:50Z"}],"graph_snapshots":[{"event_id":"sha256:eae42bc4baa6b661241c2edd38da28a38e57e7124bd84757bfc4aed19844c222","target":"graph","created_at":"2026-05-18T00:06:04Z","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"},"paper":{"abstract_excerpt":"A significant challenge in motion planning is to avoid being in or near \\emph{singular configurations} (\\textit{singularities}), that is, joint configurations that result in the loss of the ability to move in certain directions in task space. A robotic system's capacity for motion is reduced even in regions that are in close proximity to (i.e., neighbouring) a singularity. In this work we examine singularity avoidance in a motion planning context, finding trajectories which minimize proximity to singular regions, subject to constraints. We define a manipulability-based likelihood associated wi","authors_text":"Filip Mari\\'c, Ivan Petrovi\\'c, Jonathan Kelly, Luka Petrovi\\'c, Oliver Limoyo","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.RO","submitted_at":"2018-03-26T10:04:54Z","title":"Manipulability Maximization Using Continuous-Time Gaussian Processes"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1803.09493","kind":"arxiv","version":3},"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:18faa71b2f03791636661314a1439e26ce9d8867a91473cd2b33bcda6dce0c31","target":"record","created_at":"2026-05-18T00:06:04Z","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":"2f9eccf2ed885ef40cda2a6e930e470303f70442e6204372403bc1f588e991dc","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.RO","submitted_at":"2018-03-26T10:04:54Z","title_canon_sha256":"42419c4b9f0126607558104e86284d5cdfb81f3dd521f0b75cb3dac9c3065454"},"schema_version":"1.0","source":{"id":"1803.09493","kind":"arxiv","version":3}},"canonical_sha256":"88da70614914d2e3cc3a79bfe62830887c1183f54594895c3f210eef7d794b67","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"88da70614914d2e3cc3a79bfe62830887c1183f54594895c3f210eef7d794b67","first_computed_at":"2026-05-18T00:06:04.692145Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:06:04.692145Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"zguTZCy45448Qvx6aRbzCG3k+gfHCEYceI5I6ZJq8dUp998bWH3/lQ92cojY2jgff/tsy3lGaSG3ozYBacglCA==","signature_status":"signed_v1","signed_at":"2026-05-18T00:06:04.692623Z","signed_message":"canonical_sha256_bytes"},"source_id":"1803.09493","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:18faa71b2f03791636661314a1439e26ce9d8867a91473cd2b33bcda6dce0c31","sha256:eae42bc4baa6b661241c2edd38da28a38e57e7124bd84757bfc4aed19844c222"],"state_sha256":"95ea8667725c29ec5153a975bc482286444314ba9f18cbbd50c9340169b580cc"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"xRd8GfLHNO2rQ8tTa3m++wZsMH2bvm9yx1rm2h79f8NIkZ4oXbTCuDqI55MKy000TGgl6RC+4KigK8XG4ikMAQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-27T17:30:59.214743Z","bundle_sha256":"8b27d3953e9ebe4bd678bdd7cd71b5cfed179dbc9736d949e7d08c40208a1882"}}