{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2019:MDVTMYFTV47FGFPCJ4BUPJL5CI","short_pith_number":"pith:MDVTMYFT","canonical_record":{"source":{"id":"1909.00526","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.RO","submitted_at":"2019-09-02T03:30:45Z","cross_cats_sorted":[],"title_canon_sha256":"294ec0c53ee4b47c6f4c48f9766290f35d7fefc4004f711a39f5358f109332aa","abstract_canon_sha256":"cbe0ebb01524d761b9f698e395a518f254f25bcf349d0395de0626891cad7ab3"},"schema_version":"1.0"},"canonical_sha256":"60eb3660b3af3e5315e24f0347a57d1239630266d5f7f07f3f2d395ae2c8f6a8","source":{"kind":"arxiv","id":"1909.00526","version":4},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1909.00526","created_at":"2026-07-05T02:25:16Z"},{"alias_kind":"arxiv_version","alias_value":"1909.00526v4","created_at":"2026-07-05T02:25:16Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1909.00526","created_at":"2026-07-05T02:25:16Z"},{"alias_kind":"pith_short_12","alias_value":"MDVTMYFTV47F","created_at":"2026-07-05T02:25:16Z"},{"alias_kind":"pith_short_16","alias_value":"MDVTMYFTV47FGFPC","created_at":"2026-07-05T02:25:16Z"},{"alias_kind":"pith_short_8","alias_value":"MDVTMYFT","created_at":"2026-07-05T02:25:16Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2019:MDVTMYFTV47FGFPCJ4BUPJL5CI","target":"record","payload":{"canonical_record":{"source":{"id":"1909.00526","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.RO","submitted_at":"2019-09-02T03:30:45Z","cross_cats_sorted":[],"title_canon_sha256":"294ec0c53ee4b47c6f4c48f9766290f35d7fefc4004f711a39f5358f109332aa","abstract_canon_sha256":"cbe0ebb01524d761b9f698e395a518f254f25bcf349d0395de0626891cad7ab3"},"schema_version":"1.0"},"canonical_sha256":"60eb3660b3af3e5315e24f0347a57d1239630266d5f7f07f3f2d395ae2c8f6a8","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T02:25:16.118979Z","signature_b64":"xfs/yQxaSEOoe3Hm0JNJgvN/boUJuFqpNUx42I6GPbq0sTGCJVKSkTq4UkGG6Gi1Cj5kbtOedKohSu7pI2zuDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"60eb3660b3af3e5315e24f0347a57d1239630266d5f7f07f3f2d395ae2c8f6a8","last_reissued_at":"2026-07-05T02:25:16.118634Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T02:25:16.118634Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1909.00526","source_version":4,"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-07-05T02:25:16Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Ifet8xnGg/p9cfHlmOVTSF3PwH/c1/TrLM+2bPWO7tH3b96aTk1l9k9HbPoWl8YmXiFVVcNcUUun5tcQiWmkDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-07T04:29:51.184677Z"},"content_sha256":"89b7c54a194e614ba64f385b999ed921678766d0c59ee99499ae78ae603c6752","schema_version":"1.0","event_id":"sha256:89b7c54a194e614ba64f385b999ed921678766d0c59ee99499ae78ae603c6752"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2019:MDVTMYFTV47FGFPCJ4BUPJL5CI","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"An Abstraction-Free Method for Multi-Robot Temporal Logic Optimal Control Synthesis","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.RO","authors_text":"Michael M. Zavlanos, Xusheng Luo, Yiannis Kantaros","submitted_at":"2019-09-02T03:30:45Z","abstract_excerpt":"The majority of existing Linear Temporal Logic (LTL) planning methods rely on the construction of a discrete product automaton, that combines a discrete abstraction of robot mobility and a B$\\ddot{\\text{u}}$chi automaton that captures the LTL specification. Representing this product automaton as a graph and using graph search techniques, optimal plans that satisfy the LTL task can be synthesized. However, constructing expressive discrete abstractions makes the synthesis problem computationally intractable. In this paper, we propose a new sampling-based LTL planning algorithm that does not requ"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1909.00526","kind":"arxiv","version":4},"verdict":{"id":null,"model_set":{},"created_at":null,"strongest_claim":"","one_line_summary":"","pipeline_version":null,"weakest_assumption":"","pith_extraction_headline":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/1909.00526/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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-07-05T02:25:16Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"eyuKuxl8yaYsMRvNWQ4jdaH9slqMOBQBhb25g5MnQsDw9epYcp63NsI9YAg9KPx5nARevK68l7zPo0ZDLtW6DQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-07T04:29:51.185044Z"},"content_sha256":"d6da5721c076c26add1d3844f4e15f7c11068eb3c194812eb036dfd90bd9b039","schema_version":"1.0","event_id":"sha256:d6da5721c076c26add1d3844f4e15f7c11068eb3c194812eb036dfd90bd9b039"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/MDVTMYFTV47FGFPCJ4BUPJL5CI/bundle.json","state_url":"https://pith.science/pith/MDVTMYFTV47FGFPCJ4BUPJL5CI/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/MDVTMYFTV47FGFPCJ4BUPJL5CI/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-07-07T04:29:51Z","links":{"resolver":"https://pith.science/pith/MDVTMYFTV47FGFPCJ4BUPJL5CI","bundle":"https://pith.science/pith/MDVTMYFTV47FGFPCJ4BUPJL5CI/bundle.json","state":"https://pith.science/pith/MDVTMYFTV47FGFPCJ4BUPJL5CI/state.json","well_known_bundle":"https://pith.science/.well-known/pith/MDVTMYFTV47FGFPCJ4BUPJL5CI/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2019:MDVTMYFTV47FGFPCJ4BUPJL5CI","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":"cbe0ebb01524d761b9f698e395a518f254f25bcf349d0395de0626891cad7ab3","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.RO","submitted_at":"2019-09-02T03:30:45Z","title_canon_sha256":"294ec0c53ee4b47c6f4c48f9766290f35d7fefc4004f711a39f5358f109332aa"},"schema_version":"1.0","source":{"id":"1909.00526","kind":"arxiv","version":4}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1909.00526","created_at":"2026-07-05T02:25:16Z"},{"alias_kind":"arxiv_version","alias_value":"1909.00526v4","created_at":"2026-07-05T02:25:16Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1909.00526","created_at":"2026-07-05T02:25:16Z"},{"alias_kind":"pith_short_12","alias_value":"MDVTMYFTV47F","created_at":"2026-07-05T02:25:16Z"},{"alias_kind":"pith_short_16","alias_value":"MDVTMYFTV47FGFPC","created_at":"2026-07-05T02:25:16Z"},{"alias_kind":"pith_short_8","alias_value":"MDVTMYFT","created_at":"2026-07-05T02:25:16Z"}],"graph_snapshots":[{"event_id":"sha256:d6da5721c076c26add1d3844f4e15f7c11068eb3c194812eb036dfd90bd9b039","target":"graph","created_at":"2026-07-05T02:25:16Z","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"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/1909.00526/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"The majority of existing Linear Temporal Logic (LTL) planning methods rely on the construction of a discrete product automaton, that combines a discrete abstraction of robot mobility and a B$\\ddot{\\text{u}}$chi automaton that captures the LTL specification. Representing this product automaton as a graph and using graph search techniques, optimal plans that satisfy the LTL task can be synthesized. However, constructing expressive discrete abstractions makes the synthesis problem computationally intractable. In this paper, we propose a new sampling-based LTL planning algorithm that does not requ","authors_text":"Michael M. Zavlanos, Xusheng Luo, Yiannis Kantaros","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.RO","submitted_at":"2019-09-02T03:30:45Z","title":"An Abstraction-Free Method for Multi-Robot Temporal Logic Optimal Control Synthesis"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1909.00526","kind":"arxiv","version":4},"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:89b7c54a194e614ba64f385b999ed921678766d0c59ee99499ae78ae603c6752","target":"record","created_at":"2026-07-05T02:25:16Z","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":"cbe0ebb01524d761b9f698e395a518f254f25bcf349d0395de0626891cad7ab3","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.RO","submitted_at":"2019-09-02T03:30:45Z","title_canon_sha256":"294ec0c53ee4b47c6f4c48f9766290f35d7fefc4004f711a39f5358f109332aa"},"schema_version":"1.0","source":{"id":"1909.00526","kind":"arxiv","version":4}},"canonical_sha256":"60eb3660b3af3e5315e24f0347a57d1239630266d5f7f07f3f2d395ae2c8f6a8","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"60eb3660b3af3e5315e24f0347a57d1239630266d5f7f07f3f2d395ae2c8f6a8","first_computed_at":"2026-07-05T02:25:16.118634Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T02:25:16.118634Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"xfs/yQxaSEOoe3Hm0JNJgvN/boUJuFqpNUx42I6GPbq0sTGCJVKSkTq4UkGG6Gi1Cj5kbtOedKohSu7pI2zuDg==","signature_status":"signed_v1","signed_at":"2026-07-05T02:25:16.118979Z","signed_message":"canonical_sha256_bytes"},"source_id":"1909.00526","source_kind":"arxiv","source_version":4}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:89b7c54a194e614ba64f385b999ed921678766d0c59ee99499ae78ae603c6752","sha256:d6da5721c076c26add1d3844f4e15f7c11068eb3c194812eb036dfd90bd9b039"],"state_sha256":"551ccd454831653aebed59f53aa9ce124711b676411694f72e5eba94c5bb18f6"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"IlmgTdKdAKCEchePcACnwEpEiehquIjthOqlNNyEA4NRDca+/f5najwhZoiCrCLP/f+bBMz+cc/G33OsKJIpBA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-07-07T04:29:51.187103Z","bundle_sha256":"a212f84f7de071d0f1320e24c54f25199c18634198f4a6f2ed44543cca95ecea"}}