{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2012:MGUNIK5DR5D4ZPL5OQOEO5KGEH","short_pith_number":"pith:MGUNIK5D","canonical_record":{"source":{"id":"1202.1307","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.RO","submitted_at":"2012-02-06T22:31:32Z","cross_cats_sorted":[],"title_canon_sha256":"b63528703c215b878ca826733d15071d4bedb9bef850286ca1add11af1f87ffa","abstract_canon_sha256":"204a17f3a8cfcc822b517f8a665df5e7b285e6792bf575ebefdfec476e3737b0"},"schema_version":"1.0"},"canonical_sha256":"61a8d42ba38f47ccbd7d741c47754621f4b91791ed90984cc711d6a49b159c6b","source":{"kind":"arxiv","id":"1202.1307","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1202.1307","created_at":"2026-05-18T02:25:11Z"},{"alias_kind":"arxiv_version","alias_value":"1202.1307v2","created_at":"2026-05-18T02:25:11Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1202.1307","created_at":"2026-05-18T02:25:11Z"},{"alias_kind":"pith_short_12","alias_value":"MGUNIK5DR5D4","created_at":"2026-05-18T12:27:14Z"},{"alias_kind":"pith_short_16","alias_value":"MGUNIK5DR5D4ZPL5","created_at":"2026-05-18T12:27:14Z"},{"alias_kind":"pith_short_8","alias_value":"MGUNIK5D","created_at":"2026-05-18T12:27:14Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2012:MGUNIK5DR5D4ZPL5OQOEO5KGEH","target":"record","payload":{"canonical_record":{"source":{"id":"1202.1307","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.RO","submitted_at":"2012-02-06T22:31:32Z","cross_cats_sorted":[],"title_canon_sha256":"b63528703c215b878ca826733d15071d4bedb9bef850286ca1add11af1f87ffa","abstract_canon_sha256":"204a17f3a8cfcc822b517f8a665df5e7b285e6792bf575ebefdfec476e3737b0"},"schema_version":"1.0"},"canonical_sha256":"61a8d42ba38f47ccbd7d741c47754621f4b91791ed90984cc711d6a49b159c6b","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:25:11.202619Z","signature_b64":"c1jBZu9fC31G2+eicb8ZLF23P3O9sYQ96vaCL+IeL/lmcYJJD3frfQBMHgwxhYhpPDrYUJ8RDoD/UXrgLf41Bw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"61a8d42ba38f47ccbd7d741c47754621f4b91791ed90984cc711d6a49b159c6b","last_reissued_at":"2026-05-18T02:25:11.202136Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:25:11.202136Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1202.1307","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:25:11Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"DRhKgCPLFUDcX1Ni2puo/Y0B/cebEmsD97x4sQbnyy28GXbb1twv6A8ePs4KiodYmNpX5P7D0UP3JiL/Ew/MBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T14:47:09.967669Z"},"content_sha256":"1a73ad35de974c29f94e77d73d27e122ff6b9f7fe763542035f5f76876056b10","schema_version":"1.0","event_id":"sha256:1a73ad35de974c29f94e77d73d27e122ff6b9f7fe763542035f5f76876056b10"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2012:MGUNIK5DR5D4ZPL5OQOEO5KGEH","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Robust Multi-Robot Optimal 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, Stephen L. Smith, Xu Chu Ding","submitted_at":"2012-02-06T22:31:32Z","abstract_excerpt":"In this paper we present a method for automatically planning robust 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, and the mission is given as a Linear Temporal Logic (LTL) formula over a set of propositions satisfied by the regions of the environment. In addition, an optimizing proposition must repeatedly be satisfied. The goal is to minimize the maximum time between satisfying instances of the optimizing proposition while ensuring that the LTL formula is satisfied e"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1202.1307","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:25:11Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"qXEMDTVwVZs/S22Dv/rnDaGu0iyAlg7oaLHPp/qAwdf66Ogel3/OfPoSSkC04KnK+KX2vwHIU+u8tI0NK+HpCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T14:47:09.968027Z"},"content_sha256":"9c56b255e485ac5a7c209fcef7b852c50ca0693569200fe069bdba1492a5a9d6","schema_version":"1.0","event_id":"sha256:9c56b255e485ac5a7c209fcef7b852c50ca0693569200fe069bdba1492a5a9d6"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/MGUNIK5DR5D4ZPL5OQOEO5KGEH/bundle.json","state_url":"https://pith.science/pith/MGUNIK5DR5D4ZPL5OQOEO5KGEH/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/MGUNIK5DR5D4ZPL5OQOEO5KGEH/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-05-27T14:47:09Z","links":{"resolver":"https://pith.science/pith/MGUNIK5DR5D4ZPL5OQOEO5KGEH","bundle":"https://pith.science/pith/MGUNIK5DR5D4ZPL5OQOEO5KGEH/bundle.json","state":"https://pith.science/pith/MGUNIK5DR5D4ZPL5OQOEO5KGEH/state.json","well_known_bundle":"https://pith.science/.well-known/pith/MGUNIK5DR5D4ZPL5OQOEO5KGEH/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2012:MGUNIK5DR5D4ZPL5OQOEO5KGEH","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":"204a17f3a8cfcc822b517f8a665df5e7b285e6792bf575ebefdfec476e3737b0","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.RO","submitted_at":"2012-02-06T22:31:32Z","title_canon_sha256":"b63528703c215b878ca826733d15071d4bedb9bef850286ca1add11af1f87ffa"},"schema_version":"1.0","source":{"id":"1202.1307","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1202.1307","created_at":"2026-05-18T02:25:11Z"},{"alias_kind":"arxiv_version","alias_value":"1202.1307v2","created_at":"2026-05-18T02:25:11Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1202.1307","created_at":"2026-05-18T02:25:11Z"},{"alias_kind":"pith_short_12","alias_value":"MGUNIK5DR5D4","created_at":"2026-05-18T12:27:14Z"},{"alias_kind":"pith_short_16","alias_value":"MGUNIK5DR5D4ZPL5","created_at":"2026-05-18T12:27:14Z"},{"alias_kind":"pith_short_8","alias_value":"MGUNIK5D","created_at":"2026-05-18T12:27:14Z"}],"graph_snapshots":[{"event_id":"sha256:9c56b255e485ac5a7c209fcef7b852c50ca0693569200fe069bdba1492a5a9d6","target":"graph","created_at":"2026-05-18T02:25:11Z","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 robust 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, and the mission is given as a Linear Temporal Logic (LTL) formula over a set of propositions satisfied by the regions of the environment. In addition, an optimizing proposition must repeatedly be satisfied. The goal is to minimize the maximum time between satisfying instances of the optimizing proposition while ensuring that the LTL formula is satisfied e","authors_text":"Alphan Ulusoy, Calin Belta, Stephen L. Smith, Xu Chu Ding","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.RO","submitted_at":"2012-02-06T22:31:32Z","title":"Robust Multi-Robot Optimal Path Planning with Temporal Logic Constraints"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1202.1307","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:1a73ad35de974c29f94e77d73d27e122ff6b9f7fe763542035f5f76876056b10","target":"record","created_at":"2026-05-18T02:25:11Z","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":"204a17f3a8cfcc822b517f8a665df5e7b285e6792bf575ebefdfec476e3737b0","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.RO","submitted_at":"2012-02-06T22:31:32Z","title_canon_sha256":"b63528703c215b878ca826733d15071d4bedb9bef850286ca1add11af1f87ffa"},"schema_version":"1.0","source":{"id":"1202.1307","kind":"arxiv","version":2}},"canonical_sha256":"61a8d42ba38f47ccbd7d741c47754621f4b91791ed90984cc711d6a49b159c6b","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"61a8d42ba38f47ccbd7d741c47754621f4b91791ed90984cc711d6a49b159c6b","first_computed_at":"2026-05-18T02:25:11.202136Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:25:11.202136Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"c1jBZu9fC31G2+eicb8ZLF23P3O9sYQ96vaCL+IeL/lmcYJJD3frfQBMHgwxhYhpPDrYUJ8RDoD/UXrgLf41Bw==","signature_status":"signed_v1","signed_at":"2026-05-18T02:25:11.202619Z","signed_message":"canonical_sha256_bytes"},"source_id":"1202.1307","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:1a73ad35de974c29f94e77d73d27e122ff6b9f7fe763542035f5f76876056b10","sha256:9c56b255e485ac5a7c209fcef7b852c50ca0693569200fe069bdba1492a5a9d6"],"state_sha256":"354facb5d6d5df1b507fa438af22193ec47e2d1e82ac81040ad6174a57e96e70"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"jKQgkNP5zTvbR4suiudRKjTtT41k6+vXqRUDEHBkcEMLSVYzp0hyql8HRxm139ZW3srxJVJMs4NZ3z8kxKe9CA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-27T14:47:09.970679Z","bundle_sha256":"3e043d2c2092ca860e131f00d00423007aa782af849867e847a404c7ce948e38"}}