{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2026:DCJPZ2XPZVSIOEAITLWNIGHIVR","short_pith_number":"pith:DCJPZ2XP","schema_version":"1.0","canonical_sha256":"1892fceaefcd648710089aecd418e8ac5bb2a89194c113c0a49b8249dfd24495","source":{"kind":"arxiv","id":"2606.05372","version":1},"attestation_state":"computed","paper":{"title":"Efficient Computation of Distance Functions for Navigation Vector Fields in Lie Groups","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.CG"],"primary_cat":"cs.RO","authors_text":"Douglas G. Macharet, Felipe Bartelt, Gustavo M. Freitas, H\\'ector Azp\\'urua, Jo\\~ao Bai\\~ao, Luciano C. A. Pimenta, Vinicius M. Gon\\c{c}alves","submitted_at":"2026-06-03T19:18:59Z","abstract_excerpt":"Vector-field-based methods are widely used for robot control and are often applied to the path-tracking problem. Some vector field approaches require repeatedly computing the distance between the robot configuration and the curve, as well as the corresponding closest point. Recently, vector fields have been extended to Lie Groups. In this case, this computation can be expensive, especially when performed at high control frequencies on embedded platforms. This paper proposes a method for efficiently computing the distance between a point and a curve represented as what is called a G-polynomial "},"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":"2606.05372","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.RO","submitted_at":"2026-06-03T19:18:59Z","cross_cats_sorted":["cs.CG"],"title_canon_sha256":"967e94a911dfb5cd979edd848995dd93f212e055029e8b9803e47f12128dec4e","abstract_canon_sha256":"b18e991c4150d5bc3c9d89ee02543bb68fb8666f457618b1914daabd4473cc7a"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-06-05T00:13:55.652043Z","signature_b64":"vJLTb/xSBjGhCKQfqWj0K2Fo/i3yzS4aO1KZ9Fc84nwEqRRhhop319+jQZOyp6CdkoWnPzVqGZWpByHXpWUHDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"1892fceaefcd648710089aecd418e8ac5bb2a89194c113c0a49b8249dfd24495","last_reissued_at":"2026-06-05T00:13:55.651463Z","signature_status":"signed_v1","first_computed_at":"2026-06-05T00:13:55.651463Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Efficient Computation of Distance Functions for Navigation Vector Fields in Lie Groups","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.CG"],"primary_cat":"cs.RO","authors_text":"Douglas G. Macharet, Felipe Bartelt, Gustavo M. Freitas, H\\'ector Azp\\'urua, Jo\\~ao Bai\\~ao, Luciano C. A. Pimenta, Vinicius M. Gon\\c{c}alves","submitted_at":"2026-06-03T19:18:59Z","abstract_excerpt":"Vector-field-based methods are widely used for robot control and are often applied to the path-tracking problem. Some vector field approaches require repeatedly computing the distance between the robot configuration and the curve, as well as the corresponding closest point. Recently, vector fields have been extended to Lie Groups. In this case, this computation can be expensive, especially when performed at high control frequencies on embedded platforms. This paper proposes a method for efficiently computing the distance between a point and a curve represented as what is called a G-polynomial "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2606.05372","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/2606.05372/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"},"aliases":[{"alias_kind":"arxiv","alias_value":"2606.05372","created_at":"2026-06-05T00:13:55.651556+00:00"},{"alias_kind":"arxiv_version","alias_value":"2606.05372v1","created_at":"2026-06-05T00:13:55.651556+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2606.05372","created_at":"2026-06-05T00:13:55.651556+00:00"},{"alias_kind":"pith_short_12","alias_value":"DCJPZ2XPZVSI","created_at":"2026-06-05T00:13:55.651556+00:00"},{"alias_kind":"pith_short_16","alias_value":"DCJPZ2XPZVSIOEAI","created_at":"2026-06-05T00:13:55.651556+00:00"},{"alias_kind":"pith_short_8","alias_value":"DCJPZ2XP","created_at":"2026-06-05T00:13:55.651556+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/DCJPZ2XPZVSIOEAITLWNIGHIVR","json":"https://pith.science/pith/DCJPZ2XPZVSIOEAITLWNIGHIVR.json","graph_json":"https://pith.science/api/pith-number/DCJPZ2XPZVSIOEAITLWNIGHIVR/graph.json","events_json":"https://pith.science/api/pith-number/DCJPZ2XPZVSIOEAITLWNIGHIVR/events.json","paper":"https://pith.science/paper/DCJPZ2XP"},"agent_actions":{"view_html":"https://pith.science/pith/DCJPZ2XPZVSIOEAITLWNIGHIVR","download_json":"https://pith.science/pith/DCJPZ2XPZVSIOEAITLWNIGHIVR.json","view_paper":"https://pith.science/paper/DCJPZ2XP","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2606.05372&json=true","fetch_graph":"https://pith.science/api/pith-number/DCJPZ2XPZVSIOEAITLWNIGHIVR/graph.json","fetch_events":"https://pith.science/api/pith-number/DCJPZ2XPZVSIOEAITLWNIGHIVR/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/DCJPZ2XPZVSIOEAITLWNIGHIVR/action/timestamp_anchor","attest_storage":"https://pith.science/pith/DCJPZ2XPZVSIOEAITLWNIGHIVR/action/storage_attestation","attest_author":"https://pith.science/pith/DCJPZ2XPZVSIOEAITLWNIGHIVR/action/author_attestation","sign_citation":"https://pith.science/pith/DCJPZ2XPZVSIOEAITLWNIGHIVR/action/citation_signature","submit_replication":"https://pith.science/pith/DCJPZ2XPZVSIOEAITLWNIGHIVR/action/replication_record"}},"created_at":"2026-06-05T00:13:55.651556+00:00","updated_at":"2026-06-05T00:13:55.651556+00:00"}