{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2023:YUTR6AJHA5A4A2E2ZYI6XSO7ZU","short_pith_number":"pith:YUTR6AJH","canonical_record":{"source":{"id":"2310.14507","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.MA","submitted_at":"2023-10-23T02:35:28Z","cross_cats_sorted":["cs.DS"],"title_canon_sha256":"968faab2544c947bf22e306178b67cabd7ab409e617f5517ff146957fa35f1d6","abstract_canon_sha256":"0bdab1337bbd917b4973506f1c7a697ba15d9a37f4ff2a3fecebb38774931794"},"schema_version":"1.0"},"canonical_sha256":"c5271f01270741c0689ace11ebc9dfcd3d8ee890d981b6e5efb33d3a2a521643","source":{"kind":"arxiv","id":"2310.14507","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2310.14507","created_at":"2026-07-05T09:06:24Z"},{"alias_kind":"arxiv_version","alias_value":"2310.14507v2","created_at":"2026-07-05T09:06:24Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2310.14507","created_at":"2026-07-05T09:06:24Z"},{"alias_kind":"pith_short_12","alias_value":"YUTR6AJHA5A4","created_at":"2026-07-05T09:06:24Z"},{"alias_kind":"pith_short_16","alias_value":"YUTR6AJHA5A4A2E2","created_at":"2026-07-05T09:06:24Z"},{"alias_kind":"pith_short_8","alias_value":"YUTR6AJH","created_at":"2026-07-05T09:06:24Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2023:YUTR6AJHA5A4A2E2ZYI6XSO7ZU","target":"record","payload":{"canonical_record":{"source":{"id":"2310.14507","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.MA","submitted_at":"2023-10-23T02:35:28Z","cross_cats_sorted":["cs.DS"],"title_canon_sha256":"968faab2544c947bf22e306178b67cabd7ab409e617f5517ff146957fa35f1d6","abstract_canon_sha256":"0bdab1337bbd917b4973506f1c7a697ba15d9a37f4ff2a3fecebb38774931794"},"schema_version":"1.0"},"canonical_sha256":"c5271f01270741c0689ace11ebc9dfcd3d8ee890d981b6e5efb33d3a2a521643","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T09:06:24.517085Z","signature_b64":"yy1Sy0MOk8HeSp7WhZ/i4miAqLWaG9SKCQ1/7eamBNbXVwVvg7lZ6M3izGmWoKN5t/gH2Z2Gk4H4w9zZ1IQeBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"c5271f01270741c0689ace11ebc9dfcd3d8ee890d981b6e5efb33d3a2a521643","last_reissued_at":"2026-07-05T09:06:24.516675Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T09:06:24.516675Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2310.14507","source_version":2,"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-05T09:06:24Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"cvDUgJk/mP6MTJRaztya4pbYvdYFbOvl8mSf0wEIShX9dTYZOmW78p2CPJlIeaihIixdfPKLr4v/o/5NqaFAAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-19T13:21:28.536521Z"},"content_sha256":"368076791ba534db48c93c36a462e2183b76598f07168cd0493a857854b445a8","schema_version":"1.0","event_id":"sha256:368076791ba534db48c93c36a462e2183b76598f07168cd0493a857854b445a8"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2023:YUTR6AJHA5A4A2E2ZYI6XSO7ZU","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Fast Marching based Rendezvous Path Planning for a Team of Heterogeneous Vehicle","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.DS"],"primary_cat":"cs.MA","authors_text":"Aditya Penumarti, Hyung-Jun Park, Jaejeong Shin, Jaekwang Kim","submitted_at":"2023-10-23T02:35:28Z","abstract_excerpt":"This paper presents a formulation for deterministically calculating optimized paths for a multiagent system consisting of heterogeneous vehicles. The key idea is the calculation of the shortest time for each agent to reach every grid point from its known initial position. Such arrival time map is efficiently computed using the Fast Marching Method (FMM), a computational algorithm originally designed for solving boundary value problems of the Eikonal equation. By leveraging the FMM, we demonstrate that the minimal time rendezvous point and paths for all member vehicles can be uniquely determine"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2310.14507","kind":"arxiv","version":2},"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/2310.14507/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-05T09:06:24Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"bVeSAfS8tqKPnsP+i7JMcDEOhRtzC7n3jdJUXNXnf/QRXwawqCQEyIw7YvrH4Cb4jpAehQxFBDOxgXdwBqfXBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-19T13:21:28.537193Z"},"content_sha256":"d8ce0a28fb76cad45912871774ec3ffa853a9187decb0a08aafadb0f95c190cd","schema_version":"1.0","event_id":"sha256:d8ce0a28fb76cad45912871774ec3ffa853a9187decb0a08aafadb0f95c190cd"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/YUTR6AJHA5A4A2E2ZYI6XSO7ZU/bundle.json","state_url":"https://pith.science/pith/YUTR6AJHA5A4A2E2ZYI6XSO7ZU/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/YUTR6AJHA5A4A2E2ZYI6XSO7ZU/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-08-19T13:21:28Z","links":{"resolver":"https://pith.science/pith/YUTR6AJHA5A4A2E2ZYI6XSO7ZU","bundle":"https://pith.science/pith/YUTR6AJHA5A4A2E2ZYI6XSO7ZU/bundle.json","state":"https://pith.science/pith/YUTR6AJHA5A4A2E2ZYI6XSO7ZU/state.json","well_known_bundle":"https://pith.science/.well-known/pith/YUTR6AJHA5A4A2E2ZYI6XSO7ZU/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2023:YUTR6AJHA5A4A2E2ZYI6XSO7ZU","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":"0bdab1337bbd917b4973506f1c7a697ba15d9a37f4ff2a3fecebb38774931794","cross_cats_sorted":["cs.DS"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.MA","submitted_at":"2023-10-23T02:35:28Z","title_canon_sha256":"968faab2544c947bf22e306178b67cabd7ab409e617f5517ff146957fa35f1d6"},"schema_version":"1.0","source":{"id":"2310.14507","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2310.14507","created_at":"2026-07-05T09:06:24Z"},{"alias_kind":"arxiv_version","alias_value":"2310.14507v2","created_at":"2026-07-05T09:06:24Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2310.14507","created_at":"2026-07-05T09:06:24Z"},{"alias_kind":"pith_short_12","alias_value":"YUTR6AJHA5A4","created_at":"2026-07-05T09:06:24Z"},{"alias_kind":"pith_short_16","alias_value":"YUTR6AJHA5A4A2E2","created_at":"2026-07-05T09:06:24Z"},{"alias_kind":"pith_short_8","alias_value":"YUTR6AJH","created_at":"2026-07-05T09:06:24Z"}],"graph_snapshots":[{"event_id":"sha256:d8ce0a28fb76cad45912871774ec3ffa853a9187decb0a08aafadb0f95c190cd","target":"graph","created_at":"2026-07-05T09:06:24Z","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/2310.14507/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"This paper presents a formulation for deterministically calculating optimized paths for a multiagent system consisting of heterogeneous vehicles. The key idea is the calculation of the shortest time for each agent to reach every grid point from its known initial position. Such arrival time map is efficiently computed using the Fast Marching Method (FMM), a computational algorithm originally designed for solving boundary value problems of the Eikonal equation. By leveraging the FMM, we demonstrate that the minimal time rendezvous point and paths for all member vehicles can be uniquely determine","authors_text":"Aditya Penumarti, Hyung-Jun Park, Jaejeong Shin, Jaekwang Kim","cross_cats":["cs.DS"],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.MA","submitted_at":"2023-10-23T02:35:28Z","title":"Fast Marching based Rendezvous Path Planning for a Team of Heterogeneous Vehicle"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2310.14507","kind":"arxiv","version":2},"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:368076791ba534db48c93c36a462e2183b76598f07168cd0493a857854b445a8","target":"record","created_at":"2026-07-05T09:06:24Z","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":"0bdab1337bbd917b4973506f1c7a697ba15d9a37f4ff2a3fecebb38774931794","cross_cats_sorted":["cs.DS"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.MA","submitted_at":"2023-10-23T02:35:28Z","title_canon_sha256":"968faab2544c947bf22e306178b67cabd7ab409e617f5517ff146957fa35f1d6"},"schema_version":"1.0","source":{"id":"2310.14507","kind":"arxiv","version":2}},"canonical_sha256":"c5271f01270741c0689ace11ebc9dfcd3d8ee890d981b6e5efb33d3a2a521643","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"c5271f01270741c0689ace11ebc9dfcd3d8ee890d981b6e5efb33d3a2a521643","first_computed_at":"2026-07-05T09:06:24.516675Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T09:06:24.516675Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"yy1Sy0MOk8HeSp7WhZ/i4miAqLWaG9SKCQ1/7eamBNbXVwVvg7lZ6M3izGmWoKN5t/gH2Z2Gk4H4w9zZ1IQeBQ==","signature_status":"signed_v1","signed_at":"2026-07-05T09:06:24.517085Z","signed_message":"canonical_sha256_bytes"},"source_id":"2310.14507","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:368076791ba534db48c93c36a462e2183b76598f07168cd0493a857854b445a8","sha256:d8ce0a28fb76cad45912871774ec3ffa853a9187decb0a08aafadb0f95c190cd"],"state_sha256":"3ab2526dcfc30f0370c00bc9e17050f10cd5acc519de38cbd62dc6ea62f5d5c1"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"qnYzyvJA/Byd9LrKkZK4TCXLJNNwENbFnFMQgvDcTasqYFoHLtBiAHx+jaHOFZi1kiOgo1T1QvAs9JQ0Sdl/DA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-19T13:21:28.545633Z","bundle_sha256":"aa839d67ae85ada7ffb0055299dacfb5e49817d53fb2666c0b542bacb7d4335e"}}