{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2024:VZ45MGI7HJF246S25H22NB7V36","short_pith_number":"pith:VZ45MGI7","schema_version":"1.0","canonical_sha256":"ae79d6191f3a4bae7a5ae9f5a687f5dfaaf7940cc725ceeaeeda12fe93cfafb4","source":{"kind":"arxiv","id":"2406.07400","version":1},"attestation_state":"computed","paper":{"title":"Guiding LLM Temporal Logic Generation with Explicit Separation of Data and Control","license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","headline":"","cross_cats":["cs.LO"],"primary_cat":"cs.LG","authors_text":"Feitong Qiao, Leyi Cui, Mark Santolucito, Nathan Koenig, Nikolaus Holzer, Raven Rothkopf, William Murphy","submitted_at":"2024-06-11T16:07:24Z","abstract_excerpt":"Temporal logics are powerful tools that are widely used for the synthesis and verification of reactive systems. The recent progress on Large Language Models (LLMs) has the potential to make the process of writing such specifications more accessible. However, writing specifications in temporal logics remains challenging for all but the most expert users. A key question in using LLMs for temporal logic specification engineering is to understand what kind of guidance is most helpful to the LLM and the users to easily produce specifications. Looking specifically at the problem of reactive program "},"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":"2406.07400","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","primary_cat":"cs.LG","submitted_at":"2024-06-11T16:07:24Z","cross_cats_sorted":["cs.LO"],"title_canon_sha256":"8ce3d4695532318c5da5ea500337508d9fc517dfb5af16919229910c47529fb2","abstract_canon_sha256":"9322ac9ae201e72803fd3c314cb726e223bbfe5b26a09353d70dd4ad19596540"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T08:30:22.953270Z","signature_b64":"2gv/OGlmXt+LO17BDJ8YgsGiRbXMQRy3jGnjrwwCAljE6Bqhkpft8vsps4tzEGCTzWOXmr3t6SAwuVsGrKDXBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"ae79d6191f3a4bae7a5ae9f5a687f5dfaaf7940cc725ceeaeeda12fe93cfafb4","last_reissued_at":"2026-07-05T08:30:22.952798Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T08:30:22.952798Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Guiding LLM Temporal Logic Generation with Explicit Separation of Data and Control","license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","headline":"","cross_cats":["cs.LO"],"primary_cat":"cs.LG","authors_text":"Feitong Qiao, Leyi Cui, Mark Santolucito, Nathan Koenig, Nikolaus Holzer, Raven Rothkopf, William Murphy","submitted_at":"2024-06-11T16:07:24Z","abstract_excerpt":"Temporal logics are powerful tools that are widely used for the synthesis and verification of reactive systems. The recent progress on Large Language Models (LLMs) has the potential to make the process of writing such specifications more accessible. However, writing specifications in temporal logics remains challenging for all but the most expert users. A key question in using LLMs for temporal logic specification engineering is to understand what kind of guidance is most helpful to the LLM and the users to easily produce specifications. Looking specifically at the problem of reactive program "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2406.07400","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/2406.07400/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":"2406.07400","created_at":"2026-07-05T08:30:22.952859+00:00"},{"alias_kind":"arxiv_version","alias_value":"2406.07400v1","created_at":"2026-07-05T08:30:22.952859+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2406.07400","created_at":"2026-07-05T08:30:22.952859+00:00"},{"alias_kind":"pith_short_12","alias_value":"VZ45MGI7HJF2","created_at":"2026-07-05T08:30:22.952859+00:00"},{"alias_kind":"pith_short_16","alias_value":"VZ45MGI7HJF246S2","created_at":"2026-07-05T08:30:22.952859+00:00"},{"alias_kind":"pith_short_8","alias_value":"VZ45MGI7","created_at":"2026-07-05T08:30:22.952859+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":4,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2606.18519","citing_title":"As You Wish: Mission Planning with Formal Verification using LLMs in Precision Agriculture","ref_index":18,"is_internal_anchor":false},{"citing_arxiv_id":"2606.31039","citing_title":"Truth or Sophistry? LoFa: A Benchmark for LLM Robustness Against Logical Fallacies","ref_index":20,"is_internal_anchor":false},{"citing_arxiv_id":"2605.15131","citing_title":"Natural Synthesis: Outperforming Reactive Synthesis Tools with Large Reasoning Models","ref_index":37,"is_internal_anchor":false},{"citing_arxiv_id":"2604.07321","citing_title":"Syntax Is Easy, Semantics Is Hard: Evaluating LLMs for LTL Translation","ref_index":51,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/VZ45MGI7HJF246S25H22NB7V36","json":"https://pith.science/pith/VZ45MGI7HJF246S25H22NB7V36.json","graph_json":"https://pith.science/api/pith-number/VZ45MGI7HJF246S25H22NB7V36/graph.json","events_json":"https://pith.science/api/pith-number/VZ45MGI7HJF246S25H22NB7V36/events.json","paper":"https://pith.science/paper/VZ45MGI7"},"agent_actions":{"view_html":"https://pith.science/pith/VZ45MGI7HJF246S25H22NB7V36","download_json":"https://pith.science/pith/VZ45MGI7HJF246S25H22NB7V36.json","view_paper":"https://pith.science/paper/VZ45MGI7","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2406.07400&json=true","fetch_graph":"https://pith.science/api/pith-number/VZ45MGI7HJF246S25H22NB7V36/graph.json","fetch_events":"https://pith.science/api/pith-number/VZ45MGI7HJF246S25H22NB7V36/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/VZ45MGI7HJF246S25H22NB7V36/action/timestamp_anchor","attest_storage":"https://pith.science/pith/VZ45MGI7HJF246S25H22NB7V36/action/storage_attestation","attest_author":"https://pith.science/pith/VZ45MGI7HJF246S25H22NB7V36/action/author_attestation","sign_citation":"https://pith.science/pith/VZ45MGI7HJF246S25H22NB7V36/action/citation_signature","submit_replication":"https://pith.science/pith/VZ45MGI7HJF246S25H22NB7V36/action/replication_record"}},"created_at":"2026-07-05T08:30:22.952859+00:00","updated_at":"2026-07-05T08:30:22.952859+00:00"}