{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2013:XXXYV3TAA5IGZWVLZND2LU3XFU","short_pith_number":"pith:XXXYV3TA","canonical_record":{"source":{"id":"1307.7263","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.RO","submitted_at":"2013-07-27T14:19:46Z","cross_cats_sorted":[],"title_canon_sha256":"6082d429972335b85608cdcbef6deb3da03cfa20e6010df059c8d99a49fac677","abstract_canon_sha256":"7bb794217b54013666cce803d01322f8748e80d272858054e94fc943594b3439"},"schema_version":"1.0"},"canonical_sha256":"bdef8aee6007506cdaabcb47a5d3772d02ffcead213fb4f5f13ff827d5b8f38a","source":{"kind":"arxiv","id":"1307.7263","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1307.7263","created_at":"2026-05-18T03:17:23Z"},{"alias_kind":"arxiv_version","alias_value":"1307.7263v1","created_at":"2026-05-18T03:17:23Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1307.7263","created_at":"2026-05-18T03:17:23Z"},{"alias_kind":"pith_short_12","alias_value":"XXXYV3TAA5IG","created_at":"2026-05-18T12:28:06Z"},{"alias_kind":"pith_short_16","alias_value":"XXXYV3TAA5IGZWVL","created_at":"2026-05-18T12:28:06Z"},{"alias_kind":"pith_short_8","alias_value":"XXXYV3TA","created_at":"2026-05-18T12:28:06Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2013:XXXYV3TAA5IGZWVLZND2LU3XFU","target":"record","payload":{"canonical_record":{"source":{"id":"1307.7263","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.RO","submitted_at":"2013-07-27T14:19:46Z","cross_cats_sorted":[],"title_canon_sha256":"6082d429972335b85608cdcbef6deb3da03cfa20e6010df059c8d99a49fac677","abstract_canon_sha256":"7bb794217b54013666cce803d01322f8748e80d272858054e94fc943594b3439"},"schema_version":"1.0"},"canonical_sha256":"bdef8aee6007506cdaabcb47a5d3772d02ffcead213fb4f5f13ff827d5b8f38a","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:17:23.753769Z","signature_b64":"aKcDJbww5yqlNK8dj012qeg9OZmo0X1/GseVNjULBNgoEI20fdQWbtHYzT6c9u69Obx7MolEa5SSiVRlFjZtAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"bdef8aee6007506cdaabcb47a5d3772d02ffcead213fb4f5f13ff827d5b8f38a","last_reissued_at":"2026-05-18T03:17:23.753021Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:17:23.753021Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1307.7263","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:17:23Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"WhEZY3DoYqwMnbjMWQ2EhmaDyig+HbkGI6C+MxIl4Ft1gvexeYaaiKlLGrnktl21AyQIWqerQMl+zvuz4EzICw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-03T14:46:08.284678Z"},"content_sha256":"6b1a1d1457f6cce8aeb4db601ff5b079c5d14a4673573ea23f56815b2d31650c","schema_version":"1.0","event_id":"sha256:6b1a1d1457f6cce8aeb4db601ff5b079c5d14a4673573ea23f56815b2d31650c"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2013:XXXYV3TAA5IGZWVLZND2LU3XFU","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Sampling-Based Temporal Logic Path Planning","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.RO","authors_text":"Calin Belta, Cristian Ioan Vasile","submitted_at":"2013-07-27T14:19:46Z","abstract_excerpt":"In this paper, we propose a sampling-based motion planning algorithm that finds an infinite path satisfying a Linear Temporal Logic (LTL) formula over a set of properties satisfied by some regions in a given environment. The algorithm has three main features. First, it is incremental, in the sense that the procedure for finding a satisfying path at each iteration scales only with the number of new samples generated at that iteration. Second, the underlying graph is sparse, which guarantees the low complexity of the overall method. Third, it is probabilistically complete. Examples illustrating "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1307.7263","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:17:23Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"sFR1GYFlKiCXjeKQL4B+qoeCp6438hed6k3KuKEDqxA+fOqR1Jf1Ykox8TmzkFBkqfhtaKH0t7zwQrjz2eKVDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-03T14:46:08.285072Z"},"content_sha256":"629170ba7f10cdc974de74335c2e70d4d612a36c16ab9ec37483d791ead7c0bc","schema_version":"1.0","event_id":"sha256:629170ba7f10cdc974de74335c2e70d4d612a36c16ab9ec37483d791ead7c0bc"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/XXXYV3TAA5IGZWVLZND2LU3XFU/bundle.json","state_url":"https://pith.science/pith/XXXYV3TAA5IGZWVLZND2LU3XFU/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/XXXYV3TAA5IGZWVLZND2LU3XFU/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-03T14:46:08Z","links":{"resolver":"https://pith.science/pith/XXXYV3TAA5IGZWVLZND2LU3XFU","bundle":"https://pith.science/pith/XXXYV3TAA5IGZWVLZND2LU3XFU/bundle.json","state":"https://pith.science/pith/XXXYV3TAA5IGZWVLZND2LU3XFU/state.json","well_known_bundle":"https://pith.science/.well-known/pith/XXXYV3TAA5IGZWVLZND2LU3XFU/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2013:XXXYV3TAA5IGZWVLZND2LU3XFU","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":"7bb794217b54013666cce803d01322f8748e80d272858054e94fc943594b3439","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.RO","submitted_at":"2013-07-27T14:19:46Z","title_canon_sha256":"6082d429972335b85608cdcbef6deb3da03cfa20e6010df059c8d99a49fac677"},"schema_version":"1.0","source":{"id":"1307.7263","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1307.7263","created_at":"2026-05-18T03:17:23Z"},{"alias_kind":"arxiv_version","alias_value":"1307.7263v1","created_at":"2026-05-18T03:17:23Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1307.7263","created_at":"2026-05-18T03:17:23Z"},{"alias_kind":"pith_short_12","alias_value":"XXXYV3TAA5IG","created_at":"2026-05-18T12:28:06Z"},{"alias_kind":"pith_short_16","alias_value":"XXXYV3TAA5IGZWVL","created_at":"2026-05-18T12:28:06Z"},{"alias_kind":"pith_short_8","alias_value":"XXXYV3TA","created_at":"2026-05-18T12:28:06Z"}],"graph_snapshots":[{"event_id":"sha256:629170ba7f10cdc974de74335c2e70d4d612a36c16ab9ec37483d791ead7c0bc","target":"graph","created_at":"2026-05-18T03:17:23Z","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 propose a sampling-based motion planning algorithm that finds an infinite path satisfying a Linear Temporal Logic (LTL) formula over a set of properties satisfied by some regions in a given environment. The algorithm has three main features. First, it is incremental, in the sense that the procedure for finding a satisfying path at each iteration scales only with the number of new samples generated at that iteration. Second, the underlying graph is sparse, which guarantees the low complexity of the overall method. Third, it is probabilistically complete. Examples illustrating ","authors_text":"Calin Belta, Cristian Ioan Vasile","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.RO","submitted_at":"2013-07-27T14:19:46Z","title":"Sampling-Based Temporal Logic Path Planning"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1307.7263","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:6b1a1d1457f6cce8aeb4db601ff5b079c5d14a4673573ea23f56815b2d31650c","target":"record","created_at":"2026-05-18T03:17:23Z","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":"7bb794217b54013666cce803d01322f8748e80d272858054e94fc943594b3439","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.RO","submitted_at":"2013-07-27T14:19:46Z","title_canon_sha256":"6082d429972335b85608cdcbef6deb3da03cfa20e6010df059c8d99a49fac677"},"schema_version":"1.0","source":{"id":"1307.7263","kind":"arxiv","version":1}},"canonical_sha256":"bdef8aee6007506cdaabcb47a5d3772d02ffcead213fb4f5f13ff827d5b8f38a","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"bdef8aee6007506cdaabcb47a5d3772d02ffcead213fb4f5f13ff827d5b8f38a","first_computed_at":"2026-05-18T03:17:23.753021Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:17:23.753021Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"aKcDJbww5yqlNK8dj012qeg9OZmo0X1/GseVNjULBNgoEI20fdQWbtHYzT6c9u69Obx7MolEa5SSiVRlFjZtAQ==","signature_status":"signed_v1","signed_at":"2026-05-18T03:17:23.753769Z","signed_message":"canonical_sha256_bytes"},"source_id":"1307.7263","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:6b1a1d1457f6cce8aeb4db601ff5b079c5d14a4673573ea23f56815b2d31650c","sha256:629170ba7f10cdc974de74335c2e70d4d612a36c16ab9ec37483d791ead7c0bc"],"state_sha256":"f25363c9e11646856c22ea6d97861854abab4778dcf48cd6a83d78b87f5561d7"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"JDfL09uoPX86XWMsULO6o2gVVS5u4vSkTSeY/uTX36oM5oDXztMnpkIBuWd8Zg22vxNyLO9kTP8iJNFHPR7dDg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-03T14:46:08.287255Z","bundle_sha256":"054486eab6bd31cb9ce1810d726ea4f48f4b93040166b3a04340d727604e5164"}}