{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2024:435KIODTWXTHCYK6W27R5Q6HE4","short_pith_number":"pith:435KIODT","schema_version":"1.0","canonical_sha256":"e6faa43873b5e671615eb6bf1ec3c727337fc00626804aa8f18d8ecb00737a1e","source":{"kind":"arxiv","id":"2404.01219","version":1},"attestation_state":"computed","paper":{"title":"LTL-D*: Incrementally Optimal Replanning for Feasible and Infeasible Tasks in Linear Temporal Logic Specifications","license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","headline":"","cross_cats":["cs.FL"],"primary_cat":"cs.RO","authors_text":"Haris Miller, Jiming Ren, Karen M. Feigh, Samuel Coogan, Ye Zhao","submitted_at":"2024-04-01T16:19:50Z","abstract_excerpt":"This paper presents an incremental replanning algorithm, dubbed LTL-D*, for temporal-logic-based task planning in a dynamically changing environment. Unexpected changes in the environment may lead to failures in satisfying a task specification in the form of a Linear Temporal Logic (LTL). In this study, the considered failures are categorized into two classes: (i) the desired LTL specification can be satisfied via replanning, and (ii) the desired LTL specification is infeasible to meet strictly and can only be satisfied in a \"relaxed\" fashion. To address these failures, the proposed algorithm "},"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":"2404.01219","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","primary_cat":"cs.RO","submitted_at":"2024-04-01T16:19:50Z","cross_cats_sorted":["cs.FL"],"title_canon_sha256":"8805e0e1a173db91c696d9cadf9ad81ef24ac7daeb90382e6fd5eecf29b3da27","abstract_canon_sha256":"a89fcd65f2d954543bbacb849485da43e904f6f82f2a0218ea3d36fde93c7b43"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T08:03:02.826605Z","signature_b64":"4s1+vbceRjCKWCJLh60SrRvnjHQijlJShv8uysm/CwTctwwtOqhqNyTV2zxL5vCcXAlali8iAixi8K4w9ne8Dw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"e6faa43873b5e671615eb6bf1ec3c727337fc00626804aa8f18d8ecb00737a1e","last_reissued_at":"2026-07-05T08:03:02.826084Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T08:03:02.826084Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"LTL-D*: Incrementally Optimal Replanning for Feasible and Infeasible Tasks in Linear Temporal Logic Specifications","license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","headline":"","cross_cats":["cs.FL"],"primary_cat":"cs.RO","authors_text":"Haris Miller, Jiming Ren, Karen M. Feigh, Samuel Coogan, Ye Zhao","submitted_at":"2024-04-01T16:19:50Z","abstract_excerpt":"This paper presents an incremental replanning algorithm, dubbed LTL-D*, for temporal-logic-based task planning in a dynamically changing environment. Unexpected changes in the environment may lead to failures in satisfying a task specification in the form of a Linear Temporal Logic (LTL). In this study, the considered failures are categorized into two classes: (i) the desired LTL specification can be satisfied via replanning, and (ii) the desired LTL specification is infeasible to meet strictly and can only be satisfied in a \"relaxed\" fashion. To address these failures, the proposed algorithm "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2404.01219","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2404.01219/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":"2404.01219","created_at":"2026-07-05T08:03:02.826149+00:00"},{"alias_kind":"arxiv_version","alias_value":"2404.01219v1","created_at":"2026-07-05T08:03:02.826149+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2404.01219","created_at":"2026-07-05T08:03:02.826149+00:00"},{"alias_kind":"pith_short_12","alias_value":"435KIODTWXTH","created_at":"2026-07-05T08:03:02.826149+00:00"},{"alias_kind":"pith_short_16","alias_value":"435KIODTWXTHCYK6","created_at":"2026-07-05T08:03:02.826149+00:00"},{"alias_kind":"pith_short_8","alias_value":"435KIODT","created_at":"2026-07-05T08:03:02.826149+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/435KIODTWXTHCYK6W27R5Q6HE4","json":"https://pith.science/pith/435KIODTWXTHCYK6W27R5Q6HE4.json","graph_json":"https://pith.science/api/pith-number/435KIODTWXTHCYK6W27R5Q6HE4/graph.json","events_json":"https://pith.science/api/pith-number/435KIODTWXTHCYK6W27R5Q6HE4/events.json","paper":"https://pith.science/paper/435KIODT"},"agent_actions":{"view_html":"https://pith.science/pith/435KIODTWXTHCYK6W27R5Q6HE4","download_json":"https://pith.science/pith/435KIODTWXTHCYK6W27R5Q6HE4.json","view_paper":"https://pith.science/paper/435KIODT","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2404.01219&json=true","fetch_graph":"https://pith.science/api/pith-number/435KIODTWXTHCYK6W27R5Q6HE4/graph.json","fetch_events":"https://pith.science/api/pith-number/435KIODTWXTHCYK6W27R5Q6HE4/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/435KIODTWXTHCYK6W27R5Q6HE4/action/timestamp_anchor","attest_storage":"https://pith.science/pith/435KIODTWXTHCYK6W27R5Q6HE4/action/storage_attestation","attest_author":"https://pith.science/pith/435KIODTWXTHCYK6W27R5Q6HE4/action/author_attestation","sign_citation":"https://pith.science/pith/435KIODTWXTHCYK6W27R5Q6HE4/action/citation_signature","submit_replication":"https://pith.science/pith/435KIODTWXTHCYK6W27R5Q6HE4/action/replication_record"}},"created_at":"2026-07-05T08:03:02.826149+00:00","updated_at":"2026-07-05T08:03:02.826149+00:00"}