{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2022:ZVXSNGLEZHBXH4UUNV6SJCKYVQ","short_pith_number":"pith:ZVXSNGLE","schema_version":"1.0","canonical_sha256":"cd6f269964c9c373f2946d7d248958ac1ff23e7e116ca429f821209029705f4c","source":{"kind":"arxiv","id":"2212.01944","version":5},"attestation_state":"computed","paper":{"title":"Automaton-Based Representations of Task Knowledge from Generative Language Models","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.CL"],"primary_cat":"cs.FL","authors_text":"Cyrus Neary, Jean-Rapha\\\"el Gaglione, Ufuk Topcu, Yunhao Yang","submitted_at":"2022-12-04T22:34:16Z","abstract_excerpt":"Automaton-based representations of task knowledge play an important role in control and planning for sequential decision-making problems. However, obtaining the high-level task knowledge required to build such automata is often difficult. Meanwhile, large-scale generative language models (GLMs) can automatically generate relevant task knowledge. However, the textual outputs from GLMs cannot be formally verified or used for sequential decision-making. We propose a novel algorithm named GLM2FSA, which constructs a finite state automaton (FSA) encoding high-level task knowledge from a brief natur"},"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":"2212.01944","kind":"arxiv","version":5},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.FL","submitted_at":"2022-12-04T22:34:16Z","cross_cats_sorted":["cs.CL"],"title_canon_sha256":"19ac011b597929f3477b8e592302abe6d10bc1123bc535cfd4965d1ede12adf9","abstract_canon_sha256":"c2423a2dc7a7f13d2dbb21791772eed856f2f0dc4243e7bbf5a74686eca12f47"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T06:39:50.963643Z","signature_b64":"7ZlY9hOfFKMs8x+YiTzvOc0uncAAbB+mWnMQv9+72yzN62MF5NqAM3+RDAWer1UdBZBefKP+aRPHdlAqSCJCAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"cd6f269964c9c373f2946d7d248958ac1ff23e7e116ca429f821209029705f4c","last_reissued_at":"2026-07-05T06:39:50.963025Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T06:39:50.963025Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Automaton-Based Representations of Task Knowledge from Generative Language Models","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.CL"],"primary_cat":"cs.FL","authors_text":"Cyrus Neary, Jean-Rapha\\\"el Gaglione, Ufuk Topcu, Yunhao Yang","submitted_at":"2022-12-04T22:34:16Z","abstract_excerpt":"Automaton-based representations of task knowledge play an important role in control and planning for sequential decision-making problems. However, obtaining the high-level task knowledge required to build such automata is often difficult. Meanwhile, large-scale generative language models (GLMs) can automatically generate relevant task knowledge. However, the textual outputs from GLMs cannot be formally verified or used for sequential decision-making. We propose a novel algorithm named GLM2FSA, which constructs a finite state automaton (FSA) encoding high-level task knowledge from a brief natur"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2212.01944","kind":"arxiv","version":5},"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/2212.01944/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":"2212.01944","created_at":"2026-07-05T06:39:50.963084+00:00"},{"alias_kind":"arxiv_version","alias_value":"2212.01944v5","created_at":"2026-07-05T06:39:50.963084+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2212.01944","created_at":"2026-07-05T06:39:50.963084+00:00"},{"alias_kind":"pith_short_12","alias_value":"ZVXSNGLEZHBX","created_at":"2026-07-05T06:39:50.963084+00:00"},{"alias_kind":"pith_short_16","alias_value":"ZVXSNGLEZHBXH4UU","created_at":"2026-07-05T06:39:50.963084+00:00"},{"alias_kind":"pith_short_8","alias_value":"ZVXSNGLE","created_at":"2026-07-05T06:39:50.963084+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2304.11477","citing_title":"LLM+P: Empowering Large Language Models with Optimal Planning Proficiency","ref_index":42,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/ZVXSNGLEZHBXH4UUNV6SJCKYVQ","json":"https://pith.science/pith/ZVXSNGLEZHBXH4UUNV6SJCKYVQ.json","graph_json":"https://pith.science/api/pith-number/ZVXSNGLEZHBXH4UUNV6SJCKYVQ/graph.json","events_json":"https://pith.science/api/pith-number/ZVXSNGLEZHBXH4UUNV6SJCKYVQ/events.json","paper":"https://pith.science/paper/ZVXSNGLE"},"agent_actions":{"view_html":"https://pith.science/pith/ZVXSNGLEZHBXH4UUNV6SJCKYVQ","download_json":"https://pith.science/pith/ZVXSNGLEZHBXH4UUNV6SJCKYVQ.json","view_paper":"https://pith.science/paper/ZVXSNGLE","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2212.01944&json=true","fetch_graph":"https://pith.science/api/pith-number/ZVXSNGLEZHBXH4UUNV6SJCKYVQ/graph.json","fetch_events":"https://pith.science/api/pith-number/ZVXSNGLEZHBXH4UUNV6SJCKYVQ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/ZVXSNGLEZHBXH4UUNV6SJCKYVQ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/ZVXSNGLEZHBXH4UUNV6SJCKYVQ/action/storage_attestation","attest_author":"https://pith.science/pith/ZVXSNGLEZHBXH4UUNV6SJCKYVQ/action/author_attestation","sign_citation":"https://pith.science/pith/ZVXSNGLEZHBXH4UUNV6SJCKYVQ/action/citation_signature","submit_replication":"https://pith.science/pith/ZVXSNGLEZHBXH4UUNV6SJCKYVQ/action/replication_record"}},"created_at":"2026-07-05T06:39:50.963084+00:00","updated_at":"2026-07-05T06:39:50.963084+00:00"}