{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2013:AIWEIH6WIZ7P6EEXJL2TX4VNLU","short_pith_number":"pith:AIWEIH6W","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"},"canonical_sha256":"022c441fd6467eff10974af53bf2ad5d199a1f13e710ce5781141515848e3277","source":{"kind":"arxiv","id":"1310.7729","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1310.7729","created_at":"2026-05-18T03:08:35Z"},{"alias_kind":"arxiv_version","alias_value":"1310.7729v1","created_at":"2026-05-18T03:08:35Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1310.7729","created_at":"2026-05-18T03:08:35Z"},{"alias_kind":"pith_short_12","alias_value":"AIWEIH6WIZ7P","created_at":"2026-05-18T12:27:38Z"},{"alias_kind":"pith_short_16","alias_value":"AIWEIH6WIZ7P6EEX","created_at":"2026-05-18T12:27:38Z"},{"alias_kind":"pith_short_8","alias_value":"AIWEIH6W","created_at":"2026-05-18T12:27:38Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2013:AIWEIH6WIZ7P6EEXJL2TX4VNLU","target":"record","payload":{"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"},"canonical_sha256":"022c441fd6467eff10974af53bf2ad5d199a1f13e710ce5781141515848e3277","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"},"source_kind":"arxiv","source_id":"1310.7729","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-18T03:08:35Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"L4QYBwDfZwO9nbv0U66UwLBEoczpIHfodxYkNWBa1/2akDXOC0Qg8zlKWw8yqe8wAFl9ihk6PFQyMsAHyZHGDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-02T22:06:54.593346Z"},"content_sha256":"ddf4c95066b908eef439f24af04c0dc0b67736c62d763425d50025681e9f811a","schema_version":"1.0","event_id":"sha256:ddf4c95066b908eef439f24af04c0dc0b67736c62d763425d50025681e9f811a"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2013:AIWEIH6WIZ7P6EEXJL2TX4VNLU","target":"graph","payload":{"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"},"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-18T03:08:35Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"HkrKq0WKH5cGdQQXu0GCNhnWNuc2qOF5n41NqfBUkD8QcSX2cRoX9DnQXlNgeXInxpY0PHKX+vD5DvXr5zH9AA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-02T22:06:54.593698Z"},"content_sha256":"01c681f2063c7f2e70b6f04babe717ba9d34782af09533ea29f79c24c0d82129","schema_version":"1.0","event_id":"sha256:01c681f2063c7f2e70b6f04babe717ba9d34782af09533ea29f79c24c0d82129"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/AIWEIH6WIZ7P6EEXJL2TX4VNLU/bundle.json","state_url":"https://pith.science/pith/AIWEIH6WIZ7P6EEXJL2TX4VNLU/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/AIWEIH6WIZ7P6EEXJL2TX4VNLU/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-02T22:06:54Z","links":{"resolver":"https://pith.science/pith/AIWEIH6WIZ7P6EEXJL2TX4VNLU","bundle":"https://pith.science/pith/AIWEIH6WIZ7P6EEXJL2TX4VNLU/bundle.json","state":"https://pith.science/pith/AIWEIH6WIZ7P6EEXJL2TX4VNLU/state.json","well_known_bundle":"https://pith.science/.well-known/pith/AIWEIH6WIZ7P6EEXJL2TX4VNLU/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2013:AIWEIH6WIZ7P6EEXJL2TX4VNLU","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":"f88f2c43a1169b0a1f15f726e54719947fec04abfc7aa3f7a5f57bf881c606ac","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SY","submitted_at":"2013-10-29T09:52:52Z","title_canon_sha256":"3787a3051cd43633247d4d5ee13b73cc37f351cae9bb739de07d06ab42e8fbb6"},"schema_version":"1.0","source":{"id":"1310.7729","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1310.7729","created_at":"2026-05-18T03:08:35Z"},{"alias_kind":"arxiv_version","alias_value":"1310.7729v1","created_at":"2026-05-18T03:08:35Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1310.7729","created_at":"2026-05-18T03:08:35Z"},{"alias_kind":"pith_short_12","alias_value":"AIWEIH6WIZ7P","created_at":"2026-05-18T12:27:38Z"},{"alias_kind":"pith_short_16","alias_value":"AIWEIH6WIZ7P6EEX","created_at":"2026-05-18T12:27:38Z"},{"alias_kind":"pith_short_8","alias_value":"AIWEIH6W","created_at":"2026-05-18T12:27:38Z"}],"graph_snapshots":[{"event_id":"sha256:01c681f2063c7f2e70b6f04babe717ba9d34782af09533ea29f79c24c0d82129","target":"graph","created_at":"2026-05-18T03:08:35Z","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 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","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.SY","submitted_at":"2013-10-29T09:52:52Z","title":"Optimal cooperative motion planning for vehicles at intersections"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1310.7729","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:ddf4c95066b908eef439f24af04c0dc0b67736c62d763425d50025681e9f811a","target":"record","created_at":"2026-05-18T03:08:35Z","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":"f88f2c43a1169b0a1f15f726e54719947fec04abfc7aa3f7a5f57bf881c606ac","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SY","submitted_at":"2013-10-29T09:52:52Z","title_canon_sha256":"3787a3051cd43633247d4d5ee13b73cc37f351cae9bb739de07d06ab42e8fbb6"},"schema_version":"1.0","source":{"id":"1310.7729","kind":"arxiv","version":1}},"canonical_sha256":"022c441fd6467eff10974af53bf2ad5d199a1f13e710ce5781141515848e3277","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"022c441fd6467eff10974af53bf2ad5d199a1f13e710ce5781141515848e3277","first_computed_at":"2026-05-18T03:08:35.424635Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:08:35.424635Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"phqn+NDm2TyrHV9XGn0siViBcOw2Xy8TX83coNNnZGfIdV/0IS6/+r3yLoiQYr0B28PoA7h6nAmNzknJGk2+BA==","signature_status":"signed_v1","signed_at":"2026-05-18T03:08:35.425218Z","signed_message":"canonical_sha256_bytes"},"source_id":"1310.7729","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:ddf4c95066b908eef439f24af04c0dc0b67736c62d763425d50025681e9f811a","sha256:01c681f2063c7f2e70b6f04babe717ba9d34782af09533ea29f79c24c0d82129"],"state_sha256":"94d6d700fab453f2d791699c32a5ef04057d33f9e695733d533f07a6924c907d"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"MyzgK2o+5nktqzrpVJ/fHDZRJCREMdy+2Ehl/sG73rKuYZrWA9HWoPPsPY4Pq0QAVjSDTR6a4VKv4Cg4jhlwDQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-02T22:06:54.595688Z","bundle_sha256":"70a39817deb46fa972013d758b528a7598f3be2e89e5f679e5270c3317e37baa"}}