{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:MYT5AJKAVBEUHCUW25SMJIWZ3T","short_pith_number":"pith:MYT5AJKA","canonical_record":{"source":{"id":"1809.07262","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.MA","submitted_at":"2018-09-19T16:02:03Z","cross_cats_sorted":[],"title_canon_sha256":"c5810cb29ae940d64f098cd067210ac409abbf274bb0d4ce677a16f859636077","abstract_canon_sha256":"3720e24763e1c36fcad3368dc6a3c2a4fd95ccf1025f37669027cc3fb7f34f80"},"schema_version":"1.0"},"canonical_sha256":"6627d02540a849438a96d764c4a2d9dccd61b9ad217cde23154a8095ce063197","source":{"kind":"arxiv","id":"1809.07262","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1809.07262","created_at":"2026-05-17T23:49:03Z"},{"alias_kind":"arxiv_version","alias_value":"1809.07262v2","created_at":"2026-05-17T23:49:03Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1809.07262","created_at":"2026-05-17T23:49:03Z"},{"alias_kind":"pith_short_12","alias_value":"MYT5AJKAVBEU","created_at":"2026-05-18T12:32:40Z"},{"alias_kind":"pith_short_16","alias_value":"MYT5AJKAVBEUHCUW","created_at":"2026-05-18T12:32:40Z"},{"alias_kind":"pith_short_8","alias_value":"MYT5AJKA","created_at":"2026-05-18T12:32:40Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:MYT5AJKAVBEUHCUW25SMJIWZ3T","target":"record","payload":{"canonical_record":{"source":{"id":"1809.07262","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.MA","submitted_at":"2018-09-19T16:02:03Z","cross_cats_sorted":[],"title_canon_sha256":"c5810cb29ae940d64f098cd067210ac409abbf274bb0d4ce677a16f859636077","abstract_canon_sha256":"3720e24763e1c36fcad3368dc6a3c2a4fd95ccf1025f37669027cc3fb7f34f80"},"schema_version":"1.0"},"canonical_sha256":"6627d02540a849438a96d764c4a2d9dccd61b9ad217cde23154a8095ce063197","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:49:03.396252Z","signature_b64":"C8rVEiHBoXISQeBPLUOsX2YZqJwK9VYAlClHLGriZsVDfGOTnnoX5lqXE8MNZA0o+ALUf4Nc5mnDJrVtQbT8AA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"6627d02540a849438a96d764c4a2d9dccd61b9ad217cde23154a8095ce063197","last_reissued_at":"2026-05-17T23:49:03.395666Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:49:03.395666Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1809.07262","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-05-17T23:49:03Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Xjx018bCXcKm1EtKPwKTMcM07ezAKT3CCZzj+uuxg3aeKZ9viYHfl9o5Veqk8zrCJOJ+h6KeyCzl9AR1084dBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-05T06:11:36.256303Z"},"content_sha256":"c6fcb7c7b09dcd2e86e7c8f5c9795e2f21b787354bc5833bb4906eaf7811030c","schema_version":"1.0","event_id":"sha256:c6fcb7c7b09dcd2e86e7c8f5c9795e2f21b787354bc5833bb4906eaf7811030c"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:MYT5AJKAVBEUHCUW25SMJIWZ3T","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"A Novel Warehouse Multi-Robot Automation System with Semi-Complete and Computationally Efficient Path Planning and Adaptive Genetic Task Allocation Algorithms","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.MA","authors_text":"Cheuk Fung Raphael Wong, Kam Fai Elvis Tsang, Ling Shi, Yuqing Ni","submitted_at":"2018-09-19T16:02:03Z","abstract_excerpt":"We consider the problem of warehouse multi-robot automation system in discrete-time and discrete-space configuration with focus on the task allocation and conflict-free path planning. We present a system design where a centralized server handles the task allocation and each robot performs local path planning distributively. A genetic-based task allocation algorithm is firstly presented, with modification to enable heuristic learning. A semi-complete potential field based local path planning algorithm is then proposed, named the recursive excitation/relaxation artificial potential field (RERAPF"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1809.07262","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":""},"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-05-17T23:49:03Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"CmyJiZmdwafReX5yLfQAPORKGC1OKwV/DADxs/CzsoEeNIZQG8RzdOiX5bk0SPFeKNBpeqflPyyePdlHohkTBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-05T06:11:36.256910Z"},"content_sha256":"906f2b7d1b098bf9a9b440dcce0e12a2cd272c525935eea5f7d3ebd1891f5bef","schema_version":"1.0","event_id":"sha256:906f2b7d1b098bf9a9b440dcce0e12a2cd272c525935eea5f7d3ebd1891f5bef"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/MYT5AJKAVBEUHCUW25SMJIWZ3T/bundle.json","state_url":"https://pith.science/pith/MYT5AJKAVBEUHCUW25SMJIWZ3T/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/MYT5AJKAVBEUHCUW25SMJIWZ3T/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-06-05T06:11:36Z","links":{"resolver":"https://pith.science/pith/MYT5AJKAVBEUHCUW25SMJIWZ3T","bundle":"https://pith.science/pith/MYT5AJKAVBEUHCUW25SMJIWZ3T/bundle.json","state":"https://pith.science/pith/MYT5AJKAVBEUHCUW25SMJIWZ3T/state.json","well_known_bundle":"https://pith.science/.well-known/pith/MYT5AJKAVBEUHCUW25SMJIWZ3T/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:MYT5AJKAVBEUHCUW25SMJIWZ3T","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":"3720e24763e1c36fcad3368dc6a3c2a4fd95ccf1025f37669027cc3fb7f34f80","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.MA","submitted_at":"2018-09-19T16:02:03Z","title_canon_sha256":"c5810cb29ae940d64f098cd067210ac409abbf274bb0d4ce677a16f859636077"},"schema_version":"1.0","source":{"id":"1809.07262","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1809.07262","created_at":"2026-05-17T23:49:03Z"},{"alias_kind":"arxiv_version","alias_value":"1809.07262v2","created_at":"2026-05-17T23:49:03Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1809.07262","created_at":"2026-05-17T23:49:03Z"},{"alias_kind":"pith_short_12","alias_value":"MYT5AJKAVBEU","created_at":"2026-05-18T12:32:40Z"},{"alias_kind":"pith_short_16","alias_value":"MYT5AJKAVBEUHCUW","created_at":"2026-05-18T12:32:40Z"},{"alias_kind":"pith_short_8","alias_value":"MYT5AJKA","created_at":"2026-05-18T12:32:40Z"}],"graph_snapshots":[{"event_id":"sha256:906f2b7d1b098bf9a9b440dcce0e12a2cd272c525935eea5f7d3ebd1891f5bef","target":"graph","created_at":"2026-05-17T23:49:03Z","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"},"paper":{"abstract_excerpt":"We consider the problem of warehouse multi-robot automation system in discrete-time and discrete-space configuration with focus on the task allocation and conflict-free path planning. We present a system design where a centralized server handles the task allocation and each robot performs local path planning distributively. A genetic-based task allocation algorithm is firstly presented, with modification to enable heuristic learning. A semi-complete potential field based local path planning algorithm is then proposed, named the recursive excitation/relaxation artificial potential field (RERAPF","authors_text":"Cheuk Fung Raphael Wong, Kam Fai Elvis Tsang, Ling Shi, Yuqing Ni","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.MA","submitted_at":"2018-09-19T16:02:03Z","title":"A Novel Warehouse Multi-Robot Automation System with Semi-Complete and Computationally Efficient Path Planning and Adaptive Genetic Task Allocation Algorithms"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1809.07262","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:c6fcb7c7b09dcd2e86e7c8f5c9795e2f21b787354bc5833bb4906eaf7811030c","target":"record","created_at":"2026-05-17T23:49:03Z","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":"3720e24763e1c36fcad3368dc6a3c2a4fd95ccf1025f37669027cc3fb7f34f80","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.MA","submitted_at":"2018-09-19T16:02:03Z","title_canon_sha256":"c5810cb29ae940d64f098cd067210ac409abbf274bb0d4ce677a16f859636077"},"schema_version":"1.0","source":{"id":"1809.07262","kind":"arxiv","version":2}},"canonical_sha256":"6627d02540a849438a96d764c4a2d9dccd61b9ad217cde23154a8095ce063197","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"6627d02540a849438a96d764c4a2d9dccd61b9ad217cde23154a8095ce063197","first_computed_at":"2026-05-17T23:49:03.395666Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:49:03.395666Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"C8rVEiHBoXISQeBPLUOsX2YZqJwK9VYAlClHLGriZsVDfGOTnnoX5lqXE8MNZA0o+ALUf4Nc5mnDJrVtQbT8AA==","signature_status":"signed_v1","signed_at":"2026-05-17T23:49:03.396252Z","signed_message":"canonical_sha256_bytes"},"source_id":"1809.07262","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:c6fcb7c7b09dcd2e86e7c8f5c9795e2f21b787354bc5833bb4906eaf7811030c","sha256:906f2b7d1b098bf9a9b440dcce0e12a2cd272c525935eea5f7d3ebd1891f5bef"],"state_sha256":"ff2c68396ef8975cd4cef97fb4c56b1d365f04c28e5943e19f60481820777f52"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"sbtjn99osRbHflT4UujCwtC9CJUY/KjvcK7RLdm3wqqZ8AW6bvHmNdCfDRb/m+fv8QgCt1IoFjo9H0zsdsbAAA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-05T06:11:36.260174Z","bundle_sha256":"fa72881ec2314b21804f4caa74633ee8cc2fe54084e929ffff4ea39fa6096564"}}