{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2026:CFXFAYBHS62KCH6XSFYC4TBYXA","short_pith_number":"pith:CFXFAYBH","canonical_record":{"source":{"id":"2607.00065","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.RO","submitted_at":"2026-06-30T12:40:23Z","cross_cats_sorted":["cs.AI"],"title_canon_sha256":"9072fcb2939fcf02788fe2b5280407390f06a61215e88c47b3c5ba9ce4a8b8a0","abstract_canon_sha256":"eb33d7cfca2df02ded7ea91e40916f96194b17d3ffcb92f6dd695532f28cb4bd"},"schema_version":"1.0"},"canonical_sha256":"116e50602797b4a11fd791702e4c38b8162bc41401f29f3d293fe5288e77cd34","source":{"kind":"arxiv","id":"2607.00065","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2607.00065","created_at":"2026-07-02T00:18:33Z"},{"alias_kind":"arxiv_version","alias_value":"2607.00065v1","created_at":"2026-07-02T00:18:33Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2607.00065","created_at":"2026-07-02T00:18:33Z"},{"alias_kind":"pith_short_12","alias_value":"CFXFAYBHS62K","created_at":"2026-07-02T00:18:33Z"},{"alias_kind":"pith_short_16","alias_value":"CFXFAYBHS62KCH6X","created_at":"2026-07-02T00:18:33Z"},{"alias_kind":"pith_short_8","alias_value":"CFXFAYBH","created_at":"2026-07-02T00:18:33Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2026:CFXFAYBHS62KCH6XSFYC4TBYXA","target":"record","payload":{"canonical_record":{"source":{"id":"2607.00065","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.RO","submitted_at":"2026-06-30T12:40:23Z","cross_cats_sorted":["cs.AI"],"title_canon_sha256":"9072fcb2939fcf02788fe2b5280407390f06a61215e88c47b3c5ba9ce4a8b8a0","abstract_canon_sha256":"eb33d7cfca2df02ded7ea91e40916f96194b17d3ffcb92f6dd695532f28cb4bd"},"schema_version":"1.0"},"canonical_sha256":"116e50602797b4a11fd791702e4c38b8162bc41401f29f3d293fe5288e77cd34","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-02T00:18:33.021997Z","signature_b64":"j7bN6ZK3t8eI83EBZStRQB+SCeDrl3Bp6zJShZ02FRluM2PpfOg9km50dHDJXic/1JSbuUgwwz5TYvVND1MlBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"116e50602797b4a11fd791702e4c38b8162bc41401f29f3d293fe5288e77cd34","last_reissued_at":"2026-07-02T00:18:33.021518Z","signature_status":"signed_v1","first_computed_at":"2026-07-02T00:18:33.021518Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2607.00065","source_version":1,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-07-02T00:18:33Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"BP7t2wKTi6IZy0rcXOQ1TPdjC9WW7eeyZ/bzj8XlxpfZkzF/T1hVjQKKLxyr6wZNgQ1iUcDdJgFjM5iFoEhADQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-03T07:53:40.947770Z"},"content_sha256":"b8c384b5126870e52c0664ec483c991fe79938353941088c9773ab146029e515","schema_version":"1.0","event_id":"sha256:b8c384b5126870e52c0664ec483c991fe79938353941088c9773ab146029e515"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2026:CFXFAYBHS62KCH6XSFYC4TBYXA","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Optimal any-angle path planning in static and dynamic environments","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.AI"],"primary_cat":"cs.RO","authors_text":"Clark Borst, Yiyuan Zou","submitted_at":"2026-06-30T12:40:23Z","abstract_excerpt":"Any-angle path planning extends traditional graph-based path planning by allowing movement between any pair of vertices, rather than being restricted by predefined edges. It can find straighter and shorter paths in continuous space with graphs, making it particularly suitable for navigation in open areas such as airspaces, warehouses, and oceans. Many any-angle path-planning algorithms have been proposed, but only a few can guarantee optimal solutions, especially in the presence of dynamic obstacles. To address this challenge, this article focuses on optimal any-angle path planning on grids an"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2607.00065","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/2607.00065/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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-07-02T00:18:33Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"XgeUwrpSbPnTGczirork4nMuMENeR/OljEc20Z6AfaA2C19h2sQehkdI3mncbK9+ppOLu4zDfsWuLMubKMNpDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-03T07:53:40.948141Z"},"content_sha256":"1bca299593bb1c9aa815c966814ccfc42bff0609a07e4da77e7b1b98674c7919","schema_version":"1.0","event_id":"sha256:1bca299593bb1c9aa815c966814ccfc42bff0609a07e4da77e7b1b98674c7919"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/CFXFAYBHS62KCH6XSFYC4TBYXA/bundle.json","state_url":"https://pith.science/pith/CFXFAYBHS62KCH6XSFYC4TBYXA/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/CFXFAYBHS62KCH6XSFYC4TBYXA/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-07-03T07:53:40Z","links":{"resolver":"https://pith.science/pith/CFXFAYBHS62KCH6XSFYC4TBYXA","bundle":"https://pith.science/pith/CFXFAYBHS62KCH6XSFYC4TBYXA/bundle.json","state":"https://pith.science/pith/CFXFAYBHS62KCH6XSFYC4TBYXA/state.json","well_known_bundle":"https://pith.science/.well-known/pith/CFXFAYBHS62KCH6XSFYC4TBYXA/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2026:CFXFAYBHS62KCH6XSFYC4TBYXA","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"eb33d7cfca2df02ded7ea91e40916f96194b17d3ffcb92f6dd695532f28cb4bd","cross_cats_sorted":["cs.AI"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.RO","submitted_at":"2026-06-30T12:40:23Z","title_canon_sha256":"9072fcb2939fcf02788fe2b5280407390f06a61215e88c47b3c5ba9ce4a8b8a0"},"schema_version":"1.0","source":{"id":"2607.00065","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2607.00065","created_at":"2026-07-02T00:18:33Z"},{"alias_kind":"arxiv_version","alias_value":"2607.00065v1","created_at":"2026-07-02T00:18:33Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2607.00065","created_at":"2026-07-02T00:18:33Z"},{"alias_kind":"pith_short_12","alias_value":"CFXFAYBHS62K","created_at":"2026-07-02T00:18:33Z"},{"alias_kind":"pith_short_16","alias_value":"CFXFAYBHS62KCH6X","created_at":"2026-07-02T00:18:33Z"},{"alias_kind":"pith_short_8","alias_value":"CFXFAYBH","created_at":"2026-07-02T00:18:33Z"}],"graph_snapshots":[{"event_id":"sha256:1bca299593bb1c9aa815c966814ccfc42bff0609a07e4da77e7b1b98674c7919","target":"graph","created_at":"2026-07-02T00:18:33Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2607.00065/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Any-angle path planning extends traditional graph-based path planning by allowing movement between any pair of vertices, rather than being restricted by predefined edges. It can find straighter and shorter paths in continuous space with graphs, making it particularly suitable for navigation in open areas such as airspaces, warehouses, and oceans. Many any-angle path-planning algorithms have been proposed, but only a few can guarantee optimal solutions, especially in the presence of dynamic obstacles. To address this challenge, this article focuses on optimal any-angle path planning on grids an","authors_text":"Clark Borst, Yiyuan Zou","cross_cats":["cs.AI"],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.RO","submitted_at":"2026-06-30T12:40:23Z","title":"Optimal any-angle path planning in static and dynamic environments"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2607.00065","kind":"arxiv","version":1},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:b8c384b5126870e52c0664ec483c991fe79938353941088c9773ab146029e515","target":"record","created_at":"2026-07-02T00:18:33Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"eb33d7cfca2df02ded7ea91e40916f96194b17d3ffcb92f6dd695532f28cb4bd","cross_cats_sorted":["cs.AI"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.RO","submitted_at":"2026-06-30T12:40:23Z","title_canon_sha256":"9072fcb2939fcf02788fe2b5280407390f06a61215e88c47b3c5ba9ce4a8b8a0"},"schema_version":"1.0","source":{"id":"2607.00065","kind":"arxiv","version":1}},"canonical_sha256":"116e50602797b4a11fd791702e4c38b8162bc41401f29f3d293fe5288e77cd34","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"116e50602797b4a11fd791702e4c38b8162bc41401f29f3d293fe5288e77cd34","first_computed_at":"2026-07-02T00:18:33.021518Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-02T00:18:33.021518Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"j7bN6ZK3t8eI83EBZStRQB+SCeDrl3Bp6zJShZ02FRluM2PpfOg9km50dHDJXic/1JSbuUgwwz5TYvVND1MlBg==","signature_status":"signed_v1","signed_at":"2026-07-02T00:18:33.021997Z","signed_message":"canonical_sha256_bytes"},"source_id":"2607.00065","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:b8c384b5126870e52c0664ec483c991fe79938353941088c9773ab146029e515","sha256:1bca299593bb1c9aa815c966814ccfc42bff0609a07e4da77e7b1b98674c7919"],"state_sha256":"37f51cfb543a7f5d0cfe8fdf5b680829601fe74413fb4bcb37be11638effe3db"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"D78KymPSDQ2Vem9Kvj3605OuR3jCpKQY8I3WSLAIlYm1gRXaEvqk91LgsDp5GAhA40faOvOhtTbl0SyY1eJXAg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-07-03T07:53:40.950142Z","bundle_sha256":"c9d68c9bcd04980535d1b9a745f7446e586ccb6c26ca558bfc8b43d7b2f71d39"}}