{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2025:ACVKITZJA6YUNKSNE7GDI3QEYT","short_pith_number":"pith:ACVKITZJ","schema_version":"1.0","canonical_sha256":"00aaa44f2907b146aa4d27cc346e04c4e00e52976f93a2cf251406685514f158","source":{"kind":"arxiv","id":"2505.00562","version":1},"attestation_state":"computed","paper":{"title":"TeLoGraF: Temporal Logic Planning via Graph-encoded Flow Matching","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI","cs.FL","cs.LG"],"primary_cat":"cs.RO","authors_text":"Chuchu Fan, Yue Meng","submitted_at":"2025-05-01T14:40:07Z","abstract_excerpt":"Learning to solve complex tasks with signal temporal logic (STL) specifications is crucial to many real-world applications. However, most previous works only consider fixed or parametrized STL specifications due to the lack of a diverse STL dataset and encoders to effectively extract temporal logic information for downstream tasks. In this paper, we propose TeLoGraF, Temporal Logic Graph-encoded Flow, which utilizes Graph Neural Networks (GNN) encoder and flow-matching to learn solutions for general STL specifications. We identify four commonly used STL templates and collect a total of 200K sp"},"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":"2505.00562","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.RO","submitted_at":"2025-05-01T14:40:07Z","cross_cats_sorted":["cs.AI","cs.FL","cs.LG"],"title_canon_sha256":"b33b1a32e6db491bbce26a3bb41f4b91df41c7aa6ac1c2a284f429e5ab29df50","abstract_canon_sha256":"2327f4d46b9dd4e3f208d022fec9fc246c92a66a364a0806d8900af10c851fec"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T10:57:22.140734Z","signature_b64":"xM6An5SSLG1mHsNjkQWRHZDjC0Wej2eGRQSU6FRU1wn+njcKPdgGDqEirM6TA+FkW4l0K9Go2vq6NyMw63bfBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"00aaa44f2907b146aa4d27cc346e04c4e00e52976f93a2cf251406685514f158","last_reissued_at":"2026-07-05T10:57:22.140242Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T10:57:22.140242Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"TeLoGraF: Temporal Logic Planning via Graph-encoded Flow Matching","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI","cs.FL","cs.LG"],"primary_cat":"cs.RO","authors_text":"Chuchu Fan, Yue Meng","submitted_at":"2025-05-01T14:40:07Z","abstract_excerpt":"Learning to solve complex tasks with signal temporal logic (STL) specifications is crucial to many real-world applications. However, most previous works only consider fixed or parametrized STL specifications due to the lack of a diverse STL dataset and encoders to effectively extract temporal logic information for downstream tasks. In this paper, we propose TeLoGraF, Temporal Logic Graph-encoded Flow, which utilizes Graph Neural Networks (GNN) encoder and flow-matching to learn solutions for general STL specifications. We identify four commonly used STL templates and collect a total of 200K sp"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2505.00562","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/2505.00562/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":"2505.00562","created_at":"2026-07-05T10:57:22.140301+00:00"},{"alias_kind":"arxiv_version","alias_value":"2505.00562v1","created_at":"2026-07-05T10:57:22.140301+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2505.00562","created_at":"2026-07-05T10:57:22.140301+00:00"},{"alias_kind":"pith_short_12","alias_value":"ACVKITZJA6YU","created_at":"2026-07-05T10:57:22.140301+00:00"},{"alias_kind":"pith_short_16","alias_value":"ACVKITZJA6YUNKSN","created_at":"2026-07-05T10:57:22.140301+00:00"},{"alias_kind":"pith_short_8","alias_value":"ACVKITZJ","created_at":"2026-07-05T10:57:22.140301+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":4,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2601.12538","citing_title":"Agentic Reasoning for Large Language Models","ref_index":181,"is_internal_anchor":false},{"citing_arxiv_id":"2605.06117","citing_title":"BoostLLM: Boosting-inspired LLM Fine-tuning for Few-shot Tabular Classification","ref_index":45,"is_internal_anchor":false},{"citing_arxiv_id":"2605.06117","citing_title":"BoostLLM: Boosting-inspired LLM Fine-tuning for Few-shot Tabular Classification","ref_index":45,"is_internal_anchor":false},{"citing_arxiv_id":"2604.18343","citing_title":"DAG-STL: A Hierarchical Framework for Zero-Shot Trajectory Planning under Signal Temporal Logic Specifications","ref_index":84,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/ACVKITZJA6YUNKSNE7GDI3QEYT","json":"https://pith.science/pith/ACVKITZJA6YUNKSNE7GDI3QEYT.json","graph_json":"https://pith.science/api/pith-number/ACVKITZJA6YUNKSNE7GDI3QEYT/graph.json","events_json":"https://pith.science/api/pith-number/ACVKITZJA6YUNKSNE7GDI3QEYT/events.json","paper":"https://pith.science/paper/ACVKITZJ"},"agent_actions":{"view_html":"https://pith.science/pith/ACVKITZJA6YUNKSNE7GDI3QEYT","download_json":"https://pith.science/pith/ACVKITZJA6YUNKSNE7GDI3QEYT.json","view_paper":"https://pith.science/paper/ACVKITZJ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2505.00562&json=true","fetch_graph":"https://pith.science/api/pith-number/ACVKITZJA6YUNKSNE7GDI3QEYT/graph.json","fetch_events":"https://pith.science/api/pith-number/ACVKITZJA6YUNKSNE7GDI3QEYT/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/ACVKITZJA6YUNKSNE7GDI3QEYT/action/timestamp_anchor","attest_storage":"https://pith.science/pith/ACVKITZJA6YUNKSNE7GDI3QEYT/action/storage_attestation","attest_author":"https://pith.science/pith/ACVKITZJA6YUNKSNE7GDI3QEYT/action/author_attestation","sign_citation":"https://pith.science/pith/ACVKITZJA6YUNKSNE7GDI3QEYT/action/citation_signature","submit_replication":"https://pith.science/pith/ACVKITZJA6YUNKSNE7GDI3QEYT/action/replication_record"}},"created_at":"2026-07-05T10:57:22.140301+00:00","updated_at":"2026-07-05T10:57:22.140301+00:00"}