{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2025:BW2JXU7FKHA6EM4YB7YXOH4G25","short_pith_number":"pith:BW2JXU7F","canonical_record":{"source":{"id":"2508.20095","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.RO","submitted_at":"2025-08-27T17:59:36Z","cross_cats_sorted":["cs.AI","cs.LG"],"title_canon_sha256":"d2cb476e07138ae33429d4b728922b14368209a72556c01f89dbf8dca3a3b037","abstract_canon_sha256":"4ed3ac111a60456b07240cea310bf9c0fc293f63faa262d3a1a2b1e9c04b280b"},"schema_version":"1.0"},"canonical_sha256":"0db49bd3e551c1e233980ff1771f86d7664c68fd238d35bb67b37dedad47d9f7","source":{"kind":"arxiv","id":"2508.20095","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2508.20095","created_at":"2026-07-05T12:00:24Z"},{"alias_kind":"arxiv_version","alias_value":"2508.20095v1","created_at":"2026-07-05T12:00:24Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2508.20095","created_at":"2026-07-05T12:00:24Z"},{"alias_kind":"pith_short_12","alias_value":"BW2JXU7FKHA6","created_at":"2026-07-05T12:00:24Z"},{"alias_kind":"pith_short_16","alias_value":"BW2JXU7FKHA6EM4Y","created_at":"2026-07-05T12:00:24Z"},{"alias_kind":"pith_short_8","alias_value":"BW2JXU7F","created_at":"2026-07-05T12:00:24Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2025:BW2JXU7FKHA6EM4YB7YXOH4G25","target":"record","payload":{"canonical_record":{"source":{"id":"2508.20095","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.RO","submitted_at":"2025-08-27T17:59:36Z","cross_cats_sorted":["cs.AI","cs.LG"],"title_canon_sha256":"d2cb476e07138ae33429d4b728922b14368209a72556c01f89dbf8dca3a3b037","abstract_canon_sha256":"4ed3ac111a60456b07240cea310bf9c0fc293f63faa262d3a1a2b1e9c04b280b"},"schema_version":"1.0"},"canonical_sha256":"0db49bd3e551c1e233980ff1771f86d7664c68fd238d35bb67b37dedad47d9f7","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T12:00:24.896333Z","signature_b64":"gQM3UlHak4OvfHsr1nttcqVtV3d0Fot2cIC6EgmH0RAF3Y1hTTR1j1sXuVdhTAMpHG6QoOHubqU149klEOQSAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"0db49bd3e551c1e233980ff1771f86d7664c68fd238d35bb67b37dedad47d9f7","last_reissued_at":"2026-07-05T12:00:24.895811Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T12:00:24.895811Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2508.20095","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-05T12:00:24Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Qp449PJCPU/YBOXIgFE5LbOgA5b0ggBs4kmanNiq4pjVKN4jXsWRVBxnDa04tfwsOWdmDntqtZBZ2H0n1OpzAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-10T05:39:33.702975Z"},"content_sha256":"e290fd9b9715e484d739a853dda30b798b2f25bc4a0117ab3de47bd21ed08b64","schema_version":"1.0","event_id":"sha256:e290fd9b9715e484d739a853dda30b798b2f25bc4a0117ab3de47bd21ed08b64"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2025:BW2JXU7FKHA6EM4YB7YXOH4G25","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Discrete-Guided Diffusion for Scalable and Safe Multi-Robot Motion Planning","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.AI","cs.LG"],"primary_cat":"cs.RO","authors_text":"Ferdinando Fioretto, Jinhao Liang, Sven Koenig","submitted_at":"2025-08-27T17:59:36Z","abstract_excerpt":"Multi-Robot Motion Planning (MRMP) involves generating collision-free trajectories for multiple robots operating in a shared continuous workspace. While discrete multi-agent path finding (MAPF) methods are broadly adopted due to their scalability, their coarse discretization severely limits trajectory quality. In contrast, continuous optimization-based planners offer higher-quality paths but suffer from the curse of dimensionality, resulting in poor scalability with respect to the number of robots. This paper tackles the limitations of these two approaches by introducing a novel framework that"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2508.20095","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/2508.20095/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-05T12:00:24Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"k3wiTJtJJUDVWjerHKbGppH+0JMc9XgYYxaf6WUOvMgXK/E+JCO9T+xCqUIALeoigO2/BKfvWzsE5yXIqXjeDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-10T05:39:33.703501Z"},"content_sha256":"a68e3cd64fcd25fbbab7ab7be2c48d894141a6e671f916a9a06fd4e286bde2b0","schema_version":"1.0","event_id":"sha256:a68e3cd64fcd25fbbab7ab7be2c48d894141a6e671f916a9a06fd4e286bde2b0"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/BW2JXU7FKHA6EM4YB7YXOH4G25/bundle.json","state_url":"https://pith.science/pith/BW2JXU7FKHA6EM4YB7YXOH4G25/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/BW2JXU7FKHA6EM4YB7YXOH4G25/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-10T05:39:33Z","links":{"resolver":"https://pith.science/pith/BW2JXU7FKHA6EM4YB7YXOH4G25","bundle":"https://pith.science/pith/BW2JXU7FKHA6EM4YB7YXOH4G25/bundle.json","state":"https://pith.science/pith/BW2JXU7FKHA6EM4YB7YXOH4G25/state.json","well_known_bundle":"https://pith.science/.well-known/pith/BW2JXU7FKHA6EM4YB7YXOH4G25/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2025:BW2JXU7FKHA6EM4YB7YXOH4G25","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":"4ed3ac111a60456b07240cea310bf9c0fc293f63faa262d3a1a2b1e9c04b280b","cross_cats_sorted":["cs.AI","cs.LG"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.RO","submitted_at":"2025-08-27T17:59:36Z","title_canon_sha256":"d2cb476e07138ae33429d4b728922b14368209a72556c01f89dbf8dca3a3b037"},"schema_version":"1.0","source":{"id":"2508.20095","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2508.20095","created_at":"2026-07-05T12:00:24Z"},{"alias_kind":"arxiv_version","alias_value":"2508.20095v1","created_at":"2026-07-05T12:00:24Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2508.20095","created_at":"2026-07-05T12:00:24Z"},{"alias_kind":"pith_short_12","alias_value":"BW2JXU7FKHA6","created_at":"2026-07-05T12:00:24Z"},{"alias_kind":"pith_short_16","alias_value":"BW2JXU7FKHA6EM4Y","created_at":"2026-07-05T12:00:24Z"},{"alias_kind":"pith_short_8","alias_value":"BW2JXU7F","created_at":"2026-07-05T12:00:24Z"}],"graph_snapshots":[{"event_id":"sha256:a68e3cd64fcd25fbbab7ab7be2c48d894141a6e671f916a9a06fd4e286bde2b0","target":"graph","created_at":"2026-07-05T12:00: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/2508.20095/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Multi-Robot Motion Planning (MRMP) involves generating collision-free trajectories for multiple robots operating in a shared continuous workspace. While discrete multi-agent path finding (MAPF) methods are broadly adopted due to their scalability, their coarse discretization severely limits trajectory quality. In contrast, continuous optimization-based planners offer higher-quality paths but suffer from the curse of dimensionality, resulting in poor scalability with respect to the number of robots. This paper tackles the limitations of these two approaches by introducing a novel framework that","authors_text":"Ferdinando Fioretto, Jinhao Liang, Sven Koenig","cross_cats":["cs.AI","cs.LG"],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.RO","submitted_at":"2025-08-27T17:59:36Z","title":"Discrete-Guided Diffusion for Scalable and Safe Multi-Robot Motion Planning"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2508.20095","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:e290fd9b9715e484d739a853dda30b798b2f25bc4a0117ab3de47bd21ed08b64","target":"record","created_at":"2026-07-05T12:00: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":"4ed3ac111a60456b07240cea310bf9c0fc293f63faa262d3a1a2b1e9c04b280b","cross_cats_sorted":["cs.AI","cs.LG"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.RO","submitted_at":"2025-08-27T17:59:36Z","title_canon_sha256":"d2cb476e07138ae33429d4b728922b14368209a72556c01f89dbf8dca3a3b037"},"schema_version":"1.0","source":{"id":"2508.20095","kind":"arxiv","version":1}},"canonical_sha256":"0db49bd3e551c1e233980ff1771f86d7664c68fd238d35bb67b37dedad47d9f7","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"0db49bd3e551c1e233980ff1771f86d7664c68fd238d35bb67b37dedad47d9f7","first_computed_at":"2026-07-05T12:00:24.895811Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T12:00:24.895811Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"gQM3UlHak4OvfHsr1nttcqVtV3d0Fot2cIC6EgmH0RAF3Y1hTTR1j1sXuVdhTAMpHG6QoOHubqU149klEOQSAg==","signature_status":"signed_v1","signed_at":"2026-07-05T12:00:24.896333Z","signed_message":"canonical_sha256_bytes"},"source_id":"2508.20095","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:e290fd9b9715e484d739a853dda30b798b2f25bc4a0117ab3de47bd21ed08b64","sha256:a68e3cd64fcd25fbbab7ab7be2c48d894141a6e671f916a9a06fd4e286bde2b0"],"state_sha256":"ee9a49fae1974d44e77bb256cb5f9812bf329848d185a943ba526bd87345ac7e"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"6kxRW0C+0FhA5zZ/IDwI8EBKahR+Ilbfqy5emVhhNqV6N6vmuiRGLrWNE0YseV5UmcdpQ9o7ltB0/bX0O8slAw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-10T05:39:33.707476Z","bundle_sha256":"60f5e0d53b9f28751685d681317bca940cf78d96934c8eeeb3169de4545807ce"}}