{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2024:JP2V2ZD3CNDDQBZVTFDGXWT7OP","short_pith_number":"pith:JP2V2ZD3","schema_version":"1.0","canonical_sha256":"4bf55d647b134638073599466bda7f73e224989bc184fffa728b6c9f2f649b5e","source":{"kind":"arxiv","id":"2401.05860","version":2},"attestation_state":"computed","paper":{"title":"Confidence-Based Curriculum Learning for Multi-Agent Path Finding","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.MA","authors_text":"Joseph Driscoll, Justin Romberg, Sven Koenig, Thomy Phan","submitted_at":"2024-01-11T12:11:24Z","abstract_excerpt":"A wide range of real-world applications can be formulated as Multi-Agent Path Finding (MAPF) problem, where the goal is to find collision-free paths for multiple agents with individual start and goal locations. State-of-the-art MAPF solvers are mainly centralized and depend on global information, which limits their scalability and flexibility regarding changes or new maps that would require expensive replanning. Multi-agent reinforcement learning (MARL) offers an alternative way by learning decentralized policies that can generalize over a variety of maps. While there exist some prior works th"},"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":"2401.05860","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.MA","submitted_at":"2024-01-11T12:11:24Z","cross_cats_sorted":[],"title_canon_sha256":"afce88c26f36599d9a88ac0c3d30ae569df7e6d4656df314e98fa8eb08e8419d","abstract_canon_sha256":"7b84fe03f6371d1da13d444f1ac69d067346f6bfb04dfe220b564da47bba2d3f"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T07:43:34.854051Z","signature_b64":"2j+kYEYdN1jK3uRP8XIfOCNmjSVX356cbNGWwgl98Zpr6eY56ktp/rAZzsMSGBZoMSFjF8ZrYc8UOthPL3WaBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"4bf55d647b134638073599466bda7f73e224989bc184fffa728b6c9f2f649b5e","last_reissued_at":"2026-07-05T07:43:34.853630Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T07:43:34.853630Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Confidence-Based Curriculum Learning for Multi-Agent Path Finding","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.MA","authors_text":"Joseph Driscoll, Justin Romberg, Sven Koenig, Thomy Phan","submitted_at":"2024-01-11T12:11:24Z","abstract_excerpt":"A wide range of real-world applications can be formulated as Multi-Agent Path Finding (MAPF) problem, where the goal is to find collision-free paths for multiple agents with individual start and goal locations. State-of-the-art MAPF solvers are mainly centralized and depend on global information, which limits their scalability and flexibility regarding changes or new maps that would require expensive replanning. Multi-agent reinforcement learning (MARL) offers an alternative way by learning decentralized policies that can generalize over a variety of maps. While there exist some prior works th"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2401.05860","kind":"arxiv","version":2},"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/2401.05860/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":"2401.05860","created_at":"2026-07-05T07:43:34.853684+00:00"},{"alias_kind":"arxiv_version","alias_value":"2401.05860v2","created_at":"2026-07-05T07:43:34.853684+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2401.05860","created_at":"2026-07-05T07:43:34.853684+00:00"},{"alias_kind":"pith_short_12","alias_value":"JP2V2ZD3CNDD","created_at":"2026-07-05T07:43:34.853684+00:00"},{"alias_kind":"pith_short_16","alias_value":"JP2V2ZD3CNDDQBZV","created_at":"2026-07-05T07:43:34.853684+00:00"},{"alias_kind":"pith_short_8","alias_value":"JP2V2ZD3","created_at":"2026-07-05T07:43:34.853684+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/JP2V2ZD3CNDDQBZVTFDGXWT7OP","json":"https://pith.science/pith/JP2V2ZD3CNDDQBZVTFDGXWT7OP.json","graph_json":"https://pith.science/api/pith-number/JP2V2ZD3CNDDQBZVTFDGXWT7OP/graph.json","events_json":"https://pith.science/api/pith-number/JP2V2ZD3CNDDQBZVTFDGXWT7OP/events.json","paper":"https://pith.science/paper/JP2V2ZD3"},"agent_actions":{"view_html":"https://pith.science/pith/JP2V2ZD3CNDDQBZVTFDGXWT7OP","download_json":"https://pith.science/pith/JP2V2ZD3CNDDQBZVTFDGXWT7OP.json","view_paper":"https://pith.science/paper/JP2V2ZD3","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2401.05860&json=true","fetch_graph":"https://pith.science/api/pith-number/JP2V2ZD3CNDDQBZVTFDGXWT7OP/graph.json","fetch_events":"https://pith.science/api/pith-number/JP2V2ZD3CNDDQBZVTFDGXWT7OP/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/JP2V2ZD3CNDDQBZVTFDGXWT7OP/action/timestamp_anchor","attest_storage":"https://pith.science/pith/JP2V2ZD3CNDDQBZVTFDGXWT7OP/action/storage_attestation","attest_author":"https://pith.science/pith/JP2V2ZD3CNDDQBZVTFDGXWT7OP/action/author_attestation","sign_citation":"https://pith.science/pith/JP2V2ZD3CNDDQBZVTFDGXWT7OP/action/citation_signature","submit_replication":"https://pith.science/pith/JP2V2ZD3CNDDQBZVTFDGXWT7OP/action/replication_record"}},"created_at":"2026-07-05T07:43:34.853684+00:00","updated_at":"2026-07-05T07:43:34.853684+00:00"}