{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2013:NWMIZJHJ632QYUXZLKFRGZ5YLK","short_pith_number":"pith:NWMIZJHJ","canonical_record":{"source":{"id":"1305.5025","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.RO","submitted_at":"2013-05-22T05:37:35Z","cross_cats_sorted":["cs.CE","math.NA"],"title_canon_sha256":"802f573396b156bc8087b2a0cf9ab1006b68e1ad8aca4522365e71f4b10baaad","abstract_canon_sha256":"ea6a16d5683e83d2a11e0926da45efa764c75771759a2befdb7447c4452b0010"},"schema_version":"1.0"},"canonical_sha256":"6d988ca4e9f6f50c52f95a8b1367b85a963fc9d952976a2ee2be21294c9a1987","source":{"kind":"arxiv","id":"1305.5025","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1305.5025","created_at":"2026-05-18T03:25:13Z"},{"alias_kind":"arxiv_version","alias_value":"1305.5025v1","created_at":"2026-05-18T03:25:13Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1305.5025","created_at":"2026-05-18T03:25:13Z"},{"alias_kind":"pith_short_12","alias_value":"NWMIZJHJ632Q","created_at":"2026-05-18T12:27:52Z"},{"alias_kind":"pith_short_16","alias_value":"NWMIZJHJ632QYUXZ","created_at":"2026-05-18T12:27:52Z"},{"alias_kind":"pith_short_8","alias_value":"NWMIZJHJ","created_at":"2026-05-18T12:27:52Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2013:NWMIZJHJ632QYUXZLKFRGZ5YLK","target":"record","payload":{"canonical_record":{"source":{"id":"1305.5025","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.RO","submitted_at":"2013-05-22T05:37:35Z","cross_cats_sorted":["cs.CE","math.NA"],"title_canon_sha256":"802f573396b156bc8087b2a0cf9ab1006b68e1ad8aca4522365e71f4b10baaad","abstract_canon_sha256":"ea6a16d5683e83d2a11e0926da45efa764c75771759a2befdb7447c4452b0010"},"schema_version":"1.0"},"canonical_sha256":"6d988ca4e9f6f50c52f95a8b1367b85a963fc9d952976a2ee2be21294c9a1987","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:25:13.733876Z","signature_b64":"QigIHj8Ra6gtdLuRarqzhN0is6bNfgrRlB2kpHhnEc8KYGTj2JhsKSs6K3ntaPFl64RXNA1eZHg+yPyZnB1VDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"6d988ca4e9f6f50c52f95a8b1367b85a963fc9d952976a2ee2be21294c9a1987","last_reissued_at":"2026-05-18T03:25:13.733144Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:25:13.733144Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1305.5025","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-18T03:25:13Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"tC8KspG4V5z9BTY8W2tzsSV7zipv1RHzHilQZWtzEa+wLtMw15RM+skAQD06m2qH1/F2edo6ROWl4iuWRmBLDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-24T13:36:59.628531Z"},"content_sha256":"a79aac9866a786ae397d51ae834f3119ff4253b2d1c02e947e8d2c8da1e0f3df","schema_version":"1.0","event_id":"sha256:a79aac9866a786ae397d51ae834f3119ff4253b2d1c02e947e8d2c8da1e0f3df"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2013:NWMIZJHJ632QYUXZLKFRGZ5YLK","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"A Nonlinear Constrained Optimization Framework for Comfortable and Customizable Motion Planning of Nonholonomic Mobile Robots - Part II","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CE","math.NA"],"primary_cat":"cs.RO","authors_text":"Benjamin Kuipers, Chetan Jhurani, Shilpa Gulati","submitted_at":"2013-05-22T05:37:35Z","abstract_excerpt":"In this series of papers, we present a motion planning framework for planning comfortable and customizable motion of nonholonomic mobile robots such as intelligent wheelchairs and autonomous cars. In Part I, we presented the mathematical foundation of our framework, where we model motion discomfort as a weighted cost functional and define comfortable motion planning as a nonlinear constrained optimization problem of computing trajectories that minimize this discomfort given the appropriate boundary conditions and constraints.\n  In this paper, we discretize the infinite-dimensional optimization"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1305.5025","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-18T03:25:13Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"c35lPtTRWRI4XmDWwUkMX4QTreIHwHaImItbMZV/TH7JhXg8jBTAjXHr4zchyNzwhZAuAEWvz6QmytIbVni9Dg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-24T13:36:59.628889Z"},"content_sha256":"32782b1b147550d23f9ced9420515686f2785176868c37dbcbff3285cbe4d923","schema_version":"1.0","event_id":"sha256:32782b1b147550d23f9ced9420515686f2785176868c37dbcbff3285cbe4d923"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/NWMIZJHJ632QYUXZLKFRGZ5YLK/bundle.json","state_url":"https://pith.science/pith/NWMIZJHJ632QYUXZLKFRGZ5YLK/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/NWMIZJHJ632QYUXZLKFRGZ5YLK/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-24T13:36:59Z","links":{"resolver":"https://pith.science/pith/NWMIZJHJ632QYUXZLKFRGZ5YLK","bundle":"https://pith.science/pith/NWMIZJHJ632QYUXZLKFRGZ5YLK/bundle.json","state":"https://pith.science/pith/NWMIZJHJ632QYUXZLKFRGZ5YLK/state.json","well_known_bundle":"https://pith.science/.well-known/pith/NWMIZJHJ632QYUXZLKFRGZ5YLK/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2013:NWMIZJHJ632QYUXZLKFRGZ5YLK","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":"ea6a16d5683e83d2a11e0926da45efa764c75771759a2befdb7447c4452b0010","cross_cats_sorted":["cs.CE","math.NA"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.RO","submitted_at":"2013-05-22T05:37:35Z","title_canon_sha256":"802f573396b156bc8087b2a0cf9ab1006b68e1ad8aca4522365e71f4b10baaad"},"schema_version":"1.0","source":{"id":"1305.5025","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1305.5025","created_at":"2026-05-18T03:25:13Z"},{"alias_kind":"arxiv_version","alias_value":"1305.5025v1","created_at":"2026-05-18T03:25:13Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1305.5025","created_at":"2026-05-18T03:25:13Z"},{"alias_kind":"pith_short_12","alias_value":"NWMIZJHJ632Q","created_at":"2026-05-18T12:27:52Z"},{"alias_kind":"pith_short_16","alias_value":"NWMIZJHJ632QYUXZ","created_at":"2026-05-18T12:27:52Z"},{"alias_kind":"pith_short_8","alias_value":"NWMIZJHJ","created_at":"2026-05-18T12:27:52Z"}],"graph_snapshots":[{"event_id":"sha256:32782b1b147550d23f9ced9420515686f2785176868c37dbcbff3285cbe4d923","target":"graph","created_at":"2026-05-18T03:25:13Z","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 series of papers, we present a motion planning framework for planning comfortable and customizable motion of nonholonomic mobile robots such as intelligent wheelchairs and autonomous cars. In Part I, we presented the mathematical foundation of our framework, where we model motion discomfort as a weighted cost functional and define comfortable motion planning as a nonlinear constrained optimization problem of computing trajectories that minimize this discomfort given the appropriate boundary conditions and constraints.\n  In this paper, we discretize the infinite-dimensional optimization","authors_text":"Benjamin Kuipers, Chetan Jhurani, Shilpa Gulati","cross_cats":["cs.CE","math.NA"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.RO","submitted_at":"2013-05-22T05:37:35Z","title":"A Nonlinear Constrained Optimization Framework for Comfortable and Customizable Motion Planning of Nonholonomic Mobile Robots - Part II"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1305.5025","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:a79aac9866a786ae397d51ae834f3119ff4253b2d1c02e947e8d2c8da1e0f3df","target":"record","created_at":"2026-05-18T03:25:13Z","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":"ea6a16d5683e83d2a11e0926da45efa764c75771759a2befdb7447c4452b0010","cross_cats_sorted":["cs.CE","math.NA"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.RO","submitted_at":"2013-05-22T05:37:35Z","title_canon_sha256":"802f573396b156bc8087b2a0cf9ab1006b68e1ad8aca4522365e71f4b10baaad"},"schema_version":"1.0","source":{"id":"1305.5025","kind":"arxiv","version":1}},"canonical_sha256":"6d988ca4e9f6f50c52f95a8b1367b85a963fc9d952976a2ee2be21294c9a1987","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"6d988ca4e9f6f50c52f95a8b1367b85a963fc9d952976a2ee2be21294c9a1987","first_computed_at":"2026-05-18T03:25:13.733144Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:25:13.733144Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"QigIHj8Ra6gtdLuRarqzhN0is6bNfgrRlB2kpHhnEc8KYGTj2JhsKSs6K3ntaPFl64RXNA1eZHg+yPyZnB1VDw==","signature_status":"signed_v1","signed_at":"2026-05-18T03:25:13.733876Z","signed_message":"canonical_sha256_bytes"},"source_id":"1305.5025","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:a79aac9866a786ae397d51ae834f3119ff4253b2d1c02e947e8d2c8da1e0f3df","sha256:32782b1b147550d23f9ced9420515686f2785176868c37dbcbff3285cbe4d923"],"state_sha256":"41fad01544d24e9cb9e26122b353489ad22f64f6139dc750247377c6f75babdc"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"jLFYlyvvOvIEBGuHNvNXRyNZL9XTZ9DZW0sDoB1QiL1Rpk1NXXu+WqK6nAE0imGBE9b25jgtWLCjCQA/hjO+BA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-24T13:36:59.631050Z","bundle_sha256":"26fffb14703c39a672086ffe5b6602effa3a5ccb532d9c6a058d27b01e213e56"}}