{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2013:AIWEIH6WIZ7P6EEXJL2TX4VNLU","short_pith_number":"pith:AIWEIH6W","schema_version":"1.0","canonical_sha256":"022c441fd6467eff10974af53bf2ad5d199a1f13e710ce5781141515848e3277","source":{"kind":"arxiv","id":"1310.7729","version":1},"attestation_state":"computed","paper":{"title":"Optimal cooperative motion planning for vehicles at intersections","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.SY","authors_text":"Arnaud de La Fortelle, Jean Gregoire, Silv\\`ere Bonnabel","submitted_at":"2013-10-29T09:52:52Z","abstract_excerpt":"We consider the problem of cooperative intersection management. It arises in automated transportation systems for people or goods but also in multi-robots environment. Therefore many solutions have been proposed to avoid collisions. The main problem is to determine collision-free but also deadlock-free and optimal algorithms. Even with a simple definition of optimality, finding a global optimum is a problem of high complexity, especially for open systems involving a large and varying number of vehicles. This paper advocates the use of a mathematical framework based on a decomposition of the pr"},"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":"1310.7729","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SY","submitted_at":"2013-10-29T09:52:52Z","cross_cats_sorted":[],"title_canon_sha256":"3787a3051cd43633247d4d5ee13b73cc37f351cae9bb739de07d06ab42e8fbb6","abstract_canon_sha256":"f88f2c43a1169b0a1f15f726e54719947fec04abfc7aa3f7a5f57bf881c606ac"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:08:35.425218Z","signature_b64":"phqn+NDm2TyrHV9XGn0siViBcOw2Xy8TX83coNNnZGfIdV/0IS6/+r3yLoiQYr0B28PoA7h6nAmNzknJGk2+BA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"022c441fd6467eff10974af53bf2ad5d199a1f13e710ce5781141515848e3277","last_reissued_at":"2026-05-18T03:08:35.424635Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:08:35.424635Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Optimal cooperative motion planning for vehicles at intersections","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.SY","authors_text":"Arnaud de La Fortelle, Jean Gregoire, Silv\\`ere Bonnabel","submitted_at":"2013-10-29T09:52:52Z","abstract_excerpt":"We consider the problem of cooperative intersection management. It arises in automated transportation systems for people or goods but also in multi-robots environment. Therefore many solutions have been proposed to avoid collisions. The main problem is to determine collision-free but also deadlock-free and optimal algorithms. Even with a simple definition of optimality, finding a global optimum is a problem of high complexity, especially for open systems involving a large and varying number of vehicles. This paper advocates the use of a mathematical framework based on a decomposition of the pr"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1310.7729","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":"1310.7729","created_at":"2026-05-18T03:08:35.424725+00:00"},{"alias_kind":"arxiv_version","alias_value":"1310.7729v1","created_at":"2026-05-18T03:08:35.424725+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1310.7729","created_at":"2026-05-18T03:08:35.424725+00:00"},{"alias_kind":"pith_short_12","alias_value":"AIWEIH6WIZ7P","created_at":"2026-05-18T12:27:38.830355+00:00"},{"alias_kind":"pith_short_16","alias_value":"AIWEIH6WIZ7P6EEX","created_at":"2026-05-18T12:27:38.830355+00:00"},{"alias_kind":"pith_short_8","alias_value":"AIWEIH6W","created_at":"2026-05-18T12:27:38.830355+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/AIWEIH6WIZ7P6EEXJL2TX4VNLU","json":"https://pith.science/pith/AIWEIH6WIZ7P6EEXJL2TX4VNLU.json","graph_json":"https://pith.science/api/pith-number/AIWEIH6WIZ7P6EEXJL2TX4VNLU/graph.json","events_json":"https://pith.science/api/pith-number/AIWEIH6WIZ7P6EEXJL2TX4VNLU/events.json","paper":"https://pith.science/paper/AIWEIH6W"},"agent_actions":{"view_html":"https://pith.science/pith/AIWEIH6WIZ7P6EEXJL2TX4VNLU","download_json":"https://pith.science/pith/AIWEIH6WIZ7P6EEXJL2TX4VNLU.json","view_paper":"https://pith.science/paper/AIWEIH6W","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1310.7729&json=true","fetch_graph":"https://pith.science/api/pith-number/AIWEIH6WIZ7P6EEXJL2TX4VNLU/graph.json","fetch_events":"https://pith.science/api/pith-number/AIWEIH6WIZ7P6EEXJL2TX4VNLU/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/AIWEIH6WIZ7P6EEXJL2TX4VNLU/action/timestamp_anchor","attest_storage":"https://pith.science/pith/AIWEIH6WIZ7P6EEXJL2TX4VNLU/action/storage_attestation","attest_author":"https://pith.science/pith/AIWEIH6WIZ7P6EEXJL2TX4VNLU/action/author_attestation","sign_citation":"https://pith.science/pith/AIWEIH6WIZ7P6EEXJL2TX4VNLU/action/citation_signature","submit_replication":"https://pith.science/pith/AIWEIH6WIZ7P6EEXJL2TX4VNLU/action/replication_record"}},"created_at":"2026-05-18T03:08:35.424725+00:00","updated_at":"2026-05-18T03:08:35.424725+00:00"}