{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:ERCVXDJGF2N26LBRPI5NVKZ5FG","short_pith_number":"pith:ERCVXDJG","schema_version":"1.0","canonical_sha256":"24455b8d262e9baf2c317a3adaab3d299029ae1fe12f43255e365917d46b2f89","source":{"kind":"arxiv","id":"1701.07549","version":1},"attestation_state":"computed","paper":{"title":"Robot Coverage Path Planning for General Surfaces Using Quadratic Differentials","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.RO","authors_text":"Chien-Chun Ni, Jie Gao, Na Lei, Xianfeng David Gu, Yu-Yao Lin","submitted_at":"2017-01-26T02:29:03Z","abstract_excerpt":"Robot Coverage Path planning (i.e., provide full coverage of a given domain by one or multiple robots) is a classical problem in the field of robotics and motion planning. The goal is to provide nearly full coverage while also minimize duplicately visited area. In this paper we focus on the scenario of path planning on general surfaces including planar domains with complex topology, complex terrain or general surface in 3D space. The main idea is to adopt a natural, intrinsic and global parametrization of the surface for robot path planning, namely the holomorphic quadratic differentials. Exce"},"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":"1701.07549","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.RO","submitted_at":"2017-01-26T02:29:03Z","cross_cats_sorted":[],"title_canon_sha256":"0222b737c20e92aba5be69b19e086100297e017896358ee5a0848ea85dbb57e5","abstract_canon_sha256":"18013e764da1b750086a6b3bcd3c98da8ca6e5cc0ca95d212acaf3d4bca7bdb2"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:52:03.171033Z","signature_b64":"veCAHNc9jFdqwJTscng4EuZ44hOcHMA0gzA8HjA7lYD1mAIoEnODs7/7B1aZAElLuI7yLd5hD3iDDJdl4ovVBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"24455b8d262e9baf2c317a3adaab3d299029ae1fe12f43255e365917d46b2f89","last_reissued_at":"2026-05-18T00:52:03.170606Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:52:03.170606Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Robot Coverage Path Planning for General Surfaces Using Quadratic Differentials","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.RO","authors_text":"Chien-Chun Ni, Jie Gao, Na Lei, Xianfeng David Gu, Yu-Yao Lin","submitted_at":"2017-01-26T02:29:03Z","abstract_excerpt":"Robot Coverage Path planning (i.e., provide full coverage of a given domain by one or multiple robots) is a classical problem in the field of robotics and motion planning. The goal is to provide nearly full coverage while also minimize duplicately visited area. In this paper we focus on the scenario of path planning on general surfaces including planar domains with complex topology, complex terrain or general surface in 3D space. The main idea is to adopt a natural, intrinsic and global parametrization of the surface for robot path planning, namely the holomorphic quadratic differentials. Exce"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1701.07549","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":"1701.07549","created_at":"2026-05-18T00:52:03.170672+00:00"},{"alias_kind":"arxiv_version","alias_value":"1701.07549v1","created_at":"2026-05-18T00:52:03.170672+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1701.07549","created_at":"2026-05-18T00:52:03.170672+00:00"},{"alias_kind":"pith_short_12","alias_value":"ERCVXDJGF2N2","created_at":"2026-05-18T12:31:12.930513+00:00"},{"alias_kind":"pith_short_16","alias_value":"ERCVXDJGF2N26LBR","created_at":"2026-05-18T12:31:12.930513+00:00"},{"alias_kind":"pith_short_8","alias_value":"ERCVXDJG","created_at":"2026-05-18T12:31:12.930513+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/ERCVXDJGF2N26LBRPI5NVKZ5FG","json":"https://pith.science/pith/ERCVXDJGF2N26LBRPI5NVKZ5FG.json","graph_json":"https://pith.science/api/pith-number/ERCVXDJGF2N26LBRPI5NVKZ5FG/graph.json","events_json":"https://pith.science/api/pith-number/ERCVXDJGF2N26LBRPI5NVKZ5FG/events.json","paper":"https://pith.science/paper/ERCVXDJG"},"agent_actions":{"view_html":"https://pith.science/pith/ERCVXDJGF2N26LBRPI5NVKZ5FG","download_json":"https://pith.science/pith/ERCVXDJGF2N26LBRPI5NVKZ5FG.json","view_paper":"https://pith.science/paper/ERCVXDJG","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1701.07549&json=true","fetch_graph":"https://pith.science/api/pith-number/ERCVXDJGF2N26LBRPI5NVKZ5FG/graph.json","fetch_events":"https://pith.science/api/pith-number/ERCVXDJGF2N26LBRPI5NVKZ5FG/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/ERCVXDJGF2N26LBRPI5NVKZ5FG/action/timestamp_anchor","attest_storage":"https://pith.science/pith/ERCVXDJGF2N26LBRPI5NVKZ5FG/action/storage_attestation","attest_author":"https://pith.science/pith/ERCVXDJGF2N26LBRPI5NVKZ5FG/action/author_attestation","sign_citation":"https://pith.science/pith/ERCVXDJGF2N26LBRPI5NVKZ5FG/action/citation_signature","submit_replication":"https://pith.science/pith/ERCVXDJGF2N26LBRPI5NVKZ5FG/action/replication_record"}},"created_at":"2026-05-18T00:52:03.170672+00:00","updated_at":"2026-05-18T00:52:03.170672+00:00"}