{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2011:E5YD3YIQKU4DVDVJT6U5XBFQY6","short_pith_number":"pith:E5YD3YIQ","canonical_record":{"source":{"id":"1107.0062","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.RO","submitted_at":"2011-06-30T21:39:20Z","cross_cats_sorted":[],"title_canon_sha256":"908478e667a58aab32750cbbb8e7c5b2444352a5cb95b827b36810e1b04be798","abstract_canon_sha256":"9fcf74276af55c4f6dc746dbde5849ef3ce054726387efb68ef863ee6a44045d"},"schema_version":"1.0"},"canonical_sha256":"27703de11055383a8ea99fa9db84b0c7bf9b37dc929cfc8ee09b808e13d102df","source":{"kind":"arxiv","id":"1107.0062","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1107.0062","created_at":"2026-05-18T02:25:12Z"},{"alias_kind":"arxiv_version","alias_value":"1107.0062v1","created_at":"2026-05-18T02:25:12Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1107.0062","created_at":"2026-05-18T02:25:12Z"},{"alias_kind":"pith_short_12","alias_value":"E5YD3YIQKU4D","created_at":"2026-05-18T12:26:26Z"},{"alias_kind":"pith_short_16","alias_value":"E5YD3YIQKU4DVDVJ","created_at":"2026-05-18T12:26:26Z"},{"alias_kind":"pith_short_8","alias_value":"E5YD3YIQ","created_at":"2026-05-18T12:26:26Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2011:E5YD3YIQKU4DVDVJT6U5XBFQY6","target":"record","payload":{"canonical_record":{"source":{"id":"1107.0062","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.RO","submitted_at":"2011-06-30T21:39:20Z","cross_cats_sorted":[],"title_canon_sha256":"908478e667a58aab32750cbbb8e7c5b2444352a5cb95b827b36810e1b04be798","abstract_canon_sha256":"9fcf74276af55c4f6dc746dbde5849ef3ce054726387efb68ef863ee6a44045d"},"schema_version":"1.0"},"canonical_sha256":"27703de11055383a8ea99fa9db84b0c7bf9b37dc929cfc8ee09b808e13d102df","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:25:12.050159Z","signature_b64":"9E979R0AXc+X88KSU2HY/eg1WfxPRO8hCY0nL4lyL0OQ0/0C5i6hXSQ68DZ8uYbrFFBdo7PvSBqqroj4RxibAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"27703de11055383a8ea99fa9db84b0c7bf9b37dc929cfc8ee09b808e13d102df","last_reissued_at":"2026-05-18T02:25:12.049613Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:25:12.049613Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1107.0062","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:25:12Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"NqFZGNlI3Wwu47Hdoa4BdYdTLUcfze67vNE9EKCfdqGDRAKxiJcBcsdwaLwycukvPZE1a7VfiCBRnZtrXg2ICQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-10T17:22:28.155239Z"},"content_sha256":"34ea84c261760cb7c68eccdb4d872a605c24911413d947af1e4d5473b7e3bb4c","schema_version":"1.0","event_id":"sha256:34ea84c261760cb7c68eccdb4d872a605c24911413d947af1e4d5473b7e3bb4c"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2011:E5YD3YIQKU4DVDVJT6U5XBFQY6","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Optimal Multi-Robot Path Planning with Temporal Logic Constraints","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.RO","authors_text":"Alphan Ulusoy, Calin Belta, Daniela Rus, Stephen L. Smith, Xu Chu Ding","submitted_at":"2011-06-30T21:39:20Z","abstract_excerpt":"In this paper we present a method for automatically planning optimal paths for a group of robots that satisfy a common high level mission specification. Each robot's motion in the environment is modeled as a weighted transition system. The mission is given as a Linear Temporal Logic formula. In addition, an optimizing proposition must repeatedly be satisfied. The goal is to minimize the maximum time between satisfying instances of the optimizing proposition. Our method is guaranteed to compute an optimal set of robot paths. We utilize a timed automaton representation in order to capture the re"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1107.0062","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:25:12Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Uix+869oHtt2TxvwapMpdQiv4YDMV+9ZYtrWaZcxwIL1bUWq/2rtZ+5e+DvxTGlDoESVZwWIk4Mfw8e9xt49CQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-10T17:22:28.155869Z"},"content_sha256":"a3b779e9edd83ea79708e67ffbc14e9ec500dea45d34fafc247620498fd57fd1","schema_version":"1.0","event_id":"sha256:a3b779e9edd83ea79708e67ffbc14e9ec500dea45d34fafc247620498fd57fd1"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/E5YD3YIQKU4DVDVJT6U5XBFQY6/bundle.json","state_url":"https://pith.science/pith/E5YD3YIQKU4DVDVJT6U5XBFQY6/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/E5YD3YIQKU4DVDVJT6U5XBFQY6/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-10T17:22:28Z","links":{"resolver":"https://pith.science/pith/E5YD3YIQKU4DVDVJT6U5XBFQY6","bundle":"https://pith.science/pith/E5YD3YIQKU4DVDVJT6U5XBFQY6/bundle.json","state":"https://pith.science/pith/E5YD3YIQKU4DVDVJT6U5XBFQY6/state.json","well_known_bundle":"https://pith.science/.well-known/pith/E5YD3YIQKU4DVDVJT6U5XBFQY6/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2011:E5YD3YIQKU4DVDVJT6U5XBFQY6","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":"9fcf74276af55c4f6dc746dbde5849ef3ce054726387efb68ef863ee6a44045d","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.RO","submitted_at":"2011-06-30T21:39:20Z","title_canon_sha256":"908478e667a58aab32750cbbb8e7c5b2444352a5cb95b827b36810e1b04be798"},"schema_version":"1.0","source":{"id":"1107.0062","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1107.0062","created_at":"2026-05-18T02:25:12Z"},{"alias_kind":"arxiv_version","alias_value":"1107.0062v1","created_at":"2026-05-18T02:25:12Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1107.0062","created_at":"2026-05-18T02:25:12Z"},{"alias_kind":"pith_short_12","alias_value":"E5YD3YIQKU4D","created_at":"2026-05-18T12:26:26Z"},{"alias_kind":"pith_short_16","alias_value":"E5YD3YIQKU4DVDVJ","created_at":"2026-05-18T12:26:26Z"},{"alias_kind":"pith_short_8","alias_value":"E5YD3YIQ","created_at":"2026-05-18T12:26:26Z"}],"graph_snapshots":[{"event_id":"sha256:a3b779e9edd83ea79708e67ffbc14e9ec500dea45d34fafc247620498fd57fd1","target":"graph","created_at":"2026-05-18T02:25:12Z","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":"In this paper we present a method for automatically planning optimal paths for a group of robots that satisfy a common high level mission specification. Each robot's motion in the environment is modeled as a weighted transition system. The mission is given as a Linear Temporal Logic formula. In addition, an optimizing proposition must repeatedly be satisfied. The goal is to minimize the maximum time between satisfying instances of the optimizing proposition. Our method is guaranteed to compute an optimal set of robot paths. We utilize a timed automaton representation in order to capture the re","authors_text":"Alphan Ulusoy, Calin Belta, Daniela Rus, Stephen L. Smith, Xu Chu Ding","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.RO","submitted_at":"2011-06-30T21:39:20Z","title":"Optimal Multi-Robot Path Planning with Temporal Logic Constraints"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1107.0062","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:34ea84c261760cb7c68eccdb4d872a605c24911413d947af1e4d5473b7e3bb4c","target":"record","created_at":"2026-05-18T02:25:12Z","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":"9fcf74276af55c4f6dc746dbde5849ef3ce054726387efb68ef863ee6a44045d","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.RO","submitted_at":"2011-06-30T21:39:20Z","title_canon_sha256":"908478e667a58aab32750cbbb8e7c5b2444352a5cb95b827b36810e1b04be798"},"schema_version":"1.0","source":{"id":"1107.0062","kind":"arxiv","version":1}},"canonical_sha256":"27703de11055383a8ea99fa9db84b0c7bf9b37dc929cfc8ee09b808e13d102df","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"27703de11055383a8ea99fa9db84b0c7bf9b37dc929cfc8ee09b808e13d102df","first_computed_at":"2026-05-18T02:25:12.049613Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:25:12.049613Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"9E979R0AXc+X88KSU2HY/eg1WfxPRO8hCY0nL4lyL0OQ0/0C5i6hXSQ68DZ8uYbrFFBdo7PvSBqqroj4RxibAA==","signature_status":"signed_v1","signed_at":"2026-05-18T02:25:12.050159Z","signed_message":"canonical_sha256_bytes"},"source_id":"1107.0062","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:34ea84c261760cb7c68eccdb4d872a605c24911413d947af1e4d5473b7e3bb4c","sha256:a3b779e9edd83ea79708e67ffbc14e9ec500dea45d34fafc247620498fd57fd1"],"state_sha256":"865a62d2363b0bd5a9332ca4bb8c5edaf663301f1dd99ce3df98ea64bde6d4f2"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"/Sw7cpBKO5bzLgdTzPz7Tx35lNVH9fPzNK2plYO+YcmakiQ3rUzWBu6fEi+ilo0ZfZd0muzH0R92qyKcPnHUAA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-10T17:22:28.160604Z","bundle_sha256":"de16b50542e61a384b4580c1d906da4083dca5b957821aaf17c8353106341fc6"}}