{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2023:IUVABU5N36HNZDYAFNHT4NYUJP","short_pith_number":"pith:IUVABU5N","canonical_record":{"source":{"id":"2302.14289","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.RO","submitted_at":"2023-02-28T03:49:35Z","cross_cats_sorted":["cs.MA"],"title_canon_sha256":"bec367a7f29fc6f4fcc619fbaf0a60d017234fb08165476b6b4ca80d96a8e9f4","abstract_canon_sha256":"fbcc69d251c5426e83c367b3906ab09dffa3e6b0b042151a633413cf807dcc6a"},"schema_version":"1.0"},"canonical_sha256":"452a00d3addf8edc8f002b4f3e37144bddae561e32d45e3c66663350b06c8cee","source":{"kind":"arxiv","id":"2302.14289","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2302.14289","created_at":"2026-07-05T05:46:42Z"},{"alias_kind":"arxiv_version","alias_value":"2302.14289v1","created_at":"2026-07-05T05:46:42Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2302.14289","created_at":"2026-07-05T05:46:42Z"},{"alias_kind":"pith_short_12","alias_value":"IUVABU5N36HN","created_at":"2026-07-05T05:46:42Z"},{"alias_kind":"pith_short_16","alias_value":"IUVABU5N36HNZDYA","created_at":"2026-07-05T05:46:42Z"},{"alias_kind":"pith_short_8","alias_value":"IUVABU5N","created_at":"2026-07-05T05:46:42Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2023:IUVABU5N36HNZDYAFNHT4NYUJP","target":"record","payload":{"canonical_record":{"source":{"id":"2302.14289","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.RO","submitted_at":"2023-02-28T03:49:35Z","cross_cats_sorted":["cs.MA"],"title_canon_sha256":"bec367a7f29fc6f4fcc619fbaf0a60d017234fb08165476b6b4ca80d96a8e9f4","abstract_canon_sha256":"fbcc69d251c5426e83c367b3906ab09dffa3e6b0b042151a633413cf807dcc6a"},"schema_version":"1.0"},"canonical_sha256":"452a00d3addf8edc8f002b4f3e37144bddae561e32d45e3c66663350b06c8cee","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T05:46:42.990124Z","signature_b64":"Z9L3pPF4JeIU/MJ89AfjiI7RPVei7qdFj+/lCwLGfXCxmVDkmR66WlUPop9OGqgkn3ZUVoS9i8eAdZPcaCENDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"452a00d3addf8edc8f002b4f3e37144bddae561e32d45e3c66663350b06c8cee","last_reissued_at":"2026-07-05T05:46:42.989708Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T05:46:42.989708Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2302.14289","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-05T05:46:42Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"OCzCComXfWMn/nZnVyKZ4FGeEZz9DW04VAPtIoToqerMIcPXRf1uFsWQjIgGd8dI+tIDIj3FpgUcLYvOj58TBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-04T02:24:16.045688Z"},"content_sha256":"0df6206fa98b7af8a5f789047abb6f62e0089e45ddae7fa14ff04aba2f8418cf","schema_version":"1.0","event_id":"sha256:0df6206fa98b7af8a5f789047abb6f62e0089e45ddae7fa14ff04aba2f8418cf"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2023:IUVABU5N36HNZDYAFNHT4NYUJP","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"DrMaMP: Distributed Real-time Multi-agent Mission Planning in Cluttered Environment","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.MA"],"primary_cat":"cs.RO","authors_text":"Shaoshuai Mou, Tianyu Zhou, Zehui Lu","submitted_at":"2023-02-28T03:49:35Z","abstract_excerpt":"Solving a collision-aware multi-agent mission planning (task allocation and path finding) problem is challenging due to the requirement of real-time computational performance, scalability, and capability of handling static/dynamic obstacles and tasks in a cluttered environment. This paper proposes a distributed real-time (on the order of millisecond) algorithm DrMaMP, which partitions the entire unassigned task set into subsets via approximation and decomposes the original problem into several single-agent mission planning problems. This paper presents experiments with dynamic obstacles and ta"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2302.14289","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/2302.14289/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-05T05:46:42Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"NunuLapFlZmgbafqwVpzYA8yksMr76/vLzUoqCKUnKeQNhrSG7bLODaRAaf/syOMq1H963CSD4optRY+cG9JCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-04T02:24:16.046594Z"},"content_sha256":"0a20e8b78106a655bb8331552399a99961e9ac2e844b71a3e75e1b9fea2feb4c","schema_version":"1.0","event_id":"sha256:0a20e8b78106a655bb8331552399a99961e9ac2e844b71a3e75e1b9fea2feb4c"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/IUVABU5N36HNZDYAFNHT4NYUJP/bundle.json","state_url":"https://pith.science/pith/IUVABU5N36HNZDYAFNHT4NYUJP/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/IUVABU5N36HNZDYAFNHT4NYUJP/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-04T02:24:16Z","links":{"resolver":"https://pith.science/pith/IUVABU5N36HNZDYAFNHT4NYUJP","bundle":"https://pith.science/pith/IUVABU5N36HNZDYAFNHT4NYUJP/bundle.json","state":"https://pith.science/pith/IUVABU5N36HNZDYAFNHT4NYUJP/state.json","well_known_bundle":"https://pith.science/.well-known/pith/IUVABU5N36HNZDYAFNHT4NYUJP/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2023:IUVABU5N36HNZDYAFNHT4NYUJP","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":"fbcc69d251c5426e83c367b3906ab09dffa3e6b0b042151a633413cf807dcc6a","cross_cats_sorted":["cs.MA"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.RO","submitted_at":"2023-02-28T03:49:35Z","title_canon_sha256":"bec367a7f29fc6f4fcc619fbaf0a60d017234fb08165476b6b4ca80d96a8e9f4"},"schema_version":"1.0","source":{"id":"2302.14289","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2302.14289","created_at":"2026-07-05T05:46:42Z"},{"alias_kind":"arxiv_version","alias_value":"2302.14289v1","created_at":"2026-07-05T05:46:42Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2302.14289","created_at":"2026-07-05T05:46:42Z"},{"alias_kind":"pith_short_12","alias_value":"IUVABU5N36HN","created_at":"2026-07-05T05:46:42Z"},{"alias_kind":"pith_short_16","alias_value":"IUVABU5N36HNZDYA","created_at":"2026-07-05T05:46:42Z"},{"alias_kind":"pith_short_8","alias_value":"IUVABU5N","created_at":"2026-07-05T05:46:42Z"}],"graph_snapshots":[{"event_id":"sha256:0a20e8b78106a655bb8331552399a99961e9ac2e844b71a3e75e1b9fea2feb4c","target":"graph","created_at":"2026-07-05T05:46:42Z","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/2302.14289/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Solving a collision-aware multi-agent mission planning (task allocation and path finding) problem is challenging due to the requirement of real-time computational performance, scalability, and capability of handling static/dynamic obstacles and tasks in a cluttered environment. This paper proposes a distributed real-time (on the order of millisecond) algorithm DrMaMP, which partitions the entire unassigned task set into subsets via approximation and decomposes the original problem into several single-agent mission planning problems. This paper presents experiments with dynamic obstacles and ta","authors_text":"Shaoshuai Mou, Tianyu Zhou, Zehui Lu","cross_cats":["cs.MA"],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.RO","submitted_at":"2023-02-28T03:49:35Z","title":"DrMaMP: Distributed Real-time Multi-agent Mission Planning in Cluttered Environment"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2302.14289","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:0df6206fa98b7af8a5f789047abb6f62e0089e45ddae7fa14ff04aba2f8418cf","target":"record","created_at":"2026-07-05T05:46:42Z","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":"fbcc69d251c5426e83c367b3906ab09dffa3e6b0b042151a633413cf807dcc6a","cross_cats_sorted":["cs.MA"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.RO","submitted_at":"2023-02-28T03:49:35Z","title_canon_sha256":"bec367a7f29fc6f4fcc619fbaf0a60d017234fb08165476b6b4ca80d96a8e9f4"},"schema_version":"1.0","source":{"id":"2302.14289","kind":"arxiv","version":1}},"canonical_sha256":"452a00d3addf8edc8f002b4f3e37144bddae561e32d45e3c66663350b06c8cee","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"452a00d3addf8edc8f002b4f3e37144bddae561e32d45e3c66663350b06c8cee","first_computed_at":"2026-07-05T05:46:42.989708Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T05:46:42.989708Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"Z9L3pPF4JeIU/MJ89AfjiI7RPVei7qdFj+/lCwLGfXCxmVDkmR66WlUPop9OGqgkn3ZUVoS9i8eAdZPcaCENDw==","signature_status":"signed_v1","signed_at":"2026-07-05T05:46:42.990124Z","signed_message":"canonical_sha256_bytes"},"source_id":"2302.14289","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:0df6206fa98b7af8a5f789047abb6f62e0089e45ddae7fa14ff04aba2f8418cf","sha256:0a20e8b78106a655bb8331552399a99961e9ac2e844b71a3e75e1b9fea2feb4c"],"state_sha256":"d3c66a423c5ab99529a69ede282c0057b9af617fc253d0c3631f6fb05c90f2cd"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"BP+/7ibRaGGi2xVeSgTn0A6huJHSQN10rPxr0/S9nALUhH7ZZEL9/CiIr+q4Wxm7fWgjpsc5G7u8rJOCn66pAA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-04T02:24:16.053208Z","bundle_sha256":"3446dc9b6fa2da0493fbf14cdf7208872a098c9f97e13b1a7cb093a1dd5a556d"}}