{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2019:PP7UU2OVC2IYESRQMJX6DEXECA","short_pith_number":"pith:PP7UU2OV","canonical_record":{"source":{"id":"1908.08493","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.RO","submitted_at":"2019-08-22T16:58:06Z","cross_cats_sorted":[],"title_canon_sha256":"ce1d1bd1d1edf275429260a96757dcc59a307441e2c6406c588835b2f0d112b4","abstract_canon_sha256":"92d6a6306944ac03b9a6a4d700ebd5795afd715eb8d08d99dce960bea6df48d3"},"schema_version":"1.0"},"canonical_sha256":"7bff4a69d51691824a30626fe192e410279042a498f547049e0e903c20f309e7","source":{"kind":"arxiv","id":"1908.08493","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1908.08493","created_at":"2026-07-04T23:59:13Z"},{"alias_kind":"arxiv_version","alias_value":"1908.08493v1","created_at":"2026-07-04T23:59:13Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1908.08493","created_at":"2026-07-04T23:59:13Z"},{"alias_kind":"pith_short_12","alias_value":"PP7UU2OVC2IY","created_at":"2026-07-04T23:59:13Z"},{"alias_kind":"pith_short_16","alias_value":"PP7UU2OVC2IYESRQ","created_at":"2026-07-04T23:59:13Z"},{"alias_kind":"pith_short_8","alias_value":"PP7UU2OV","created_at":"2026-07-04T23:59:13Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2019:PP7UU2OVC2IYESRQMJX6DEXECA","target":"record","payload":{"canonical_record":{"source":{"id":"1908.08493","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.RO","submitted_at":"2019-08-22T16:58:06Z","cross_cats_sorted":[],"title_canon_sha256":"ce1d1bd1d1edf275429260a96757dcc59a307441e2c6406c588835b2f0d112b4","abstract_canon_sha256":"92d6a6306944ac03b9a6a4d700ebd5795afd715eb8d08d99dce960bea6df48d3"},"schema_version":"1.0"},"canonical_sha256":"7bff4a69d51691824a30626fe192e410279042a498f547049e0e903c20f309e7","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-04T23:59:13.385828Z","signature_b64":"ZujUi9+gx8yTcPbUtMqknUxC48erLovStTQKdHMiDoC+gcaMgodU5P3PklEGWjzfATr9waWbc8weYPPFDvAhBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"7bff4a69d51691824a30626fe192e410279042a498f547049e0e903c20f309e7","last_reissued_at":"2026-07-04T23:59:13.385407Z","signature_status":"signed_v1","first_computed_at":"2026-07-04T23:59:13.385407Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1908.08493","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-07-04T23:59:13Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"2hPuhBF0HFs/MS51RHJu6gOcMNC/2c+oWR/jaECvrwyTHdejK99d4osgri4mlheVHmRaqK/I/c0elwLXJCA3Dg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-16T15:51:45.774176Z"},"content_sha256":"9dc4ff5df2ae4506ca864e57c576f9e26344cc108694e9e5202e5a2c9842c47f","schema_version":"1.0","event_id":"sha256:9dc4ff5df2ae4506ca864e57c576f9e26344cc108694e9e5202e5a2c9842c47f"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2019:PP7UU2OVC2IYESRQMJX6DEXECA","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"A Hybrid Method for Online Trajectory Planning of Mobile Robots in Cluttered Environments","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.RO","authors_text":"David G\\'omez-Guti\\'errez, Jos\\'e I. Parra-Vilchis, Leobardo Campos-Mac\\'ias, Rafael de la Guardia, Rodrigo Aldana-L\\'opez","submitted_at":"2019-08-22T16:58:06Z","abstract_excerpt":"This paper presents a method for online trajectory planning in known environments. The proposed algorithm is a fusion of sampling-based techniques and model-based optimization via quadratic programming. The former is used to efficiently generate an obstacle-free path while the latter takes into account the robot dynamical constraints to generate a time-dependent trajectory. The main contribution of this work lies on the formulation of a convex optimization problem over the generated obstacle-free path that is guaranteed to be feasible. Thus, in contrast with previously proposed methods, iterat"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1908.08493","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/1908.08493/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-04T23:59:13Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"kf1We0UAGUv+//dMAA33c4IPiotNQ2SYoTrhXGmiwHgf/uLbrCIDgR3zDLIV6QB6t2SxzyL00O5NnuUS1ZhCBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-16T15:51:45.774687Z"},"content_sha256":"7a9ec0fc7e8c641d376795433005b3d15a66e86b0ffe0b6e1dc39d7809eb609e","schema_version":"1.0","event_id":"sha256:7a9ec0fc7e8c641d376795433005b3d15a66e86b0ffe0b6e1dc39d7809eb609e"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/PP7UU2OVC2IYESRQMJX6DEXECA/bundle.json","state_url":"https://pith.science/pith/PP7UU2OVC2IYESRQMJX6DEXECA/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/PP7UU2OVC2IYESRQMJX6DEXECA/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-16T15:51:45Z","links":{"resolver":"https://pith.science/pith/PP7UU2OVC2IYESRQMJX6DEXECA","bundle":"https://pith.science/pith/PP7UU2OVC2IYESRQMJX6DEXECA/bundle.json","state":"https://pith.science/pith/PP7UU2OVC2IYESRQMJX6DEXECA/state.json","well_known_bundle":"https://pith.science/.well-known/pith/PP7UU2OVC2IYESRQMJX6DEXECA/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2019:PP7UU2OVC2IYESRQMJX6DEXECA","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":"92d6a6306944ac03b9a6a4d700ebd5795afd715eb8d08d99dce960bea6df48d3","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.RO","submitted_at":"2019-08-22T16:58:06Z","title_canon_sha256":"ce1d1bd1d1edf275429260a96757dcc59a307441e2c6406c588835b2f0d112b4"},"schema_version":"1.0","source":{"id":"1908.08493","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1908.08493","created_at":"2026-07-04T23:59:13Z"},{"alias_kind":"arxiv_version","alias_value":"1908.08493v1","created_at":"2026-07-04T23:59:13Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1908.08493","created_at":"2026-07-04T23:59:13Z"},{"alias_kind":"pith_short_12","alias_value":"PP7UU2OVC2IY","created_at":"2026-07-04T23:59:13Z"},{"alias_kind":"pith_short_16","alias_value":"PP7UU2OVC2IYESRQ","created_at":"2026-07-04T23:59:13Z"},{"alias_kind":"pith_short_8","alias_value":"PP7UU2OV","created_at":"2026-07-04T23:59:13Z"}],"graph_snapshots":[{"event_id":"sha256:7a9ec0fc7e8c641d376795433005b3d15a66e86b0ffe0b6e1dc39d7809eb609e","target":"graph","created_at":"2026-07-04T23:59: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"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/1908.08493/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"This paper presents a method for online trajectory planning in known environments. The proposed algorithm is a fusion of sampling-based techniques and model-based optimization via quadratic programming. The former is used to efficiently generate an obstacle-free path while the latter takes into account the robot dynamical constraints to generate a time-dependent trajectory. The main contribution of this work lies on the formulation of a convex optimization problem over the generated obstacle-free path that is guaranteed to be feasible. Thus, in contrast with previously proposed methods, iterat","authors_text":"David G\\'omez-Guti\\'errez, Jos\\'e I. Parra-Vilchis, Leobardo Campos-Mac\\'ias, Rafael de la Guardia, Rodrigo Aldana-L\\'opez","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.RO","submitted_at":"2019-08-22T16:58:06Z","title":"A Hybrid Method for Online Trajectory Planning of Mobile Robots in Cluttered Environments"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1908.08493","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:9dc4ff5df2ae4506ca864e57c576f9e26344cc108694e9e5202e5a2c9842c47f","target":"record","created_at":"2026-07-04T23:59: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":"92d6a6306944ac03b9a6a4d700ebd5795afd715eb8d08d99dce960bea6df48d3","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.RO","submitted_at":"2019-08-22T16:58:06Z","title_canon_sha256":"ce1d1bd1d1edf275429260a96757dcc59a307441e2c6406c588835b2f0d112b4"},"schema_version":"1.0","source":{"id":"1908.08493","kind":"arxiv","version":1}},"canonical_sha256":"7bff4a69d51691824a30626fe192e410279042a498f547049e0e903c20f309e7","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"7bff4a69d51691824a30626fe192e410279042a498f547049e0e903c20f309e7","first_computed_at":"2026-07-04T23:59:13.385407Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-04T23:59:13.385407Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"ZujUi9+gx8yTcPbUtMqknUxC48erLovStTQKdHMiDoC+gcaMgodU5P3PklEGWjzfATr9waWbc8weYPPFDvAhBg==","signature_status":"signed_v1","signed_at":"2026-07-04T23:59:13.385828Z","signed_message":"canonical_sha256_bytes"},"source_id":"1908.08493","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:9dc4ff5df2ae4506ca864e57c576f9e26344cc108694e9e5202e5a2c9842c47f","sha256:7a9ec0fc7e8c641d376795433005b3d15a66e86b0ffe0b6e1dc39d7809eb609e"],"state_sha256":"9b4e9d23052dfefa77a14682f752dfc6fd562cc15c61984c8f66ab33b04a365e"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ghtJOMFHQdDPsByeCgUK+LiS9CKAu3eKcFfifN8Qy8wfqbBiKKrYWYG0UgPrvcBVCz1dd3yW2TUFq5Ri/gf5Dg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-16T15:51:45.780211Z","bundle_sha256":"ed033ed12d5388b6f7affcb6837af31ceebdede0bdfd50b369a6ace1efcf898b"}}