{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2024:OYJU5E3YTBRECQL7E4TLV56GJL","short_pith_number":"pith:OYJU5E3Y","schema_version":"1.0","canonical_sha256":"76134e9378986241417f2726baf7c64ae0853e7905ebf85181cff37434588010","source":{"kind":"arxiv","id":"2409.09536","version":2},"attestation_state":"computed","paper":{"title":"VernaCopter: Disambiguated Natural-Language-Driven Robot via Formal Specifications","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.AI"],"primary_cat":"cs.RO","authors_text":"Shuhao Qi, Sofie Haesaert, Teun van de Laar, Zengjie Zhang, Zhiyong Sun","submitted_at":"2024-09-14T21:36:22Z","abstract_excerpt":"It has been an ambition of many to control a robot for a complex task using natural language (NL). The rise of large language models (LLMs) makes it closer to coming true. However, an LLM-powered system still suffers from the ambiguity inherent in an NL and the uncertainty brought up by LLMs. This paper proposes a novel LLM-based robot motion planner, named \\textit{VernaCopter}, with signal temporal logic (STL) specifications serving as a bridge between NL commands and specific task objectives. The rigorous and abstract nature of formal specifications allows the planner to generate high-qualit"},"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":"2409.09536","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.RO","submitted_at":"2024-09-14T21:36:22Z","cross_cats_sorted":["cs.AI"],"title_canon_sha256":"e652f393423aa5308584de5b55fec8c7fa446d76a9a5936683ac01c87a650384","abstract_canon_sha256":"3b77c37c13dca4a7bbbc7077e005a80db262709345556e8ef22a683f114b9f6a"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T10:25:46.486653Z","signature_b64":"18Rh8i/98hj3ZS4XJk0b74lc7ni8BsKmvmezFhGQH74dZLFp+IbjTzrSynRXdVnSgvmJWIvGkN5vLIeRgPK9Bw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"76134e9378986241417f2726baf7c64ae0853e7905ebf85181cff37434588010","last_reissued_at":"2026-07-05T10:25:46.486089Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T10:25:46.486089Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"VernaCopter: Disambiguated Natural-Language-Driven Robot via Formal Specifications","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.AI"],"primary_cat":"cs.RO","authors_text":"Shuhao Qi, Sofie Haesaert, Teun van de Laar, Zengjie Zhang, Zhiyong Sun","submitted_at":"2024-09-14T21:36:22Z","abstract_excerpt":"It has been an ambition of many to control a robot for a complex task using natural language (NL). The rise of large language models (LLMs) makes it closer to coming true. However, an LLM-powered system still suffers from the ambiguity inherent in an NL and the uncertainty brought up by LLMs. This paper proposes a novel LLM-based robot motion planner, named \\textit{VernaCopter}, with signal temporal logic (STL) specifications serving as a bridge between NL commands and specific task objectives. The rigorous and abstract nature of formal specifications allows the planner to generate high-qualit"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2409.09536","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/2409.09536/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":"2409.09536","created_at":"2026-07-05T10:25:46.486172+00:00"},{"alias_kind":"arxiv_version","alias_value":"2409.09536v2","created_at":"2026-07-05T10:25:46.486172+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2409.09536","created_at":"2026-07-05T10:25:46.486172+00:00"},{"alias_kind":"pith_short_12","alias_value":"OYJU5E3YTBRE","created_at":"2026-07-05T10:25:46.486172+00:00"},{"alias_kind":"pith_short_16","alias_value":"OYJU5E3YTBRECQL7","created_at":"2026-07-05T10:25:46.486172+00:00"},{"alias_kind":"pith_short_8","alias_value":"OYJU5E3Y","created_at":"2026-07-05T10:25:46.486172+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2606.04123","citing_title":"Semantic Constraint Synthesis for Adaptive Trajectory Optimization via Large Language Models","ref_index":22,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/OYJU5E3YTBRECQL7E4TLV56GJL","json":"https://pith.science/pith/OYJU5E3YTBRECQL7E4TLV56GJL.json","graph_json":"https://pith.science/api/pith-number/OYJU5E3YTBRECQL7E4TLV56GJL/graph.json","events_json":"https://pith.science/api/pith-number/OYJU5E3YTBRECQL7E4TLV56GJL/events.json","paper":"https://pith.science/paper/OYJU5E3Y"},"agent_actions":{"view_html":"https://pith.science/pith/OYJU5E3YTBRECQL7E4TLV56GJL","download_json":"https://pith.science/pith/OYJU5E3YTBRECQL7E4TLV56GJL.json","view_paper":"https://pith.science/paper/OYJU5E3Y","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2409.09536&json=true","fetch_graph":"https://pith.science/api/pith-number/OYJU5E3YTBRECQL7E4TLV56GJL/graph.json","fetch_events":"https://pith.science/api/pith-number/OYJU5E3YTBRECQL7E4TLV56GJL/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/OYJU5E3YTBRECQL7E4TLV56GJL/action/timestamp_anchor","attest_storage":"https://pith.science/pith/OYJU5E3YTBRECQL7E4TLV56GJL/action/storage_attestation","attest_author":"https://pith.science/pith/OYJU5E3YTBRECQL7E4TLV56GJL/action/author_attestation","sign_citation":"https://pith.science/pith/OYJU5E3YTBRECQL7E4TLV56GJL/action/citation_signature","submit_replication":"https://pith.science/pith/OYJU5E3YTBRECQL7E4TLV56GJL/action/replication_record"}},"created_at":"2026-07-05T10:25:46.486172+00:00","updated_at":"2026-07-05T10:25:46.486172+00:00"}