{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2012:SJWBODWWORNSNDL4CCOKW5LEG3","short_pith_number":"pith:SJWBODWW","schema_version":"1.0","canonical_sha256":"926c170ed6745b268d7c109cab756436e464346043b74b0541a39d81783b1167","source":{"kind":"arxiv","id":"1210.6855","version":1},"attestation_state":"computed","paper":{"title":"Asynchronous Decentralized Algorithm for Space-Time Cooperative Pathfinding","license":"http://creativecommons.org/licenses/by-nc-sa/3.0/","headline":"","cross_cats":["cs.DC","cs.RO"],"primary_cat":"cs.AI","authors_text":"Ji\\v{r}\\'i Vok\\v{r}\\'inek, Michal P\\v{e}chou\\v{c}ek, Michal \\v{C}\\'ap, Peter Nov\\'ak","submitted_at":"2012-10-25T14:35:27Z","abstract_excerpt":"Cooperative pathfinding is a multi-agent path planning problem where a group of vehicles searches for a corresponding set of non-conflicting space-time trajectories. Many of the practical methods for centralized solving of cooperative pathfinding problems are based on the prioritized planning strategy. However, in some domains (e.g., multi-robot teams of unmanned aerial vehicles, autonomous underwater vehicles, or unmanned ground vehicles) a decentralized approach may be more desirable than a centralized one due to communication limitations imposed by the domain and/or privacy concerns.\n  In t"},"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":"1210.6855","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by-nc-sa/3.0/","primary_cat":"cs.AI","submitted_at":"2012-10-25T14:35:27Z","cross_cats_sorted":["cs.DC","cs.RO"],"title_canon_sha256":"24f104eeb919f56caab7bdf74cca7101bd2fd06864363798a6ad9776e4951246","abstract_canon_sha256":"7660af764535ba72f72e5e4e3ca21ee12de879a0cf639c6d7fb62578b79b646b"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:42:22.974507Z","signature_b64":"Bhzl7tRwH5fkQk3J9V4xCv9TLWqkGQZ5uysxR15Rim+l9FfkVbQcSr4+oXGmVu3OFKo7jDun5GC5pHAzHnf4Bw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"926c170ed6745b268d7c109cab756436e464346043b74b0541a39d81783b1167","last_reissued_at":"2026-05-18T03:42:22.973929Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:42:22.973929Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Asynchronous Decentralized Algorithm for Space-Time Cooperative Pathfinding","license":"http://creativecommons.org/licenses/by-nc-sa/3.0/","headline":"","cross_cats":["cs.DC","cs.RO"],"primary_cat":"cs.AI","authors_text":"Ji\\v{r}\\'i Vok\\v{r}\\'inek, Michal P\\v{e}chou\\v{c}ek, Michal \\v{C}\\'ap, Peter Nov\\'ak","submitted_at":"2012-10-25T14:35:27Z","abstract_excerpt":"Cooperative pathfinding is a multi-agent path planning problem where a group of vehicles searches for a corresponding set of non-conflicting space-time trajectories. Many of the practical methods for centralized solving of cooperative pathfinding problems are based on the prioritized planning strategy. However, in some domains (e.g., multi-robot teams of unmanned aerial vehicles, autonomous underwater vehicles, or unmanned ground vehicles) a decentralized approach may be more desirable than a centralized one due to communication limitations imposed by the domain and/or privacy concerns.\n  In t"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1210.6855","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":""},"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":"1210.6855","created_at":"2026-05-18T03:42:22.974007+00:00"},{"alias_kind":"arxiv_version","alias_value":"1210.6855v1","created_at":"2026-05-18T03:42:22.974007+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1210.6855","created_at":"2026-05-18T03:42:22.974007+00:00"},{"alias_kind":"pith_short_12","alias_value":"SJWBODWWORNS","created_at":"2026-05-18T12:27:20.899486+00:00"},{"alias_kind":"pith_short_16","alias_value":"SJWBODWWORNSNDL4","created_at":"2026-05-18T12:27:20.899486+00:00"},{"alias_kind":"pith_short_8","alias_value":"SJWBODWW","created_at":"2026-05-18T12:27:20.899486+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/SJWBODWWORNSNDL4CCOKW5LEG3","json":"https://pith.science/pith/SJWBODWWORNSNDL4CCOKW5LEG3.json","graph_json":"https://pith.science/api/pith-number/SJWBODWWORNSNDL4CCOKW5LEG3/graph.json","events_json":"https://pith.science/api/pith-number/SJWBODWWORNSNDL4CCOKW5LEG3/events.json","paper":"https://pith.science/paper/SJWBODWW"},"agent_actions":{"view_html":"https://pith.science/pith/SJWBODWWORNSNDL4CCOKW5LEG3","download_json":"https://pith.science/pith/SJWBODWWORNSNDL4CCOKW5LEG3.json","view_paper":"https://pith.science/paper/SJWBODWW","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1210.6855&json=true","fetch_graph":"https://pith.science/api/pith-number/SJWBODWWORNSNDL4CCOKW5LEG3/graph.json","fetch_events":"https://pith.science/api/pith-number/SJWBODWWORNSNDL4CCOKW5LEG3/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/SJWBODWWORNSNDL4CCOKW5LEG3/action/timestamp_anchor","attest_storage":"https://pith.science/pith/SJWBODWWORNSNDL4CCOKW5LEG3/action/storage_attestation","attest_author":"https://pith.science/pith/SJWBODWWORNSNDL4CCOKW5LEG3/action/author_attestation","sign_citation":"https://pith.science/pith/SJWBODWWORNSNDL4CCOKW5LEG3/action/citation_signature","submit_replication":"https://pith.science/pith/SJWBODWWORNSNDL4CCOKW5LEG3/action/replication_record"}},"created_at":"2026-05-18T03:42:22.974007+00:00","updated_at":"2026-05-18T03:42:22.974007+00:00"}