{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2022:7CYTRBRNOXUFKWHH76VB5EXNWX","short_pith_number":"pith:7CYTRBRN","schema_version":"1.0","canonical_sha256":"f8b138862d75e85558e7ffaa1e92edb5f8c32b04cea3645d6e5b0e1ef9412bc8","source":{"kind":"arxiv","id":"2210.04813","version":2},"attestation_state":"computed","paper":{"title":"Stochastic Robustness Interval for Motion Planning with Signal Temporal Logic","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.RO","cs.SY","eess.SY"],"primary_cat":"cs.FL","authors_text":"Morteza Lahijanian, Qi Heng Ho, Roland B. Ilyes","submitted_at":"2022-10-10T16:22:10Z","abstract_excerpt":"In this work, we present a novel robustness measure for continuous-time stochastic trajectories with respect to Signal Temporal Logic (STL) specifications. We show the soundness of the measure and develop a monitor for reasoning about partial trajectories. Using this monitor, we introduce an STL sampling-based motion planning algorithm for robots under uncertainty. Given a minimum robustness requirement, this algorithm finds satisfying motion plans; alternatively, the algorithm also optimizes for the measure. We prove probabilistic completeness and asymptotic optimality, and demonstrate the ef"},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"canonical_record":{"source":{"id":"2210.04813","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.FL","submitted_at":"2022-10-10T16:22:10Z","cross_cats_sorted":["cs.RO","cs.SY","eess.SY"],"title_canon_sha256":"08838292dbbc8bf36be3e0bccfdeb88a8a4482a883ab7a8e739deff5739ede53","abstract_canon_sha256":"d462bab366d96006d1dfa5d415d163c39355ce25da7b7bf0c324e5f44249fbd9"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T06:14:37.114527Z","signature_b64":"gAc/7dRS1P16HuNybR4LhP/D1sUTIQtmKN/CqptqqEVb883kkYhMCsbdSuC83yr+Lj4vWYi5M1HZiPGdxpdnAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"f8b138862d75e85558e7ffaa1e92edb5f8c32b04cea3645d6e5b0e1ef9412bc8","last_reissued_at":"2026-07-05T06:14:37.114014Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T06:14:37.114014Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Stochastic Robustness Interval for Motion Planning with Signal Temporal Logic","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.RO","cs.SY","eess.SY"],"primary_cat":"cs.FL","authors_text":"Morteza Lahijanian, Qi Heng Ho, Roland B. Ilyes","submitted_at":"2022-10-10T16:22:10Z","abstract_excerpt":"In this work, we present a novel robustness measure for continuous-time stochastic trajectories with respect to Signal Temporal Logic (STL) specifications. We show the soundness of the measure and develop a monitor for reasoning about partial trajectories. Using this monitor, we introduce an STL sampling-based motion planning algorithm for robots under uncertainty. Given a minimum robustness requirement, this algorithm finds satisfying motion plans; alternatively, the algorithm also optimizes for the measure. We prove probabilistic completeness and asymptotic optimality, and demonstrate the ef"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2210.04813","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2210.04813/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"},"aliases":[{"alias_kind":"arxiv","alias_value":"2210.04813","created_at":"2026-07-05T06:14:37.114073+00:00"},{"alias_kind":"arxiv_version","alias_value":"2210.04813v2","created_at":"2026-07-05T06:14:37.114073+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2210.04813","created_at":"2026-07-05T06:14:37.114073+00:00"},{"alias_kind":"pith_short_12","alias_value":"7CYTRBRNOXUF","created_at":"2026-07-05T06:14:37.114073+00:00"},{"alias_kind":"pith_short_16","alias_value":"7CYTRBRNOXUFKWHH","created_at":"2026-07-05T06:14:37.114073+00:00"},{"alias_kind":"pith_short_8","alias_value":"7CYTRBRN","created_at":"2026-07-05T06:14:37.114073+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2606.19561","citing_title":"pdSTL: Probabilistic Differentiable Signal Temporal Logic for Stochastic Systems","ref_index":14,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/7CYTRBRNOXUFKWHH76VB5EXNWX","json":"https://pith.science/pith/7CYTRBRNOXUFKWHH76VB5EXNWX.json","graph_json":"https://pith.science/api/pith-number/7CYTRBRNOXUFKWHH76VB5EXNWX/graph.json","events_json":"https://pith.science/api/pith-number/7CYTRBRNOXUFKWHH76VB5EXNWX/events.json","paper":"https://pith.science/paper/7CYTRBRN"},"agent_actions":{"view_html":"https://pith.science/pith/7CYTRBRNOXUFKWHH76VB5EXNWX","download_json":"https://pith.science/pith/7CYTRBRNOXUFKWHH76VB5EXNWX.json","view_paper":"https://pith.science/paper/7CYTRBRN","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2210.04813&json=true","fetch_graph":"https://pith.science/api/pith-number/7CYTRBRNOXUFKWHH76VB5EXNWX/graph.json","fetch_events":"https://pith.science/api/pith-number/7CYTRBRNOXUFKWHH76VB5EXNWX/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/7CYTRBRNOXUFKWHH76VB5EXNWX/action/timestamp_anchor","attest_storage":"https://pith.science/pith/7CYTRBRNOXUFKWHH76VB5EXNWX/action/storage_attestation","attest_author":"https://pith.science/pith/7CYTRBRNOXUFKWHH76VB5EXNWX/action/author_attestation","sign_citation":"https://pith.science/pith/7CYTRBRNOXUFKWHH76VB5EXNWX/action/citation_signature","submit_replication":"https://pith.science/pith/7CYTRBRNOXUFKWHH76VB5EXNWX/action/replication_record"}},"created_at":"2026-07-05T06:14:37.114073+00:00","updated_at":"2026-07-05T06:14:37.114073+00:00"}