{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2014:VLJHBLTMMNYG2XGA752LSQBAA2","short_pith_number":"pith:VLJHBLTM","canonical_record":{"source":{"id":"1409.2399","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.RO","submitted_at":"2014-09-08T15:38:31Z","cross_cats_sorted":["cs.AI","cs.MA"],"title_canon_sha256":"24f2909fa27c1fb2f19a68f526bdb71f28b697559b22ca0e739419373c56969a","abstract_canon_sha256":"993440d05412ff01d3fe00b04018c5a9eaa87e5d55ec92f1de81d8cfaf465331"},"schema_version":"1.0"},"canonical_sha256":"aad270ae6c63706d5cc0ff74b9402006b26f1ac1f510cdbbfb486ca567887b3b","source":{"kind":"arxiv","id":"1409.2399","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1409.2399","created_at":"2026-05-18T02:43:17Z"},{"alias_kind":"arxiv_version","alias_value":"1409.2399v1","created_at":"2026-05-18T02:43:17Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1409.2399","created_at":"2026-05-18T02:43:17Z"},{"alias_kind":"pith_short_12","alias_value":"VLJHBLTMMNYG","created_at":"2026-05-18T12:28:54Z"},{"alias_kind":"pith_short_16","alias_value":"VLJHBLTMMNYG2XGA","created_at":"2026-05-18T12:28:54Z"},{"alias_kind":"pith_short_8","alias_value":"VLJHBLTM","created_at":"2026-05-18T12:28:54Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2014:VLJHBLTMMNYG2XGA752LSQBAA2","target":"record","payload":{"canonical_record":{"source":{"id":"1409.2399","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.RO","submitted_at":"2014-09-08T15:38:31Z","cross_cats_sorted":["cs.AI","cs.MA"],"title_canon_sha256":"24f2909fa27c1fb2f19a68f526bdb71f28b697559b22ca0e739419373c56969a","abstract_canon_sha256":"993440d05412ff01d3fe00b04018c5a9eaa87e5d55ec92f1de81d8cfaf465331"},"schema_version":"1.0"},"canonical_sha256":"aad270ae6c63706d5cc0ff74b9402006b26f1ac1f510cdbbfb486ca567887b3b","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:43:17.182178Z","signature_b64":"AnXL6poRV7T8Pcc0z5qvtQesqaRTFKjdzpWw0DgWUWMs5Uik+L/GnhFSRTwjZ7rGPFm1w9FdwBOCLXu1tVbbBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"aad270ae6c63706d5cc0ff74b9402006b26f1ac1f510cdbbfb486ca567887b3b","last_reissued_at":"2026-05-18T02:43:17.181631Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:43:17.181631Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1409.2399","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-05-18T02:43:17Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"JwC57YqjvvY+jbpsSpYbUyfASaaXNMf52hvpp93mt6n8o/CfcR5bV+M6RFfIjU8oSeANGvYo3d8fS8N8dX2zDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-05T14:35:53.709285Z"},"content_sha256":"ab06e09669d69f0d4f2f7702ba5f0f017658f5026b0aada368eda5d8e7d85614","schema_version":"1.0","event_id":"sha256:ab06e09669d69f0d4f2f7702ba5f0f017658f5026b0aada368eda5d8e7d85614"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2014:VLJHBLTMMNYG2XGA752LSQBAA2","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Prioritized Planning Algorithms for Trajectory Coordination of Multiple Mobile Robots","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI","cs.MA"],"primary_cat":"cs.RO","authors_text":"Alexander Kleiner, Martin Seleck\\'y, Michal \\v{C}\\'ap, Peter Nov\\'ak","submitted_at":"2014-09-08T15:38:31Z","abstract_excerpt":"An important capability of autonomous multi-robot systems is to prevent collision among the individual robots. One approach to this problem is to plan conflict-free trajectories and let each of the robots follow its pre-planned trajectory. A widely used practical method for multi-robot trajectory planning is prioritized planning, which has been shown to be effective in practice, but is in general incomplete. Formal analysis of instances that are provably solvable by prioritized planning is still missing. Moreover, prioritized planning is a centralized algorithm, which may be in many situations"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1409.2399","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"},"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-05-18T02:43:17Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"LgWZa5ZcrUhsPpALLy5gJ2Rcjub7GpQm9C4u89gkSiIMfDZoBQsVPHDSPxA3krKqQaIi9/RfJU5rAjmt4N/sAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-05T14:35:53.709660Z"},"content_sha256":"c3866621ba6b0130c3bd01b7a2e7069b10de52de8b9afe2a04bc66a4e2e688bd","schema_version":"1.0","event_id":"sha256:c3866621ba6b0130c3bd01b7a2e7069b10de52de8b9afe2a04bc66a4e2e688bd"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/VLJHBLTMMNYG2XGA752LSQBAA2/bundle.json","state_url":"https://pith.science/pith/VLJHBLTMMNYG2XGA752LSQBAA2/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/VLJHBLTMMNYG2XGA752LSQBAA2/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-06-05T14:35:53Z","links":{"resolver":"https://pith.science/pith/VLJHBLTMMNYG2XGA752LSQBAA2","bundle":"https://pith.science/pith/VLJHBLTMMNYG2XGA752LSQBAA2/bundle.json","state":"https://pith.science/pith/VLJHBLTMMNYG2XGA752LSQBAA2/state.json","well_known_bundle":"https://pith.science/.well-known/pith/VLJHBLTMMNYG2XGA752LSQBAA2/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:VLJHBLTMMNYG2XGA752LSQBAA2","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":"993440d05412ff01d3fe00b04018c5a9eaa87e5d55ec92f1de81d8cfaf465331","cross_cats_sorted":["cs.AI","cs.MA"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.RO","submitted_at":"2014-09-08T15:38:31Z","title_canon_sha256":"24f2909fa27c1fb2f19a68f526bdb71f28b697559b22ca0e739419373c56969a"},"schema_version":"1.0","source":{"id":"1409.2399","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1409.2399","created_at":"2026-05-18T02:43:17Z"},{"alias_kind":"arxiv_version","alias_value":"1409.2399v1","created_at":"2026-05-18T02:43:17Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1409.2399","created_at":"2026-05-18T02:43:17Z"},{"alias_kind":"pith_short_12","alias_value":"VLJHBLTMMNYG","created_at":"2026-05-18T12:28:54Z"},{"alias_kind":"pith_short_16","alias_value":"VLJHBLTMMNYG2XGA","created_at":"2026-05-18T12:28:54Z"},{"alias_kind":"pith_short_8","alias_value":"VLJHBLTM","created_at":"2026-05-18T12:28:54Z"}],"graph_snapshots":[{"event_id":"sha256:c3866621ba6b0130c3bd01b7a2e7069b10de52de8b9afe2a04bc66a4e2e688bd","target":"graph","created_at":"2026-05-18T02:43:17Z","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"},"paper":{"abstract_excerpt":"An important capability of autonomous multi-robot systems is to prevent collision among the individual robots. One approach to this problem is to plan conflict-free trajectories and let each of the robots follow its pre-planned trajectory. A widely used practical method for multi-robot trajectory planning is prioritized planning, which has been shown to be effective in practice, but is in general incomplete. Formal analysis of instances that are provably solvable by prioritized planning is still missing. Moreover, prioritized planning is a centralized algorithm, which may be in many situations","authors_text":"Alexander Kleiner, Martin Seleck\\'y, Michal \\v{C}\\'ap, Peter Nov\\'ak","cross_cats":["cs.AI","cs.MA"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.RO","submitted_at":"2014-09-08T15:38:31Z","title":"Prioritized Planning Algorithms for Trajectory Coordination of Multiple Mobile Robots"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1409.2399","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:ab06e09669d69f0d4f2f7702ba5f0f017658f5026b0aada368eda5d8e7d85614","target":"record","created_at":"2026-05-18T02:43:17Z","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":"993440d05412ff01d3fe00b04018c5a9eaa87e5d55ec92f1de81d8cfaf465331","cross_cats_sorted":["cs.AI","cs.MA"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.RO","submitted_at":"2014-09-08T15:38:31Z","title_canon_sha256":"24f2909fa27c1fb2f19a68f526bdb71f28b697559b22ca0e739419373c56969a"},"schema_version":"1.0","source":{"id":"1409.2399","kind":"arxiv","version":1}},"canonical_sha256":"aad270ae6c63706d5cc0ff74b9402006b26f1ac1f510cdbbfb486ca567887b3b","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"aad270ae6c63706d5cc0ff74b9402006b26f1ac1f510cdbbfb486ca567887b3b","first_computed_at":"2026-05-18T02:43:17.181631Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:43:17.181631Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"AnXL6poRV7T8Pcc0z5qvtQesqaRTFKjdzpWw0DgWUWMs5Uik+L/GnhFSRTwjZ7rGPFm1w9FdwBOCLXu1tVbbBw==","signature_status":"signed_v1","signed_at":"2026-05-18T02:43:17.182178Z","signed_message":"canonical_sha256_bytes"},"source_id":"1409.2399","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:ab06e09669d69f0d4f2f7702ba5f0f017658f5026b0aada368eda5d8e7d85614","sha256:c3866621ba6b0130c3bd01b7a2e7069b10de52de8b9afe2a04bc66a4e2e688bd"],"state_sha256":"8e5d72e4f1d60764ea3086a7667ce3992640a9d93951e400981535e21a6462e9"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"3ZpbD2g7tSu+x5ZRbcoS1eKWGOEDOlYIY70TUMR000ga6BV6ZkQILgD5ZQ2tCr+GgrAzsoSkRN5W+i9KbOCEBQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-05T14:35:53.711632Z","bundle_sha256":"75a0cd72144b90d82540fc62b292c4c52f0b7b4c4330677d941a6f2b39802615"}}