{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:7OIPZZX57QQUCSRAFAU3K62BVM","short_pith_number":"pith:7OIPZZX5","canonical_record":{"source":{"id":"1706.09347","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2017-06-28T16:18:12Z","cross_cats_sorted":["cs.RO"],"title_canon_sha256":"86a00eb9eb61991a8690b9d9f9e27ff528b5140510f371e358fa8aa4b6956334","abstract_canon_sha256":"c69871cdeda3729b8905db95a5a95fb406d11c83fe2ce403f5118080044758b7"},"schema_version":"1.0"},"canonical_sha256":"fb90fce6fdfc21414a202829b57b41ab2860cb68a66e84d1399a9fabeb535e4e","source":{"kind":"arxiv","id":"1706.09347","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1706.09347","created_at":"2026-05-18T00:00:31Z"},{"alias_kind":"arxiv_version","alias_value":"1706.09347v2","created_at":"2026-05-18T00:00:31Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1706.09347","created_at":"2026-05-18T00:00:31Z"},{"alias_kind":"pith_short_12","alias_value":"7OIPZZX57QQU","created_at":"2026-05-18T12:31:05Z"},{"alias_kind":"pith_short_16","alias_value":"7OIPZZX57QQUCSRA","created_at":"2026-05-18T12:31:05Z"},{"alias_kind":"pith_short_8","alias_value":"7OIPZZX5","created_at":"2026-05-18T12:31:05Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:7OIPZZX57QQUCSRAFAU3K62BVM","target":"record","payload":{"canonical_record":{"source":{"id":"1706.09347","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2017-06-28T16:18:12Z","cross_cats_sorted":["cs.RO"],"title_canon_sha256":"86a00eb9eb61991a8690b9d9f9e27ff528b5140510f371e358fa8aa4b6956334","abstract_canon_sha256":"c69871cdeda3729b8905db95a5a95fb406d11c83fe2ce403f5118080044758b7"},"schema_version":"1.0"},"canonical_sha256":"fb90fce6fdfc21414a202829b57b41ab2860cb68a66e84d1399a9fabeb535e4e","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:00:31.055353Z","signature_b64":"aSa1dR85+z6/pZLgxjMb6dK/hD4b+Ck/xJXcdbPAV4gNbRKCAL+c9nLAhsW2BGIL6Fj+qcRW2DBj27pB1ce4Dg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"fb90fce6fdfc21414a202829b57b41ab2860cb68a66e84d1399a9fabeb535e4e","last_reissued_at":"2026-05-18T00:00:31.054814Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:00:31.054814Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1706.09347","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-18T00:00:31Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"VBOLoz/cX1YhasH0bwyC/MQpX6xonxi5tcw7WToir9bZW2lnRK5z92g03JdxRPk8r87N6R6LzAI1zc7vHnI4Cw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T19:10:13.930936Z"},"content_sha256":"207978acf232a6315387fdd77e993f8a2eb6e78ec3be204a02c2430a5384954a","schema_version":"1.0","event_id":"sha256:207978acf232a6315387fdd77e993f8a2eb6e78ec3be204a02c2430a5384954a"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:7OIPZZX57QQUCSRAFAU3K62BVM","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Path planning for Robotic Mobile Fulfillment Systems","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.RO"],"primary_cat":"cs.AI","authors_text":"Daniel Erdmann, Lin Xie, Marius Merschformann","submitted_at":"2017-06-28T16:18:12Z","abstract_excerpt":"This paper presents a collection of path planning algorithms for real-time movement of multiple robots across a Robotic Mobile Fulfillment System (RMFS). Robots are assigned to move storage units to pickers at working stations instead of requiring pickers to go to the storage area. Path planning algorithms aim to find paths for the robots to fulfill the requests without collisions or deadlocks. The state-of-the-art path planning algorithms, including WHCA*, FAR, BCP, OD&ID and CBS, were adapted to suit path planning in RMFS and integrated within a simulation tool to guide the robots from their"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1706.09347","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-18T00:00:31Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ljOBf3xduNcmUSBiE5PvmiwSkqePWan+VGKW54GlSmL8dv3xEV1JWQSVWS1FjzxcVcwCSTAAeiOPsRONy/xCBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T19:10:13.931532Z"},"content_sha256":"452f93e53b64aefe0b4e93b0581ca692ecaa4f18868fe245c8d6d4852c69371e","schema_version":"1.0","event_id":"sha256:452f93e53b64aefe0b4e93b0581ca692ecaa4f18868fe245c8d6d4852c69371e"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/7OIPZZX57QQUCSRAFAU3K62BVM/bundle.json","state_url":"https://pith.science/pith/7OIPZZX57QQUCSRAFAU3K62BVM/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/7OIPZZX57QQUCSRAFAU3K62BVM/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-05-30T19:10:13Z","links":{"resolver":"https://pith.science/pith/7OIPZZX57QQUCSRAFAU3K62BVM","bundle":"https://pith.science/pith/7OIPZZX57QQUCSRAFAU3K62BVM/bundle.json","state":"https://pith.science/pith/7OIPZZX57QQUCSRAFAU3K62BVM/state.json","well_known_bundle":"https://pith.science/.well-known/pith/7OIPZZX57QQUCSRAFAU3K62BVM/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:7OIPZZX57QQUCSRAFAU3K62BVM","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":"c69871cdeda3729b8905db95a5a95fb406d11c83fe2ce403f5118080044758b7","cross_cats_sorted":["cs.RO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2017-06-28T16:18:12Z","title_canon_sha256":"86a00eb9eb61991a8690b9d9f9e27ff528b5140510f371e358fa8aa4b6956334"},"schema_version":"1.0","source":{"id":"1706.09347","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1706.09347","created_at":"2026-05-18T00:00:31Z"},{"alias_kind":"arxiv_version","alias_value":"1706.09347v2","created_at":"2026-05-18T00:00:31Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1706.09347","created_at":"2026-05-18T00:00:31Z"},{"alias_kind":"pith_short_12","alias_value":"7OIPZZX57QQU","created_at":"2026-05-18T12:31:05Z"},{"alias_kind":"pith_short_16","alias_value":"7OIPZZX57QQUCSRA","created_at":"2026-05-18T12:31:05Z"},{"alias_kind":"pith_short_8","alias_value":"7OIPZZX5","created_at":"2026-05-18T12:31:05Z"}],"graph_snapshots":[{"event_id":"sha256:452f93e53b64aefe0b4e93b0581ca692ecaa4f18868fe245c8d6d4852c69371e","target":"graph","created_at":"2026-05-18T00:00:31Z","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":"This paper presents a collection of path planning algorithms for real-time movement of multiple robots across a Robotic Mobile Fulfillment System (RMFS). Robots are assigned to move storage units to pickers at working stations instead of requiring pickers to go to the storage area. Path planning algorithms aim to find paths for the robots to fulfill the requests without collisions or deadlocks. The state-of-the-art path planning algorithms, including WHCA*, FAR, BCP, OD&ID and CBS, were adapted to suit path planning in RMFS and integrated within a simulation tool to guide the robots from their","authors_text":"Daniel Erdmann, Lin Xie, Marius Merschformann","cross_cats":["cs.RO"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2017-06-28T16:18:12Z","title":"Path planning for Robotic Mobile Fulfillment Systems"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1706.09347","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:207978acf232a6315387fdd77e993f8a2eb6e78ec3be204a02c2430a5384954a","target":"record","created_at":"2026-05-18T00:00:31Z","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":"c69871cdeda3729b8905db95a5a95fb406d11c83fe2ce403f5118080044758b7","cross_cats_sorted":["cs.RO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2017-06-28T16:18:12Z","title_canon_sha256":"86a00eb9eb61991a8690b9d9f9e27ff528b5140510f371e358fa8aa4b6956334"},"schema_version":"1.0","source":{"id":"1706.09347","kind":"arxiv","version":2}},"canonical_sha256":"fb90fce6fdfc21414a202829b57b41ab2860cb68a66e84d1399a9fabeb535e4e","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"fb90fce6fdfc21414a202829b57b41ab2860cb68a66e84d1399a9fabeb535e4e","first_computed_at":"2026-05-18T00:00:31.054814Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:00:31.054814Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"aSa1dR85+z6/pZLgxjMb6dK/hD4b+Ck/xJXcdbPAV4gNbRKCAL+c9nLAhsW2BGIL6Fj+qcRW2DBj27pB1ce4Dg==","signature_status":"signed_v1","signed_at":"2026-05-18T00:00:31.055353Z","signed_message":"canonical_sha256_bytes"},"source_id":"1706.09347","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:207978acf232a6315387fdd77e993f8a2eb6e78ec3be204a02c2430a5384954a","sha256:452f93e53b64aefe0b4e93b0581ca692ecaa4f18868fe245c8d6d4852c69371e"],"state_sha256":"f2625adc89754ae57d4f61d51539a02ebf038b8fadae92ba4805e05d22de3f3e"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"HX9es/6JNktiaT4r1nkJbpYFVgS3TGz/5wHPKV/LOkFcAgLtGlJgPMAPQzNGwekWN3kY/jx89B8NC8GaQOm6AQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-30T19:10:13.935276Z","bundle_sha256":"b70975953a912b864bf374084969bca196ea3029a8977abcd40a17105fa4d4b0"}}