{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:37KDSXPECQANKGQREQT55CH65G","short_pith_number":"pith:37KDSXPE","schema_version":"1.0","canonical_sha256":"dfd4395de41400d51a112427de88fee9866fa378c4a0e9eba48d1dcb500c9054","source":{"kind":"arxiv","id":"1801.06325","version":2},"attestation_state":"computed","paper":{"title":"Markov-Dubins Interpolating Curves","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":"2018-01-19T07:42:21Z","abstract_excerpt":"A realistic generalization of the Markov--Dubins problem, which is concerned with finding the shortest planar curve of constrained curvature joining two points with prescribed tangents, is the requirement that the curve passes through a number of prescribed intermediate points/nodes. We refer to this generalization as the Markov--Dubins interpolation problem. We formulate this interpolation problem as an optimal control problem and obtain results about the structure of its solution using optimal control theory. The Markov--Dubins interpolants consist of a concatenation of circular ($C$) and st"},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"canonical_record":{"source":{"id":"1801.06325","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2018-01-19T07:42:21Z","cross_cats_sorted":[],"title_canon_sha256":"ed187c86302bbc2cf512989c49985aba257240212a05455d2eac63ab2531451e","abstract_canon_sha256":"f046b81565ad13e2ef398c4f16828f17691235f1961105520d536adbd97d395c"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:54:56.379819Z","signature_b64":"jtfY+FbTvPs9pIQoDzgIYLcT3LvHjRgmZq5SpXwiwXCOIxFsBju1mJ4u3LUm8OO55IHR8XG5fLocDjJA3z11DQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"dfd4395de41400d51a112427de88fee9866fa378c4a0e9eba48d1dcb500c9054","last_reissued_at":"2026-05-17T23:54:56.379292Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:54:56.379292Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Markov-Dubins Interpolating Curves","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":"2018-01-19T07:42:21Z","abstract_excerpt":"A realistic generalization of the Markov--Dubins problem, which is concerned with finding the shortest planar curve of constrained curvature joining two points with prescribed tangents, is the requirement that the curve passes through a number of prescribed intermediate points/nodes. We refer to this generalization as the Markov--Dubins interpolation problem. We formulate this interpolation problem as an optimal control problem and obtain results about the structure of its solution using optimal control theory. The Markov--Dubins interpolants consist of a concatenation of circular ($C$) and st"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1801.06325","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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1801.06325","created_at":"2026-05-17T23:54:56.379385+00:00"},{"alias_kind":"arxiv_version","alias_value":"1801.06325v2","created_at":"2026-05-17T23:54:56.379385+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1801.06325","created_at":"2026-05-17T23:54:56.379385+00:00"},{"alias_kind":"pith_short_12","alias_value":"37KDSXPECQAN","created_at":"2026-05-18T12:32:02.567920+00:00"},{"alias_kind":"pith_short_16","alias_value":"37KDSXPECQANKGQR","created_at":"2026-05-18T12:32:02.567920+00:00"},{"alias_kind":"pith_short_8","alias_value":"37KDSXPE","created_at":"2026-05-18T12:32:02.567920+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/37KDSXPECQANKGQREQT55CH65G","json":"https://pith.science/pith/37KDSXPECQANKGQREQT55CH65G.json","graph_json":"https://pith.science/api/pith-number/37KDSXPECQANKGQREQT55CH65G/graph.json","events_json":"https://pith.science/api/pith-number/37KDSXPECQANKGQREQT55CH65G/events.json","paper":"https://pith.science/paper/37KDSXPE"},"agent_actions":{"view_html":"https://pith.science/pith/37KDSXPECQANKGQREQT55CH65G","download_json":"https://pith.science/pith/37KDSXPECQANKGQREQT55CH65G.json","view_paper":"https://pith.science/paper/37KDSXPE","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1801.06325&json=true","fetch_graph":"https://pith.science/api/pith-number/37KDSXPECQANKGQREQT55CH65G/graph.json","fetch_events":"https://pith.science/api/pith-number/37KDSXPECQANKGQREQT55CH65G/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/37KDSXPECQANKGQREQT55CH65G/action/timestamp_anchor","attest_storage":"https://pith.science/pith/37KDSXPECQANKGQREQT55CH65G/action/storage_attestation","attest_author":"https://pith.science/pith/37KDSXPECQANKGQREQT55CH65G/action/author_attestation","sign_citation":"https://pith.science/pith/37KDSXPECQANKGQREQT55CH65G/action/citation_signature","submit_replication":"https://pith.science/pith/37KDSXPECQANKGQREQT55CH65G/action/replication_record"}},"created_at":"2026-05-17T23:54:56.379385+00:00","updated_at":"2026-05-17T23:54:56.379385+00:00"}