{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2019:DC6LENXG6VSZFKINULZWYR6YVV","short_pith_number":"pith:DC6LENXG","schema_version":"1.0","canonical_sha256":"18bcb236e6f56592a90da2f36c47d8ad677c1f0a03b8b9d11f2dc39cccdcf2c2","source":{"kind":"arxiv","id":"1903.02765","version":1},"attestation_state":"computed","paper":{"title":"Using DP Towards A Shortest Path Problem-Related Application","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.RO"],"primary_cat":"cs.CV","authors_text":"Han Ma, Jianhao Jiao, Ming Liu, Rui Fan","submitted_at":"2019-03-07T08:11:15Z","abstract_excerpt":"The detection of curved lanes is still challenging for autonomous driving systems. Although current cutting-edge approaches have performed well in real applications, most of them are based on strict model assumptions. Similar to other visual recognition tasks, lane detection can be formulated as a two-dimensional graph searching problem, which can be solved by finding several optimal paths along with line segments and boundaries. In this paper, we present a directed graph model, in which dynamic programming is used to deal with a specific shortest path problem. This model is particularly suita"},"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":"1903.02765","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2019-03-07T08:11:15Z","cross_cats_sorted":["cs.RO"],"title_canon_sha256":"06c34c665d7449c00210858b96a943b4078bc2858623c595ce9dc87e7361b3ab","abstract_canon_sha256":"26caabd493e216511ff6a640373c00f93d411248dba1119d88407eb9968ff805"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:51:51.201071Z","signature_b64":"V385V/TGYDHRJclRDuPHTIFDV4olQtJsNlUoo+VgIJAu7ttbTg0lvmvEDifN1Xai6fyToMS3ja46wnWoghbQBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"18bcb236e6f56592a90da2f36c47d8ad677c1f0a03b8b9d11f2dc39cccdcf2c2","last_reissued_at":"2026-05-17T23:51:51.200410Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:51:51.200410Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Using DP Towards A Shortest Path Problem-Related Application","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.RO"],"primary_cat":"cs.CV","authors_text":"Han Ma, Jianhao Jiao, Ming Liu, Rui Fan","submitted_at":"2019-03-07T08:11:15Z","abstract_excerpt":"The detection of curved lanes is still challenging for autonomous driving systems. Although current cutting-edge approaches have performed well in real applications, most of them are based on strict model assumptions. Similar to other visual recognition tasks, lane detection can be formulated as a two-dimensional graph searching problem, which can be solved by finding several optimal paths along with line segments and boundaries. In this paper, we present a directed graph model, in which dynamic programming is used to deal with a specific shortest path problem. This model is particularly suita"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1903.02765","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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1903.02765","created_at":"2026-05-17T23:51:51.200511+00:00"},{"alias_kind":"arxiv_version","alias_value":"1903.02765v1","created_at":"2026-05-17T23:51:51.200511+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1903.02765","created_at":"2026-05-17T23:51:51.200511+00:00"},{"alias_kind":"pith_short_12","alias_value":"DC6LENXG6VSZ","created_at":"2026-05-18T12:33:15.570797+00:00"},{"alias_kind":"pith_short_16","alias_value":"DC6LENXG6VSZFKIN","created_at":"2026-05-18T12:33:15.570797+00:00"},{"alias_kind":"pith_short_8","alias_value":"DC6LENXG","created_at":"2026-05-18T12:33:15.570797+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/DC6LENXG6VSZFKINULZWYR6YVV","json":"https://pith.science/pith/DC6LENXG6VSZFKINULZWYR6YVV.json","graph_json":"https://pith.science/api/pith-number/DC6LENXG6VSZFKINULZWYR6YVV/graph.json","events_json":"https://pith.science/api/pith-number/DC6LENXG6VSZFKINULZWYR6YVV/events.json","paper":"https://pith.science/paper/DC6LENXG"},"agent_actions":{"view_html":"https://pith.science/pith/DC6LENXG6VSZFKINULZWYR6YVV","download_json":"https://pith.science/pith/DC6LENXG6VSZFKINULZWYR6YVV.json","view_paper":"https://pith.science/paper/DC6LENXG","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1903.02765&json=true","fetch_graph":"https://pith.science/api/pith-number/DC6LENXG6VSZFKINULZWYR6YVV/graph.json","fetch_events":"https://pith.science/api/pith-number/DC6LENXG6VSZFKINULZWYR6YVV/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/DC6LENXG6VSZFKINULZWYR6YVV/action/timestamp_anchor","attest_storage":"https://pith.science/pith/DC6LENXG6VSZFKINULZWYR6YVV/action/storage_attestation","attest_author":"https://pith.science/pith/DC6LENXG6VSZFKINULZWYR6YVV/action/author_attestation","sign_citation":"https://pith.science/pith/DC6LENXG6VSZFKINULZWYR6YVV/action/citation_signature","submit_replication":"https://pith.science/pith/DC6LENXG6VSZFKINULZWYR6YVV/action/replication_record"}},"created_at":"2026-05-17T23:51:51.200511+00:00","updated_at":"2026-05-17T23:51:51.200511+00:00"}