{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2019:QI32MEOW2KX5WECAC74KX6ZY3E","short_pith_number":"pith:QI32MEOW","canonical_record":{"source":{"id":"1903.11163","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.RO","submitted_at":"2019-03-26T21:40:46Z","cross_cats_sorted":[],"title_canon_sha256":"1e412952b5bf87edf010b642a9c75aef0ae86c6c47faafd7605d88e05f383c85","abstract_canon_sha256":"cb8d420ad61efa0c8dbc104655b292852d45755b9ac700e2ad7371f0c013a39d"},"schema_version":"1.0"},"canonical_sha256":"8237a611d6d2afdb104017f8abfb38d9356d1c19ab7d7dd047330822e2cd8a48","source":{"kind":"arxiv","id":"1903.11163","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1903.11163","created_at":"2026-05-17T23:50:03Z"},{"alias_kind":"arxiv_version","alias_value":"1903.11163v1","created_at":"2026-05-17T23:50:03Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1903.11163","created_at":"2026-05-17T23:50:03Z"},{"alias_kind":"pith_short_12","alias_value":"QI32MEOW2KX5","created_at":"2026-05-18T12:33:27Z"},{"alias_kind":"pith_short_16","alias_value":"QI32MEOW2KX5WECA","created_at":"2026-05-18T12:33:27Z"},{"alias_kind":"pith_short_8","alias_value":"QI32MEOW","created_at":"2026-05-18T12:33:27Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2019:QI32MEOW2KX5WECAC74KX6ZY3E","target":"record","payload":{"canonical_record":{"source":{"id":"1903.11163","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.RO","submitted_at":"2019-03-26T21:40:46Z","cross_cats_sorted":[],"title_canon_sha256":"1e412952b5bf87edf010b642a9c75aef0ae86c6c47faafd7605d88e05f383c85","abstract_canon_sha256":"cb8d420ad61efa0c8dbc104655b292852d45755b9ac700e2ad7371f0c013a39d"},"schema_version":"1.0"},"canonical_sha256":"8237a611d6d2afdb104017f8abfb38d9356d1c19ab7d7dd047330822e2cd8a48","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:50:03.979611Z","signature_b64":"+TIeuNbM9f7ToUMTyjL2KcBL9xvYH7seO6660ElSaF1mGXDqDPJgCMoup1yFNSelEhITeodbOr6BCUFUlCMoAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"8237a611d6d2afdb104017f8abfb38d9356d1c19ab7d7dd047330822e2cd8a48","last_reissued_at":"2026-05-17T23:50:03.979121Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:50:03.979121Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1903.11163","source_version":1,"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-17T23:50:03Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"XOlRZtwMZ2yofFDxosmtNvHoIq2sLLJoJUncRXOXYaxUvj3xjmNrbpcyxSJGa+dgEa/LZjiojKe8wTH1u7uYAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-05T09:25:00.725300Z"},"content_sha256":"d301f499807053a96ab67cbba4639926c928b2f835c696718948585ebb7bef2a","schema_version":"1.0","event_id":"sha256:d301f499807053a96ab67cbba4639926c928b2f835c696718948585ebb7bef2a"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2019:QI32MEOW2KX5WECAC74KX6ZY3E","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Efficient Trajectory Generation for Robotic Systems Constrained by Contact Forces","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.RO","authors_text":"Efstathios Bakolas, Jaemin Lee, Luis Sentis","submitted_at":"2019-03-26T21:40:46Z","abstract_excerpt":"In this work, we propose a trajectory generation method for robotic systems with contact force constraint based on optimal control and reachability analysis. Normally, the dynamics and constraints of the contact-constrained robot are nonlinear and coupled to each other. Instead of linearizing the model and constraints, we directly solve the optimal control problem to obtain the feasible state trajectory and the control input of the system. A tractable optimal control problem is formulated which is addressed by dual approaches, which are sampling-based dynamic programming and rigorous reachabil"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1903.11163","kind":"arxiv","version":1},"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-17T23:50:03Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"9xn3dCfpABqGvPUBCIA/VOKdvANWJLPGw/EMJ9kYIfPLda4Y6qc+fHb0NgrI7bK6ESzkRdFxwldkQHXY/t3QAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-05T09:25:00.725676Z"},"content_sha256":"81b95f15b58a1687141991da63a740429147f6052544b5b1aa7e4a04513442b5","schema_version":"1.0","event_id":"sha256:81b95f15b58a1687141991da63a740429147f6052544b5b1aa7e4a04513442b5"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/QI32MEOW2KX5WECAC74KX6ZY3E/bundle.json","state_url":"https://pith.science/pith/QI32MEOW2KX5WECAC74KX6ZY3E/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/QI32MEOW2KX5WECAC74KX6ZY3E/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-05T09:25:00Z","links":{"resolver":"https://pith.science/pith/QI32MEOW2KX5WECAC74KX6ZY3E","bundle":"https://pith.science/pith/QI32MEOW2KX5WECAC74KX6ZY3E/bundle.json","state":"https://pith.science/pith/QI32MEOW2KX5WECAC74KX6ZY3E/state.json","well_known_bundle":"https://pith.science/.well-known/pith/QI32MEOW2KX5WECAC74KX6ZY3E/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2019:QI32MEOW2KX5WECAC74KX6ZY3E","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":"cb8d420ad61efa0c8dbc104655b292852d45755b9ac700e2ad7371f0c013a39d","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.RO","submitted_at":"2019-03-26T21:40:46Z","title_canon_sha256":"1e412952b5bf87edf010b642a9c75aef0ae86c6c47faafd7605d88e05f383c85"},"schema_version":"1.0","source":{"id":"1903.11163","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1903.11163","created_at":"2026-05-17T23:50:03Z"},{"alias_kind":"arxiv_version","alias_value":"1903.11163v1","created_at":"2026-05-17T23:50:03Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1903.11163","created_at":"2026-05-17T23:50:03Z"},{"alias_kind":"pith_short_12","alias_value":"QI32MEOW2KX5","created_at":"2026-05-18T12:33:27Z"},{"alias_kind":"pith_short_16","alias_value":"QI32MEOW2KX5WECA","created_at":"2026-05-18T12:33:27Z"},{"alias_kind":"pith_short_8","alias_value":"QI32MEOW","created_at":"2026-05-18T12:33:27Z"}],"graph_snapshots":[{"event_id":"sha256:81b95f15b58a1687141991da63a740429147f6052544b5b1aa7e4a04513442b5","target":"graph","created_at":"2026-05-17T23:50:03Z","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":"In this work, we propose a trajectory generation method for robotic systems with contact force constraint based on optimal control and reachability analysis. Normally, the dynamics and constraints of the contact-constrained robot are nonlinear and coupled to each other. Instead of linearizing the model and constraints, we directly solve the optimal control problem to obtain the feasible state trajectory and the control input of the system. A tractable optimal control problem is formulated which is addressed by dual approaches, which are sampling-based dynamic programming and rigorous reachabil","authors_text":"Efstathios Bakolas, Jaemin Lee, Luis Sentis","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.RO","submitted_at":"2019-03-26T21:40:46Z","title":"Efficient Trajectory Generation for Robotic Systems Constrained by Contact Forces"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1903.11163","kind":"arxiv","version":1},"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:d301f499807053a96ab67cbba4639926c928b2f835c696718948585ebb7bef2a","target":"record","created_at":"2026-05-17T23:50:03Z","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":"cb8d420ad61efa0c8dbc104655b292852d45755b9ac700e2ad7371f0c013a39d","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.RO","submitted_at":"2019-03-26T21:40:46Z","title_canon_sha256":"1e412952b5bf87edf010b642a9c75aef0ae86c6c47faafd7605d88e05f383c85"},"schema_version":"1.0","source":{"id":"1903.11163","kind":"arxiv","version":1}},"canonical_sha256":"8237a611d6d2afdb104017f8abfb38d9356d1c19ab7d7dd047330822e2cd8a48","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"8237a611d6d2afdb104017f8abfb38d9356d1c19ab7d7dd047330822e2cd8a48","first_computed_at":"2026-05-17T23:50:03.979121Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:50:03.979121Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"+TIeuNbM9f7ToUMTyjL2KcBL9xvYH7seO6660ElSaF1mGXDqDPJgCMoup1yFNSelEhITeodbOr6BCUFUlCMoAA==","signature_status":"signed_v1","signed_at":"2026-05-17T23:50:03.979611Z","signed_message":"canonical_sha256_bytes"},"source_id":"1903.11163","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:d301f499807053a96ab67cbba4639926c928b2f835c696718948585ebb7bef2a","sha256:81b95f15b58a1687141991da63a740429147f6052544b5b1aa7e4a04513442b5"],"state_sha256":"f020c54a6ab312d2ff848f77afe46bc7f19209f857b66a933dbf40a30cafdddb"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"LzTZ3OjRsLZp+eYHRjoegHPvf8elVT+XkQYMMSAhyqz2/SYFUrlH4edzsjZcXgxDHJHw1jL5XrqdB50jcjEzBg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-05T09:25:00.727737Z","bundle_sha256":"5079f772c5ca68fa1790378da3c557e166ee3eb56826dcd1d8312e726bc0d525"}}