{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2026:HVEBDNVY6KXMOZYUEA6NWIIDU4","short_pith_number":"pith:HVEBDNVY","schema_version":"1.0","canonical_sha256":"3d4811b6b8f2aec76714203cdb2103a72563e544565d1ac474bbb97bb59292da","source":{"kind":"arxiv","id":"2605.16009","version":1},"attestation_state":"computed","paper":{"title":"Fast Expanding Safe Circular Regions for Efficient Local Path Planning","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.RO","authors_text":"Akshit Saradagi, George Nikolakopoulos, Scott Fredriksson","submitted_at":"2026-05-15T14:40:19Z","abstract_excerpt":"Local navigation is one of the fundamental problems in robot navigation, and numerous approaches have been proposed over the years, including methods such as the Dynamic Window Approach, Model Predictive Control, and more recently, Control Barrier Functions and machine learning based techniques. While these methods perform well in simple environments, many of them rely on optimization or learning based procedures that can struggle in more complex scenarios. In contrast, this article proposes a more geometric algorithmic approach that enables a local navigation method with faster computation ti"},"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":"2605.16009","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.RO","submitted_at":"2026-05-15T14:40:19Z","cross_cats_sorted":[],"title_canon_sha256":"3932b961c3568452db32e03dffa2909959a44b9cc08eadfa8af90589a7883762","abstract_canon_sha256":"6e49f1b846d460533e1b5225e6208f848aeb43a879e50bcca3d03534700a085a"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-20T00:01:48.888789Z","signature_b64":"wkJiegN4889AvAl1eLz2hHAWqzKY+biJ3xs+3be29lUIvs6QzDmyfyqBykx4a44pVrXpVp1VxaOiHTKt56qrCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"3d4811b6b8f2aec76714203cdb2103a72563e544565d1ac474bbb97bb59292da","last_reissued_at":"2026-05-20T00:01:48.888287Z","signature_status":"signed_v1","first_computed_at":"2026-05-20T00:01:48.888287Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Fast Expanding Safe Circular Regions for Efficient Local Path Planning","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.RO","authors_text":"Akshit Saradagi, George Nikolakopoulos, Scott Fredriksson","submitted_at":"2026-05-15T14:40:19Z","abstract_excerpt":"Local navigation is one of the fundamental problems in robot navigation, and numerous approaches have been proposed over the years, including methods such as the Dynamic Window Approach, Model Predictive Control, and more recently, Control Barrier Functions and machine learning based techniques. While these methods perform well in simple environments, many of them rely on optimization or learning based procedures that can struggle in more complex scenarios. In contrast, this article proposes a more geometric algorithmic approach that enables a local navigation method with faster computation ti"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2605.16009","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/2605.16009/integrity.json","findings":[],"available":true,"detectors_run":[{"name":"ai_meta_artifact","ran_at":"2026-05-19T17:33:42.167169Z","status":"skipped","version":"1.0.0","findings_count":0},{"name":"claim_evidence","ran_at":"2026-05-19T17:01:55.647637Z","status":"completed","version":"1.0.0","findings_count":0}],"snapshot_sha256":"6b4d40433cf4989a75aae0f40dcf5dfbbdbf22b78bc18a1cb000c463358acdd0"},"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":"2605.16009","created_at":"2026-05-20T00:01:48.888374+00:00"},{"alias_kind":"arxiv_version","alias_value":"2605.16009v1","created_at":"2026-05-20T00:01:48.888374+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2605.16009","created_at":"2026-05-20T00:01:48.888374+00:00"},{"alias_kind":"pith_short_12","alias_value":"HVEBDNVY6KXM","created_at":"2026-05-20T00:01:48.888374+00:00"},{"alias_kind":"pith_short_16","alias_value":"HVEBDNVY6KXMOZYU","created_at":"2026-05-20T00:01:48.888374+00:00"},{"alias_kind":"pith_short_8","alias_value":"HVEBDNVY","created_at":"2026-05-20T00:01:48.888374+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/HVEBDNVY6KXMOZYUEA6NWIIDU4","json":"https://pith.science/pith/HVEBDNVY6KXMOZYUEA6NWIIDU4.json","graph_json":"https://pith.science/api/pith-number/HVEBDNVY6KXMOZYUEA6NWIIDU4/graph.json","events_json":"https://pith.science/api/pith-number/HVEBDNVY6KXMOZYUEA6NWIIDU4/events.json","paper":"https://pith.science/paper/HVEBDNVY"},"agent_actions":{"view_html":"https://pith.science/pith/HVEBDNVY6KXMOZYUEA6NWIIDU4","download_json":"https://pith.science/pith/HVEBDNVY6KXMOZYUEA6NWIIDU4.json","view_paper":"https://pith.science/paper/HVEBDNVY","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2605.16009&json=true","fetch_graph":"https://pith.science/api/pith-number/HVEBDNVY6KXMOZYUEA6NWIIDU4/graph.json","fetch_events":"https://pith.science/api/pith-number/HVEBDNVY6KXMOZYUEA6NWIIDU4/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/HVEBDNVY6KXMOZYUEA6NWIIDU4/action/timestamp_anchor","attest_storage":"https://pith.science/pith/HVEBDNVY6KXMOZYUEA6NWIIDU4/action/storage_attestation","attest_author":"https://pith.science/pith/HVEBDNVY6KXMOZYUEA6NWIIDU4/action/author_attestation","sign_citation":"https://pith.science/pith/HVEBDNVY6KXMOZYUEA6NWIIDU4/action/citation_signature","submit_replication":"https://pith.science/pith/HVEBDNVY6KXMOZYUEA6NWIIDU4/action/replication_record"}},"created_at":"2026-05-20T00:01:48.888374+00:00","updated_at":"2026-05-20T00:01:48.888374+00:00"}