{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2013:KJLC4KLXKE263HEQ7FLTQSYDYU","short_pith_number":"pith:KJLC4KLX","canonical_record":{"source":{"id":"1306.0785","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.RO","submitted_at":"2013-06-04T13:40:47Z","cross_cats_sorted":[],"title_canon_sha256":"234ab70b10cae3614a9c7f35ba0144b5e8cc86a2647b8655539faadf0292d6be","abstract_canon_sha256":"1c632f6ee842f1a285a9a84f9e8bba4d7732c42fe4a3e8f6e3e4ccba74338535"},"schema_version":"1.0"},"canonical_sha256":"52562e29775135ed9c90f957384b03c509a50e2f4bbdad04afcf538466c6a410","source":{"kind":"arxiv","id":"1306.0785","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1306.0785","created_at":"2026-05-18T01:35:57Z"},{"alias_kind":"arxiv_version","alias_value":"1306.0785v3","created_at":"2026-05-18T01:35:57Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1306.0785","created_at":"2026-05-18T01:35:57Z"},{"alias_kind":"pith_short_12","alias_value":"KJLC4KLXKE26","created_at":"2026-05-18T12:27:49Z"},{"alias_kind":"pith_short_16","alias_value":"KJLC4KLXKE263HEQ","created_at":"2026-05-18T12:27:49Z"},{"alias_kind":"pith_short_8","alias_value":"KJLC4KLX","created_at":"2026-05-18T12:27:49Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2013:KJLC4KLXKE263HEQ7FLTQSYDYU","target":"record","payload":{"canonical_record":{"source":{"id":"1306.0785","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.RO","submitted_at":"2013-06-04T13:40:47Z","cross_cats_sorted":[],"title_canon_sha256":"234ab70b10cae3614a9c7f35ba0144b5e8cc86a2647b8655539faadf0292d6be","abstract_canon_sha256":"1c632f6ee842f1a285a9a84f9e8bba4d7732c42fe4a3e8f6e3e4ccba74338535"},"schema_version":"1.0"},"canonical_sha256":"52562e29775135ed9c90f957384b03c509a50e2f4bbdad04afcf538466c6a410","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:35:57.592813Z","signature_b64":"jSt030C7P/B04gOTeWttd1vShW4vMsJvEOTh8/EjI8e894eLsXiJ2jAYtWU0taMuFFtVnGAzSwBBjg8MlWaDDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"52562e29775135ed9c90f957384b03c509a50e2f4bbdad04afcf538466c6a410","last_reissued_at":"2026-05-18T01:35:57.592390Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:35:57.592390Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1306.0785","source_version":3,"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-18T01:35:57Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"YoTyy1vWPP94mZbtl8homhOrosSxbPxwART+XGRPcEtKvqNqOJT+f1OrfQPSlMOtySICHgbaXRiYymlSnUSKBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-02T07:19:54.970809Z"},"content_sha256":"27a29c17e7baf835bd7fff3c51ce4953f37bc7eefbc3e6c32ba1cc03c14c40e2","schema_version":"1.0","event_id":"sha256:27a29c17e7baf835bd7fff3c51ce4953f37bc7eefbc3e6c32ba1cc03c14c40e2"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2013:KJLC4KLXKE263HEQ7FLTQSYDYU","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Robust multirobot coordination using priority encoded homotopic 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-06-04T13:40:47Z","abstract_excerpt":"We study the problem of coordinating multiple robots along fixed geometric paths. Our contribution is threefold. First we formalize the intuitive concept of priorities as a binary relation induced by a feasible coordination solution, without excluding the case of robots following each other on the same geometric path. Then we prove that two paths in the coordination space are continuously deformable into each other if and only if they induce the \\emph{same priority graph}, that is, the priority graph uniquely encodes homotopy classes of coordination solutions. Finally, we give a simple control"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1306.0785","kind":"arxiv","version":3},"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-18T01:35:57Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"4pfZ+MiJhLZuG2A8iPtvMcigdlN/2z3t5zgrvoADb0gkwLn91EqzB0nckm29k8LZwwPxCMbpE5ZEPuJDPiCdDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-02T07:19:54.971152Z"},"content_sha256":"12975e6198bcb59767074b45569e0cbab7da0582a8b3e45e699904d55a50699f","schema_version":"1.0","event_id":"sha256:12975e6198bcb59767074b45569e0cbab7da0582a8b3e45e699904d55a50699f"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/KJLC4KLXKE263HEQ7FLTQSYDYU/bundle.json","state_url":"https://pith.science/pith/KJLC4KLXKE263HEQ7FLTQSYDYU/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/KJLC4KLXKE263HEQ7FLTQSYDYU/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-02T07:19:54Z","links":{"resolver":"https://pith.science/pith/KJLC4KLXKE263HEQ7FLTQSYDYU","bundle":"https://pith.science/pith/KJLC4KLXKE263HEQ7FLTQSYDYU/bundle.json","state":"https://pith.science/pith/KJLC4KLXKE263HEQ7FLTQSYDYU/state.json","well_known_bundle":"https://pith.science/.well-known/pith/KJLC4KLXKE263HEQ7FLTQSYDYU/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2013:KJLC4KLXKE263HEQ7FLTQSYDYU","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":"1c632f6ee842f1a285a9a84f9e8bba4d7732c42fe4a3e8f6e3e4ccba74338535","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.RO","submitted_at":"2013-06-04T13:40:47Z","title_canon_sha256":"234ab70b10cae3614a9c7f35ba0144b5e8cc86a2647b8655539faadf0292d6be"},"schema_version":"1.0","source":{"id":"1306.0785","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1306.0785","created_at":"2026-05-18T01:35:57Z"},{"alias_kind":"arxiv_version","alias_value":"1306.0785v3","created_at":"2026-05-18T01:35:57Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1306.0785","created_at":"2026-05-18T01:35:57Z"},{"alias_kind":"pith_short_12","alias_value":"KJLC4KLXKE26","created_at":"2026-05-18T12:27:49Z"},{"alias_kind":"pith_short_16","alias_value":"KJLC4KLXKE263HEQ","created_at":"2026-05-18T12:27:49Z"},{"alias_kind":"pith_short_8","alias_value":"KJLC4KLX","created_at":"2026-05-18T12:27:49Z"}],"graph_snapshots":[{"event_id":"sha256:12975e6198bcb59767074b45569e0cbab7da0582a8b3e45e699904d55a50699f","target":"graph","created_at":"2026-05-18T01:35:57Z","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 study the problem of coordinating multiple robots along fixed geometric paths. Our contribution is threefold. First we formalize the intuitive concept of priorities as a binary relation induced by a feasible coordination solution, without excluding the case of robots following each other on the same geometric path. Then we prove that two paths in the coordination space are continuously deformable into each other if and only if they induce the \\emph{same priority graph}, that is, the priority graph uniquely encodes homotopy classes of coordination solutions. Finally, we give a simple control","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-06-04T13:40:47Z","title":"Robust multirobot coordination using priority encoded homotopic constraints"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1306.0785","kind":"arxiv","version":3},"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:27a29c17e7baf835bd7fff3c51ce4953f37bc7eefbc3e6c32ba1cc03c14c40e2","target":"record","created_at":"2026-05-18T01:35:57Z","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":"1c632f6ee842f1a285a9a84f9e8bba4d7732c42fe4a3e8f6e3e4ccba74338535","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.RO","submitted_at":"2013-06-04T13:40:47Z","title_canon_sha256":"234ab70b10cae3614a9c7f35ba0144b5e8cc86a2647b8655539faadf0292d6be"},"schema_version":"1.0","source":{"id":"1306.0785","kind":"arxiv","version":3}},"canonical_sha256":"52562e29775135ed9c90f957384b03c509a50e2f4bbdad04afcf538466c6a410","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"52562e29775135ed9c90f957384b03c509a50e2f4bbdad04afcf538466c6a410","first_computed_at":"2026-05-18T01:35:57.592390Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:35:57.592390Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"jSt030C7P/B04gOTeWttd1vShW4vMsJvEOTh8/EjI8e894eLsXiJ2jAYtWU0taMuFFtVnGAzSwBBjg8MlWaDDw==","signature_status":"signed_v1","signed_at":"2026-05-18T01:35:57.592813Z","signed_message":"canonical_sha256_bytes"},"source_id":"1306.0785","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:27a29c17e7baf835bd7fff3c51ce4953f37bc7eefbc3e6c32ba1cc03c14c40e2","sha256:12975e6198bcb59767074b45569e0cbab7da0582a8b3e45e699904d55a50699f"],"state_sha256":"fcd93a5e71e3f952a969b71094c6546db538d3baf1c9ffad6baee935a9d8316a"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"i4lp4HJIY26sB0J1fmP/esUkbdhALNTqHeD3AAYjRerUMMfnY97bQUSEbqQqCDCXWqysTPvB+mwF5Mx/lY2dCQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-02T07:19:54.973059Z","bundle_sha256":"aaf300da278bd7184438e7c633d250336de255551f8e290ee49023bbdf4a330b"}}