{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2024:G6QO6VEETYLN6J5MJI7D7MXZP3","short_pith_number":"pith:G6QO6VEE","schema_version":"1.0","canonical_sha256":"37a0ef54849e16df27ac4a3e3fb2f97ef6fc5f72584a270f731da36281310b1b","source":{"kind":"arxiv","id":"2410.04631","version":2},"attestation_state":"computed","paper":{"title":"DeepLTL: Learning to Efficiently Satisfy Complex LTL Specifications for Multi-Task RL","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG"],"primary_cat":"cs.AI","authors_text":"Alessandro Abate, Mathias Jackermeier","submitted_at":"2024-10-06T21:30:38Z","abstract_excerpt":"Linear temporal logic (LTL) has recently been adopted as a powerful formalism for specifying complex, temporally extended tasks in multi-task reinforcement learning (RL). However, learning policies that efficiently satisfy arbitrary specifications not observed during training remains a challenging problem. Existing approaches suffer from several shortcomings: they are often only applicable to finite-horizon fragments of LTL, are restricted to suboptimal solutions, and do not adequately handle safety constraints. In this work, we propose a novel learning approach to address these concerns. Our "},"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":"2410.04631","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2024-10-06T21:30:38Z","cross_cats_sorted":["cs.LG"],"title_canon_sha256":"9cc067091c4ba8c4142e1a5a0043abde024c9b3f89be51e4f66048c3a36ee9a8","abstract_canon_sha256":"b8d52909b9382b567198f7f2cdb19cf4df1a7778470bcf76a8b7804157e02b43"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T10:41:15.795247Z","signature_b64":"4ap1VUX/u1/+REkovcKMr1/h8eBwIFkbiEV+Sn3mj82xLza3rlXzNZnBF0Us6VFwhXb/IqqaNG4YgbZBKKtxAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"37a0ef54849e16df27ac4a3e3fb2f97ef6fc5f72584a270f731da36281310b1b","last_reissued_at":"2026-07-05T10:41:15.794776Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T10:41:15.794776Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"DeepLTL: Learning to Efficiently Satisfy Complex LTL Specifications for Multi-Task RL","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG"],"primary_cat":"cs.AI","authors_text":"Alessandro Abate, Mathias Jackermeier","submitted_at":"2024-10-06T21:30:38Z","abstract_excerpt":"Linear temporal logic (LTL) has recently been adopted as a powerful formalism for specifying complex, temporally extended tasks in multi-task reinforcement learning (RL). However, learning policies that efficiently satisfy arbitrary specifications not observed during training remains a challenging problem. Existing approaches suffer from several shortcomings: they are often only applicable to finite-horizon fragments of LTL, are restricted to suboptimal solutions, and do not adequately handle safety constraints. In this work, we propose a novel learning approach to address these concerns. Our "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2410.04631","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/2410.04631/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":"2410.04631","created_at":"2026-07-05T10:41:15.794831+00:00"},{"alias_kind":"arxiv_version","alias_value":"2410.04631v2","created_at":"2026-07-05T10:41:15.794831+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2410.04631","created_at":"2026-07-05T10:41:15.794831+00:00"},{"alias_kind":"pith_short_12","alias_value":"G6QO6VEETYLN","created_at":"2026-07-05T10:41:15.794831+00:00"},{"alias_kind":"pith_short_16","alias_value":"G6QO6VEETYLN6J5M","created_at":"2026-07-05T10:41:15.794831+00:00"},{"alias_kind":"pith_short_8","alias_value":"G6QO6VEE","created_at":"2026-07-05T10:41:15.794831+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2606.24842","citing_title":"World Models in Pieces: Structural Certification for General Agents","ref_index":101,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/G6QO6VEETYLN6J5MJI7D7MXZP3","json":"https://pith.science/pith/G6QO6VEETYLN6J5MJI7D7MXZP3.json","graph_json":"https://pith.science/api/pith-number/G6QO6VEETYLN6J5MJI7D7MXZP3/graph.json","events_json":"https://pith.science/api/pith-number/G6QO6VEETYLN6J5MJI7D7MXZP3/events.json","paper":"https://pith.science/paper/G6QO6VEE"},"agent_actions":{"view_html":"https://pith.science/pith/G6QO6VEETYLN6J5MJI7D7MXZP3","download_json":"https://pith.science/pith/G6QO6VEETYLN6J5MJI7D7MXZP3.json","view_paper":"https://pith.science/paper/G6QO6VEE","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2410.04631&json=true","fetch_graph":"https://pith.science/api/pith-number/G6QO6VEETYLN6J5MJI7D7MXZP3/graph.json","fetch_events":"https://pith.science/api/pith-number/G6QO6VEETYLN6J5MJI7D7MXZP3/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/G6QO6VEETYLN6J5MJI7D7MXZP3/action/timestamp_anchor","attest_storage":"https://pith.science/pith/G6QO6VEETYLN6J5MJI7D7MXZP3/action/storage_attestation","attest_author":"https://pith.science/pith/G6QO6VEETYLN6J5MJI7D7MXZP3/action/author_attestation","sign_citation":"https://pith.science/pith/G6QO6VEETYLN6J5MJI7D7MXZP3/action/citation_signature","submit_replication":"https://pith.science/pith/G6QO6VEETYLN6J5MJI7D7MXZP3/action/replication_record"}},"created_at":"2026-07-05T10:41:15.794831+00:00","updated_at":"2026-07-05T10:41:15.794831+00:00"}