{"as_of":"2026-08-19T08:29:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:db002b34310030c1f5a5b47d43227aaa5a580383802deae194fa78ba1f187957","coverage":[{"denominator":68,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":68,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-16T04:44:57.944557Z","state":"measured"},{"denominator":72,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":72,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-19T06:32:44.657259+00:00","state":"measured"},{"denominator":4,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":4,"source":"paper_references, paper_reference_links","source_observed_at":"2026-05-17T15:14:25.558878Z","state":"measured"},{"denominator":1,"lane":"external_citation_measurements","note":"A source-named dated measurement, never combined with another source.","records_observed":0,"source":"arxiv_reference","source_observed_at":"2026-05-17T15:14:26.156169Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2505.00562","last_updated":"2025-05-01T14:40:07Z","snapshot_observed_at":"2026-08-18T12:59:40.595021Z","submitted_at":"2025-05-01T14:40:07Z","title":"TeLoGraF: Temporal Logic Planning via Graph-encoded Flow Matching","version":1},"cited_work":{"arxiv_id":"2505.00562","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2505.00562","snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Telograf: Temporal logic planning via graph-encoded flow matching","venue":null,"work_id":"6d327ddd-576b-45f1-90fd-1364d807235d","year":2025},"citing_paper":{"arxiv_id":"2601.12538","last_updated":"2026-01-18T18:58:23Z","snapshot_observed_at":"2026-08-04T22:42:23.171653Z","submitted_at":"2026-01-18T18:58:23Z","title":"Agentic Reasoning for Large Language Models","version":1},"reference_index":181,"source":"pdf_text","source_observed_at":"2026-05-17T15:14:25.558878Z"},"links":{"cited_paper":"/paper/2505.00562","citing_paper":"/paper/2601.12538"},"observation_digest":"sha256:cfab905e8b832755db7fda801c5d3c5e113970715cd862a929af2adbc697b7ef","observation_id":"e16130f8-5646-4742-8612-3755726e9e69","resolution":{"observed_at":"2026-05-17T15:14:26.158912Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2505.00562","last_updated":"2025-05-01T14:40:07Z","snapshot_observed_at":"2026-08-18T12:59:40.595021Z","submitted_at":"2025-05-01T14:40:07Z","title":"TeLoGraF: Temporal Logic Planning via Graph-encoded Flow Matching","version":1},"cited_work":{"arxiv_id":"2505.00562","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2505.00562","snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Telograf: Temporal logic planning via graph-encoded flow matching","venue":null,"work_id":"6d327ddd-576b-45f1-90fd-1364d807235d","year":2025},"citing_paper":{"arxiv_id":"2604.18343","last_updated":"2026-04-20T14:41:37Z","snapshot_observed_at":"2026-08-17T07:20:37.182942Z","submitted_at":"2026-04-20T14:41:37Z","title":"DAG-STL: A Hierarchical Framework for Zero-Shot Trajectory Planning under Signal Temporal Logic Specifications","version":1},"reference_index":84,"source":"arxiv_source","source_observed_at":"2026-05-10T03:53:37.295204Z"},"links":{"cited_paper":"/paper/2505.00562","citing_paper":"/paper/2604.18343"},"observation_digest":"sha256:50d1ed7e9d74930bcf3fc3625557e6d36161f3fba925f1e32892d1e615971b06","observation_id":"59b81246-15d1-490c-9c32-f075d390cf63","resolution":{"observed_at":"2026-05-11T12:21:03.083953Z","resolver_source":"arxiv_id","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2505.00562","last_updated":"2025-05-01T14:40:07Z","snapshot_observed_at":"2026-08-18T12:59:40.595021Z","submitted_at":"2025-05-01T14:40:07Z","title":"TeLoGraF: Temporal Logic Planning via Graph-encoded Flow Matching","version":1},"cited_work":{"arxiv_id":"2505.00562","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2505.00562","snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Telograf: Temporal logic planning via graph-encoded flow matching","venue":null,"work_id":"6d327ddd-576b-45f1-90fd-1364d807235d","year":2025},"citing_paper":{"arxiv_id":"2605.06117","last_updated":"2026-05-11T01:17:23Z","snapshot_observed_at":"2026-08-12T21:58:46.183705Z","submitted_at":"2026-05-07T12:27:18Z","title":"BoostLLM: Boosting-inspired LLM Fine-tuning for Few-shot Tabular Classification","version":1},"reference_index":45,"source":"pdf_text","source_observed_at":"2026-05-08T13:50:53.258092Z"},"links":{"cited_paper":"/paper/2505.00562","citing_paper":"/paper/2605.06117"},"observation_digest":"sha256:876dc673cd4ecda2a7fbf4446304fcd726be7f641a2c7f326af54db5f0ec8187","observation_id":"4862035c-e972-41d1-84db-6b5f77b99a1b","resolution":{"observed_at":"2026-05-11T18:51:06.363537Z","resolver_source":"arxiv_id","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2505.00562","last_updated":"2025-05-01T14:40:07Z","snapshot_observed_at":"2026-08-18T12:59:40.595021Z","submitted_at":"2025-05-01T14:40:07Z","title":"TeLoGraF: Temporal Logic Planning via Graph-encoded Flow Matching","version":1},"cited_work":{"arxiv_id":"2505.00562","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2505.00562","snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Telograf: Temporal logic planning via graph-encoded flow matching","venue":null,"work_id":"6d327ddd-576b-45f1-90fd-1364d807235d","year":2025},"citing_paper":{"arxiv_id":"2605.06117","last_updated":"2026-05-11T01:17:23Z","snapshot_observed_at":"2026-08-12T21:58:46.183705Z","submitted_at":"2026-05-07T12:27:18Z","title":"BoostLLM: Boosting-inspired LLM Fine-tuning for Few-shot Tabular Classification","version":2},"reference_index":45,"source":"pdf_text","source_observed_at":"2026-05-12T03:26:41.396467Z"},"links":{"cited_paper":"/paper/2505.00562","citing_paper":"/paper/2605.06117"},"observation_digest":"sha256:00033c5611c00d03a0529ba4051a571d4f6da95fdb8bc357677a9faf16ff1110","observation_id":"bd2f5b5b-152c-4f8b-8887-149ce5775534","resolution":{"observed_at":"2026-05-12T07:21:26.656239Z","resolver_source":"arxiv_id","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+00:00","source":"retraction_watch"}],"state":"measured"}}],"links":{"evidence":"/evidence","html":"/paper/2505.00562/citation-record","integrity":"/paper/2505.00562/integrity","json":"/paper/2505.00562/citation-record.json","paper":"/paper/2505.00562"},"outbound":[{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-16T04:44:57.613502Z","title":"write newline","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2505.00562","last_updated":"2025-05-01T14:40:07Z","snapshot_observed_at":"2026-08-18T12:59:40.595021Z","submitted_at":"2025-05-01T14:40:07Z","title":"TeLoGraF: Temporal Logic Planning via Graph-encoded Flow Matching","version":1},"reference_index":1,"source":"arxiv_source","source_observed_at":"2026-08-16T04:44:57.613502Z"},"links":{"citing_paper":"/paper/2505.00562"},"observation_digest":"sha256:0a6acc82013f3e7c58329f8234d968769d057db37d019a43891607a509ee0ab2","observation_id":"314e4483-cfd6-4cb1-b62d-3d9b486399f5","resolution":{"observed_at":"2026-08-16T04:44:57.613502Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-16T04:44:58.943606Z","title":"T., Baierl, M., Koert, D., and Peters, J","venue":null,"work_id":"df96e8fa-9d10-4c6b-b5cc-df56a6e5b4a9","year":2023},"citing_paper":{"arxiv_id":"2505.00562","last_updated":"2025-05-01T14:40:07Z","snapshot_observed_at":"2026-08-18T12:59:40.595021Z","submitted_at":"2025-05-01T14:40:07Z","title":"TeLoGraF: Temporal Logic Planning via Graph-encoded Flow Matching","version":1},"reference_index":2,"source":"arxiv_source","source_observed_at":"2026-08-16T04:44:57.619498Z"},"links":{"citing_paper":"/paper/2505.00562"},"observation_digest":"sha256:bc0c5c84050f9e8585f6c71557a46749a4b04d8723523dffee5b6191faa37ded","observation_id":"62931e90-01d9-43fa-bf19-80cd6ab95e45","resolution":{"observed_at":"2026-08-16T04:44:58.947954Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2205.09251","last_updated":"2022-05-19T00:05:03Z","snapshot_observed_at":"2026-08-18T09:17:08.114770Z","submitted_at":"2022-05-19T00:05:03Z","title":"IL-flOw: Imitation Learning from Observation using Normalizing Flows","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2205.09251","snapshot_observed_at":"2026-08-16T04:44:57.624301Z","title":null,"venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2505.00562","last_updated":"2025-05-01T14:40:07Z","snapshot_observed_at":"2026-08-18T12:59:40.595021Z","submitted_at":"2025-05-01T14:40:07Z","title":"TeLoGraF: Temporal Logic Planning via Graph-encoded Flow Matching","version":1},"reference_index":3,"source":"arxiv_source","source_observed_at":"2026-08-16T04:44:57.624301Z"},"links":{"cited_paper":"/paper/2205.09251","citing_paper":"/paper/2505.00562"},"observation_digest":"sha256:b4608c0ec38ec3f1fef6b3296f8b95b37e4cbaa56125306ccc51d9965fba6cff","observation_id":"849d5af1-3fed-4e35-ac60-64618391e64c","resolution":{"observed_at":"2026-08-16T04:44:57.624301Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2401.02644","last_updated":"2024-01-05T05:28:40Z","snapshot_observed_at":"2026-08-16T14:29:42.154695Z","submitted_at":"2024-01-05T05:28:40Z","title":"Simple Hierarchical Planning with Diffusion","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2401.02644","snapshot_observed_at":"2026-08-16T04:44:57.629420Z","title":"Simple hierarchical planning with diffusion","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2505.00562","last_updated":"2025-05-01T14:40:07Z","snapshot_observed_at":"2026-08-18T12:59:40.595021Z","submitted_at":"2025-05-01T14:40:07Z","title":"TeLoGraF: Temporal Logic Planning via Graph-encoded Flow Matching","version":1},"reference_index":4,"source":"arxiv_source","source_observed_at":"2026-08-16T04:44:57.629420Z"},"links":{"cited_paper":"/paper/2401.02644","citing_paper":"/paper/2505.00562"},"observation_digest":"sha256:2f50ef7d76a76297e1a0e59630a7bf4f1598989da546ad9583a9403eb1546f76","observation_id":"f8bbec91-0d25-4ad8-9311-779725599f1e","resolution":{"observed_at":"2026-08-16T04:44:57.629420Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2310.06343","last_updated":"2024-01-24T04:44:58Z","snapshot_observed_at":"2026-08-16T14:53:34.558563Z","submitted_at":"2023-10-10T06:26:05Z","title":"Boosting Continuous Control with Consistency Policy","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2310.06343","snapshot_observed_at":"2026-08-16T04:44:57.634641Z","title":"Boosting continuous control with consistency policy","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2505.00562","last_updated":"2025-05-01T14:40:07Z","snapshot_observed_at":"2026-08-18T12:59:40.595021Z","submitted_at":"2025-05-01T14:40:07Z","title":"TeLoGraF: Temporal Logic Planning via Graph-encoded Flow Matching","version":1},"reference_index":5,"source":"arxiv_source","source_observed_at":"2026-08-16T04:44:57.634641Z"},"links":{"cited_paper":"/paper/2310.06343","citing_paper":"/paper/2505.00562"},"observation_digest":"sha256:0bd8c1500bec45f0e990875e7f0d8e48da4642b07f00ac2c454a351221c729af","observation_id":"e3230f35-10d0-421a-8d60-a5f4a1f41942","resolution":{"observed_at":"2026-08-16T04:44:57.634641Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-16T04:44:57.639616Z","title":"Diffusion policy: Visuomotor policy learning via action diffusion","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2505.00562","last_updated":"2025-05-01T14:40:07Z","snapshot_observed_at":"2026-08-18T12:59:40.595021Z","submitted_at":"2025-05-01T14:40:07Z","title":"TeLoGraF: Temporal Logic Planning via Graph-encoded Flow Matching","version":1},"reference_index":6,"source":"arxiv_source","source_observed_at":"2026-08-16T04:44:57.639616Z"},"links":{"citing_paper":"/paper/2505.00562"},"observation_digest":"sha256:980f71a6bae44f33ad90fdde720558a5f385dc1570b5b74a27bc2c9342b1f403","observation_id":"d4fe7f49-6288-4af1-a135-174d08613d00","resolution":{"observed_at":"2026-08-16T04:44:57.639616Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1412.3555","last_updated":"2014-12-11T06:46:53Z","snapshot_observed_at":"2026-08-13T10:35:27.214652Z","submitted_at":"2014-12-11T06:46:53Z","title":"Empirical Evaluation of Gated Recurrent Neural Networks on Sequence Modeling","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1412.3555","snapshot_observed_at":"2026-08-16T04:44:57.644049Z","title":"Empirical evaluation of gated recurrent neural networks on sequence modeling","venue":null,"work_id":null,"year":2014},"citing_paper":{"arxiv_id":"2505.00562","last_updated":"2025-05-01T14:40:07Z","snapshot_observed_at":"2026-08-18T12:59:40.595021Z","submitted_at":"2025-05-01T14:40:07Z","title":"TeLoGraF: Temporal Logic Planning via Graph-encoded Flow Matching","version":1},"reference_index":7,"source":"arxiv_source","source_observed_at":"2026-08-16T04:44:57.644049Z"},"links":{"cited_paper":"/paper/1412.3555","citing_paper":"/paper/2505.00562"},"observation_digest":"sha256:9e5279f85628e8569d1c904b1a574b06cc16c404687bc02ba4a86423d5f0afbc","observation_id":"5cfaf357-c894-4d0c-b5f3-60be1e81630c","resolution":{"observed_at":"2026-08-16T04:44:57.644049Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-16T04:44:58.919553Z","title":null,"venue":null,"work_id":"0f6e897c-2162-4230-956c-9d0d751953c5","year":1981},"citing_paper":{"arxiv_id":"2505.00562","last_updated":"2025-05-01T14:40:07Z","snapshot_observed_at":"2026-08-18T12:59:40.595021Z","submitted_at":"2025-05-01T14:40:07Z","title":"TeLoGraF: Temporal Logic Planning via Graph-encoded Flow Matching","version":1},"reference_index":8,"source":"arxiv_source","source_observed_at":"2026-08-16T04:44:57.649368Z"},"links":{"citing_paper":"/paper/2505.00562"},"observation_digest":"sha256:6a7f2e322ba34407b9cc05f9f77d575817965fbeb355e9ba4c4b305645a1e995","observation_id":"9b41a8d8-62b6-4967-b562-57244e924ac7","resolution":{"observed_at":"2026-08-16T04:44:58.924679Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-16T04:44:58.904642Z","title":"and Bai, Y","venue":null,"work_id":"ac36ced3-00e0-4b9d-ba5a-600fb88b8370","year":2021},"citing_paper":{"arxiv_id":"2505.00562","last_updated":"2025-05-01T14:40:07Z","snapshot_observed_at":"2026-08-18T12:59:40.595021Z","submitted_at":"2025-05-01T14:40:07Z","title":"TeLoGraF: Temporal Logic Planning via Graph-encoded Flow Matching","version":1},"reference_index":9,"source":"arxiv_source","source_observed_at":"2026-08-16T04:44:57.653502Z"},"links":{"citing_paper":"/paper/2505.00562"},"observation_digest":"sha256:34c59c10abb1c59d5f6e232db73c5a9f594a52c4201fdd70fc64e0f97ed14118","observation_id":"834245fd-2c0b-47e8-af7f-ceb699302884","resolution":{"observed_at":"2026-08-16T04:44:58.909264Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-16T04:44:58.889445Z","title":"and Fan, C","venue":null,"work_id":"d8ca49a9-91b2-456e-bd1a-27825544a5d2","year":2022},"citing_paper":{"arxiv_id":"2505.00562","last_updated":"2025-05-01T14:40:07Z","snapshot_observed_at":"2026-08-18T12:59:40.595021Z","submitted_at":"2025-05-01T14:40:07Z","title":"TeLoGraF: Temporal Logic Planning via Graph-encoded Flow Matching","version":1},"reference_index":10,"source":"arxiv_source","source_observed_at":"2026-08-16T04:44:57.657682Z"},"links":{"citing_paper":"/paper/2505.00562"},"observation_digest":"sha256:a1ecb5ad41bcd5f66f58dea8d31b7f29cd2db091a7d17862a41b7980858fd97d","observation_id":"7e6032f1-baa2-415e-82f5-8a7574f7e9c4","resolution":{"observed_at":"2026-08-16T04:44:58.893850Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-16T04:44:58.874871Z","title":"J., Lee, S","venue":null,"work_id":"8ed2314a-d64f-4020-8c80-28c6d9aa30e4","year":2024},"citing_paper":{"arxiv_id":"2505.00562","last_updated":"2025-05-01T14:40:07Z","snapshot_observed_at":"2026-08-18T12:59:40.595021Z","submitted_at":"2025-05-01T14:40:07Z","title":"TeLoGraF: Temporal Logic Planning via Graph-encoded Flow Matching","version":1},"reference_index":11,"source":"arxiv_source","source_observed_at":"2026-08-16T04:44:57.661975Z"},"links":{"citing_paper":"/paper/2505.00562"},"observation_digest":"sha256:8e2ee3cde331dc2c2c1ad9fab2d5414936472967907542c79b39c6e51a223060","observation_id":"b1eb1201-a733-43ef-89e6-4e59ebf422c1","resolution":{"observed_at":"2026-08-16T04:44:58.879278Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-16T04:44:58.860690Z","title":"and Maler, O","venue":null,"work_id":"76251a01-4338-44f2-bdff-4bde80d00716","year":2010},"citing_paper":{"arxiv_id":"2505.00562","last_updated":"2025-05-01T14:40:07Z","snapshot_observed_at":"2026-08-18T12:59:40.595021Z","submitted_at":"2025-05-01T14:40:07Z","title":"TeLoGraF: Temporal Logic Planning via Graph-encoded Flow Matching","version":1},"reference_index":12,"source":"arxiv_source","source_observed_at":"2026-08-16T04:44:57.666178Z"},"links":{"citing_paper":"/paper/2505.00562"},"observation_digest":"sha256:ff3ddff333fb18081f7243fc5bc6a0d8345b38399cda9c7c54922dc7446ac952","observation_id":"f5428cbc-6bb9-409f-80bf-eaa08ee95078","resolution":{"observed_at":"2026-08-16T04:44:58.864994Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-16T04:44:58.846673Z","title":"Efficient robust monitoring for stl","venue":null,"work_id":"e3ed8083-754e-40a0-a580-3d67472b5545","year":2013},"citing_paper":{"arxiv_id":"2505.00562","last_updated":"2025-05-01T14:40:07Z","snapshot_observed_at":"2026-08-18T12:59:40.595021Z","submitted_at":"2025-05-01T14:40:07Z","title":"TeLoGraF: Temporal Logic Planning via Graph-encoded Flow Matching","version":1},"reference_index":13,"source":"arxiv_source","source_observed_at":"2026-08-16T04:44:57.670565Z"},"links":{"citing_paper":"/paper/2505.00562"},"observation_digest":"sha256:94a77a4ddc6009e9fb39840c00844052b2a0d81ce5018923119915788a63f4e0","observation_id":"2c46fb87-df47-4cdd-abb7-ec65efd7434b","resolution":{"observed_at":"2026-08-16T04:44:58.851257Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2501.05639","last_updated":"2025-01-10T00:56:39Z","snapshot_observed_at":"2026-08-16T12:59:25.304403Z","submitted_at":"2025-01-10T00:56:39Z","title":"Scaling Safe Multi-Agent Control for Signal Temporal Logic Specifications","version":1},"cited_work":{"arxiv_id":"2501.05639","doi":null,"metadata_source":"pith","pith_arxiv_id":"2501.05639","snapshot_observed_at":"2026-08-16T04:44:58.311707Z","title":"Scaling Safe Multi-Agent Control for Signal Temporal Logic Specifications","venue":"cs.MA","work_id":"137e0adb-d1d4-4589-9c3d-6c737556bdec","year":2025},"citing_paper":{"arxiv_id":"2505.00562","last_updated":"2025-05-01T14:40:07Z","snapshot_observed_at":"2026-08-18T12:59:40.595021Z","submitted_at":"2025-05-01T14:40:07Z","title":"TeLoGraF: Temporal Logic Planning via Graph-encoded Flow Matching","version":1},"reference_index":14,"source":"arxiv_source","source_observed_at":"2026-08-16T04:44:57.674890Z"},"links":{"cited_paper":"/paper/2501.05639","citing_paper":"/paper/2505.00562"},"observation_digest":"sha256:f2c754bf2750735f9d022ba405faba235120a9a5d2d192d9e4dd73897b2d1cd5","observation_id":"ff75b190-fbb8-4c32-8d22-3d630d4a3a84","resolution":{"observed_at":"2026-08-16T04:44:58.316612Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-16T04:44:58.831570Z","title":"E., Girard, A., Kress-Gazit, H., and Pappas, G","venue":null,"work_id":"31774417-ac3c-437f-bdb5-d256f725277c","year":2009},"citing_paper":{"arxiv_id":"2505.00562","last_updated":"2025-05-01T14:40:07Z","snapshot_observed_at":"2026-08-18T12:59:40.595021Z","submitted_at":"2025-05-01T14:40:07Z","title":"TeLoGraF: Temporal Logic Planning via Graph-encoded Flow Matching","version":1},"reference_index":15,"source":"arxiv_source","source_observed_at":"2026-08-16T04:44:57.679537Z"},"links":{"citing_paper":"/paper/2505.00562"},"observation_digest":"sha256:2fc992822e16bffa8c119a482607a900da7eade83d7921dc01dcaea379dd857a","observation_id":"2858afcc-b265-45d0-a256-9154ba596cc6","resolution":{"observed_at":"2026-08-16T04:44:58.836717Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-16T04:44:58.816590Z","title":"R., Eppner, C., Lozano-P \\'e rez, T., Kaelbling, L","venue":null,"work_id":"7c1eec83-a1fa-4d84-bccb-896712f67161","year":2024},"citing_paper":{"arxiv_id":"2505.00562","last_updated":"2025-05-01T14:40:07Z","snapshot_observed_at":"2026-08-18T12:59:40.595021Z","submitted_at":"2025-05-01T14:40:07Z","title":"TeLoGraF: Temporal Logic Planning via Graph-encoded Flow Matching","version":1},"reference_index":16,"source":"arxiv_source","source_observed_at":"2026-08-16T04:44:57.684267Z"},"links":{"citing_paper":"/paper/2505.00562"},"observation_digest":"sha256:d2e12af373e1090196f888fd2b72e66e77b7cca1b5cd041c40789bb800a714ec","observation_id":"80abb759-0df9-4a10-b481-3424052100e6","resolution":{"observed_at":"2026-08-16T04:44:58.821131Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2405.04235","last_updated":"2024-09-30T08:42:00Z","snapshot_observed_at":"2026-08-19T05:25:08.032585Z","submitted_at":"2024-05-07T11:54:22Z","title":"LTLDoG: Satisfying Temporally-Extended Symbolic Constraints for Safe Diffusion-based Planning","version":2},"cited_work":{"arxiv_id":"2405.04235","doi":null,"metadata_source":"pith","pith_arxiv_id":"2405.04235","snapshot_observed_at":"2026-08-16T04:44:58.290914Z","title":"LTLDoG: Satisfying Temporally-Extended Symbolic Constraints for Safe Diffusion-based Planning","venue":"cs.RO","work_id":"9aa93b99-b871-4005-8f67-fa898dc831e3","year":2024},"citing_paper":{"arxiv_id":"2505.00562","last_updated":"2025-05-01T14:40:07Z","snapshot_observed_at":"2026-08-18T12:59:40.595021Z","submitted_at":"2025-05-01T14:40:07Z","title":"TeLoGraF: Temporal Logic Planning via Graph-encoded Flow Matching","version":1},"reference_index":17,"source":"arxiv_source","source_observed_at":"2026-08-16T04:44:57.688349Z"},"links":{"cited_paper":"/paper/2405.04235","citing_paper":"/paper/2505.00562"},"observation_digest":"sha256:53e118fdb9a73eaec48ec4e371c6cf12e6f138c0c08a26ca274ae59a317f263c","observation_id":"75e7705b-447d-43f2-ba54-b378a7d24180","resolution":{"observed_at":"2026-08-16T04:44:58.295722Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1903.02428","last_updated":"2019-04-25T10:06:09Z","snapshot_observed_at":"2026-08-02T18:54:43.326912Z","submitted_at":"2019-03-06T14:50:02Z","title":"Fast Graph Representation Learning with PyTorch Geometric","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1903.02428","snapshot_observed_at":"2026-08-16T04:44:57.693113Z","title":"and Lenssen, J","venue":null,"work_id":null,"year":1903},"citing_paper":{"arxiv_id":"2505.00562","last_updated":"2025-05-01T14:40:07Z","snapshot_observed_at":"2026-08-18T12:59:40.595021Z","submitted_at":"2025-05-01T14:40:07Z","title":"TeLoGraF: Temporal Logic Planning via Graph-encoded Flow Matching","version":1},"reference_index":18,"source":"arxiv_source","source_observed_at":"2026-08-16T04:44:57.693113Z"},"links":{"cited_paper":"/paper/1903.02428","citing_paper":"/paper/2505.00562"},"observation_digest":"sha256:e332a33ff7b8f07dbfdede8dec3c3d5e0162eda662507ab174c3f01cce03e55b","observation_id":"838ad5ae-662d-402e-83a3-2da4c282f830","resolution":{"observed_at":"2026-08-16T04:44:57.693113Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-16T04:44:58.801968Z","title":"Ltlmop: Experimenting with language, temporal logic and robot control","venue":null,"work_id":"db51f14a-e4de-48ce-b3ca-0e358893b608","year":2010},"citing_paper":{"arxiv_id":"2505.00562","last_updated":"2025-05-01T14:40:07Z","snapshot_observed_at":"2026-08-18T12:59:40.595021Z","submitted_at":"2025-05-01T14:40:07Z","title":"TeLoGraF: Temporal Logic Planning via Graph-encoded Flow Matching","version":1},"reference_index":19,"source":"arxiv_source","source_observed_at":"2026-08-16T04:44:57.697698Z"},"links":{"citing_paper":"/paper/2505.00562"},"observation_digest":"sha256:94ab229f0baebcaeff0f511e3a45a68a03e6043a1da30f4db88a3e679ef08748","observation_id":"cd45cf9e-0fb2-440a-8dc8-6eccbdf3b0dd","resolution":{"observed_at":"2026-08-16T04:44:58.806871Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2004.07219","last_updated":"2021-02-06T01:57:28Z","snapshot_observed_at":"2026-08-16T08:32:46.407746Z","submitted_at":"2020-04-15T17:18:19Z","title":"D4RL: Datasets for Deep Data-Driven Reinforcement Learning","version":4},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2004.07219","snapshot_observed_at":"2026-08-16T04:44:57.702445Z","title":"D4rl: Datasets for deep data-driven reinforcement learning","venue":null,"work_id":null,"year":2004},"citing_paper":{"arxiv_id":"2505.00562","last_updated":"2025-05-01T14:40:07Z","snapshot_observed_at":"2026-08-18T12:59:40.595021Z","submitted_at":"2025-05-01T14:40:07Z","title":"TeLoGraF: Temporal Logic Planning via Graph-encoded Flow Matching","version":1},"reference_index":20,"source":"arxiv_source","source_observed_at":"2026-08-16T04:44:57.702445Z"},"links":{"cited_paper":"/paper/2004.07219","citing_paper":"/paper/2505.00562"},"observation_digest":"sha256:5c397b27e27b9382f3769a9ac85ebd537a1b822cfef94c6e419b56a9e3ec8046","observation_id":"61191f96-5d9b-455f-a446-609401fd044a","resolution":{"observed_at":"2026-08-16T04:44:57.702445Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-16T04:44:58.787557Z","title":"R., and De Luca, A","venue":null,"work_id":"e3077d05-7849-49c8-898a-87185534cc1a","year":2019},"citing_paper":{"arxiv_id":"2505.00562","last_updated":"2025-05-01T14:40:07Z","snapshot_observed_at":"2026-08-18T12:59:40.595021Z","submitted_at":"2025-05-01T14:40:07Z","title":"TeLoGraF: Temporal Logic Planning via Graph-encoded Flow Matching","version":1},"reference_index":21,"source":"arxiv_source","source_observed_at":"2026-08-16T04:44:57.706979Z"},"links":{"citing_paper":"/paper/2505.00562"},"observation_digest":"sha256:9eabe5b78d4328822bf8869dda5b08c174635d851ead86fba2c49006ad2f1cb4","observation_id":"fee7020c-feb5-4425-af54-94a471180e30","resolution":{"observed_at":"2026-08-16T04:44:58.792329Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-16T04:44:58.773271Z","title":"Temporal logic specification-conditioned decision transformer for offline safe reinforcement learning","venue":null,"work_id":"be4366e1-33d6-465e-ae28-e813b956c0be","year":2024},"citing_paper":{"arxiv_id":"2505.00562","last_updated":"2025-05-01T14:40:07Z","snapshot_observed_at":"2026-08-18T12:59:40.595021Z","submitted_at":"2025-05-01T14:40:07Z","title":"TeLoGraF: Temporal Logic Planning via Graph-encoded Flow Matching","version":1},"reference_index":22,"source":"arxiv_source","source_observed_at":"2026-08-16T04:44:57.711121Z"},"links":{"citing_paper":"/paper/2505.00562"},"observation_digest":"sha256:69d77511b92e2a07a194906d16460a96caca7731e30bf87b26bb2f339e7d1c6a","observation_id":"2a2bdd03-edf2-45bb-b789-ed94e617e14a","resolution":{"observed_at":"2026-08-16T04:44:58.777974Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2212.05200","last_updated":"2022-12-10T04:44:25Z","snapshot_observed_at":"2026-08-16T16:09:38.636295Z","submitted_at":"2022-12-10T04:44:25Z","title":"Neural Controller Synthesis for Signal Temporal Logic Specifications Using Encoder-Decoder Structured Networks","version":1},"cited_work":{"arxiv_id":"2212.05200","doi":null,"metadata_source":"pith","pith_arxiv_id":"2212.05200","snapshot_observed_at":"2026-08-16T04:44:58.238197Z","title":"Neural Controller Synthesis for Signal Temporal Logic Specifications Using Encoder-Decoder Structured Networks","venue":"eess.SY","work_id":"a8ab2a3c-b26a-4bbc-b197-bd9c7176b017","year":2022},"citing_paper":{"arxiv_id":"2505.00562","last_updated":"2025-05-01T14:40:07Z","snapshot_observed_at":"2026-08-18T12:59:40.595021Z","submitted_at":"2025-05-01T14:40:07Z","title":"TeLoGraF: Temporal Logic Planning via Graph-encoded Flow Matching","version":1},"reference_index":23,"source":"arxiv_source","source_observed_at":"2026-08-16T04:44:57.715274Z"},"links":{"cited_paper":"/paper/2212.05200","citing_paper":"/paper/2505.00562"},"observation_digest":"sha256:0725e58ca71f921f7885c437b81b056f058921e2cfb6a886cf974c2005e1a916","observation_id":"a4bbd905-895c-4cc0-a9e2-63fc1201c7d1","resolution":{"observed_at":"2026-08-16T04:44:58.244922Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-16T04:44:58.758891Z","title":"Deepstl: from english requirements to signal temporal logic","venue":null,"work_id":"dfe87d03-0ab7-4cac-9320-c3d507eb80b6","year":2022},"citing_paper":{"arxiv_id":"2505.00562","last_updated":"2025-05-01T14:40:07Z","snapshot_observed_at":"2026-08-18T12:59:40.595021Z","submitted_at":"2025-05-01T14:40:07Z","title":"TeLoGraF: Temporal Logic Planning via Graph-encoded Flow Matching","version":1},"reference_index":24,"source":"arxiv_source","source_observed_at":"2026-08-16T04:44:57.719860Z"},"links":{"citing_paper":"/paper/2505.00562"},"observation_digest":"sha256:10493b331130788d2fb65649ef1e06e7f3035a987892d41b36695215e3b0483e","observation_id":"cb123ee8-af73-43d6-9022-df2fd6a41ed1","resolution":{"observed_at":"2026-08-16T04:44:58.763297Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-16T04:44:57.723764Z","title":"Denoising diffusion probabilistic models","venue":null,"work_id":null,"year":2020},"citing_paper":{"arxiv_id":"2505.00562","last_updated":"2025-05-01T14:40:07Z","snapshot_observed_at":"2026-08-18T12:59:40.595021Z","submitted_at":"2025-05-01T14:40:07Z","title":"TeLoGraF: Temporal Logic Planning via Graph-encoded Flow Matching","version":1},"reference_index":25,"source":"arxiv_source","source_observed_at":"2026-08-16T04:44:57.723764Z"},"links":{"citing_paper":"/paper/2505.00562"},"observation_digest":"sha256:32856a48a1167be64318e00785b76ad2dc8d9a54dd891ce13bfb36acff2c36eb","observation_id":"4e329267-85da-4902-81e3-a1a174bd0779","resolution":{"observed_at":"2026-08-16T04:44:57.723764Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2410.16727","last_updated":"2024-10-22T06:25:34Z","snapshot_observed_at":"2026-08-18T11:06:46.570690Z","submitted_at":"2024-10-22T06:25:34Z","title":"DiffusionSeeder: Seeding Motion Optimization with Diffusion for Rapid Motion Planning","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2410.16727","snapshot_observed_at":"2026-08-16T04:44:57.727839Z","title":"Diffusionseeder: Seeding motion optimization with diffusion for rapid motion planning","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2505.00562","last_updated":"2025-05-01T14:40:07Z","snapshot_observed_at":"2026-08-18T12:59:40.595021Z","submitted_at":"2025-05-01T14:40:07Z","title":"TeLoGraF: Temporal Logic Planning via Graph-encoded Flow Matching","version":1},"reference_index":26,"source":"arxiv_source","source_observed_at":"2026-08-16T04:44:57.727839Z"},"links":{"cited_paper":"/paper/2410.16727","citing_paper":"/paper/2505.00562"},"observation_digest":"sha256:8c544d4eabbce9463ac19a89e9cbdb1d89fea3d33d1475612b001f46479b09cd","observation_id":"e15e671d-fa49-4e6f-9c82-9ffdc8707253","resolution":{"observed_at":"2026-08-16T04:44:57.727839Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2410.04631","last_updated":"2025-03-29T11:33:49Z","snapshot_observed_at":"2026-08-16T13:12:06.779634Z","submitted_at":"2024-10-06T21:30:38Z","title":"DeepLTL: Learning to Efficiently Satisfy Complex LTL Specifications for Multi-Task RL","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2410.04631","snapshot_observed_at":"2026-08-16T04:44:57.732413Z","title":"and Abate, A","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2505.00562","last_updated":"2025-05-01T14:40:07Z","snapshot_observed_at":"2026-08-18T12:59:40.595021Z","submitted_at":"2025-05-01T14:40:07Z","title":"TeLoGraF: Temporal Logic Planning via Graph-encoded Flow Matching","version":1},"reference_index":27,"source":"arxiv_source","source_observed_at":"2026-08-16T04:44:57.732413Z"},"links":{"cited_paper":"/paper/2410.04631","citing_paper":"/paper/2505.00562"},"observation_digest":"sha256:6118d1aeb1d9d045aaaebb30cacd352860419c9b8cd61cfa69c809391447e783","observation_id":"5a2a325d-620c-4efa-9274-ec65c1243870","resolution":{"observed_at":"2026-08-16T04:44:57.732413Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2205.09991","last_updated":"2022-12-21T01:06:18Z","snapshot_observed_at":"2026-08-17T05:09:53.121073Z","submitted_at":"2022-05-20T07:02:03Z","title":"Planning with Diffusion for Flexible Behavior Synthesis","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2205.09991","snapshot_observed_at":"2026-08-16T04:44:57.736924Z","title":"B., and Levine, S","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2505.00562","last_updated":"2025-05-01T14:40:07Z","snapshot_observed_at":"2026-08-18T12:59:40.595021Z","submitted_at":"2025-05-01T14:40:07Z","title":"TeLoGraF: Temporal Logic Planning via Graph-encoded Flow Matching","version":1},"reference_index":28,"source":"arxiv_source","source_observed_at":"2026-08-16T04:44:57.736924Z"},"links":{"cited_paper":"/paper/2205.09991","citing_paper":"/paper/2505.00562"},"observation_digest":"sha256:d160d0074f16758d654dc94396ee00f739a2eb138dbb519092e67dd6491a5e94","observation_id":"f97519dc-e4c4-4b40-95bc-37daa5b7a2f3","resolution":{"observed_at":"2026-08-16T04:44:57.736924Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2011.04950","last_updated":"2020-11-10T07:31:47Z","snapshot_observed_at":"2026-08-16T19:06:57.953287Z","submitted_at":"2020-11-10T07:31:47Z","title":"Model-based Reinforcement Learning from Signal Temporal Logic Specifications","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2011.04950","snapshot_observed_at":"2026-08-16T04:44:57.741276Z","title":null,"venue":null,"work_id":null,"year":2011},"citing_paper":{"arxiv_id":"2505.00562","last_updated":"2025-05-01T14:40:07Z","snapshot_observed_at":"2026-08-18T12:59:40.595021Z","submitted_at":"2025-05-01T14:40:07Z","title":"TeLoGraF: Temporal Logic Planning via Graph-encoded Flow Matching","version":1},"reference_index":29,"source":"arxiv_source","source_observed_at":"2026-08-16T04:44:57.741276Z"},"links":{"cited_paper":"/paper/2011.04950","citing_paper":"/paper/2505.00562"},"observation_digest":"sha256:2b7f604b25c8c88441077f730290933ca6764e5f80bbd7b9b3d5039dd081a1b9","observation_id":"94bc0a1d-5415-435d-97ea-ee03daeea7f5","resolution":{"observed_at":"2026-08-16T04:44:57.741276Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2402.10885","last_updated":"2024-07-25T14:30:22Z","snapshot_observed_at":"2026-07-06T17:31:17.058043Z","submitted_at":"2024-02-16T18:43:02Z","title":"3D Diffuser Actor: Policy Diffusion with 3D Scene Representations","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2402.10885","snapshot_observed_at":"2026-08-16T04:44:57.745699Z","title":"3d diffuser actor: Policy diffusion with 3d scene representations","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2505.00562","last_updated":"2025-05-01T14:40:07Z","snapshot_observed_at":"2026-08-18T12:59:40.595021Z","submitted_at":"2025-05-01T14:40:07Z","title":"TeLoGraF: Temporal Logic Planning via Graph-encoded Flow Matching","version":1},"reference_index":30,"source":"arxiv_source","source_observed_at":"2026-08-16T04:44:57.745699Z"},"links":{"cited_paper":"/paper/2402.10885","citing_paper":"/paper/2505.00562"},"observation_digest":"sha256:0d46ed498dde3aba71402b91f5ce1f5ce871d98296dee7b961c9ae89ea4c38a1","observation_id":"c7d97d27-1eea-48dc-8739-6b0ddcbaff8a","resolution":{"observed_at":"2026-08-16T04:44:57.745699Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-16T04:44:58.734785Z","title":"Power and limits of the Weisfeiler-Leman algorithm","venue":null,"work_id":"646dd829-d43a-4d9a-8e16-0210de7bce88","year":2020},"citing_paper":{"arxiv_id":"2505.00562","last_updated":"2025-05-01T14:40:07Z","snapshot_observed_at":"2026-08-18T12:59:40.595021Z","submitted_at":"2025-05-01T14:40:07Z","title":"TeLoGraF: Temporal Logic Planning via Graph-encoded Flow Matching","version":1},"reference_index":31,"source":"arxiv_source","source_observed_at":"2026-08-16T04:44:57.749951Z"},"links":{"citing_paper":"/paper/2505.00562"},"observation_digest":"sha256:b1f89e003a1381d9a3ecc0ead128f87a7cb82b7d601aecc390030f40f7b37e2e","observation_id":"3a3abde9-6268-4f0b-8c49-1bbcbd2fd830","resolution":{"observed_at":"2026-08-16T04:44:58.739279Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1412.6980","last_updated":"2017-01-30T01:27:54Z","snapshot_observed_at":"2026-08-17T19:26:44.032537Z","submitted_at":"2014-12-22T13:54:29Z","title":"Adam: A Method for Stochastic Optimization","version":9},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1412.6980","snapshot_observed_at":"2026-08-16T04:44:57.754379Z","title":"Adam: a method for stochastic optimization","venue":null,"work_id":null,"year":2014},"citing_paper":{"arxiv_id":"2505.00562","last_updated":"2025-05-01T14:40:07Z","snapshot_observed_at":"2026-08-18T12:59:40.595021Z","submitted_at":"2025-05-01T14:40:07Z","title":"TeLoGraF: Temporal Logic Planning via Graph-encoded Flow Matching","version":1},"reference_index":32,"source":"arxiv_source","source_observed_at":"2026-08-16T04:44:57.754379Z"},"links":{"cited_paper":"/paper/1412.6980","citing_paper":"/paper/2505.00562"},"observation_digest":"sha256:3f8d36d82a47ee75ffca61d616070f62cd95e1f9c101636b61b520d01fa521cb","observation_id":"a9c3e25e-ebdd-47d0-a0de-5096e75b7b3d","resolution":{"observed_at":"2026-08-16T04:44:57.754379Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1609.02907","last_updated":"2017-02-22T09:55:36Z","snapshot_observed_at":"2026-08-17T10:49:36.026134Z","submitted_at":"2016-09-09T19:48:41Z","title":"Semi-Supervised Classification with Graph Convolutional Networks","version":4},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1609.02907","snapshot_observed_at":"2026-08-16T04:44:57.758755Z","title":null,"venue":null,"work_id":null,"year":2016},"citing_paper":{"arxiv_id":"2505.00562","last_updated":"2025-05-01T14:40:07Z","snapshot_observed_at":"2026-08-18T12:59:40.595021Z","submitted_at":"2025-05-01T14:40:07Z","title":"TeLoGraF: Temporal Logic Planning via Graph-encoded Flow Matching","version":1},"reference_index":33,"source":"arxiv_source","source_observed_at":"2026-08-16T04:44:57.758755Z"},"links":{"cited_paper":"/paper/1609.02907","citing_paper":"/paper/2505.00562"},"observation_digest":"sha256:8126dc830c6ae5253684c05f82849e15b9dc22d282034144bc8f0c0a284064b9","observation_id":"35eadbd4-b47f-43f2-b88f-92831ff41fb8","resolution":{"observed_at":"2026-08-16T04:44:57.758755Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-16T04:44:58.720340Z","title":"Specifying real-time properties with metric temporal logic","venue":null,"work_id":"82f5ea99-67d0-4683-9903-0b4e215c0372","year":1990},"citing_paper":{"arxiv_id":"2505.00562","last_updated":"2025-05-01T14:40:07Z","snapshot_observed_at":"2026-08-18T12:59:40.595021Z","submitted_at":"2025-05-01T14:40:07Z","title":"TeLoGraF: Temporal Logic Planning via Graph-encoded Flow Matching","version":1},"reference_index":34,"source":"arxiv_source","source_observed_at":"2026-08-16T04:44:57.763099Z"},"links":{"citing_paper":"/paper/2505.00562"},"observation_digest":"sha256:774b3b016d7505715593380821903582b2bb4799337877a88cc7bf516b535952","observation_id":"2af83a96-bb3b-4148-b6f1-08485c0bf58b","resolution":{"observed_at":"2026-08-16T04:44:58.724817Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-16T04:44:58.705945Z","title":"and Lin, H","venue":null,"work_id":"e5a28b00-fa1f-4618-b8b7-2d280affc3ba","year":2022},"citing_paper":{"arxiv_id":"2505.00562","last_updated":"2025-05-01T14:40:07Z","snapshot_observed_at":"2026-08-18T12:59:40.595021Z","submitted_at":"2025-05-01T14:40:07Z","title":"TeLoGraF: Temporal Logic Planning via Graph-encoded Flow Matching","version":1},"reference_index":35,"source":"arxiv_source","source_observed_at":"2026-08-16T04:44:57.767306Z"},"links":{"citing_paper":"/paper/2505.00562"},"observation_digest":"sha256:3b5f65fea0e0921efdb3bc4afb68316764f3feb886f80b8faa45fca4a33a8c7d","observation_id":"ca1966bd-9ee3-4b1d-8005-fc6613f8b443","resolution":{"observed_at":"2026-08-16T04:44:58.710785Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-16T04:44:58.690825Z","title":"and Pavone, M","venue":null,"work_id":"7b55317f-b780-4744-8223-8ba79c3f3223","year":2022},"citing_paper":{"arxiv_id":"2505.00562","last_updated":"2025-05-01T14:40:07Z","snapshot_observed_at":"2026-08-18T12:59:40.595021Z","submitted_at":"2025-05-01T14:40:07Z","title":"TeLoGraF: Temporal Logic Planning via Graph-encoded Flow Matching","version":1},"reference_index":36,"source":"arxiv_source","source_observed_at":"2026-08-16T04:44:57.771330Z"},"links":{"citing_paper":"/paper/2505.00562"},"observation_digest":"sha256:b22afd60d6d8a71b6be66302868826f1514de757d9797869dfc9fce0572c8c46","observation_id":"feb14091-28ac-466b-9850-ad8a247a9b13","resolution":{"observed_at":"2026-08-16T04:44:58.695987Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-16T04:44:58.675660Z","title":"Backpropagation through signal temporal logic specifications: Infusing logical structure into gradient-based methods","venue":null,"work_id":"82f179c3-7a16-4ad0-b135-addc6ebd4a5a","year":2023},"citing_paper":{"arxiv_id":"2505.00562","last_updated":"2025-05-01T14:40:07Z","snapshot_observed_at":"2026-08-18T12:59:40.595021Z","submitted_at":"2025-05-01T14:40:07Z","title":"TeLoGraF: Temporal Logic Planning via Graph-encoded Flow Matching","version":1},"reference_index":37,"source":"arxiv_source","source_observed_at":"2026-08-16T04:44:57.775614Z"},"links":{"citing_paper":"/paper/2505.00562"},"observation_digest":"sha256:90b6294581dea8256b02c5df95a1fbba0cb4417b00d32fda517b80821d5d5f21","observation_id":"01ec6c80-7a4e-4595-a7d8-891ab68a4c33","resolution":{"observed_at":"2026-08-16T04:44:58.680527Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-16T04:44:57.779851Z","title":"Hierarchical diffusion for offline decision making","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2505.00562","last_updated":"2025-05-01T14:40:07Z","snapshot_observed_at":"2026-08-18T12:59:40.595021Z","submitted_at":"2025-05-01T14:40:07Z","title":"TeLoGraF: Temporal Logic Planning via Graph-encoded Flow Matching","version":1},"reference_index":38,"source":"arxiv_source","source_observed_at":"2026-08-16T04:44:57.779851Z"},"links":{"citing_paper":"/paper/2505.00562"},"observation_digest":"sha256:637bcfc94cd518ad070415851206915d14c87a223f9809653bc41d2139e81507","observation_id":"dd8052f0-21dc-41bc-8da7-4c7d93c6db4d","resolution":{"observed_at":"2026-08-16T04:44:57.779851Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-16T04:44:58.651723Z","title":"Reinforcement learning with temporal logic rewards","venue":null,"work_id":"b6e663ab-3800-4c35-a87f-7196e8224266","year":2017},"citing_paper":{"arxiv_id":"2505.00562","last_updated":"2025-05-01T14:40:07Z","snapshot_observed_at":"2026-08-18T12:59:40.595021Z","submitted_at":"2025-05-01T14:40:07Z","title":"TeLoGraF: Temporal Logic Planning via Graph-encoded Flow Matching","version":1},"reference_index":39,"source":"arxiv_source","source_observed_at":"2026-08-16T04:44:57.784227Z"},"links":{"citing_paper":"/paper/2505.00562"},"observation_digest":"sha256:53f718b9d603058c2382bf999c13594713657089b663d03d0b61e1357c01f160","observation_id":"7ea89671-6655-4a6d-9b20-90fd4e523f96","resolution":{"observed_at":"2026-08-16T04:44:58.656342Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-16T04:44:58.636358Z","title":"Recurrent neural network controllers for signal temporal logic specifications subject to safety constraints","venue":null,"work_id":"e4851666-9b86-42e4-ba8b-7e0b40d3368b","year":2021},"citing_paper":{"arxiv_id":"2505.00562","last_updated":"2025-05-01T14:40:07Z","snapshot_observed_at":"2026-08-18T12:59:40.595021Z","submitted_at":"2025-05-01T14:40:07Z","title":"TeLoGraF: Temporal Logic Planning via Graph-encoded Flow Matching","version":1},"reference_index":40,"source":"arxiv_source","source_observed_at":"2026-08-16T04:44:57.788753Z"},"links":{"citing_paper":"/paper/2505.00562"},"observation_digest":"sha256:08479a7a36165ee2e1f0061d24218b67e28ac4c83a283c1c69781adde8546795","observation_id":"9758e1aa-440e-481b-a901-27a657aeb7d3","resolution":{"observed_at":"2026-08-16T04:44:58.641685Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2209.03003","last_updated":"2022-09-07T08:59:55Z","snapshot_observed_at":"2026-07-06T13:49:40.974495Z","submitted_at":"2022-09-07T08:59:55Z","title":"Flow Straight and Fast: Learning to Generate and Transfer Data with Rectified Flow","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2209.03003","snapshot_observed_at":"2026-08-16T04:44:57.793081Z","title":"Flow straight and fast: Learning to generate and transfer data with rectified flow","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2505.00562","last_updated":"2025-05-01T14:40:07Z","snapshot_observed_at":"2026-08-18T12:59:40.595021Z","submitted_at":"2025-05-01T14:40:07Z","title":"TeLoGraF: Temporal Logic Planning via Graph-encoded Flow Matching","version":1},"reference_index":41,"source":"arxiv_source","source_observed_at":"2026-08-16T04:44:57.793081Z"},"links":{"cited_paper":"/paper/2209.03003","citing_paper":"/paper/2505.00562"},"observation_digest":"sha256:638c47f765a413ecff7500a33badb1489b0622e87a15d9f9b5a26178142f833d","observation_id":"ba439b57-ca16-4c1e-8abd-e53ec67b22f7","resolution":{"observed_at":"2026-08-16T04:44:57.793081Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-16T04:44:58.620916Z","title":"Formalization of intersection traffic rules in temporal logic","venue":null,"work_id":"51ed3574-0461-47ee-bea4-7ccab6bf6792","year":2022},"citing_paper":{"arxiv_id":"2505.00562","last_updated":"2025-05-01T14:40:07Z","snapshot_observed_at":"2026-08-18T12:59:40.595021Z","submitted_at":"2025-05-01T14:40:07Z","title":"TeLoGraF: Temporal Logic Planning via Graph-encoded Flow Matching","version":1},"reference_index":42,"source":"arxiv_source","source_observed_at":"2026-08-16T04:44:57.797998Z"},"links":{"citing_paper":"/paper/2505.00562"},"observation_digest":"sha256:d575c39fd99c45bd54a4c596e536faaea77b04488afa779793189c3db2a7c88b","observation_id":"6cc19e43-76e7-4628-ba51-5f6ec0e5159f","resolution":{"observed_at":"2026-08-16T04:44:58.625790Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-16T04:44:58.606557Z","title":"and Nickovic, D","venue":null,"work_id":"8288bfa6-6d10-4600-b456-2660164eac4e","year":2004},"citing_paper":{"arxiv_id":"2505.00562","last_updated":"2025-05-01T14:40:07Z","snapshot_observed_at":"2026-08-18T12:59:40.595021Z","submitted_at":"2025-05-01T14:40:07Z","title":"TeLoGraF: Temporal Logic Planning via Graph-encoded Flow Matching","version":1},"reference_index":43,"source":"arxiv_source","source_observed_at":"2026-08-16T04:44:57.802423Z"},"links":{"citing_paper":"/paper/2505.00562"},"observation_digest":"sha256:c2f68b2722ec007b312ddcd2555d70a4fea5afa7b1bc041811d9e0457c320138","observation_id":"bc9be4a3-2a07-4c72-922c-8957a51c934c","resolution":{"observed_at":"2026-08-16T04:44:58.611030Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-16T04:44:58.592698Z","title":"and Fan, C","venue":null,"work_id":"1e3bae09-33ec-4afe-b1fa-35497dbff491","year":2023},"citing_paper":{"arxiv_id":"2505.00562","last_updated":"2025-05-01T14:40:07Z","snapshot_observed_at":"2026-08-18T12:59:40.595021Z","submitted_at":"2025-05-01T14:40:07Z","title":"TeLoGraF: Temporal Logic Planning via Graph-encoded Flow Matching","version":1},"reference_index":44,"source":"arxiv_source","source_observed_at":"2026-08-16T04:44:57.806822Z"},"links":{"citing_paper":"/paper/2505.00562"},"observation_digest":"sha256:c085a9c3e6f936afd2018d8cc2c7dc3642e7e049127ba0ffb69c5eae676e3b32","observation_id":"09961c56-750d-455d-adb6-6ebf96e339cc","resolution":{"observed_at":"2026-08-16T04:44:58.597070Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-16T04:44:58.578217Z","title":"and Fan, C","venue":null,"work_id":"ab311660-5d5e-452a-9e80-52d79447bffd","year":2024},"citing_paper":{"arxiv_id":"2505.00562","last_updated":"2025-05-01T14:40:07Z","snapshot_observed_at":"2026-08-18T12:59:40.595021Z","submitted_at":"2025-05-01T14:40:07Z","title":"TeLoGraF: Temporal Logic Planning via Graph-encoded Flow Matching","version":1},"reference_index":45,"source":"arxiv_source","source_observed_at":"2026-08-16T04:44:57.811236Z"},"links":{"citing_paper":"/paper/2505.00562"},"observation_digest":"sha256:e8f5e17ddc9c014fc5b33f33297fbfd56f84f2ac6f055f36ac9e21add5d68e6f","observation_id":"62e3759f-deb8-4291-87ed-253780b950cc","resolution":{"observed_at":"2026-08-16T04:44:58.583062Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-16T04:44:58.563116Z","title":"A., Xue, S., Chen, Y., and Xu, D","venue":null,"work_id":"efc73365-5527-428c-9a65-c5878277b8f7","year":2023},"citing_paper":{"arxiv_id":"2505.00562","last_updated":"2025-05-01T14:40:07Z","snapshot_observed_at":"2026-08-18T12:59:40.595021Z","submitted_at":"2025-05-01T14:40:07Z","title":"TeLoGraF: Temporal Logic Planning via Graph-encoded Flow Matching","version":1},"reference_index":46,"source":"arxiv_source","source_observed_at":"2026-08-16T04:44:57.815888Z"},"links":{"citing_paper":"/paper/2505.00562"},"observation_digest":"sha256:06027fa767f0c684140793f5e4a72623d85c0fdfb9733feeafa5b9d4988aa75e","observation_id":"496196a5-6eff-45cf-9cb0-b63204b3af22","resolution":{"observed_at":"2026-08-16T04:44:58.568410Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-16T04:44:57.821184Z","title":"and Hinton, G","venue":null,"work_id":null,"year":2010},"citing_paper":{"arxiv_id":"2505.00562","last_updated":"2025-05-01T14:40:07Z","snapshot_observed_at":"2026-08-18T12:59:40.595021Z","submitted_at":"2025-05-01T14:40:07Z","title":"TeLoGraF: Temporal Logic Planning via Graph-encoded Flow Matching","version":1},"reference_index":47,"source":"arxiv_source","source_observed_at":"2026-08-16T04:44:57.821184Z"},"links":{"citing_paper":"/paper/2505.00562"},"observation_digest":"sha256:d6baaa491e2b0ffc2c67444288e0e3e80204eea222abf973a4461bd7715c2256","observation_id":"0f8d9259-be7e-4077-872f-2b65acaf49eb","resolution":{"observed_at":"2026-08-16T04:44:57.821184Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-16T04:44:57.826495Z","title":"Pytorch: An imperative style, high-performance deep learning library","venue":null,"work_id":null,"year":2019},"citing_paper":{"arxiv_id":"2505.00562","last_updated":"2025-05-01T14:40:07Z","snapshot_observed_at":"2026-08-18T12:59:40.595021Z","submitted_at":"2025-05-01T14:40:07Z","title":"TeLoGraF: Temporal Logic Planning via Graph-encoded Flow Matching","version":1},"reference_index":48,"source":"arxiv_source","source_observed_at":"2026-08-16T04:44:57.826495Z"},"links":{"citing_paper":"/paper/2505.00562"},"observation_digest":"sha256:18ddd55c19f331f4c842a2cef34ec5643143ab2fa8cb96c0c0037980a2994670","observation_id":"8304edc4-8cdd-46c2-85e0-8b42674a8284","resolution":{"observed_at":"2026-08-16T04:44:57.826495Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-16T04:44:58.529381Z","title":"The temporal logic of programs","venue":null,"work_id":"207962d5-14f1-40f4-8cd5-58fbc03062f3","year":1977},"citing_paper":{"arxiv_id":"2505.00562","last_updated":"2025-05-01T14:40:07Z","snapshot_observed_at":"2026-08-18T12:59:40.595021Z","submitted_at":"2025-05-01T14:40:07Z","title":"TeLoGraF: Temporal Logic Planning via Graph-encoded Flow Matching","version":1},"reference_index":49,"source":"arxiv_source","source_observed_at":"2026-08-16T04:44:57.830855Z"},"links":{"citing_paper":"/paper/2505.00562"},"observation_digest":"sha256:f1162f2f32acc2affef3b69fc109d7c529a8aee4cd1a60d6af6caf48f7f7ca5e","observation_id":"0fefa33d-3e2d-4d84-bfbc-9c02a0b4d07a","resolution":{"observed_at":"2026-08-16T04:44:58.533882Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2405.07503","last_updated":"2024-06-28T21:56:25Z","snapshot_observed_at":"2026-08-19T08:19:59.136599Z","submitted_at":"2024-05-13T06:53:42Z","title":"Consistency Policy: Accelerated Visuomotor Policies via Consistency Distillation","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2405.07503","snapshot_observed_at":"2026-08-16T04:44:57.835253Z","title":"Consistency policy: Accelerated visuomotor policies via consistency distillation","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2505.00562","last_updated":"2025-05-01T14:40:07Z","snapshot_observed_at":"2026-08-18T12:59:40.595021Z","submitted_at":"2025-05-01T14:40:07Z","title":"TeLoGraF: Temporal Logic Planning via Graph-encoded Flow Matching","version":1},"reference_index":50,"source":"arxiv_source","source_observed_at":"2026-08-16T04:44:57.835253Z"},"links":{"cited_paper":"/paper/2405.07503","citing_paper":"/paper/2505.00562"},"observation_digest":"sha256:5c3403fc97b4f817d3a4eb839821a9481d5a479fa2319254f9a31f699a74a56d","observation_id":"c4a80ba9-1336-4c2c-b8b9-f02680231916","resolution":{"observed_at":"2026-08-16T04:44:57.835253Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-16T04:44:58.515233Z","title":"Learning from demonstrations using signal temporal logic","venue":null,"work_id":"037d2fcf-ccc8-4a5d-8b99-a7159511417c","year":2021},"citing_paper":{"arxiv_id":"2505.00562","last_updated":"2025-05-01T14:40:07Z","snapshot_observed_at":"2026-08-18T12:59:40.595021Z","submitted_at":"2025-05-01T14:40:07Z","title":"TeLoGraF: Temporal Logic Planning via Graph-encoded Flow Matching","version":1},"reference_index":51,"source":"arxiv_source","source_observed_at":"2026-08-16T04:44:57.848662Z"},"links":{"citing_paper":"/paper/2505.00562"},"observation_digest":"sha256:37c3c15c156b8d0218e608975a17713663eb7f6faf5716281b1711c534dbc2d0","observation_id":"f8f801d3-cd19-4cc2-a651-aabee62c3818","resolution":{"observed_at":"2026-08-16T04:44:58.519749Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-16T04:44:58.500819Z","title":"M., and Seshia, S","venue":null,"work_id":"3bbc4da7-b057-4e8f-ab17-ca0fa581352c","year":2015},"citing_paper":{"arxiv_id":"2505.00562","last_updated":"2025-05-01T14:40:07Z","snapshot_observed_at":"2026-08-18T12:59:40.595021Z","submitted_at":"2025-05-01T14:40:07Z","title":"TeLoGraF: Temporal Logic Planning via Graph-encoded Flow Matching","version":1},"reference_index":52,"source":"arxiv_source","source_observed_at":"2026-08-16T04:44:57.854060Z"},"links":{"citing_paper":"/paper/2505.00562"},"observation_digest":"sha256:e85b865c4d46d724c1e441fc0dbd4c369ba50f52f92fe3a6d1d8e80926636ea0","observation_id":"19e31b26-76f3-4296-8441-7437d8852f02","resolution":{"observed_at":"2026-08-16T04:44:58.505375Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-16T04:44:58.486076Z","title":"and Belta, C","venue":null,"work_id":"273e740a-fac0-4519-996c-cae43c81af1e","year":2015},"citing_paper":{"arxiv_id":"2505.00562","last_updated":"2025-05-01T14:40:07Z","snapshot_observed_at":"2026-08-18T12:59:40.595021Z","submitted_at":"2025-05-01T14:40:07Z","title":"TeLoGraF: Temporal Logic Planning via Graph-encoded Flow Matching","version":1},"reference_index":53,"source":"arxiv_source","source_observed_at":"2026-08-16T04:44:57.859663Z"},"links":{"citing_paper":"/paper/2505.00562"},"observation_digest":"sha256:77b69e1e207842d5a1fa57ed4f8d972073fc79c851f04dc2964b3e92258d9e44","observation_id":"4b935cbb-4caa-4a9c-9404-07c4c2fc5909","resolution":{"observed_at":"2026-08-16T04:44:58.490524Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-16T04:44:58.471401Z","title":"Multi-agent motion planning from signal temporal logic specifications","venue":null,"work_id":"84eab6ee-3bab-4864-82e6-ebcd425208e2","year":2022},"citing_paper":{"arxiv_id":"2505.00562","last_updated":"2025-05-01T14:40:07Z","snapshot_observed_at":"2026-08-18T12:59:40.595021Z","submitted_at":"2025-05-01T14:40:07Z","title":"TeLoGraF: Temporal Logic Planning via Graph-encoded Flow Matching","version":1},"reference_index":54,"source":"arxiv_source","source_observed_at":"2026-08-16T04:44:57.864966Z"},"links":{"citing_paper":"/paper/2505.00562"},"observation_digest":"sha256:04ddadfa66bc181d8601426f73883d4f81f8f1ac041fb6e5eed4b5962cb9b940","observation_id":"88caa538-ff07-427c-a3a1-66f321f656b4","resolution":{"observed_at":"2026-08-16T04:44:58.476380Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1503.00075","last_updated":"2015-05-30T06:51:20Z","snapshot_observed_at":"2026-08-16T16:31:47.013439Z","submitted_at":"2015-02-28T06:31:50Z","title":"Improved Semantic Representations From Tree-Structured Long Short-Term Memory Networks","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1503.00075","snapshot_observed_at":"2026-08-16T04:44:57.870240Z","title":"S., Socher, R., and Manning, C","venue":null,"work_id":null,"year":2015},"citing_paper":{"arxiv_id":"2505.00562","last_updated":"2025-05-01T14:40:07Z","snapshot_observed_at":"2026-08-18T12:59:40.595021Z","submitted_at":"2025-05-01T14:40:07Z","title":"TeLoGraF: Temporal Logic Planning via Graph-encoded Flow Matching","version":1},"reference_index":55,"source":"arxiv_source","source_observed_at":"2026-08-16T04:44:57.870240Z"},"links":{"cited_paper":"/paper/1503.00075","citing_paper":"/paper/2505.00562"},"observation_digest":"sha256:0a63265f5cb7d828b0022a2f72e652e466d081e170c4994207ef1f80899fde46","observation_id":"014d0708-db7b-4d9e-be49-70f5b906a169","resolution":{"observed_at":"2026-08-16T04:44:57.870240Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2405.12213","last_updated":"2024-05-26T19:55:26Z","snapshot_observed_at":"2026-08-14T08:22:11.295012Z","submitted_at":"2024-05-20T17:57:01Z","title":"Octo: An Open-Source Generalist Robot Policy","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2405.12213","snapshot_observed_at":"2026-08-16T04:44:57.877096Z","title":"M., Ghosh, D., Walke, H., Pertsch, K., Black, K., Mees, O., Dasari, S., Hejna, J., Kreiman, T., Xu, C., et al","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2505.00562","last_updated":"2025-05-01T14:40:07Z","snapshot_observed_at":"2026-08-18T12:59:40.595021Z","submitted_at":"2025-05-01T14:40:07Z","title":"TeLoGraF: Temporal Logic Planning via Graph-encoded Flow Matching","version":1},"reference_index":56,"source":"arxiv_source","source_observed_at":"2026-08-16T04:44:57.877096Z"},"links":{"cited_paper":"/paper/2405.12213","citing_paper":"/paper/2505.00562"},"observation_digest":"sha256:1f29a3b1f8301c0448517da13057756488a138f0292954cb51fc407c2d402819","observation_id":"0094f4a2-8601-46a3-a2ae-62dafca782ad","resolution":{"observed_at":"2026-08-16T04:44:57.877096Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-16T04:44:57.882781Z","title":"Mujoco: A physics engine for model-based control","venue":null,"work_id":null,"year":2012},"citing_paper":{"arxiv_id":"2505.00562","last_updated":"2025-05-01T14:40:07Z","snapshot_observed_at":"2026-08-18T12:59:40.595021Z","submitted_at":"2025-05-01T14:40:07Z","title":"TeLoGraF: Temporal Logic Planning via Graph-encoded Flow Matching","version":1},"reference_index":57,"source":"arxiv_source","source_observed_at":"2026-08-16T04:44:57.882781Z"},"links":{"citing_paper":"/paper/2505.00562"},"observation_digest":"sha256:c7bbb6b373b7f8a19cf56fcfa40ecc6ce015bcf2c908d1e9e54385ba1712c741","observation_id":"033efc7c-8dd8-41c9-869a-ade09cd6e91c","resolution":{"observed_at":"2026-08-16T04:44:57.882781Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2408.04380","last_updated":"2024-08-21T15:54:54Z","snapshot_observed_at":"2026-08-18T12:59:39.799089Z","submitted_at":"2024-08-08T11:34:31Z","title":"Deep Generative Models in Robotics: A Survey on Learning from Multimodal Demonstrations","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2408.04380","snapshot_observed_at":"2026-08-16T04:44:57.888082Z","title":"Deep generative models in robotics: A survey on learning from multimodal demonstrations","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2505.00562","last_updated":"2025-05-01T14:40:07Z","snapshot_observed_at":"2026-08-18T12:59:40.595021Z","submitted_at":"2025-05-01T14:40:07Z","title":"TeLoGraF: Temporal Logic Planning via Graph-encoded Flow Matching","version":1},"reference_index":58,"source":"arxiv_source","source_observed_at":"2026-08-16T04:44:57.888082Z"},"links":{"cited_paper":"/paper/2408.04380","citing_paper":"/paper/2505.00562"},"observation_digest":"sha256:9b2b8ee6005a1117fd6128f8157aa7d0b4b63362c714e8f2f0bfd4e28ede74f3","observation_id":"776a2cf5-f7f8-4507-87e7-9e44c674b239","resolution":{"observed_at":"2026-08-16T04:44:57.888082Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-16T04:44:58.447603Z","title":"Sampling-based synthesis of maximally-satisfying controllers for temporal logic specifications","venue":null,"work_id":"78c015bc-36b0-45bf-a884-19f24881e00a","year":2017},"citing_paper":{"arxiv_id":"2505.00562","last_updated":"2025-05-01T14:40:07Z","snapshot_observed_at":"2026-08-18T12:59:40.595021Z","submitted_at":"2025-05-01T14:40:07Z","title":"TeLoGraF: Temporal Logic Planning via Graph-encoded Flow Matching","version":1},"reference_index":59,"source":"arxiv_source","source_observed_at":"2026-08-16T04:44:57.893896Z"},"links":{"citing_paper":"/paper/2505.00562"},"observation_digest":"sha256:eda6fd037238e87bf8728e56fbaff2fb9b848c86dd43c14c64d4529a18e9f478","observation_id":"82e9af1d-e66e-4d7f-8425-331e69c87a00","resolution":{"observed_at":"2026-08-16T04:44:58.452218Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-16T04:44:57.900524Z","title":"Attention is all you need","venue":null,"work_id":null,"year":2017},"citing_paper":{"arxiv_id":"2505.00562","last_updated":"2025-05-01T14:40:07Z","snapshot_observed_at":"2026-08-18T12:59:40.595021Z","submitted_at":"2025-05-01T14:40:07Z","title":"TeLoGraF: Temporal Logic Planning via Graph-encoded Flow Matching","version":1},"reference_index":60,"source":"arxiv_source","source_observed_at":"2026-08-16T04:44:57.900524Z"},"links":{"citing_paper":"/paper/2505.00562"},"observation_digest":"sha256:c2789776e91c029dc8d67d175098b304a9cf5ad3196e6bb6b5b9c29a32c006f9","observation_id":"e3ab3248-a4dd-4af6-9def-c07c077998cb","resolution":{"observed_at":"2026-08-16T04:44:57.900524Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-16T04:44:58.423569Z","title":null,"venue":null,"work_id":"e038585c-71cb-4234-aaaa-38c705c710af","year":2012},"citing_paper":{"arxiv_id":"2505.00562","last_updated":"2025-05-01T14:40:07Z","snapshot_observed_at":"2026-08-18T12:59:40.595021Z","submitted_at":"2025-05-01T14:40:07Z","title":"TeLoGraF: Temporal Logic Planning via Graph-encoded Flow Matching","version":1},"reference_index":61,"source":"arxiv_source","source_observed_at":"2026-08-16T04:44:57.905950Z"},"links":{"citing_paper":"/paper/2505.00562"},"observation_digest":"sha256:14f11226e805be95161cb55024fd6627e4e063beac5bc75de5659076805c6940","observation_id":"82cc8ad0-dac3-4e72-a6dc-52612eba3f70","resolution":{"observed_at":"2026-08-16T04:44:58.428066Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-16T04:44:57.911106Z","title":"Chaineddiffuser: Unifying trajectory diffusion and keypose prediction for robotic manipulation","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2505.00562","last_updated":"2025-05-01T14:40:07Z","snapshot_observed_at":"2026-08-18T12:59:40.595021Z","submitted_at":"2025-05-01T14:40:07Z","title":"TeLoGraF: Temporal Logic Planning via Graph-encoded Flow Matching","version":1},"reference_index":62,"source":"arxiv_source","source_observed_at":"2026-08-16T04:44:57.911106Z"},"links":{"citing_paper":"/paper/2505.00562"},"observation_digest":"sha256:c29ac4d4f7bdc07cb22f6286b437d8114640ca9ad923da4455da5830d800c49d","observation_id":"787bc691-feb6-46aa-ae23-80ab312f64f7","resolution":{"observed_at":"2026-08-16T04:44:57.911106Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1810.00826","last_updated":"2019-02-22T19:15:54Z","snapshot_observed_at":"2026-08-13T05:06:48.606308Z","submitted_at":"2018-10-01T17:11:31Z","title":"How Powerful are Graph Neural Networks?","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1810.00826","snapshot_observed_at":"2026-08-16T04:44:57.916114Z","title":"How powerful are graph neural networks? arXiv preprint arXiv:1810.00826, 2018","venue":null,"work_id":null,"year":2018},"citing_paper":{"arxiv_id":"2505.00562","last_updated":"2025-05-01T14:40:07Z","snapshot_observed_at":"2026-08-18T12:59:40.595021Z","submitted_at":"2025-05-01T14:40:07Z","title":"TeLoGraF: Temporal Logic Planning via Graph-encoded Flow Matching","version":1},"reference_index":63,"source":"arxiv_source","source_observed_at":"2026-08-16T04:44:57.916114Z"},"links":{"cited_paper":"/paper/1810.00826","citing_paper":"/paper/2505.00562"},"observation_digest":"sha256:2bd36b27e30b172c6e00a68b5a9cba57b400be51f865462eba49894ff329efa1","observation_id":"46b00725-90cc-47c4-88f0-d03ec176b8d9","resolution":{"observed_at":"2026-08-16T04:44:57.916114Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2309.00966","last_updated":"2023-09-02T15:20:36Z","snapshot_observed_at":"2026-08-16T15:03:48.078873Z","submitted_at":"2023-09-02T15:20:36Z","title":"Compositional Diffusion-Based Continuous Constraint Solvers","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2309.00966","snapshot_observed_at":"2026-08-16T04:44:57.921526Z","title":"B., Lozano-P \\'e rez, T., and Kaelbling, L","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2505.00562","last_updated":"2025-05-01T14:40:07Z","snapshot_observed_at":"2026-08-18T12:59:40.595021Z","submitted_at":"2025-05-01T14:40:07Z","title":"TeLoGraF: Temporal Logic Planning via Graph-encoded Flow Matching","version":1},"reference_index":64,"source":"arxiv_source","source_observed_at":"2026-08-16T04:44:57.921526Z"},"links":{"cited_paper":"/paper/2309.00966","citing_paper":"/paper/2505.00562"},"observation_digest":"sha256:b2835949fd10fe9a8a5db9483ef64d3669f4b9889749525562803ee0b2cac317","observation_id":"267bd824-b2c3-4b40-ad26-9cc345017d73","resolution":{"observed_at":"2026-08-16T04:44:57.921526Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2403.03954","last_updated":"2024-09-27T02:43:48Z","snapshot_observed_at":"2026-08-01T16:34:39.855742Z","submitted_at":"2024-03-06T18:58:49Z","title":"3D Diffusion Policy: Generalizable Visuomotor Policy Learning via Simple 3D Representations","version":7},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2403.03954","snapshot_observed_at":"2026-08-16T04:44:57.927693Z","title":"3d diffusion policy","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2505.00562","last_updated":"2025-05-01T14:40:07Z","snapshot_observed_at":"2026-08-18T12:59:40.595021Z","submitted_at":"2025-05-01T14:40:07Z","title":"TeLoGraF: Temporal Logic Planning via Graph-encoded Flow Matching","version":1},"reference_index":65,"source":"arxiv_source","source_observed_at":"2026-08-16T04:44:57.927693Z"},"links":{"cited_paper":"/paper/2403.03954","citing_paper":"/paper/2505.00562"},"observation_digest":"sha256:d521d40df89f0f570469a9684d5c51d498030b28047f83bea8811b41c78771ff","observation_id":"e57e1017-ded3-4cce-983e-2af000250d9a","resolution":{"observed_at":"2026-08-16T04:44:57.927693Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2412.04987","last_updated":"2024-12-15T05:41:54Z","snapshot_observed_at":"2026-08-16T09:41:49.835190Z","submitted_at":"2024-12-06T12:15:24Z","title":"FlowPolicy: Enabling Fast and Robust 3D Flow-based Policy via Consistency Flow Matching for Robot Manipulation","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2412.04987","snapshot_observed_at":"2026-08-16T04:44:57.933731Z","title":"Flowpolicy: Enabling fast and robust 3d flow-based policy via consistency flow matching for robot manipulation","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2505.00562","last_updated":"2025-05-01T14:40:07Z","snapshot_observed_at":"2026-08-18T12:59:40.595021Z","submitted_at":"2025-05-01T14:40:07Z","title":"TeLoGraF: Temporal Logic Planning via Graph-encoded Flow Matching","version":1},"reference_index":66,"source":"arxiv_source","source_observed_at":"2026-08-16T04:44:57.933731Z"},"links":{"cited_paper":"/paper/2412.04987","citing_paper":"/paper/2505.00562"},"observation_digest":"sha256:4ca2535b4a6aac70874f454bf65fff2a2b1dc88909bc3825848d87bf619dcb88","observation_id":"d75b1ae4-3f76-4de3-9afb-9c6a2d79eac2","resolution":{"observed_at":"2026-08-16T04:44:57.933731Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-16T04:44:58.399797Z","title":"PyTorch Kinematics , February 2024","venue":null,"work_id":"a82e2f23-3f42-4c2e-99c0-e7bc1ebcf88f","year":2024},"citing_paper":{"arxiv_id":"2505.00562","last_updated":"2025-05-01T14:40:07Z","snapshot_observed_at":"2026-08-18T12:59:40.595021Z","submitted_at":"2025-05-01T14:40:07Z","title":"TeLoGraF: Temporal Logic Planning via Graph-encoded Flow Matching","version":1},"reference_index":67,"source":"arxiv_source","source_observed_at":"2026-08-16T04:44:57.939315Z"},"links":{"citing_paper":"/paper/2505.00562"},"observation_digest":"sha256:d3070562ca5ead1c07ddab0646fb3af49ef4082979af24e474ea9958b77eb3fe","observation_id":"3998a4be-c59d-4c4d-8388-f99b38ed3759","resolution":{"observed_at":"2026-08-16T04:44:58.404432Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-16T04:44:58.385134Z","title":"Guided conditional diffusion for controllable traffic simulation","venue":null,"work_id":"54ac3408-1e3c-483a-857a-8f401edbeeea","year":2023},"citing_paper":{"arxiv_id":"2505.00562","last_updated":"2025-05-01T14:40:07Z","snapshot_observed_at":"2026-08-18T12:59:40.595021Z","submitted_at":"2025-05-01T14:40:07Z","title":"TeLoGraF: Temporal Logic Planning via Graph-encoded Flow Matching","version":1},"reference_index":68,"source":"arxiv_source","source_observed_at":"2026-08-16T04:44:57.944557Z"},"links":{"citing_paper":"/paper/2505.00562"},"observation_digest":"sha256:783c5da25956648e4a3f50db76e93d8847632821a1c195251a7870aa6eac42ac","observation_id":"9d5147d9-c3b7-43b2-9a57-95017412e398","resolution":{"observed_at":"2026-08-16T04:44:58.389839Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+00:00","source":"retraction_watch"}],"state":"measured"}}],"paper":{"arxiv_id":"2505.00562","last_updated":"2025-05-01T14:40:07Z","latest_version":1,"primary_category":"cs.RO","snapshot_observed_at":"2026-08-18T12:59:40.595021Z","submitted_at":"2025-05-01T14:40:07Z","title":"TeLoGraF: Temporal Logic Planning via Graph-encoded Flow Matching"},"reference_resolution":{"displayed":68,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":33,"verified_exact":3,"verified_fuzzy":32},"total_outbound_references":68},"refusal":"A citation records a reference. It does not transfer a finding from one paper to another.","schema":"pith.paper-citation-record.v1","standing_sources":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+00:00","source":"retraction_watch"}],"thesis":"As of 19 August 2026, this Paper Citation Record lists 68 of 68 outbound references and 4 inbound Pith citation observations for arXiv:2505.00562."}