{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2013:IRZ5LGPDCO3OMBFBWEU5EU76ZJ","short_pith_number":"pith:IRZ5LGPD","canonical_record":{"source":{"id":"1310.5828","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.RO","submitted_at":"2013-10-22T08:06:31Z","cross_cats_sorted":[],"title_canon_sha256":"f0a1e4e64ae4987d0ffc458c5f69bcbb2e752e6393ff5cfef604b222470d88ea","abstract_canon_sha256":"aaed3793f29b75ace61b4d2782cf827859a1474f5002529fbd54f1f8caad1b32"},"schema_version":"1.0"},"canonical_sha256":"4473d599e313b6e604a1b129d253feca7ec20bd5d53b668a16b69452f88cc754","source":{"kind":"arxiv","id":"1310.5828","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1310.5828","created_at":"2026-05-18T02:52:41Z"},{"alias_kind":"arxiv_version","alias_value":"1310.5828v2","created_at":"2026-05-18T02:52:41Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1310.5828","created_at":"2026-05-18T02:52:41Z"},{"alias_kind":"pith_short_12","alias_value":"IRZ5LGPDCO3O","created_at":"2026-05-18T12:27:49Z"},{"alias_kind":"pith_short_16","alias_value":"IRZ5LGPDCO3OMBFB","created_at":"2026-05-18T12:27:49Z"},{"alias_kind":"pith_short_8","alias_value":"IRZ5LGPD","created_at":"2026-05-18T12:27:49Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2013:IRZ5LGPDCO3OMBFBWEU5EU76ZJ","target":"record","payload":{"canonical_record":{"source":{"id":"1310.5828","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.RO","submitted_at":"2013-10-22T08:06:31Z","cross_cats_sorted":[],"title_canon_sha256":"f0a1e4e64ae4987d0ffc458c5f69bcbb2e752e6393ff5cfef604b222470d88ea","abstract_canon_sha256":"aaed3793f29b75ace61b4d2782cf827859a1474f5002529fbd54f1f8caad1b32"},"schema_version":"1.0"},"canonical_sha256":"4473d599e313b6e604a1b129d253feca7ec20bd5d53b668a16b69452f88cc754","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:52:41.825139Z","signature_b64":"PovlOMTRvEUixK+w2MPWTgwvWLn227+hgWQfi+4yhVhOWsMd3RWYHLpEdkbZIKYR0BQMzuKwazVArMyu6seSBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"4473d599e313b6e604a1b129d253feca7ec20bd5d53b668a16b69452f88cc754","last_reissued_at":"2026-05-18T02:52:41.824573Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:52:41.824573Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1310.5828","source_version":2,"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:52:41Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"O4fW4CzHRZItvnJ4OYlYpT2Rri5upBWiMccRmmU+l9HzMWWgNEIn0RFfrCPUuJtb0adPm0lMGgB6PS/QiG70Dg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-01T19:40:45.177486Z"},"content_sha256":"344c23842734224ff15778cf52888d7205b6a0d29005b56e382c644b259f6e92","schema_version":"1.0","event_id":"sha256:344c23842734224ff15778cf52888d7205b6a0d29005b56e382c644b259f6e92"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2013:IRZ5LGPDCO3OMBFBWEU5EU76ZJ","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Priority-based intersection management with kinodynamic constraints","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.RO","authors_text":"Arnaud de La Fortelle, Jean Gregoire, Silv\\`ere Bonnabel","submitted_at":"2013-10-22T08:06:31Z","abstract_excerpt":"We consider the problem of coordinating a collection of robots at an intersection area taking into account dynamical constraints due to actuator limitations. We adopt the coordination space approach, which is standard in multiple robot motion planning. Assuming the priorities between robots are assigned in advance and the existence of a collision-free trajectory respecting those priorities, we propose a provably safe trajectory planner satisfying kinodynamic constraints. The algorithm is shown to run in real time and to return safe (collision-free) trajectories. Simulation results on synthetic"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1310.5828","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":""},"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:52:41Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"wzhzj61vrYoQQlYfPpy2LEFjNQbfm0bIBancYe4p6jvC2NzijBoVwbU5rbV68xViLNxDu6iiCjCa0Ncd89JABw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-01T19:40:45.177843Z"},"content_sha256":"ab8cb313080fc6398b0c51af8029f98007e69d181bef4d62b477cfb034009c5f","schema_version":"1.0","event_id":"sha256:ab8cb313080fc6398b0c51af8029f98007e69d181bef4d62b477cfb034009c5f"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/IRZ5LGPDCO3OMBFBWEU5EU76ZJ/bundle.json","state_url":"https://pith.science/pith/IRZ5LGPDCO3OMBFBWEU5EU76ZJ/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/IRZ5LGPDCO3OMBFBWEU5EU76ZJ/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-01T19:40:45Z","links":{"resolver":"https://pith.science/pith/IRZ5LGPDCO3OMBFBWEU5EU76ZJ","bundle":"https://pith.science/pith/IRZ5LGPDCO3OMBFBWEU5EU76ZJ/bundle.json","state":"https://pith.science/pith/IRZ5LGPDCO3OMBFBWEU5EU76ZJ/state.json","well_known_bundle":"https://pith.science/.well-known/pith/IRZ5LGPDCO3OMBFBWEU5EU76ZJ/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2013:IRZ5LGPDCO3OMBFBWEU5EU76ZJ","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":"aaed3793f29b75ace61b4d2782cf827859a1474f5002529fbd54f1f8caad1b32","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.RO","submitted_at":"2013-10-22T08:06:31Z","title_canon_sha256":"f0a1e4e64ae4987d0ffc458c5f69bcbb2e752e6393ff5cfef604b222470d88ea"},"schema_version":"1.0","source":{"id":"1310.5828","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1310.5828","created_at":"2026-05-18T02:52:41Z"},{"alias_kind":"arxiv_version","alias_value":"1310.5828v2","created_at":"2026-05-18T02:52:41Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1310.5828","created_at":"2026-05-18T02:52:41Z"},{"alias_kind":"pith_short_12","alias_value":"IRZ5LGPDCO3O","created_at":"2026-05-18T12:27:49Z"},{"alias_kind":"pith_short_16","alias_value":"IRZ5LGPDCO3OMBFB","created_at":"2026-05-18T12:27:49Z"},{"alias_kind":"pith_short_8","alias_value":"IRZ5LGPD","created_at":"2026-05-18T12:27:49Z"}],"graph_snapshots":[{"event_id":"sha256:ab8cb313080fc6398b0c51af8029f98007e69d181bef4d62b477cfb034009c5f","target":"graph","created_at":"2026-05-18T02:52:41Z","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":"We consider the problem of coordinating a collection of robots at an intersection area taking into account dynamical constraints due to actuator limitations. We adopt the coordination space approach, which is standard in multiple robot motion planning. Assuming the priorities between robots are assigned in advance and the existence of a collision-free trajectory respecting those priorities, we propose a provably safe trajectory planner satisfying kinodynamic constraints. The algorithm is shown to run in real time and to return safe (collision-free) trajectories. Simulation results on synthetic","authors_text":"Arnaud de La Fortelle, Jean Gregoire, Silv\\`ere Bonnabel","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.RO","submitted_at":"2013-10-22T08:06:31Z","title":"Priority-based intersection management with kinodynamic constraints"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1310.5828","kind":"arxiv","version":2},"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:344c23842734224ff15778cf52888d7205b6a0d29005b56e382c644b259f6e92","target":"record","created_at":"2026-05-18T02:52:41Z","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":"aaed3793f29b75ace61b4d2782cf827859a1474f5002529fbd54f1f8caad1b32","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.RO","submitted_at":"2013-10-22T08:06:31Z","title_canon_sha256":"f0a1e4e64ae4987d0ffc458c5f69bcbb2e752e6393ff5cfef604b222470d88ea"},"schema_version":"1.0","source":{"id":"1310.5828","kind":"arxiv","version":2}},"canonical_sha256":"4473d599e313b6e604a1b129d253feca7ec20bd5d53b668a16b69452f88cc754","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"4473d599e313b6e604a1b129d253feca7ec20bd5d53b668a16b69452f88cc754","first_computed_at":"2026-05-18T02:52:41.824573Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:52:41.824573Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"PovlOMTRvEUixK+w2MPWTgwvWLn227+hgWQfi+4yhVhOWsMd3RWYHLpEdkbZIKYR0BQMzuKwazVArMyu6seSBA==","signature_status":"signed_v1","signed_at":"2026-05-18T02:52:41.825139Z","signed_message":"canonical_sha256_bytes"},"source_id":"1310.5828","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:344c23842734224ff15778cf52888d7205b6a0d29005b56e382c644b259f6e92","sha256:ab8cb313080fc6398b0c51af8029f98007e69d181bef4d62b477cfb034009c5f"],"state_sha256":"aa44271533dee41168298edcbd0fe0f52ac0e4c76f14e8b45f82ba6f22f5d7e8"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"zsdsLW6qm7vuXpxmUhYYcd8ih858CdDAfDnaPUVBwP7ImUkpAR3s9NdN3ssionNYz9OFjPOOgvps2g6OhB12Aw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-01T19:40:45.179862Z","bundle_sha256":"8090635aea01a44d13828c006a749ac962423a68ea1d5a6552dec2b7c7e8baf3"}}