{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2025:YO7B4ABLUI7TLXCOCUDF4PPKBY","short_pith_number":"pith:YO7B4ABL","canonical_record":{"source":{"id":"2506.07293","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.RO","submitted_at":"2025-06-08T21:34:31Z","cross_cats_sorted":["cs.MA"],"title_canon_sha256":"271e1a004a4971b8c920035d3612440b59cf823b50eaf360997ceeae1bb587af","abstract_canon_sha256":"12226d9cdd99985975b74163965f92122c537d4a1a2c00bb0269dd5bfbe1c303"},"schema_version":"1.0"},"canonical_sha256":"c3be1e002ba23f35dc4e15065e3dea0e2296f714ab152d057a93e4c9e5d23d9d","source":{"kind":"arxiv","id":"2506.07293","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2506.07293","created_at":"2026-07-05T11:18:24Z"},{"alias_kind":"arxiv_version","alias_value":"2506.07293v1","created_at":"2026-07-05T11:18:24Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2506.07293","created_at":"2026-07-05T11:18:24Z"},{"alias_kind":"pith_short_12","alias_value":"YO7B4ABLUI7T","created_at":"2026-07-05T11:18:24Z"},{"alias_kind":"pith_short_16","alias_value":"YO7B4ABLUI7TLXCO","created_at":"2026-07-05T11:18:24Z"},{"alias_kind":"pith_short_8","alias_value":"YO7B4ABL","created_at":"2026-07-05T11:18:24Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2025:YO7B4ABLUI7TLXCOCUDF4PPKBY","target":"record","payload":{"canonical_record":{"source":{"id":"2506.07293","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.RO","submitted_at":"2025-06-08T21:34:31Z","cross_cats_sorted":["cs.MA"],"title_canon_sha256":"271e1a004a4971b8c920035d3612440b59cf823b50eaf360997ceeae1bb587af","abstract_canon_sha256":"12226d9cdd99985975b74163965f92122c537d4a1a2c00bb0269dd5bfbe1c303"},"schema_version":"1.0"},"canonical_sha256":"c3be1e002ba23f35dc4e15065e3dea0e2296f714ab152d057a93e4c9e5d23d9d","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T11:18:24.625174Z","signature_b64":"SLcVACwowK/KhhzYbXyLJmVEMEFQSWrRg0JXByFaK6CHATYJrvq1b5C8RiajbIeejHQZTdjMBIopRgS1DHf5Bw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"c3be1e002ba23f35dc4e15065e3dea0e2296f714ab152d057a93e4c9e5d23d9d","last_reissued_at":"2026-07-05T11:18:24.624699Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T11:18:24.624699Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2506.07293","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-05T11:18:24Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"2g8EO6R0tZ0qJBS14x47R7oFJLwbVuFHwvHusUahSpAKuYePqPMTkIFIaba+J+GqU4gJi5SWLMaWaly6ACo9BA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-08T01:25:12.213511Z"},"content_sha256":"222d40d0929aa5026da73884d55bb577b061ace297a56c5a25dfcf1f4301ff40","schema_version":"1.0","event_id":"sha256:222d40d0929aa5026da73884d55bb577b061ace297a56c5a25dfcf1f4301ff40"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2025:YO7B4ABLUI7TLXCOCUDF4PPKBY","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Very Large-scale Multi-Robot Task Allocation in Challenging Environments via Robot Redistribution","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.MA"],"primary_cat":"cs.RO","authors_text":"Changjoo Nam, Joonyeol Sim, Seabin Lee","submitted_at":"2025-06-08T21:34:31Z","abstract_excerpt":"We consider the Multi-Robot Task Allocation (MRTA) problem that aims to optimize an assignment of multiple robots to multiple tasks in challenging environments which are with densely populated obstacles and narrow passages. In such environments, conventional methods optimizing the sum-of-cost are often ineffective because the conflicts between robots incur additional costs (e.g., collision avoidance, waiting). Also, an allocation that does not incorporate the actual robot paths could cause deadlocks, which significantly degrade the collective performance of the robots.\n  We propose a scalable "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2506.07293","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/2506.07293/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-05T11:18:24Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"uP3NH3iDHPXYzz/1lnaC+SNkkQWgbUuh9k/JO0SZwAYDgboLSsxVrZnIsnQ+e4SWlmSmIgEnqQ8AFQjOUPNADw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-08T01:25:12.214009Z"},"content_sha256":"407691c8ca8a6fd96a2a05e46fffea6bb4d7801e2fca67fed8f2c48184129b6f","schema_version":"1.0","event_id":"sha256:407691c8ca8a6fd96a2a05e46fffea6bb4d7801e2fca67fed8f2c48184129b6f"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/YO7B4ABLUI7TLXCOCUDF4PPKBY/bundle.json","state_url":"https://pith.science/pith/YO7B4ABLUI7TLXCOCUDF4PPKBY/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/YO7B4ABLUI7TLXCOCUDF4PPKBY/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-08T01:25:12Z","links":{"resolver":"https://pith.science/pith/YO7B4ABLUI7TLXCOCUDF4PPKBY","bundle":"https://pith.science/pith/YO7B4ABLUI7TLXCOCUDF4PPKBY/bundle.json","state":"https://pith.science/pith/YO7B4ABLUI7TLXCOCUDF4PPKBY/state.json","well_known_bundle":"https://pith.science/.well-known/pith/YO7B4ABLUI7TLXCOCUDF4PPKBY/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2025:YO7B4ABLUI7TLXCOCUDF4PPKBY","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":"12226d9cdd99985975b74163965f92122c537d4a1a2c00bb0269dd5bfbe1c303","cross_cats_sorted":["cs.MA"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.RO","submitted_at":"2025-06-08T21:34:31Z","title_canon_sha256":"271e1a004a4971b8c920035d3612440b59cf823b50eaf360997ceeae1bb587af"},"schema_version":"1.0","source":{"id":"2506.07293","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2506.07293","created_at":"2026-07-05T11:18:24Z"},{"alias_kind":"arxiv_version","alias_value":"2506.07293v1","created_at":"2026-07-05T11:18:24Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2506.07293","created_at":"2026-07-05T11:18:24Z"},{"alias_kind":"pith_short_12","alias_value":"YO7B4ABLUI7T","created_at":"2026-07-05T11:18:24Z"},{"alias_kind":"pith_short_16","alias_value":"YO7B4ABLUI7TLXCO","created_at":"2026-07-05T11:18:24Z"},{"alias_kind":"pith_short_8","alias_value":"YO7B4ABL","created_at":"2026-07-05T11:18:24Z"}],"graph_snapshots":[{"event_id":"sha256:407691c8ca8a6fd96a2a05e46fffea6bb4d7801e2fca67fed8f2c48184129b6f","target":"graph","created_at":"2026-07-05T11:18:24Z","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/2506.07293/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"We consider the Multi-Robot Task Allocation (MRTA) problem that aims to optimize an assignment of multiple robots to multiple tasks in challenging environments which are with densely populated obstacles and narrow passages. In such environments, conventional methods optimizing the sum-of-cost are often ineffective because the conflicts between robots incur additional costs (e.g., collision avoidance, waiting). Also, an allocation that does not incorporate the actual robot paths could cause deadlocks, which significantly degrade the collective performance of the robots.\n  We propose a scalable ","authors_text":"Changjoo Nam, Joonyeol Sim, Seabin Lee","cross_cats":["cs.MA"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.RO","submitted_at":"2025-06-08T21:34:31Z","title":"Very Large-scale Multi-Robot Task Allocation in Challenging Environments via Robot Redistribution"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2506.07293","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:222d40d0929aa5026da73884d55bb577b061ace297a56c5a25dfcf1f4301ff40","target":"record","created_at":"2026-07-05T11:18:24Z","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":"12226d9cdd99985975b74163965f92122c537d4a1a2c00bb0269dd5bfbe1c303","cross_cats_sorted":["cs.MA"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.RO","submitted_at":"2025-06-08T21:34:31Z","title_canon_sha256":"271e1a004a4971b8c920035d3612440b59cf823b50eaf360997ceeae1bb587af"},"schema_version":"1.0","source":{"id":"2506.07293","kind":"arxiv","version":1}},"canonical_sha256":"c3be1e002ba23f35dc4e15065e3dea0e2296f714ab152d057a93e4c9e5d23d9d","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"c3be1e002ba23f35dc4e15065e3dea0e2296f714ab152d057a93e4c9e5d23d9d","first_computed_at":"2026-07-05T11:18:24.624699Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T11:18:24.624699Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"SLcVACwowK/KhhzYbXyLJmVEMEFQSWrRg0JXByFaK6CHATYJrvq1b5C8RiajbIeejHQZTdjMBIopRgS1DHf5Bw==","signature_status":"signed_v1","signed_at":"2026-07-05T11:18:24.625174Z","signed_message":"canonical_sha256_bytes"},"source_id":"2506.07293","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:222d40d0929aa5026da73884d55bb577b061ace297a56c5a25dfcf1f4301ff40","sha256:407691c8ca8a6fd96a2a05e46fffea6bb4d7801e2fca67fed8f2c48184129b6f"],"state_sha256":"e578a95aa3eb965eefce4862e404e5e46589b7ba6867d3746f27877b128dd1bf"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"oVLa9PR++W8foMjCBYVYQ4KUW5KA2a/nZm86XXw/Gl+pXf5EX1UMwovAFAbn9LPwBpdEsH2JaRzX4IQJrqy7Aw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-08T01:25:12.219422Z","bundle_sha256":"a34012a9a6342c830ec81b662cb1673c9d4bf37d3b6de93419a4c1966eaf8446"}}