{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:G7X2N3Q2KREWAFKUG57CL6JDS7","short_pith_number":"pith:G7X2N3Q2","canonical_record":{"source":{"id":"1702.05515","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2017-02-17T20:39:38Z","cross_cats_sorted":["cs.MA","cs.RO"],"title_canon_sha256":"6e0d646e1d79201021493b82f3751e07185e9e395e425d580bac97a99af97865","abstract_canon_sha256":"131f93b27c9f6000b489888b1a20bd74d53411207dc80392b4ba6e138fc4e1f3"},"schema_version":"1.0"},"canonical_sha256":"37efa6ee1a5449601554377e25f92397e29a3e921415cafb980962df9c421118","source":{"kind":"arxiv","id":"1702.05515","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1702.05515","created_at":"2026-05-18T00:50:30Z"},{"alias_kind":"arxiv_version","alias_value":"1702.05515v1","created_at":"2026-05-18T00:50:30Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1702.05515","created_at":"2026-05-18T00:50:30Z"},{"alias_kind":"pith_short_12","alias_value":"G7X2N3Q2KREW","created_at":"2026-05-18T12:31:15Z"},{"alias_kind":"pith_short_16","alias_value":"G7X2N3Q2KREWAFKU","created_at":"2026-05-18T12:31:15Z"},{"alias_kind":"pith_short_8","alias_value":"G7X2N3Q2","created_at":"2026-05-18T12:31:15Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:G7X2N3Q2KREWAFKUG57CL6JDS7","target":"record","payload":{"canonical_record":{"source":{"id":"1702.05515","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2017-02-17T20:39:38Z","cross_cats_sorted":["cs.MA","cs.RO"],"title_canon_sha256":"6e0d646e1d79201021493b82f3751e07185e9e395e425d580bac97a99af97865","abstract_canon_sha256":"131f93b27c9f6000b489888b1a20bd74d53411207dc80392b4ba6e138fc4e1f3"},"schema_version":"1.0"},"canonical_sha256":"37efa6ee1a5449601554377e25f92397e29a3e921415cafb980962df9c421118","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:50:30.613428Z","signature_b64":"fH/15PNU0MadsaXksLnoRZRqmQk7/uKidECWs8nA2pVIB7N7fV+zG4kyKL8Lt02WRaOT2XZfBZpDes1EVC3FDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"37efa6ee1a5449601554377e25f92397e29a3e921415cafb980962df9c421118","last_reissued_at":"2026-05-18T00:50:30.612686Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:50:30.612686Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1702.05515","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-05-18T00:50:30Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"rmpLxyPx/W1dEJbBF8Q2cOoq2HWGh7gzbzS2TBq83Yy4w2+EDEoDYmNZcRbAGkhhOwRaJDKBGpRuunxEKUxbCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T21:53:02.653661Z"},"content_sha256":"1268d3170939d8fc738687cc942ad7cd352922e3d431bf98b4551953864a6220","schema_version":"1.0","event_id":"sha256:1268d3170939d8fc738687cc942ad7cd352922e3d431bf98b4551953864a6220"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:G7X2N3Q2KREWAFKUG57CL6JDS7","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Overview: Generalizations of Multi-Agent Path Finding to Real-World Scenarios","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.MA","cs.RO"],"primary_cat":"cs.AI","authors_text":"Craig Tovey, Guni Sharon, Hang Ma, Hong Xu, Liron Cohen, Nora Ayanian, Sven Koenig, Tansel Uras, T. K. Satish Kumar, Wolfgang Hoenig","submitted_at":"2017-02-17T20:39:38Z","abstract_excerpt":"Multi-agent path finding (MAPF) is well-studied in artificial intelligence, robotics, theoretical computer science and operations research. We discuss issues that arise when generalizing MAPF methods to real-world scenarios and four research directions that address them. We emphasize the importance of addressing these issues as opposed to developing faster methods for the standard formulation of the MAPF problem."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1702.05515","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":""},"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:50:30Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"dhHJmEpy20X1h+Oga8XwPA/OKKE6vjepyGizIY2DnsCT6VI7MjstkSj20YnTZhxh9aJ2Z7tRZm3AE8KAHnAfAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T21:53:02.654074Z"},"content_sha256":"6321f3bef26cfd34ed1f106ce11f71dcf99e0123e7bd339f909f287dfe2af7a9","schema_version":"1.0","event_id":"sha256:6321f3bef26cfd34ed1f106ce11f71dcf99e0123e7bd339f909f287dfe2af7a9"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/G7X2N3Q2KREWAFKUG57CL6JDS7/bundle.json","state_url":"https://pith.science/pith/G7X2N3Q2KREWAFKUG57CL6JDS7/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/G7X2N3Q2KREWAFKUG57CL6JDS7/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-27T21:53:02Z","links":{"resolver":"https://pith.science/pith/G7X2N3Q2KREWAFKUG57CL6JDS7","bundle":"https://pith.science/pith/G7X2N3Q2KREWAFKUG57CL6JDS7/bundle.json","state":"https://pith.science/pith/G7X2N3Q2KREWAFKUG57CL6JDS7/state.json","well_known_bundle":"https://pith.science/.well-known/pith/G7X2N3Q2KREWAFKUG57CL6JDS7/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:G7X2N3Q2KREWAFKUG57CL6JDS7","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":"131f93b27c9f6000b489888b1a20bd74d53411207dc80392b4ba6e138fc4e1f3","cross_cats_sorted":["cs.MA","cs.RO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2017-02-17T20:39:38Z","title_canon_sha256":"6e0d646e1d79201021493b82f3751e07185e9e395e425d580bac97a99af97865"},"schema_version":"1.0","source":{"id":"1702.05515","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1702.05515","created_at":"2026-05-18T00:50:30Z"},{"alias_kind":"arxiv_version","alias_value":"1702.05515v1","created_at":"2026-05-18T00:50:30Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1702.05515","created_at":"2026-05-18T00:50:30Z"},{"alias_kind":"pith_short_12","alias_value":"G7X2N3Q2KREW","created_at":"2026-05-18T12:31:15Z"},{"alias_kind":"pith_short_16","alias_value":"G7X2N3Q2KREWAFKU","created_at":"2026-05-18T12:31:15Z"},{"alias_kind":"pith_short_8","alias_value":"G7X2N3Q2","created_at":"2026-05-18T12:31:15Z"}],"graph_snapshots":[{"event_id":"sha256:6321f3bef26cfd34ed1f106ce11f71dcf99e0123e7bd339f909f287dfe2af7a9","target":"graph","created_at":"2026-05-18T00:50:30Z","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":"Multi-agent path finding (MAPF) is well-studied in artificial intelligence, robotics, theoretical computer science and operations research. We discuss issues that arise when generalizing MAPF methods to real-world scenarios and four research directions that address them. We emphasize the importance of addressing these issues as opposed to developing faster methods for the standard formulation of the MAPF problem.","authors_text":"Craig Tovey, Guni Sharon, Hang Ma, Hong Xu, Liron Cohen, Nora Ayanian, Sven Koenig, Tansel Uras, T. K. Satish Kumar, Wolfgang Hoenig","cross_cats":["cs.MA","cs.RO"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2017-02-17T20:39:38Z","title":"Overview: Generalizations of Multi-Agent Path Finding to Real-World Scenarios"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1702.05515","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:1268d3170939d8fc738687cc942ad7cd352922e3d431bf98b4551953864a6220","target":"record","created_at":"2026-05-18T00:50:30Z","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":"131f93b27c9f6000b489888b1a20bd74d53411207dc80392b4ba6e138fc4e1f3","cross_cats_sorted":["cs.MA","cs.RO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2017-02-17T20:39:38Z","title_canon_sha256":"6e0d646e1d79201021493b82f3751e07185e9e395e425d580bac97a99af97865"},"schema_version":"1.0","source":{"id":"1702.05515","kind":"arxiv","version":1}},"canonical_sha256":"37efa6ee1a5449601554377e25f92397e29a3e921415cafb980962df9c421118","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"37efa6ee1a5449601554377e25f92397e29a3e921415cafb980962df9c421118","first_computed_at":"2026-05-18T00:50:30.612686Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:50:30.612686Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"fH/15PNU0MadsaXksLnoRZRqmQk7/uKidECWs8nA2pVIB7N7fV+zG4kyKL8Lt02WRaOT2XZfBZpDes1EVC3FDg==","signature_status":"signed_v1","signed_at":"2026-05-18T00:50:30.613428Z","signed_message":"canonical_sha256_bytes"},"source_id":"1702.05515","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:1268d3170939d8fc738687cc942ad7cd352922e3d431bf98b4551953864a6220","sha256:6321f3bef26cfd34ed1f106ce11f71dcf99e0123e7bd339f909f287dfe2af7a9"],"state_sha256":"cf4b0531e4ac4dfd934848f91c19eba6527668c73c4e26ca7694fcbadb7ae3dc"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"gqNIog0GuBnFWgwolupuNYYU6qf+MCffcaMf2A4U3N2Fa8hVOlkkRacvmOImjIsyVql0EFIBENp2XKtGwoavCQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-27T21:53:02.657003Z","bundle_sha256":"6dd3713bc8eeabd3368285123bb3b7346ba3b992827435cb2ccc2a0528e18787"}}