{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2021:45V77WMPLNGPGKG2OFNCFM3XHH","short_pith_number":"pith:45V77WMP","canonical_record":{"source":{"id":"2110.14891","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","primary_cat":"cs.MA","submitted_at":"2021-10-28T05:08:30Z","cross_cats_sorted":["cs.RO"],"title_canon_sha256":"a412b2a9f013ad9f1b3aa5a921c4b27fc0b8c0c09b53cb36a0b7184271eaa3c6","abstract_canon_sha256":"8c79c8ff2e9851af30ea69f199001a54a4371ae06c47a71c2924980e949b2162"},"schema_version":"1.0"},"canonical_sha256":"e76bffd98f5b4cf328da715a22b37739c8bc5cd73e34d4f1e9ea1b4b0bcad48b","source":{"kind":"arxiv","id":"2110.14891","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2110.14891","created_at":"2026-07-05T03:26:48Z"},{"alias_kind":"arxiv_version","alias_value":"2110.14891v1","created_at":"2026-07-05T03:26:48Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2110.14891","created_at":"2026-07-05T03:26:48Z"},{"alias_kind":"pith_short_12","alias_value":"45V77WMPLNGP","created_at":"2026-07-05T03:26:48Z"},{"alias_kind":"pith_short_16","alias_value":"45V77WMPLNGPGKG2","created_at":"2026-07-05T03:26:48Z"},{"alias_kind":"pith_short_8","alias_value":"45V77WMP","created_at":"2026-07-05T03:26:48Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2021:45V77WMPLNGPGKG2OFNCFM3XHH","target":"record","payload":{"canonical_record":{"source":{"id":"2110.14891","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","primary_cat":"cs.MA","submitted_at":"2021-10-28T05:08:30Z","cross_cats_sorted":["cs.RO"],"title_canon_sha256":"a412b2a9f013ad9f1b3aa5a921c4b27fc0b8c0c09b53cb36a0b7184271eaa3c6","abstract_canon_sha256":"8c79c8ff2e9851af30ea69f199001a54a4371ae06c47a71c2924980e949b2162"},"schema_version":"1.0"},"canonical_sha256":"e76bffd98f5b4cf328da715a22b37739c8bc5cd73e34d4f1e9ea1b4b0bcad48b","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T03:26:48.661345Z","signature_b64":"pyCKPHFmKh9kA0ecIx1UyMoBnOOb90f7z5U0aXsMhdLG8hM1hH4USUOjn8VU9sNrAem0ryPPuXMoE+VWJ6Y1BQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"e76bffd98f5b4cf328da715a22b37739c8bc5cd73e34d4f1e9ea1b4b0bcad48b","last_reissued_at":"2026-07-05T03:26:48.660916Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T03:26:48.660916Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2110.14891","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-05T03:26:48Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Mg9vHCpF4Reg1GARe3+k3n+HlMUScNRVUVYSz0Q9lg17Y26GNA3NgHz68BlarsrT0TAX4YmDVpD4Nzggi5puAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-12T01:48:02.813800Z"},"content_sha256":"d48144b352cdf551ceb9f71c55f84e8a29b93bf8666a64951ee98810c658094d","schema_version":"1.0","event_id":"sha256:d48144b352cdf551ceb9f71c55f84e8a29b93bf8666a64951ee98810c658094d"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2021:45V77WMPLNGPGKG2OFNCFM3XHH","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Integrated Task Assignment and Path Planning for Capacitated Multi-Agent Pickup and Delivery","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","headline":"","cross_cats":["cs.RO"],"primary_cat":"cs.MA","authors_text":"Daniel D. Harabor, Javier Alonso-Mora, Peter J. Stuckey, Xiaoshan Bai, Zhe Chen","submitted_at":"2021-10-28T05:08:30Z","abstract_excerpt":"Multi-agent Pickup and Delivery (MAPD) is a challenging industrial problem where a team of robots is tasked with transporting a set of tasks, each from an initial location and each to a specified target location. Appearing in the context of automated warehouse logistics and automated mail sortation, MAPD requires first deciding which robot is assigned what task (i.e., Task Assignment or TA) followed by a subsequent coordination problem where each robot must be assigned collision-free paths so as to successfully complete its assignment (i.e., Multi-Agent Path Finding or MAPF). Leading methods i"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2110.14891","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/2110.14891/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-05T03:26:48Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"VOLAqRLKuKjbVF9GkH5Yc9WkZnKfEYoegi43TbnBZ5GmrN7L1VZCHjCJIjCLT+FIA0PlWhbwFXft7q8F7cFUDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-12T01:48:02.814174Z"},"content_sha256":"24b8c972ab866221e67f9d60a63583dcb13de425810296456124d3de3f962e30","schema_version":"1.0","event_id":"sha256:24b8c972ab866221e67f9d60a63583dcb13de425810296456124d3de3f962e30"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/45V77WMPLNGPGKG2OFNCFM3XHH/bundle.json","state_url":"https://pith.science/pith/45V77WMPLNGPGKG2OFNCFM3XHH/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/45V77WMPLNGPGKG2OFNCFM3XHH/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-07-12T01:48:02Z","links":{"resolver":"https://pith.science/pith/45V77WMPLNGPGKG2OFNCFM3XHH","bundle":"https://pith.science/pith/45V77WMPLNGPGKG2OFNCFM3XHH/bundle.json","state":"https://pith.science/pith/45V77WMPLNGPGKG2OFNCFM3XHH/state.json","well_known_bundle":"https://pith.science/.well-known/pith/45V77WMPLNGPGKG2OFNCFM3XHH/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2021:45V77WMPLNGPGKG2OFNCFM3XHH","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":"8c79c8ff2e9851af30ea69f199001a54a4371ae06c47a71c2924980e949b2162","cross_cats_sorted":["cs.RO"],"license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","primary_cat":"cs.MA","submitted_at":"2021-10-28T05:08:30Z","title_canon_sha256":"a412b2a9f013ad9f1b3aa5a921c4b27fc0b8c0c09b53cb36a0b7184271eaa3c6"},"schema_version":"1.0","source":{"id":"2110.14891","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2110.14891","created_at":"2026-07-05T03:26:48Z"},{"alias_kind":"arxiv_version","alias_value":"2110.14891v1","created_at":"2026-07-05T03:26:48Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2110.14891","created_at":"2026-07-05T03:26:48Z"},{"alias_kind":"pith_short_12","alias_value":"45V77WMPLNGP","created_at":"2026-07-05T03:26:48Z"},{"alias_kind":"pith_short_16","alias_value":"45V77WMPLNGPGKG2","created_at":"2026-07-05T03:26:48Z"},{"alias_kind":"pith_short_8","alias_value":"45V77WMP","created_at":"2026-07-05T03:26:48Z"}],"graph_snapshots":[{"event_id":"sha256:24b8c972ab866221e67f9d60a63583dcb13de425810296456124d3de3f962e30","target":"graph","created_at":"2026-07-05T03:26:48Z","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/2110.14891/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Multi-agent Pickup and Delivery (MAPD) is a challenging industrial problem where a team of robots is tasked with transporting a set of tasks, each from an initial location and each to a specified target location. Appearing in the context of automated warehouse logistics and automated mail sortation, MAPD requires first deciding which robot is assigned what task (i.e., Task Assignment or TA) followed by a subsequent coordination problem where each robot must be assigned collision-free paths so as to successfully complete its assignment (i.e., Multi-Agent Path Finding or MAPF). Leading methods i","authors_text":"Daniel D. Harabor, Javier Alonso-Mora, Peter J. Stuckey, Xiaoshan Bai, Zhe Chen","cross_cats":["cs.RO"],"headline":"","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","primary_cat":"cs.MA","submitted_at":"2021-10-28T05:08:30Z","title":"Integrated Task Assignment and Path Planning for Capacitated Multi-Agent Pickup and Delivery"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2110.14891","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:d48144b352cdf551ceb9f71c55f84e8a29b93bf8666a64951ee98810c658094d","target":"record","created_at":"2026-07-05T03:26:48Z","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":"8c79c8ff2e9851af30ea69f199001a54a4371ae06c47a71c2924980e949b2162","cross_cats_sorted":["cs.RO"],"license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","primary_cat":"cs.MA","submitted_at":"2021-10-28T05:08:30Z","title_canon_sha256":"a412b2a9f013ad9f1b3aa5a921c4b27fc0b8c0c09b53cb36a0b7184271eaa3c6"},"schema_version":"1.0","source":{"id":"2110.14891","kind":"arxiv","version":1}},"canonical_sha256":"e76bffd98f5b4cf328da715a22b37739c8bc5cd73e34d4f1e9ea1b4b0bcad48b","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"e76bffd98f5b4cf328da715a22b37739c8bc5cd73e34d4f1e9ea1b4b0bcad48b","first_computed_at":"2026-07-05T03:26:48.660916Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T03:26:48.660916Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"pyCKPHFmKh9kA0ecIx1UyMoBnOOb90f7z5U0aXsMhdLG8hM1hH4USUOjn8VU9sNrAem0ryPPuXMoE+VWJ6Y1BQ==","signature_status":"signed_v1","signed_at":"2026-07-05T03:26:48.661345Z","signed_message":"canonical_sha256_bytes"},"source_id":"2110.14891","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:d48144b352cdf551ceb9f71c55f84e8a29b93bf8666a64951ee98810c658094d","sha256:24b8c972ab866221e67f9d60a63583dcb13de425810296456124d3de3f962e30"],"state_sha256":"e73e098108d9f5a724612655fecc68f6cb5ece442a4af140bc6162889309c02e"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"cciJ6hpn9k+7IZL9y2TXmaMISlOenC+h0m/zOdsr0UJqSvb/SPqm556OeVg33GelSmWX3SX9+yrWSsBvpp/wBw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-07-12T01:48:02.816586Z","bundle_sha256":"0c8b7bfbc582c3a5aede15fa73a011aba4ec307523c1774e6dbc45cff2076fb1"}}