{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:P5NQSZOJALUVRTC5R4RWTM57XJ","short_pith_number":"pith:P5NQSZOJ","canonical_record":{"source":{"id":"1704.04895","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2017-04-17T07:37:51Z","cross_cats_sorted":[],"title_canon_sha256":"b8123ed74fa41b0167534f65154a84cfefab62da30df2259e1e5b59bfa544803","abstract_canon_sha256":"6ee7f07331d49996cf0ff565dabee81aa147a54818c891489bc515f638c1b796"},"schema_version":"1.0"},"canonical_sha256":"7f5b0965c902e958cc5d8f2369b3bfba4016dd3841e00e0588574a5738c641af","source":{"kind":"arxiv","id":"1704.04895","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1704.04895","created_at":"2026-05-18T00:30:45Z"},{"alias_kind":"arxiv_version","alias_value":"1704.04895v2","created_at":"2026-05-18T00:30:45Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1704.04895","created_at":"2026-05-18T00:30:45Z"},{"alias_kind":"pith_short_12","alias_value":"P5NQSZOJALUV","created_at":"2026-05-18T12:31:37Z"},{"alias_kind":"pith_short_16","alias_value":"P5NQSZOJALUVRTC5","created_at":"2026-05-18T12:31:37Z"},{"alias_kind":"pith_short_8","alias_value":"P5NQSZOJ","created_at":"2026-05-18T12:31:37Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:P5NQSZOJALUVRTC5R4RWTM57XJ","target":"record","payload":{"canonical_record":{"source":{"id":"1704.04895","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2017-04-17T07:37:51Z","cross_cats_sorted":[],"title_canon_sha256":"b8123ed74fa41b0167534f65154a84cfefab62da30df2259e1e5b59bfa544803","abstract_canon_sha256":"6ee7f07331d49996cf0ff565dabee81aa147a54818c891489bc515f638c1b796"},"schema_version":"1.0"},"canonical_sha256":"7f5b0965c902e958cc5d8f2369b3bfba4016dd3841e00e0588574a5738c641af","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:30:45.163871Z","signature_b64":"7z3Egi4WWPja36Paj3Z9+jmrvAqN0zx8RKvvGx9RwsGlEkib+cCA8hY4A4qNiLBQ2jSX5rRkTjAH2m4UKe6jCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"7f5b0965c902e958cc5d8f2369b3bfba4016dd3841e00e0588574a5738c641af","last_reissued_at":"2026-05-18T00:30:45.163288Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:30:45.163288Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1704.04895","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-05-18T00:30:45Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Q9Y5+Z2vR5NiCorv3+aAknofnw4gYiNGD7uOq2TSoqK2TkXKI0b24dCMIUSYQJlwdVupIn8LXJKV7WX4blI2Cg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-30T04:00:56.755161Z"},"content_sha256":"f47107e6a1badf4a4f32546b7be760e6a5d6e45a009cb0d977cfd85c9a80e738","schema_version":"1.0","event_id":"sha256:f47107e6a1badf4a4f32546b7be760e6a5d6e45a009cb0d977cfd85c9a80e738"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:P5NQSZOJALUVRTC5R4RWTM57XJ","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Markov-Dubins Path via Optimal Control Theory","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"C. Yal\\c{c}{\\i}n Kaya","submitted_at":"2017-04-17T07:37:51Z","abstract_excerpt":"Markov-Dubins path is the shortest planar curve joining two points with prescribed tangents, with a specified bound on its curvature. Its structure, as proved by Dubins in 1957 nearly 70 years after Markov posed the problem of finding it, is elegantly simple: a selection of at most three arcs are concatenated, each of which is either a circular arc of maximum (prescribed) curvature or a straight line. The Markov-Dubins problem and its variants have since been extensively studied in practical and theoretical settings. A reformulation of the Markov-Dubins problem as an optimal control problem wa"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1704.04895","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":""},"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:30:45Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Km9oNrrdbul6qa8taJ66djs6Pml37M9+BdEcBRifJW8azKy0nzWci4BazlVvWGE4J6EnJ+W62FzdDPmIhwPKAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-30T04:00:56.755729Z"},"content_sha256":"d01306f4b0cb262f97dca58e8398c98f01351d6010fdacd99a2b51f18c1f14f3","schema_version":"1.0","event_id":"sha256:d01306f4b0cb262f97dca58e8398c98f01351d6010fdacd99a2b51f18c1f14f3"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/P5NQSZOJALUVRTC5R4RWTM57XJ/bundle.json","state_url":"https://pith.science/pith/P5NQSZOJALUVRTC5R4RWTM57XJ/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/P5NQSZOJALUVRTC5R4RWTM57XJ/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-30T04:00:56Z","links":{"resolver":"https://pith.science/pith/P5NQSZOJALUVRTC5R4RWTM57XJ","bundle":"https://pith.science/pith/P5NQSZOJALUVRTC5R4RWTM57XJ/bundle.json","state":"https://pith.science/pith/P5NQSZOJALUVRTC5R4RWTM57XJ/state.json","well_known_bundle":"https://pith.science/.well-known/pith/P5NQSZOJALUVRTC5R4RWTM57XJ/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:P5NQSZOJALUVRTC5R4RWTM57XJ","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":"6ee7f07331d49996cf0ff565dabee81aa147a54818c891489bc515f638c1b796","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2017-04-17T07:37:51Z","title_canon_sha256":"b8123ed74fa41b0167534f65154a84cfefab62da30df2259e1e5b59bfa544803"},"schema_version":"1.0","source":{"id":"1704.04895","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1704.04895","created_at":"2026-05-18T00:30:45Z"},{"alias_kind":"arxiv_version","alias_value":"1704.04895v2","created_at":"2026-05-18T00:30:45Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1704.04895","created_at":"2026-05-18T00:30:45Z"},{"alias_kind":"pith_short_12","alias_value":"P5NQSZOJALUV","created_at":"2026-05-18T12:31:37Z"},{"alias_kind":"pith_short_16","alias_value":"P5NQSZOJALUVRTC5","created_at":"2026-05-18T12:31:37Z"},{"alias_kind":"pith_short_8","alias_value":"P5NQSZOJ","created_at":"2026-05-18T12:31:37Z"}],"graph_snapshots":[{"event_id":"sha256:d01306f4b0cb262f97dca58e8398c98f01351d6010fdacd99a2b51f18c1f14f3","target":"graph","created_at":"2026-05-18T00:30:45Z","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":"Markov-Dubins path is the shortest planar curve joining two points with prescribed tangents, with a specified bound on its curvature. Its structure, as proved by Dubins in 1957 nearly 70 years after Markov posed the problem of finding it, is elegantly simple: a selection of at most three arcs are concatenated, each of which is either a circular arc of maximum (prescribed) curvature or a straight line. The Markov-Dubins problem and its variants have since been extensively studied in practical and theoretical settings. A reformulation of the Markov-Dubins problem as an optimal control problem wa","authors_text":"C. Yal\\c{c}{\\i}n Kaya","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2017-04-17T07:37:51Z","title":"Markov-Dubins Path via Optimal Control Theory"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1704.04895","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:f47107e6a1badf4a4f32546b7be760e6a5d6e45a009cb0d977cfd85c9a80e738","target":"record","created_at":"2026-05-18T00:30:45Z","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":"6ee7f07331d49996cf0ff565dabee81aa147a54818c891489bc515f638c1b796","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2017-04-17T07:37:51Z","title_canon_sha256":"b8123ed74fa41b0167534f65154a84cfefab62da30df2259e1e5b59bfa544803"},"schema_version":"1.0","source":{"id":"1704.04895","kind":"arxiv","version":2}},"canonical_sha256":"7f5b0965c902e958cc5d8f2369b3bfba4016dd3841e00e0588574a5738c641af","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"7f5b0965c902e958cc5d8f2369b3bfba4016dd3841e00e0588574a5738c641af","first_computed_at":"2026-05-18T00:30:45.163288Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:30:45.163288Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"7z3Egi4WWPja36Paj3Z9+jmrvAqN0zx8RKvvGx9RwsGlEkib+cCA8hY4A4qNiLBQ2jSX5rRkTjAH2m4UKe6jCw==","signature_status":"signed_v1","signed_at":"2026-05-18T00:30:45.163871Z","signed_message":"canonical_sha256_bytes"},"source_id":"1704.04895","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:f47107e6a1badf4a4f32546b7be760e6a5d6e45a009cb0d977cfd85c9a80e738","sha256:d01306f4b0cb262f97dca58e8398c98f01351d6010fdacd99a2b51f18c1f14f3"],"state_sha256":"cba70c25329a71e56e383c4b553f84f06a2f62200dfbaecea8206a8263ed7917"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"H1zwbA1TN4TEkBxQasL8drJcPa8P9CM/erae7s39JcNr5M0S6gmuv2+midLzA8KzCKJ7NmpwYN0cgPydy8HsCg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-30T04:00:56.758154Z","bundle_sha256":"81e31d2f162df800a10ac2adec2f80e44542327a8f5a6cabd16ca2cf91f832db"}}