{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2014:TSXT4YLD434IN537QWKEKTPJNW","short_pith_number":"pith:TSXT4YLD","canonical_record":{"source":{"id":"1402.3613","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2014-02-14T22:09:44Z","cross_cats_sorted":["cs.RO"],"title_canon_sha256":"2a65edfc78354c801d72f1b06ae45557e343b19ca99babac3f76733da63a6fa4","abstract_canon_sha256":"6e849e58bc95606d7c6bf20c1a724352d10ebfc03d25a600d434b1872b6301d5"},"schema_version":"1.0"},"canonical_sha256":"9caf3e6163e6f886f77f8594454de96dbcc7b6903310273892c8a02dc0c77d48","source":{"kind":"arxiv","id":"1402.3613","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1402.3613","created_at":"2026-05-18T02:58:56Z"},{"alias_kind":"arxiv_version","alias_value":"1402.3613v1","created_at":"2026-05-18T02:58:56Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1402.3613","created_at":"2026-05-18T02:58:56Z"},{"alias_kind":"pith_short_12","alias_value":"TSXT4YLD434I","created_at":"2026-05-18T12:28:52Z"},{"alias_kind":"pith_short_16","alias_value":"TSXT4YLD434IN537","created_at":"2026-05-18T12:28:52Z"},{"alias_kind":"pith_short_8","alias_value":"TSXT4YLD","created_at":"2026-05-18T12:28:52Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2014:TSXT4YLD434IN537QWKEKTPJNW","target":"record","payload":{"canonical_record":{"source":{"id":"1402.3613","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2014-02-14T22:09:44Z","cross_cats_sorted":["cs.RO"],"title_canon_sha256":"2a65edfc78354c801d72f1b06ae45557e343b19ca99babac3f76733da63a6fa4","abstract_canon_sha256":"6e849e58bc95606d7c6bf20c1a724352d10ebfc03d25a600d434b1872b6301d5"},"schema_version":"1.0"},"canonical_sha256":"9caf3e6163e6f886f77f8594454de96dbcc7b6903310273892c8a02dc0c77d48","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:58:56.121891Z","signature_b64":"mXxLQaQ37UQZgN6rDl4fOOeRj4Rk7Oort7bxCJt2h+FoPAELFmy4i1zeStQk9PN3h3O2Uv87SlMy6gSASVsSDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"9caf3e6163e6f886f77f8594454de96dbcc7b6903310273892c8a02dc0c77d48","last_reissued_at":"2026-05-18T02:58:56.121125Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:58:56.121125Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1402.3613","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:58:56Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"bq9/g4NuoBMPvJyR/SdTNPXU9OXoPrVioDFEI5A/Ias1U3rpu0FMNv1ROlrOM1LbGQvyZo78fVpdzsetrMnRCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-26T00:14:44.456864Z"},"content_sha256":"71540927963b728db476cb5e5c5f55c9eb7d2b1aa089e59850ce845869c2e728","schema_version":"1.0","event_id":"sha256:71540927963b728db476cb5e5c5f55c9eb7d2b1aa089e59850ce845869c2e728"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2014:TSXT4YLD434IN537QWKEKTPJNW","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Finding Coordinated Paths for Multiple Holonomic Agents in 2-d Polygonal Environment","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.RO"],"primary_cat":"cs.AI","authors_text":"Ji\\v{r}\\'i Vok\\v{r}\\'inek, Michal \\v{C}\\'ap, Pavel Janovsk\\'y","submitted_at":"2014-02-14T22:09:44Z","abstract_excerpt":"Avoiding collisions is one of the vital tasks for systems of autonomous mobile agents. We focus on the problem of finding continuous coordinated paths for multiple mobile disc agents in a 2-d environment with polygonal obstacles. The problem is PSPACE-hard, with the state space growing exponentially in the number of agents. Therefore, the state of the art methods include mainly reactive techniques and sampling-based iterative algorithms.\n  We compare the performance of a widely-used reactive method ORCA with three variants of a popular planning algorithm RRT* applied to multi-agent path planni"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1402.3613","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:58:56Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ceYVLivcFT/Lcbymi6VVgSgfj8SFAcR6JgiPIkO2NfYK6aAMH5tDMSlJ+YvvKGNYfUx0z22VqtYeEXIx3e6RDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-26T00:14:44.457212Z"},"content_sha256":"6e05c0ca755645ee14f2cee6316624ffa50d3500ebda326e2d15ee266f8a839c","schema_version":"1.0","event_id":"sha256:6e05c0ca755645ee14f2cee6316624ffa50d3500ebda326e2d15ee266f8a839c"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/TSXT4YLD434IN537QWKEKTPJNW/bundle.json","state_url":"https://pith.science/pith/TSXT4YLD434IN537QWKEKTPJNW/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/TSXT4YLD434IN537QWKEKTPJNW/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-26T00:14:44Z","links":{"resolver":"https://pith.science/pith/TSXT4YLD434IN537QWKEKTPJNW","bundle":"https://pith.science/pith/TSXT4YLD434IN537QWKEKTPJNW/bundle.json","state":"https://pith.science/pith/TSXT4YLD434IN537QWKEKTPJNW/state.json","well_known_bundle":"https://pith.science/.well-known/pith/TSXT4YLD434IN537QWKEKTPJNW/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:TSXT4YLD434IN537QWKEKTPJNW","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":"6e849e58bc95606d7c6bf20c1a724352d10ebfc03d25a600d434b1872b6301d5","cross_cats_sorted":["cs.RO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2014-02-14T22:09:44Z","title_canon_sha256":"2a65edfc78354c801d72f1b06ae45557e343b19ca99babac3f76733da63a6fa4"},"schema_version":"1.0","source":{"id":"1402.3613","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1402.3613","created_at":"2026-05-18T02:58:56Z"},{"alias_kind":"arxiv_version","alias_value":"1402.3613v1","created_at":"2026-05-18T02:58:56Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1402.3613","created_at":"2026-05-18T02:58:56Z"},{"alias_kind":"pith_short_12","alias_value":"TSXT4YLD434I","created_at":"2026-05-18T12:28:52Z"},{"alias_kind":"pith_short_16","alias_value":"TSXT4YLD434IN537","created_at":"2026-05-18T12:28:52Z"},{"alias_kind":"pith_short_8","alias_value":"TSXT4YLD","created_at":"2026-05-18T12:28:52Z"}],"graph_snapshots":[{"event_id":"sha256:6e05c0ca755645ee14f2cee6316624ffa50d3500ebda326e2d15ee266f8a839c","target":"graph","created_at":"2026-05-18T02:58:56Z","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":"Avoiding collisions is one of the vital tasks for systems of autonomous mobile agents. We focus on the problem of finding continuous coordinated paths for multiple mobile disc agents in a 2-d environment with polygonal obstacles. The problem is PSPACE-hard, with the state space growing exponentially in the number of agents. Therefore, the state of the art methods include mainly reactive techniques and sampling-based iterative algorithms.\n  We compare the performance of a widely-used reactive method ORCA with three variants of a popular planning algorithm RRT* applied to multi-agent path planni","authors_text":"Ji\\v{r}\\'i Vok\\v{r}\\'inek, Michal \\v{C}\\'ap, Pavel Janovsk\\'y","cross_cats":["cs.RO"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2014-02-14T22:09:44Z","title":"Finding Coordinated Paths for Multiple Holonomic Agents in 2-d Polygonal Environment"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1402.3613","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:71540927963b728db476cb5e5c5f55c9eb7d2b1aa089e59850ce845869c2e728","target":"record","created_at":"2026-05-18T02:58:56Z","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":"6e849e58bc95606d7c6bf20c1a724352d10ebfc03d25a600d434b1872b6301d5","cross_cats_sorted":["cs.RO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2014-02-14T22:09:44Z","title_canon_sha256":"2a65edfc78354c801d72f1b06ae45557e343b19ca99babac3f76733da63a6fa4"},"schema_version":"1.0","source":{"id":"1402.3613","kind":"arxiv","version":1}},"canonical_sha256":"9caf3e6163e6f886f77f8594454de96dbcc7b6903310273892c8a02dc0c77d48","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"9caf3e6163e6f886f77f8594454de96dbcc7b6903310273892c8a02dc0c77d48","first_computed_at":"2026-05-18T02:58:56.121125Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:58:56.121125Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"mXxLQaQ37UQZgN6rDl4fOOeRj4Rk7Oort7bxCJt2h+FoPAELFmy4i1zeStQk9PN3h3O2Uv87SlMy6gSASVsSDw==","signature_status":"signed_v1","signed_at":"2026-05-18T02:58:56.121891Z","signed_message":"canonical_sha256_bytes"},"source_id":"1402.3613","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:71540927963b728db476cb5e5c5f55c9eb7d2b1aa089e59850ce845869c2e728","sha256:6e05c0ca755645ee14f2cee6316624ffa50d3500ebda326e2d15ee266f8a839c"],"state_sha256":"ae578dbe717a6002fc0b35a687aa323e53de7c360f3064c3c89ea3823a70703d"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"HqMcJ8JOrm2HLg+ZcU6vneVWWbPF9daUpoBFo4MAM82Uo5tlAZJ5+OXOc3306cz9W4uXtBbQKj0JqKIh+B9qCw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-26T00:14:44.459186Z","bundle_sha256":"22e738b86f882a967658889b39b4a5f65b6fcca0e1e58025c6e1007b216f581d"}}