{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2025:CXEAQTREFWWQO6VBNEM2RHN73N","short_pith_number":"pith:CXEAQTRE","schema_version":"1.0","canonical_sha256":"15c8084e242dad077aa16919a89dbfdb63c1b72390d5958077f68e48f9ac004f","source":{"kind":"arxiv","id":"2501.13712","version":1},"attestation_state":"computed","paper":{"title":"Formally Verified Neurosymbolic Trajectory Learning via Tensor-based Linear Temporal Logic on Finite Traces","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG","cs.LO"],"primary_cat":"cs.AI","authors_text":"Filip Smola, Jacques D. Fleuriot, Mark Chevallier, Richard Schmoetten","submitted_at":"2025-01-23T14:43:12Z","abstract_excerpt":"We present a novel formalisation of tensor semantics for linear temporal logic on finite traces (LTLf), with formal proofs of correctness carried out in the theorem prover Isabelle/HOL. We demonstrate that this formalisation can be integrated into a neurosymbolic learning process by defining and verifying a differentiable loss function for the LTLf constraints, and automatically generating an implementation that integrates with PyTorch. We show that, by using this loss, the process learns to satisfy pre-specified logical constraints. Our approach offers a fully rigorous framework for constrain"},"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":"2501.13712","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2025-01-23T14:43:12Z","cross_cats_sorted":["cs.LG","cs.LO"],"title_canon_sha256":"5fbaef7f46994806b2e108d33d6b758ede9e432dbf3713eb7d86c3615a4d2edd","abstract_canon_sha256":"8d20b1ae725c8d7ec63f4b14c73876b0caeeb84f7851a5b33f61cb7ee67e0d8e"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T10:04:33.057046Z","signature_b64":"1dWKSHwCwW/n+KquJ+VXqd9gaAbPoYlQPyPE+Sf9yArn62YwjsCcdyM/iAL48LXuBsAaTgYnPjPI/3KL7gIYDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"15c8084e242dad077aa16919a89dbfdb63c1b72390d5958077f68e48f9ac004f","last_reissued_at":"2026-07-05T10:04:33.056594Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T10:04:33.056594Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Formally Verified Neurosymbolic Trajectory Learning via Tensor-based Linear Temporal Logic on Finite Traces","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG","cs.LO"],"primary_cat":"cs.AI","authors_text":"Filip Smola, Jacques D. Fleuriot, Mark Chevallier, Richard Schmoetten","submitted_at":"2025-01-23T14:43:12Z","abstract_excerpt":"We present a novel formalisation of tensor semantics for linear temporal logic on finite traces (LTLf), with formal proofs of correctness carried out in the theorem prover Isabelle/HOL. We demonstrate that this formalisation can be integrated into a neurosymbolic learning process by defining and verifying a differentiable loss function for the LTLf constraints, and automatically generating an implementation that integrates with PyTorch. We show that, by using this loss, the process learns to satisfy pre-specified logical constraints. Our approach offers a fully rigorous framework for constrain"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2501.13712","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/2501.13712/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":"2501.13712","created_at":"2026-07-05T10:04:33.056650+00:00"},{"alias_kind":"arxiv_version","alias_value":"2501.13712v1","created_at":"2026-07-05T10:04:33.056650+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2501.13712","created_at":"2026-07-05T10:04:33.056650+00:00"},{"alias_kind":"pith_short_12","alias_value":"CXEAQTREFWWQ","created_at":"2026-07-05T10:04:33.056650+00:00"},{"alias_kind":"pith_short_16","alias_value":"CXEAQTREFWWQO6VB","created_at":"2026-07-05T10:04:33.056650+00:00"},{"alias_kind":"pith_short_8","alias_value":"CXEAQTRE","created_at":"2026-07-05T10:04:33.056650+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":3,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2605.17475","citing_title":"Event-B Agent: Towards LLM Agent for Formal Model Synthesis and Repair","ref_index":13,"is_internal_anchor":false},{"citing_arxiv_id":"2605.13845","citing_title":"Quantitative Linear Logic for Neuro-Symbolic Learning and Verification","ref_index":32,"is_internal_anchor":false},{"citing_arxiv_id":"2605.13845","citing_title":"Quantitative Linear Logic for Neuro-Symbolic Learning and Verification","ref_index":32,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/CXEAQTREFWWQO6VBNEM2RHN73N","json":"https://pith.science/pith/CXEAQTREFWWQO6VBNEM2RHN73N.json","graph_json":"https://pith.science/api/pith-number/CXEAQTREFWWQO6VBNEM2RHN73N/graph.json","events_json":"https://pith.science/api/pith-number/CXEAQTREFWWQO6VBNEM2RHN73N/events.json","paper":"https://pith.science/paper/CXEAQTRE"},"agent_actions":{"view_html":"https://pith.science/pith/CXEAQTREFWWQO6VBNEM2RHN73N","download_json":"https://pith.science/pith/CXEAQTREFWWQO6VBNEM2RHN73N.json","view_paper":"https://pith.science/paper/CXEAQTRE","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2501.13712&json=true","fetch_graph":"https://pith.science/api/pith-number/CXEAQTREFWWQO6VBNEM2RHN73N/graph.json","fetch_events":"https://pith.science/api/pith-number/CXEAQTREFWWQO6VBNEM2RHN73N/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/CXEAQTREFWWQO6VBNEM2RHN73N/action/timestamp_anchor","attest_storage":"https://pith.science/pith/CXEAQTREFWWQO6VBNEM2RHN73N/action/storage_attestation","attest_author":"https://pith.science/pith/CXEAQTREFWWQO6VBNEM2RHN73N/action/author_attestation","sign_citation":"https://pith.science/pith/CXEAQTREFWWQO6VBNEM2RHN73N/action/citation_signature","submit_replication":"https://pith.science/pith/CXEAQTREFWWQO6VBNEM2RHN73N/action/replication_record"}},"created_at":"2026-07-05T10:04:33.056650+00:00","updated_at":"2026-07-05T10:04:33.056650+00:00"}