{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2024:DJ3DT2NGCKNQQNBNXSYJDK3WQF","short_pith_number":"pith:DJ3DT2NG","schema_version":"1.0","canonical_sha256":"1a7639e9a6129b08342dbcb091ab7681403a44870536c2c1c552dd3697d8cf1e","source":{"kind":"arxiv","id":"2412.17993","version":1},"attestation_state":"computed","paper":{"title":"Multi-Agent Path Finding in Continuous Spaces with Projected Diffusion Models","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.AI","cs.LG"],"primary_cat":"cs.RO","authors_text":"Ferdinando Fioretto, Jacob K. Christopher, Jinhao Liang, Sven Koenig","submitted_at":"2024-12-23T21:27:19Z","abstract_excerpt":"Multi-Agent Path Finding (MAPF) is a fundamental problem in robotics, requiring the computation of collision-free paths for multiple agents moving from their respective start to goal positions. Coordinating multiple agents in a shared environment poses significant challenges, especially in continuous spaces where traditional optimization algorithms struggle with scalability. Moreover, these algorithms often depend on discretized representations of the environment, which can be impractical in image-based or high-dimensional settings. Recently, diffusion models have shown promise in single-agent"},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"canonical_record":{"source":{"id":"2412.17993","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.RO","submitted_at":"2024-12-23T21:27:19Z","cross_cats_sorted":["cs.AI","cs.LG"],"title_canon_sha256":"fff2800fc9a89de18afde1324dfb387074599e7a3dd7109db1ca21df3f17183d","abstract_canon_sha256":"4e64b6a3b7d72e4c54fd063d3507b1c9c255d3912860a430473c57bca9d8946a"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T09:53:32.061797Z","signature_b64":"wR975bE1Rqde8c+WD0/3jOzt/JxT0kYI12uaecoinANWn95HKWLd+Rap7V0R6Jpah9rMP1WWnWWKV0CoOLxPDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"1a7639e9a6129b08342dbcb091ab7681403a44870536c2c1c552dd3697d8cf1e","last_reissued_at":"2026-07-05T09:53:32.061342Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T09:53:32.061342Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Multi-Agent Path Finding in Continuous Spaces with Projected Diffusion Models","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.AI","cs.LG"],"primary_cat":"cs.RO","authors_text":"Ferdinando Fioretto, Jacob K. Christopher, Jinhao Liang, Sven Koenig","submitted_at":"2024-12-23T21:27:19Z","abstract_excerpt":"Multi-Agent Path Finding (MAPF) is a fundamental problem in robotics, requiring the computation of collision-free paths for multiple agents moving from their respective start to goal positions. Coordinating multiple agents in a shared environment poses significant challenges, especially in continuous spaces where traditional optimization algorithms struggle with scalability. Moreover, these algorithms often depend on discretized representations of the environment, which can be impractical in image-based or high-dimensional settings. Recently, diffusion models have shown promise in single-agent"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2412.17993","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/2412.17993/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"},"aliases":[{"alias_kind":"arxiv","alias_value":"2412.17993","created_at":"2026-07-05T09:53:32.061396+00:00"},{"alias_kind":"arxiv_version","alias_value":"2412.17993v1","created_at":"2026-07-05T09:53:32.061396+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2412.17993","created_at":"2026-07-05T09:53:32.061396+00:00"},{"alias_kind":"pith_short_12","alias_value":"DJ3DT2NGCKNQ","created_at":"2026-07-05T09:53:32.061396+00:00"},{"alias_kind":"pith_short_16","alias_value":"DJ3DT2NGCKNQQNBN","created_at":"2026-07-05T09:53:32.061396+00:00"},{"alias_kind":"pith_short_8","alias_value":"DJ3DT2NG","created_at":"2026-07-05T09:53:32.061396+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":3,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2605.30825","citing_title":"Unlearning in Diffusion Models: A Unified Framework with KL Divergence and Likelihood Constraints","ref_index":14,"is_internal_anchor":false},{"citing_arxiv_id":"2605.10917","citing_title":"Optimal and Scalable MAPF via Multi-Marginal Optimal Transport and Schr\\\"odinger Bridges","ref_index":7,"is_internal_anchor":false},{"citing_arxiv_id":"2604.06598","citing_title":"Train-Small Deploy-Large: Leveraging Diffusion-Based Multi-Robot Planning","ref_index":9,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/DJ3DT2NGCKNQQNBNXSYJDK3WQF","json":"https://pith.science/pith/DJ3DT2NGCKNQQNBNXSYJDK3WQF.json","graph_json":"https://pith.science/api/pith-number/DJ3DT2NGCKNQQNBNXSYJDK3WQF/graph.json","events_json":"https://pith.science/api/pith-number/DJ3DT2NGCKNQQNBNXSYJDK3WQF/events.json","paper":"https://pith.science/paper/DJ3DT2NG"},"agent_actions":{"view_html":"https://pith.science/pith/DJ3DT2NGCKNQQNBNXSYJDK3WQF","download_json":"https://pith.science/pith/DJ3DT2NGCKNQQNBNXSYJDK3WQF.json","view_paper":"https://pith.science/paper/DJ3DT2NG","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2412.17993&json=true","fetch_graph":"https://pith.science/api/pith-number/DJ3DT2NGCKNQQNBNXSYJDK3WQF/graph.json","fetch_events":"https://pith.science/api/pith-number/DJ3DT2NGCKNQQNBNXSYJDK3WQF/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/DJ3DT2NGCKNQQNBNXSYJDK3WQF/action/timestamp_anchor","attest_storage":"https://pith.science/pith/DJ3DT2NGCKNQQNBNXSYJDK3WQF/action/storage_attestation","attest_author":"https://pith.science/pith/DJ3DT2NGCKNQQNBNXSYJDK3WQF/action/author_attestation","sign_citation":"https://pith.science/pith/DJ3DT2NGCKNQQNBNXSYJDK3WQF/action/citation_signature","submit_replication":"https://pith.science/pith/DJ3DT2NGCKNQQNBNXSYJDK3WQF/action/replication_record"}},"created_at":"2026-07-05T09:53:32.061396+00:00","updated_at":"2026-07-05T09:53:32.061396+00:00"}