{"as_of":"2026-08-14T20:26:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:837b675ca6bd93263e1e80bf9e20217abd2784d10d41ada8316da27e08b1ebf3","coverage":[{"denominator":54,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":54,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-11T18:53:41.056882Z","state":"measured"},{"denominator":54,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":54,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-14T06:32:32.682623+00:00","state":"measured"},{"denominator":0,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":0,"source":"paper_references, paper_reference_links","source_observed_at":null,"state":"measured"},{"denominator":1,"lane":"external_citation_measurements","note":"A source-named dated measurement, never combined with another source.","records_observed":0,"source":"cited_works","source_observed_at":null,"state":"measured"}],"external_citation_measurements":[],"inbound":[],"links":{"evidence":"/evidence","html":"/paper/2412.07544/citation-record","integrity":"/paper/2412.07544/integrity","json":"/paper/2412.07544/citation-record.json","paper":"/paper/2412.07544"},"outbound":[{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-11T18:53:38.338862Z","title":"write newline","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2412.07544","last_updated":"2025-03-26T13:39:58Z","snapshot_observed_at":"2026-08-12T06:09:50.881373Z","submitted_at":"2024-12-10T14:28:18Z","title":"Contractive Dynamical Imitation Policies for Efficient Out-of-Sample Recovery","version":2},"reference_index":1,"source":"arxiv_source","source_observed_at":"2026-08-11T18:53:38.338862Z"},"links":{"citing_paper":"/paper/2412.07544"},"observation_digest":"sha256:2939a7db384cbc27a6f39ace191356919fbff703df5417f898c62118a6548210","observation_id":"9c00bbd3-8eb1-41f0-9cd5-d6e57407a0a8","resolution":{"observed_at":"2026-08-11T18:53:38.338862Z","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-11T18:53:46.330050Z","title":"Apprenticeship learning via inverse reinforcement learning","venue":null,"work_id":"25325f13-7a5a-4799-8f66-7ba796d62107","year":2004},"citing_paper":{"arxiv_id":"2412.07544","last_updated":"2025-03-26T13:39:58Z","snapshot_observed_at":"2026-08-12T06:09:50.881373Z","submitted_at":"2024-12-10T14:28:18Z","title":"Contractive Dynamical Imitation Policies for Efficient Out-of-Sample Recovery","version":2},"reference_index":2,"source":"arxiv_source","source_observed_at":"2026-08-11T18:53:38.346152Z"},"links":{"citing_paper":"/paper/2412.07544"},"observation_digest":"sha256:553d9b4bff7daeb93cc2d1686af8087bc8141835ff0b19637ac10fcb1e577b6b","observation_id":"9c80e981-5681-4863-81f3-474624d41e64","resolution":{"observed_at":"2026-08-11T18:53:46.337330Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+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-11T18:53:46.306244Z","title":"Learning L yapunov-stable polynomial dynamical systems through imitation","venue":null,"work_id":"09eff101-8237-4fe6-b716-fa984c5b046e","year":2023},"citing_paper":{"arxiv_id":"2412.07544","last_updated":"2025-03-26T13:39:58Z","snapshot_observed_at":"2026-08-12T06:09:50.881373Z","submitted_at":"2024-12-10T14:28:18Z","title":"Contractive Dynamical Imitation Policies for Efficient Out-of-Sample Recovery","version":2},"reference_index":3,"source":"arxiv_source","source_observed_at":"2026-08-11T18:53:38.474836Z"},"links":{"citing_paper":"/paper/2412.07544"},"observation_digest":"sha256:91b26d2dfe0bc1abbaa077a24489d7e89d8824274ff5799297dbdb283d01322b","observation_id":"a89f36a0-8c23-43fb-9def-f20a809d328d","resolution":{"observed_at":"2026-08-11T18:53:46.312515Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+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-11T18:53:46.262192Z","title":"Globally stable neural imitation policies","venue":null,"work_id":"0d715574-576e-4fe5-bc5e-6ab798578c03","year":2024},"citing_paper":{"arxiv_id":"2412.07544","last_updated":"2025-03-26T13:39:58Z","snapshot_observed_at":"2026-08-12T06:09:50.881373Z","submitted_at":"2024-12-10T14:28:18Z","title":"Contractive Dynamical Imitation Policies for Efficient Out-of-Sample Recovery","version":2},"reference_index":4,"source":"arxiv_source","source_observed_at":"2026-08-11T18:53:38.514186Z"},"links":{"citing_paper":"/paper/2412.07544"},"observation_digest":"sha256:fd2d56f2b079c2ecc3e8428d783fbf53fac3f87ce6bbb3c4eb97c49aea8a3a4b","observation_id":"b79cf654-879c-4d90-be81-e813c25c2124","resolution":{"observed_at":"2026-08-11T18:53:46.284750Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+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-11T18:53:46.234743Z","title":"Neural dynamic policies for end-to-end sensorimotor learning","venue":null,"work_id":"cf434339-2d62-4dec-af22-42f9efa1b454","year":2020},"citing_paper":{"arxiv_id":"2412.07544","last_updated":"2025-03-26T13:39:58Z","snapshot_observed_at":"2026-08-12T06:09:50.881373Z","submitted_at":"2024-12-10T14:28:18Z","title":"Contractive Dynamical Imitation Policies for Efficient Out-of-Sample Recovery","version":2},"reference_index":5,"source":"arxiv_source","source_observed_at":"2026-08-11T18:53:38.534755Z"},"links":{"citing_paper":"/paper/2412.07544"},"observation_digest":"sha256:7dd75f0c8354018ac021b08e595c8d1280ec9da9a7c650d7a96c31ecf8cd8364","observation_id":"fda7caea-1fec-423b-9c57-4f072a7a572d","resolution":{"observed_at":"2026-08-11T18:53:46.240586Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+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-11T18:53:46.195855Z","title":"Learning stable dynamical systems using contraction theory","venue":null,"work_id":"98b9cda8-9475-43f3-a975-08792b14f852","year":2017},"citing_paper":{"arxiv_id":"2412.07544","last_updated":"2025-03-26T13:39:58Z","snapshot_observed_at":"2026-08-12T06:09:50.881373Z","submitted_at":"2024-12-10T14:28:18Z","title":"Contractive Dynamical Imitation Policies for Efficient Out-of-Sample Recovery","version":2},"reference_index":6,"source":"arxiv_source","source_observed_at":"2026-08-11T18:53:38.567879Z"},"links":{"citing_paper":"/paper/2412.07544"},"observation_digest":"sha256:e905cbe84ab9dd2a1813ce54fa603df602314b66962039a7306a728b53557112","observation_id":"4612988b-9f4f-4a0e-88e8-6afba5de4e48","resolution":{"observed_at":"2026-08-11T18:53:46.208496Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+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-11T18:53:46.167646Z","title":"A unified framework for walking and running of bipedal robots","venue":null,"work_id":"1169b8d4-081f-4a8d-9cac-00399c459913","year":2021},"citing_paper":{"arxiv_id":"2412.07544","last_updated":"2025-03-26T13:39:58Z","snapshot_observed_at":"2026-08-12T06:09:50.881373Z","submitted_at":"2024-12-10T14:28:18Z","title":"Contractive Dynamical Imitation Policies for Efficient Out-of-Sample Recovery","version":2},"reference_index":7,"source":"arxiv_source","source_observed_at":"2026-08-11T18:53:38.590565Z"},"links":{"citing_paper":"/paper/2412.07544"},"observation_digest":"sha256:8b12d773c28db9f9bfff7ac9d1208b1a2e8c1705b7dcb8e5c698879be4307478","observation_id":"20694a11-1203-43e3-bd68-9b22d0b5e033","resolution":{"observed_at":"2026-08-11T18:53:46.174594Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2403.17790","last_updated":"2025-03-26T13:55:18Z","snapshot_observed_at":"2026-08-14T12:06:52.159849Z","submitted_at":"2024-03-26T15:21:18Z","title":"A PAC-Bayesian Framework for Optimal Control with Stability Guarantees","version":3},"cited_work":{"arxiv_id":"2403.17790","doi":null,"metadata_source":"pith","pith_arxiv_id":"2403.17790","snapshot_observed_at":"2026-08-11T18:53:41.954768Z","title":"A PAC-Bayesian Framework for Optimal Control with Stability Guarantees","venue":"eess.SY","work_id":"5c72c933-2011-4f22-90f0-be96457c8218","year":2024},"citing_paper":{"arxiv_id":"2412.07544","last_updated":"2025-03-26T13:39:58Z","snapshot_observed_at":"2026-08-12T06:09:50.881373Z","submitted_at":"2024-12-10T14:28:18Z","title":"Contractive Dynamical Imitation Policies for Efficient Out-of-Sample Recovery","version":2},"reference_index":8,"source":"arxiv_source","source_observed_at":"2026-08-11T18:53:38.626027Z"},"links":{"cited_paper":"/paper/2403.17790","citing_paper":"/paper/2412.07544"},"observation_digest":"sha256:22b109c34a6215f2f2db118acfe5eb11c1b9d37c93de37c0ba2b4eaa86daf522","observation_id":"cb27f5c3-39cf-475d-bfec-2ba7eab61dab","resolution":{"observed_at":"2026-08-11T18:53:42.002080Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+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-11T18:53:46.147005Z","title":"Neural ordinary differential equations","venue":null,"work_id":"29a20ebe-ea7c-4ccc-b8b9-07e7a4ac7f07","year":2018},"citing_paper":{"arxiv_id":"2412.07544","last_updated":"2025-03-26T13:39:58Z","snapshot_observed_at":"2026-08-12T06:09:50.881373Z","submitted_at":"2024-12-10T14:28:18Z","title":"Contractive Dynamical Imitation Policies for Efficient Out-of-Sample Recovery","version":2},"reference_index":9,"source":"arxiv_source","source_observed_at":"2026-08-11T18:53:38.644747Z"},"links":{"citing_paper":"/paper/2412.07544"},"observation_digest":"sha256:aeedefb6309c62f5957bdd7b51969fe2b59bb533b89cde17cae1f052771edd75","observation_id":"0828493a-9e5a-4444-ba1b-7b71b61f857e","resolution":{"observed_at":"2026-08-11T18:53:46.154037Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+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-11T18:53:46.094763Z","title":"Diffusion policy: V isuomotor policy learning via action diffusion","venue":null,"work_id":"c5c5e1a7-6aa3-4072-aced-e5ec33c0f7ae","year":2023},"citing_paper":{"arxiv_id":"2412.07544","last_updated":"2025-03-26T13:39:58Z","snapshot_observed_at":"2026-08-12T06:09:50.881373Z","submitted_at":"2024-12-10T14:28:18Z","title":"Contractive Dynamical Imitation Policies for Efficient Out-of-Sample Recovery","version":2},"reference_index":10,"source":"arxiv_source","source_observed_at":"2026-08-11T18:53:38.663576Z"},"links":{"citing_paper":"/paper/2412.07544"},"observation_digest":"sha256:160a48e1fc7b62008bac2b860001b494d7dec3a778d0de778675ec826cac165b","observation_id":"7b4c3484-6fdf-43ce-b314-d96e18aaa7cc","resolution":{"observed_at":"2026-08-11T18:53:46.111772Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+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-11T18:53:46.063762Z","title":"Soft- DTW : a differentiable loss function for time-series","venue":null,"work_id":"62c1851e-c58b-44c1-b0b4-5af3b555973e","year":2017},"citing_paper":{"arxiv_id":"2412.07544","last_updated":"2025-03-26T13:39:58Z","snapshot_observed_at":"2026-08-12T06:09:50.881373Z","submitted_at":"2024-12-10T14:28:18Z","title":"Contractive Dynamical Imitation Policies for Efficient Out-of-Sample Recovery","version":2},"reference_index":11,"source":"arxiv_source","source_observed_at":"2026-08-11T18:53:38.675895Z"},"links":{"citing_paper":"/paper/2412.07544"},"observation_digest":"sha256:2e1a455a37c98052addf7c8c3886a41428cd5ace25847c7485e7d88b2157acfe","observation_id":"23bc5a61-7caf-4786-9a86-f08aa5f3034b","resolution":{"observed_at":"2026-08-11T18:53:46.068015Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+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-11T18:53:46.047804Z","title":"Safe control with learned certificates: A survey of neural lyapunov, barrier, and contraction methods for robotics and control","venue":null,"work_id":"97315792-397e-4d10-8cb9-d3d233e46505","year":2023},"citing_paper":{"arxiv_id":"2412.07544","last_updated":"2025-03-26T13:39:58Z","snapshot_observed_at":"2026-08-12T06:09:50.881373Z","submitted_at":"2024-12-10T14:28:18Z","title":"Contractive Dynamical Imitation Policies for Efficient Out-of-Sample Recovery","version":2},"reference_index":12,"source":"arxiv_source","source_observed_at":"2026-08-11T18:53:38.710113Z"},"links":{"citing_paper":"/paper/2412.07544"},"observation_digest":"sha256:5067a65ca2c52c288117fbe9ef219243baf8b6fbb5514b7e0d0790d5e9fcf170","observation_id":"47dbb50b-f4e7-4642-b524-1d535ffa2be6","resolution":{"observed_at":"2026-08-11T18:53:46.053668Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+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-11T18:53:46.023910Z","title":"An introduction to chaotic dynamical systems","venue":null,"work_id":"679622d5-803f-4355-872c-196672644022","year":2021},"citing_paper":{"arxiv_id":"2412.07544","last_updated":"2025-03-26T13:39:58Z","snapshot_observed_at":"2026-08-12T06:09:50.881373Z","submitted_at":"2024-12-10T14:28:18Z","title":"Contractive Dynamical Imitation Policies for Efficient Out-of-Sample Recovery","version":2},"reference_index":13,"source":"arxiv_source","source_observed_at":"2026-08-11T18:53:38.741902Z"},"links":{"citing_paper":"/paper/2412.07544"},"observation_digest":"sha256:3f86076d38ee4b1a1b82e8a0a2efbc6b2f99055700e4d83186be10966a36988c","observation_id":"5b8d4fda-5c4c-44d1-9dc5-e66f8fe7183b","resolution":{"observed_at":"2026-08-11T18:53:46.028522Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+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-11T18:53:38.773155Z","title":"Density estimation using real NVP","venue":null,"work_id":null,"year":2017},"citing_paper":{"arxiv_id":"2412.07544","last_updated":"2025-03-26T13:39:58Z","snapshot_observed_at":"2026-08-12T06:09:50.881373Z","submitted_at":"2024-12-10T14:28:18Z","title":"Contractive Dynamical Imitation Policies for Efficient Out-of-Sample Recovery","version":2},"reference_index":14,"source":"arxiv_source","source_observed_at":"2026-08-11T18:53:38.773155Z"},"links":{"citing_paper":"/paper/2412.07544"},"observation_digest":"sha256:1ae7cf3bd6a028b461aaac364962b787687ff3ea482eb350502a4d4a68760a7d","observation_id":"bf99ce67-20c7-47c7-9017-107a24a1ef47","resolution":{"observed_at":"2026-08-11T18:53:38.773155Z","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-11T18:53:45.820962Z","title":"A physically-consistent bayesian non-parametric mixture model for dynamical system learning","venue":null,"work_id":"01112735-3b27-4f6b-8316-78c3d67b347d","year":2018},"citing_paper":{"arxiv_id":"2412.07544","last_updated":"2025-03-26T13:39:58Z","snapshot_observed_at":"2026-08-12T06:09:50.881373Z","submitted_at":"2024-12-10T14:28:18Z","title":"Contractive Dynamical Imitation Policies for Efficient Out-of-Sample Recovery","version":2},"reference_index":15,"source":"arxiv_source","source_observed_at":"2026-08-11T18:53:38.950419Z"},"links":{"citing_paper":"/paper/2412.07544"},"observation_digest":"sha256:b12e702aadc86648c67352ec57a0b9e6a8bb20b0edbae5a10bbea589c5f053dc","observation_id":"30303fc8-0b96-4ab4-add2-5a4aaaf1b7da","resolution":{"observed_at":"2026-08-11T18:53:45.858612Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+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-11T18:53:45.755736Z","title":"Learning robust rewards with adversarial inverse reinforcement learning","venue":null,"work_id":"18b6773e-794f-48d2-a8ff-f61ba99db46c","year":2018},"citing_paper":{"arxiv_id":"2412.07544","last_updated":"2025-03-26T13:39:58Z","snapshot_observed_at":"2026-08-12T06:09:50.881373Z","submitted_at":"2024-12-10T14:28:18Z","title":"Contractive Dynamical Imitation Policies for Efficient Out-of-Sample Recovery","version":2},"reference_index":16,"source":"arxiv_source","source_observed_at":"2026-08-11T18:53:39.051776Z"},"links":{"citing_paper":"/paper/2412.07544"},"observation_digest":"sha256:8e6c89970cf7d416c38a12b5e4195a91b079866df4694bd0efc2b99e2626a789","observation_id":"8fcc510d-e488-43b0-90e8-1d3b1a8caff3","resolution":{"observed_at":"2026-08-11T18:53:45.772412Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+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-11T18:53:45.739094Z","title":"Generative adversarial imitation learning","venue":null,"work_id":"ea21607d-3617-458a-887b-aa54b5087b3e","year":2016},"citing_paper":{"arxiv_id":"2412.07544","last_updated":"2025-03-26T13:39:58Z","snapshot_observed_at":"2026-08-12T06:09:50.881373Z","submitted_at":"2024-12-10T14:28:18Z","title":"Contractive Dynamical Imitation Policies for Efficient Out-of-Sample Recovery","version":2},"reference_index":17,"source":"arxiv_source","source_observed_at":"2026-08-11T18:53:39.113474Z"},"links":{"citing_paper":"/paper/2412.07544"},"observation_digest":"sha256:0631a48ed53dff409b734fd83bb74445df2cfd56877eac4fde0fed589044a48d","observation_id":"01e31d17-b963-4c42-a0bd-74c3d1ad00d6","resolution":{"observed_at":"2026-08-11T18:53:45.744816Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+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-11T18:53:45.694841Z","title":"Imitation learning: A survey of learning methods","venue":null,"work_id":"6b7ee6bc-bb00-419e-b8aa-7bb42af67ecd","year":2017},"citing_paper":{"arxiv_id":"2412.07544","last_updated":"2025-03-26T13:39:58Z","snapshot_observed_at":"2026-08-12T06:09:50.881373Z","submitted_at":"2024-12-10T14:28:18Z","title":"Contractive Dynamical Imitation Policies for Efficient Out-of-Sample Recovery","version":2},"reference_index":18,"source":"arxiv_source","source_observed_at":"2026-08-11T18:53:39.123013Z"},"links":{"citing_paper":"/paper/2412.07544"},"observation_digest":"sha256:9210863a70f834ea3db2a710e6da34ffae89310a205a92db46bf4af20f02dee3","observation_id":"0fec38dd-c4c7-4124-a0ae-5218133c62b9","resolution":{"observed_at":"2026-08-11T18:53:45.716099Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+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-11T18:53:45.478669Z","title":"Exact indexing of dynamic time warping","venue":null,"work_id":"70010137-b386-4ddd-b2ea-8553c3ab255d","year":2005},"citing_paper":{"arxiv_id":"2412.07544","last_updated":"2025-03-26T13:39:58Z","snapshot_observed_at":"2026-08-12T06:09:50.881373Z","submitted_at":"2024-12-10T14:28:18Z","title":"Contractive Dynamical Imitation Policies for Efficient Out-of-Sample Recovery","version":2},"reference_index":19,"source":"arxiv_source","source_observed_at":"2026-08-11T18:53:39.131238Z"},"links":{"citing_paper":"/paper/2412.07544"},"observation_digest":"sha256:4f13e893c2e8a7c5f52aafba1f6a08292123844812803d616de574237b409e3a","observation_id":"02c33aad-7d1d-4334-a015-33aed9417b96","resolution":{"observed_at":"2026-08-11T18:53:45.546477Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+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-11T18:53:45.326881Z","title":"Learning stable nonlinear dynamical systems with G aussian mixture models","venue":null,"work_id":"6c363ea5-ae15-4dbe-afd4-36659133e0f7","year":2011},"citing_paper":{"arxiv_id":"2412.07544","last_updated":"2025-03-26T13:39:58Z","snapshot_observed_at":"2026-08-12T06:09:50.881373Z","submitted_at":"2024-12-10T14:28:18Z","title":"Contractive Dynamical Imitation Policies for Efficient Out-of-Sample Recovery","version":2},"reference_index":20,"source":"arxiv_source","source_observed_at":"2026-08-11T18:53:39.230170Z"},"links":{"citing_paper":"/paper/2412.07544"},"observation_digest":"sha256:c9d4e0f8edbfcbbbdfe8fd5aed40238532dff0fbd344ebc0aa1176d8a9dbd944","observation_id":"fb926238-e745-4347-9254-6067146fd196","resolution":{"observed_at":"2026-08-11T18:53:45.384855Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+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-11T18:53:45.291466Z","title":"Learning control L yapunov function to ensure stability of dynamical system-based robot reaching motions","venue":null,"work_id":"1418016d-286a-46fd-b604-dc592eb184d0","year":2014},"citing_paper":{"arxiv_id":"2412.07544","last_updated":"2025-03-26T13:39:58Z","snapshot_observed_at":"2026-08-12T06:09:50.881373Z","submitted_at":"2024-12-10T14:28:18Z","title":"Contractive Dynamical Imitation Policies for Efficient Out-of-Sample Recovery","version":2},"reference_index":21,"source":"arxiv_source","source_observed_at":"2026-08-11T18:53:39.265033Z"},"links":{"citing_paper":"/paper/2412.07544"},"observation_digest":"sha256:5b97b2e223c419dc77c1007ff0b6fb0a68d8963b63ca1e719ffdf2a1f5df067a","observation_id":"e7db9b90-0e38-41c7-b5bc-f28e1bfec97a","resolution":{"observed_at":"2026-08-11T18:53:45.301498Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+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-11T18:53:45.236916Z","title":"Learning stable deep dynamics models","venue":null,"work_id":"6a0fb0e1-d98d-4e14-adbe-9d5e6714bf51","year":2019},"citing_paper":{"arxiv_id":"2412.07544","last_updated":"2025-03-26T13:39:58Z","snapshot_observed_at":"2026-08-12T06:09:50.881373Z","submitted_at":"2024-12-10T14:28:18Z","title":"Contractive Dynamical Imitation Policies for Efficient Out-of-Sample Recovery","version":2},"reference_index":22,"source":"arxiv_source","source_observed_at":"2026-08-11T18:53:39.286321Z"},"links":{"citing_paper":"/paper/2412.07544"},"observation_digest":"sha256:e49cb7c0938e2873c1fcb70090822240bc78013ce092201157008552b6a03b58","observation_id":"d2dde37e-4cfe-42ef-86dd-42974ee0cd21","resolution":{"observed_at":"2026-08-11T18:53:45.247732Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+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-11T18:53:45.071716Z","title":"D ART : Noise injection for robust imitation learning","venue":null,"work_id":"d2c11f75-db47-4654-a7ae-2a0dd0aecb2f","year":2017},"citing_paper":{"arxiv_id":"2412.07544","last_updated":"2025-03-26T13:39:58Z","snapshot_observed_at":"2026-08-12T06:09:50.881373Z","submitted_at":"2024-12-10T14:28:18Z","title":"Contractive Dynamical Imitation Policies for Efficient Out-of-Sample Recovery","version":2},"reference_index":23,"source":"arxiv_source","source_observed_at":"2026-08-11T18:53:39.368079Z"},"links":{"citing_paper":"/paper/2412.07544"},"observation_digest":"sha256:361c4ae0fdb63ece86f1fea85fcd4903ab655984089cac91fe531fd4c8abd35f","observation_id":"574a3d89-0f32-403a-a893-2a17cd03423a","resolution":{"observed_at":"2026-08-11T18:53:45.186405Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+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-11T18:53:45.042215Z","title":null,"venue":null,"work_id":"b8ef9221-8ce5-491d-b90d-70fbbcdb8bf3","year":1998},"citing_paper":{"arxiv_id":"2412.07544","last_updated":"2025-03-26T13:39:58Z","snapshot_observed_at":"2026-08-12T06:09:50.881373Z","submitted_at":"2024-12-10T14:28:18Z","title":"Contractive Dynamical Imitation Policies for Efficient Out-of-Sample Recovery","version":2},"reference_index":24,"source":"arxiv_source","source_observed_at":"2026-08-11T18:53:39.435065Z"},"links":{"citing_paper":"/paper/2412.07544"},"observation_digest":"sha256:04d90d19e2eea079c7c33ab1c5763c0b679ef3508384820a1274c0223c88756c","observation_id":"dcbf1594-09d6-4517-95db-3af0dd19f60d","resolution":{"observed_at":"2026-08-11T18:53:45.051017Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+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-11T18:53:44.954447Z","title":"Manchester and Jean-Jacques E","venue":null,"work_id":"b495217d-0e6b-4545-a23a-e873cad0024d","year":2015},"citing_paper":{"arxiv_id":"2412.07544","last_updated":"2025-03-26T13:39:58Z","snapshot_observed_at":"2026-08-12T06:09:50.881373Z","submitted_at":"2024-12-10T14:28:18Z","title":"Contractive Dynamical Imitation Policies for Efficient Out-of-Sample Recovery","version":2},"reference_index":25,"source":"arxiv_source","source_observed_at":"2026-08-11T18:53:39.544110Z"},"links":{"citing_paper":"/paper/2412.07544"},"observation_digest":"sha256:f6c65ca96d587ab92ad1a19dcd020c89d9c2f0e57520fb58ed8c66c182621a1d","observation_id":"58ae07f3-fa06-438e-b39b-4b9a9240e0dc","resolution":{"observed_at":"2026-08-11T18:53:45.014763Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+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-11T18:53:44.804752Z","title":"GTI: Learning to Generalize across Long-Horizon Tasks from Human Demonstrations","venue":null,"work_id":"462e19df-3e2e-4dd8-8063-e1c80dfd887f","year":2020},"citing_paper":{"arxiv_id":"2412.07544","last_updated":"2025-03-26T13:39:58Z","snapshot_observed_at":"2026-08-12T06:09:50.881373Z","submitted_at":"2024-12-10T14:28:18Z","title":"Contractive Dynamical Imitation Policies for Efficient Out-of-Sample Recovery","version":2},"reference_index":26,"source":"arxiv_source","source_observed_at":"2026-08-11T18:53:39.556394Z"},"links":{"citing_paper":"/paper/2412.07544"},"observation_digest":"sha256:62f7de0991170f1f9bd5b2f3a937ed502805e8a345d4e1a40ddc90888bd326e0","observation_id":"54126d8f-0fc8-44c4-9968-2d246b917e8a","resolution":{"observed_at":"2026-08-11T18:53:44.820537Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+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-11T18:53:44.732614Z","title":"What matters in learning from offline human demonstrations for robot manipulation","venue":null,"work_id":"56542158-2288-4a61-a2f6-fdd25766bef6","year":2021},"citing_paper":{"arxiv_id":"2412.07544","last_updated":"2025-03-26T13:39:58Z","snapshot_observed_at":"2026-08-12T06:09:50.881373Z","submitted_at":"2024-12-10T14:28:18Z","title":"Contractive Dynamical Imitation Policies for Efficient Out-of-Sample Recovery","version":2},"reference_index":27,"source":"arxiv_source","source_observed_at":"2026-08-11T18:53:39.565549Z"},"links":{"citing_paper":"/paper/2412.07544"},"observation_digest":"sha256:5df141c63d05f03aee01390d70067f4647747464fc1789a6ef71b755a3a79984","observation_id":"0fc0dbec-d16d-4ed9-af24-07e89d89c7c7","resolution":{"observed_at":"2026-08-11T18:53:44.754487Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+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-11T18:53:44.629397Z","title":"Learning to optimize with convergence guarantees using nonlinear system theory","venue":null,"work_id":"d8881cea-16c7-43d8-a6af-6a435c50d775","year":2024},"citing_paper":{"arxiv_id":"2412.07544","last_updated":"2025-03-26T13:39:58Z","snapshot_observed_at":"2026-08-12T06:09:50.881373Z","submitted_at":"2024-12-10T14:28:18Z","title":"Contractive Dynamical Imitation Policies for Efficient Out-of-Sample Recovery","version":2},"reference_index":28,"source":"arxiv_source","source_observed_at":"2026-08-11T18:53:39.604972Z"},"links":{"citing_paper":"/paper/2412.07544"},"observation_digest":"sha256:46de3b960d499dfc6602e070ad477fe0c7bba73fd6b2552df3866f17bd491373","observation_id":"57e4eadd-dc28-4998-8aa3-31c9f2510f74","resolution":{"observed_at":"2026-08-11T18:53:44.700008Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+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-11T18:53:44.461987Z","title":"Manchester, Luca Furieri, and Giancarlo Ferrari-Trecate","venue":null,"work_id":"39ea7cf5-4818-48eb-b3f7-5b9992a0e903","year":2023},"citing_paper":{"arxiv_id":"2412.07544","last_updated":"2025-03-26T13:39:58Z","snapshot_observed_at":"2026-08-12T06:09:50.881373Z","submitted_at":"2024-12-10T14:28:18Z","title":"Contractive Dynamical Imitation Policies for Efficient Out-of-Sample Recovery","version":2},"reference_index":29,"source":"arxiv_source","source_observed_at":"2026-08-11T18:53:39.626069Z"},"links":{"citing_paper":"/paper/2412.07544"},"observation_digest":"sha256:9026f4e542c30b8227dde607207d728efc2319b9d387d762a7f396b83bca5d8d","observation_id":"90091cd0-f3ca-40f3-a2f1-d69ab06276f0","resolution":{"observed_at":"2026-08-11T18:53:44.504898Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+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-11T18:53:44.413402Z","title":"Kochenderfer","venue":null,"work_id":"b31cefd1-ddc3-40fa-90b7-e17a2e024261","year":2019},"citing_paper":{"arxiv_id":"2412.07544","last_updated":"2025-03-26T13:39:58Z","snapshot_observed_at":"2026-08-12T06:09:50.881373Z","submitted_at":"2024-12-10T14:28:18Z","title":"Contractive Dynamical Imitation Policies for Efficient Out-of-Sample Recovery","version":2},"reference_index":30,"source":"arxiv_source","source_observed_at":"2026-08-11T18:53:39.637663Z"},"links":{"citing_paper":"/paper/2412.07544"},"observation_digest":"sha256:d0f9cfc77edda169e4ad12816c271f375b6c1a6facd0f55bdfc30e484396658a","observation_id":"95b7c21e-6751-42dd-ba49-a47edb61c739","resolution":{"observed_at":"2026-08-11T18:53:44.434761Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+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-11T18:53:44.213881Z","title":"Orbit: A unified simulation framework for interactive robot learning environments","venue":null,"work_id":"469f6300-846f-404d-850a-f32a7992a0b0","year":2023},"citing_paper":{"arxiv_id":"2412.07544","last_updated":"2025-03-26T13:39:58Z","snapshot_observed_at":"2026-08-12T06:09:50.881373Z","submitted_at":"2024-12-10T14:28:18Z","title":"Contractive Dynamical Imitation Policies for Efficient Out-of-Sample Recovery","version":2},"reference_index":31,"source":"arxiv_source","source_observed_at":"2026-08-11T18:53:39.647140Z"},"links":{"citing_paper":"/paper/2412.07544"},"observation_digest":"sha256:9ce26fc3d7b503394b8ed565d582cbcc63971f567a852b478092e57381d36dd1","observation_id":"ff65ba56-19bc-4c48-968e-99867394651a","resolution":{"observed_at":"2026-08-11T18:53:44.235804Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+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-11T18:53:44.094835Z","title":"Neural contractive dynamical systems","venue":null,"work_id":"d08cecec-4dfd-4780-b013-03ccf36c18cb","year":2024},"citing_paper":{"arxiv_id":"2412.07544","last_updated":"2025-03-26T13:39:58Z","snapshot_observed_at":"2026-08-12T06:09:50.881373Z","submitted_at":"2024-12-10T14:28:18Z","title":"Contractive Dynamical Imitation Policies for Efficient Out-of-Sample Recovery","version":2},"reference_index":32,"source":"arxiv_source","source_observed_at":"2026-08-11T18:53:39.703987Z"},"links":{"citing_paper":"/paper/2412.07544"},"observation_digest":"sha256:afe394db5958328ed2c35a2c35bffb040e5d6228013d27a426357d2af9d21f84","observation_id":"9d7709d7-2ce6-4769-a9b8-b53a233a841f","resolution":{"observed_at":"2026-08-11T18:53:44.134751Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+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-11T18:53:43.818516Z","title":"Learning robot motions with stable dynamical systems under diffeomorphic transformations","venue":null,"work_id":"ece38209-f1da-4c10-ab9d-42bcb9057160","year":2015},"citing_paper":{"arxiv_id":"2412.07544","last_updated":"2025-03-26T13:39:58Z","snapshot_observed_at":"2026-08-12T06:09:50.881373Z","submitted_at":"2024-12-10T14:28:18Z","title":"Contractive Dynamical Imitation Policies for Efficient Out-of-Sample Recovery","version":2},"reference_index":33,"source":"arxiv_source","source_observed_at":"2026-08-11T18:53:39.776028Z"},"links":{"citing_paper":"/paper/2412.07544"},"observation_digest":"sha256:8f7dfc10ccb2f97404096e81da25d8befc6db1ed9c1b5f15ec6ff05c373803f5","observation_id":"2b52a254-adc0-4da8-add6-fa04b086fca7","resolution":{"observed_at":"2026-08-11T18:53:43.927026Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+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-11T18:53:39.874762Z","title":"Normalizing flows for probabilistic modeling and inference","venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2412.07544","last_updated":"2025-03-26T13:39:58Z","snapshot_observed_at":"2026-08-12T06:09:50.881373Z","submitted_at":"2024-12-10T14:28:18Z","title":"Contractive Dynamical Imitation Policies for Efficient Out-of-Sample Recovery","version":2},"reference_index":34,"source":"arxiv_source","source_observed_at":"2026-08-11T18:53:39.874762Z"},"links":{"citing_paper":"/paper/2412.07544"},"observation_digest":"sha256:4050044e95225edce048061631ab18a0afeb3ee0e82f2e28a7b60b849c2076d2","observation_id":"fcb830ba-6fbf-4d0c-bdb9-6efdb792d1b0","resolution":{"observed_at":"2026-08-11T18:53:39.874762Z","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-11T18:53:43.634785Z","title":"P y T orch: An imperative style, high-performance deep learning library","venue":null,"work_id":"591d8ca5-f4d0-4725-a2ad-8962b6263616","year":2019},"citing_paper":{"arxiv_id":"2412.07544","last_updated":"2025-03-26T13:39:58Z","snapshot_observed_at":"2026-08-12T06:09:50.881373Z","submitted_at":"2024-12-10T14:28:18Z","title":"Contractive Dynamical Imitation Policies for Efficient Out-of-Sample Recovery","version":2},"reference_index":35,"source":"arxiv_source","source_observed_at":"2026-08-11T18:53:39.911678Z"},"links":{"citing_paper":"/paper/2412.07544"},"observation_digest":"sha256:5142d37b33c18daa81d0bb319ddca6c95ad028b38fbbcdab480980dfd8d44b77","observation_id":"e0d89953-8641-4bae-86ef-e564eb2e2b7c","resolution":{"observed_at":"2026-08-11T18:53:43.684752Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+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-11T18:53:43.484751Z","title":"Variational discriminator bottleneck: Improving imitation learning, inverse RL , and GAN s by constraining information flow","venue":null,"work_id":"b4f0da82-4ad0-44f2-99f2-183c7f1bef75","year":2019},"citing_paper":{"arxiv_id":"2412.07544","last_updated":"2025-03-26T13:39:58Z","snapshot_observed_at":"2026-08-12T06:09:50.881373Z","submitted_at":"2024-12-10T14:28:18Z","title":"Contractive Dynamical Imitation Policies for Efficient Out-of-Sample Recovery","version":2},"reference_index":36,"source":"arxiv_source","source_observed_at":"2026-08-11T18:53:39.930966Z"},"links":{"citing_paper":"/paper/2412.07544"},"observation_digest":"sha256:7b47c152f168f425d461e4bb59501e6470431b40196db0bbd8b487c1b171b1a5","observation_id":"94f9d5d4-420e-4f86-9213-114ff6638bce","resolution":{"observed_at":"2026-08-11T18:53:43.544755Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.1017/s0305004100030929","metadata_source":"doi_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-11T18:53:41.164770Z","title":null,"venue":null,"work_id":"a62addad-131e-4d91-8b8d-c1b51f5c0fc6","year":1956},"citing_paper":{"arxiv_id":"2412.07544","last_updated":"2025-03-26T13:39:58Z","snapshot_observed_at":"2026-08-12T06:09:50.881373Z","submitted_at":"2024-12-10T14:28:18Z","title":"Contractive Dynamical Imitation Policies for Efficient Out-of-Sample Recovery","version":2},"reference_index":37,"source":"arxiv_source","source_observed_at":"2026-08-11T18:53:39.956732Z"},"links":{"citing_paper":"/paper/2412.07544"},"observation_digest":"sha256:66a80ab0af13657e0a72eb81ad9fee53e8281e132d83879b70138aaa3001d105","observation_id":"7ee44d76-35e4-40a7-85fc-6293270841cf","resolution":{"observed_at":"2026-08-11T18:53:41.281194Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+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-11T18:53:43.430565Z","title":"ALVINN : An autonomous land vehicle in a neural network","venue":null,"work_id":"96e45544-10c8-493e-b313-7e0a70edaff5","year":1988},"citing_paper":{"arxiv_id":"2412.07544","last_updated":"2025-03-26T13:39:58Z","snapshot_observed_at":"2026-08-12T06:09:50.881373Z","submitted_at":"2024-12-10T14:28:18Z","title":"Contractive Dynamical Imitation Policies for Efficient Out-of-Sample Recovery","version":2},"reference_index":38,"source":"arxiv_source","source_observed_at":"2026-08-11T18:53:39.996322Z"},"links":{"citing_paper":"/paper/2412.07544"},"observation_digest":"sha256:ab5fbce2826cd40b74ad8ebcf5325145070d89cad37ad1d0252d4144fbebfc99","observation_id":"68d9906f-8471-4021-8ee7-f7981b2b09cd","resolution":{"observed_at":"2026-08-11T18:53:43.440586Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+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-11T18:53:43.338986Z","title":"Euclideanizing flows: Diffeomorphic reduction for learning stable dynamical systems","venue":null,"work_id":"9a97d30f-855e-46bf-a46e-9895180905b7","year":2020},"citing_paper":{"arxiv_id":"2412.07544","last_updated":"2025-03-26T13:39:58Z","snapshot_observed_at":"2026-08-12T06:09:50.881373Z","submitted_at":"2024-12-10T14:28:18Z","title":"Contractive Dynamical Imitation Policies for Efficient Out-of-Sample Recovery","version":2},"reference_index":39,"source":"arxiv_source","source_observed_at":"2026-08-11T18:53:40.046771Z"},"links":{"citing_paper":"/paper/2412.07544"},"observation_digest":"sha256:1966398e698b492150d5b8d221a5feab2ca2d5dc93ca6c23888e0323beaa562e","observation_id":"3ebb4cae-b5a6-4d69-9154-ef9836f3d6be","resolution":{"observed_at":"2026-08-11T18:53:43.374754Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+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-11T18:53:43.230995Z","title":"Learning partially contracting dynamical systems from demonstrations","venue":null,"work_id":"d1982f04-4850-4401-a38b-8b1e3a67d02e","year":2017},"citing_paper":{"arxiv_id":"2412.07544","last_updated":"2025-03-26T13:39:58Z","snapshot_observed_at":"2026-08-12T06:09:50.881373Z","submitted_at":"2024-12-10T14:28:18Z","title":"Contractive Dynamical Imitation Policies for Efficient Out-of-Sample Recovery","version":2},"reference_index":40,"source":"arxiv_source","source_observed_at":"2026-08-11T18:53:40.144894Z"},"links":{"citing_paper":"/paper/2412.07544"},"observation_digest":"sha256:0e039c69b94cf2c65927f9d3f1cd425d46e0dfcd8a0bb61c614ffbe741c81459","observation_id":"56efa743-d94a-4c17-98f2-5f32dd4b08b0","resolution":{"observed_at":"2026-08-11T18:53:43.255331Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+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-11T18:53:43.074746Z","title":"Recent advances in robot learning from demonstration","venue":null,"work_id":"ca4682e8-16fa-47cd-82a1-c68c6f57696a","year":2020},"citing_paper":{"arxiv_id":"2412.07544","last_updated":"2025-03-26T13:39:58Z","snapshot_observed_at":"2026-08-12T06:09:50.881373Z","submitted_at":"2024-12-10T14:28:18Z","title":"Contractive Dynamical Imitation Policies for Efficient Out-of-Sample Recovery","version":2},"reference_index":41,"source":"arxiv_source","source_observed_at":"2026-08-11T18:53:40.194899Z"},"links":{"citing_paper":"/paper/2412.07544"},"observation_digest":"sha256:6d19b0c722e27df75b4611371fb2e46154f5b7b313311cb8a4729184b1d4c573","observation_id":"774a1c40-09c3-4348-ae6b-0e7b86246642","resolution":{"observed_at":"2026-08-11T18:53:43.114755Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+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-11T18:53:42.994784Z","title":"Recurrent equilibrium networks: Flexible dynamic models with guaranteed stability and robustness","venue":null,"work_id":"cd64a1db-9c56-4c7a-8bfa-48b1c9f1ba3d","year":2023},"citing_paper":{"arxiv_id":"2412.07544","last_updated":"2025-03-26T13:39:58Z","snapshot_observed_at":"2026-08-12T06:09:50.881373Z","submitted_at":"2024-12-10T14:28:18Z","title":"Contractive Dynamical Imitation Policies for Efficient Out-of-Sample Recovery","version":2},"reference_index":42,"source":"arxiv_source","source_observed_at":"2026-08-11T18:53:40.264750Z"},"links":{"citing_paper":"/paper/2412.07544"},"observation_digest":"sha256:7bd779a7674039fc81388cce772b9528a4665d7a218a8ac67252dc492d3be7c4","observation_id":"43bb37b2-45f8-4e8c-9347-167edbaa70e4","resolution":{"observed_at":"2026-08-11T18:53:43.026961Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+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-11T18:53:42.760219Z","title":"Efficient reductions for imitation learning","venue":null,"work_id":"081ae42d-f2b3-48b0-850d-e086484b3f3e","year":2010},"citing_paper":{"arxiv_id":"2412.07544","last_updated":"2025-03-26T13:39:58Z","snapshot_observed_at":"2026-08-12T06:09:50.881373Z","submitted_at":"2024-12-10T14:28:18Z","title":"Contractive Dynamical Imitation Policies for Efficient Out-of-Sample Recovery","version":2},"reference_index":43,"source":"arxiv_source","source_observed_at":"2026-08-11T18:53:40.336775Z"},"links":{"citing_paper":"/paper/2412.07544"},"observation_digest":"sha256:1a8fee7916577b4b233ad5b482602ad788d2b8a4949bd4b81e08108daabd85b3","observation_id":"60dd3ded-6819-48da-b9cb-faf89695e2fc","resolution":{"observed_at":"2026-08-11T18:53:42.874756Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1804.04878","last_updated":"2018-04-13T10:40:45Z","snapshot_observed_at":"2026-08-14T19:26:18.568429Z","submitted_at":"2018-04-13T10:40:45Z","title":"Learning Contracting Vector Fields For Stable Imitation Learning","version":1},"cited_work":{"arxiv_id":"1804.04878","doi":null,"metadata_source":"pith","pith_arxiv_id":"1804.04878","snapshot_observed_at":"2026-08-11T18:53:41.685244Z","title":"Learning Contracting Vector Fields For Stable Imitation Learning","venue":"cs.RO","work_id":"1333d7fc-4672-4b4e-9d14-9b1f2ed19af6","year":2018},"citing_paper":{"arxiv_id":"2412.07544","last_updated":"2025-03-26T13:39:58Z","snapshot_observed_at":"2026-08-12T06:09:50.881373Z","submitted_at":"2024-12-10T14:28:18Z","title":"Contractive Dynamical Imitation Policies for Efficient Out-of-Sample Recovery","version":2},"reference_index":44,"source":"arxiv_source","source_observed_at":"2026-08-11T18:53:40.434128Z"},"links":{"cited_paper":"/paper/1804.04878","citing_paper":"/paper/2412.07544"},"observation_digest":"sha256:a853b03d5aad08d37ed2f3ae13e8c05027ac3be9e5a539f2077d83288986f8b2","observation_id":"16fbb832-ee89-4a79-8ace-04e4cd4c2544","resolution":{"observed_at":"2026-08-11T18:53:41.775351Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+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-11T18:53:42.710226Z","title":"Learning deep dynamical systems using stable neural O D E s","venue":null,"work_id":"214f27d4-3b74-412f-9fb0-0b537ad1f2cb","year":2024},"citing_paper":{"arxiv_id":"2412.07544","last_updated":"2025-03-26T13:39:58Z","snapshot_observed_at":"2026-08-12T06:09:50.881373Z","submitted_at":"2024-12-10T14:28:18Z","title":"Contractive Dynamical Imitation Policies for Efficient Out-of-Sample Recovery","version":2},"reference_index":45,"source":"arxiv_source","source_observed_at":"2026-08-11T18:53:40.496461Z"},"links":{"citing_paper":"/paper/2412.07544"},"observation_digest":"sha256:ae819b7b165a1394828096e9f44947d9f3cabb75462f6c89b9f469345f098ed2","observation_id":"030e439b-c94d-4072-8b51-7a6e29912ac2","resolution":{"observed_at":"2026-08-11T18:53:42.717625Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+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-11T18:53:42.679805Z","title":"A family of nonparametric density estimation algorithms","venue":null,"work_id":"c32eaf41-e939-49e0-b7b9-872a3e02fbe0","year":2013},"citing_paper":{"arxiv_id":"2412.07544","last_updated":"2025-03-26T13:39:58Z","snapshot_observed_at":"2026-08-12T06:09:50.881373Z","submitted_at":"2024-12-10T14:28:18Z","title":"Contractive Dynamical Imitation Policies for Efficient Out-of-Sample Recovery","version":2},"reference_index":46,"source":"arxiv_source","source_observed_at":"2026-08-11T18:53:40.608481Z"},"links":{"citing_paper":"/paper/2412.07544"},"observation_digest":"sha256:5e7fbe219ec86594ec54143d4ecbc5d8c8c8ce97340a470c0d2a063f39f692d5","observation_id":"9323731b-3167-4567-93d6-3553d8d5b1cd","resolution":{"observed_at":"2026-08-11T18:53:42.693460Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+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-11T18:53:42.619243Z","title":"Behavioral cloning from observation","venue":null,"work_id":"33ad3815-b0b6-4e5c-bd55-eeda2ea5670d","year":2018},"citing_paper":{"arxiv_id":"2412.07544","last_updated":"2025-03-26T13:39:58Z","snapshot_observed_at":"2026-08-12T06:09:50.881373Z","submitted_at":"2024-12-10T14:28:18Z","title":"Contractive Dynamical Imitation Policies for Efficient Out-of-Sample Recovery","version":2},"reference_index":47,"source":"arxiv_source","source_observed_at":"2026-08-11T18:53:40.723041Z"},"links":{"citing_paper":"/paper/2412.07544"},"observation_digest":"sha256:29f08773a288eb2c2c6451902e1f4cb0a12caac5f24f8a384af35c066e863b98","observation_id":"b91445a3-ea41-4af2-8e13-52e94dc78008","resolution":{"observed_at":"2026-08-11T18:53:42.651403Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+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-11T18:53:42.475072Z","title":"Contraction theory for nonlinear stability analysis and learning-based control: A tutorial overview","venue":null,"work_id":"757b7375-8bcb-4bdb-986b-8cfe30e283b7","year":2021},"citing_paper":{"arxiv_id":"2412.07544","last_updated":"2025-03-26T13:39:58Z","snapshot_observed_at":"2026-08-12T06:09:50.881373Z","submitted_at":"2024-12-10T14:28:18Z","title":"Contractive Dynamical Imitation Policies for Efficient Out-of-Sample Recovery","version":2},"reference_index":48,"source":"arxiv_source","source_observed_at":"2026-08-11T18:53:40.755411Z"},"links":{"citing_paper":"/paper/2412.07544"},"observation_digest":"sha256:a47c10520685919184fb8b5897d5c53c55c1ad5b3f930b237b78d40733803c4e","observation_id":"574123c3-579c-4688-83bb-454ee55c6ad1","resolution":{"observed_at":"2026-08-11T18:53:42.499298Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+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-11T18:53:42.390939Z","title":null,"venue":null,"work_id":"872302f1-546a-4d87-9d88-e93efe82974e","year":1982},"citing_paper":{"arxiv_id":"2412.07544","last_updated":"2025-03-26T13:39:58Z","snapshot_observed_at":"2026-08-12T06:09:50.881373Z","submitted_at":"2024-12-10T14:28:18Z","title":"Contractive Dynamical Imitation Policies for Efficient Out-of-Sample Recovery","version":2},"reference_index":49,"source":"arxiv_source","source_observed_at":"2026-08-11T18:53:40.794767Z"},"links":{"citing_paper":"/paper/2412.07544"},"observation_digest":"sha256:d1270353324ea7f4d434b23362e8d7e39363ff0211605d4731d2caee3d4cd017","observation_id":"1413f81b-a838-46c7-af17-01cc752091ec","resolution":{"observed_at":"2026-08-11T18:53:42.400954Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+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-11T18:53:42.225037Z","title":"Learning R iemannian stable dynamical systems via diffeomorphisms","venue":null,"work_id":"dcbe4cf7-787b-4f1c-b204-ca8682a97f34","year":2022},"citing_paper":{"arxiv_id":"2412.07544","last_updated":"2025-03-26T13:39:58Z","snapshot_observed_at":"2026-08-12T06:09:50.881373Z","submitted_at":"2024-12-10T14:28:18Z","title":"Contractive Dynamical Imitation Policies for Efficient Out-of-Sample Recovery","version":2},"reference_index":50,"source":"arxiv_source","source_observed_at":"2026-08-11T18:53:40.848455Z"},"links":{"citing_paper":"/paper/2412.07544"},"observation_digest":"sha256:c264ccd0700e92002e73259dfeab9330e64d7e1fc9cbeed9aa06fb323745ff1e","observation_id":"4bc5c14f-135a-4bcd-a7d8-9a9e964fd0e4","resolution":{"observed_at":"2026-08-11T18:53:42.292011Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+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-11T18:53:42.155208Z","title":"Maximum entropy inverse reinforcement learning","venue":null,"work_id":"ec378f53-809c-477b-836d-ad927f7f68b7","year":2008},"citing_paper":{"arxiv_id":"2412.07544","last_updated":"2025-03-26T13:39:58Z","snapshot_observed_at":"2026-08-12T06:09:50.881373Z","submitted_at":"2024-12-10T14:28:18Z","title":"Contractive Dynamical Imitation Policies for Efficient Out-of-Sample Recovery","version":2},"reference_index":51,"source":"arxiv_source","source_observed_at":"2026-08-11T18:53:40.951815Z"},"links":{"citing_paper":"/paper/2412.07544"},"observation_digest":"sha256:a68e92e76f12f7b66ed96610d675c938171cf3f063eece0e9d9cbe9c39463b09","observation_id":"3be31258-02c9-4608-9d6d-935d22a14135","resolution":{"observed_at":"2026-08-11T18:53:42.172253Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+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-11T18:53:41.017028Z","title":"@esa (Ref","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2412.07544","last_updated":"2025-03-26T13:39:58Z","snapshot_observed_at":"2026-08-12T06:09:50.881373Z","submitted_at":"2024-12-10T14:28:18Z","title":"Contractive Dynamical Imitation Policies for Efficient Out-of-Sample Recovery","version":2},"reference_index":52,"source":"arxiv_source","source_observed_at":"2026-08-11T18:53:41.017028Z"},"links":{"citing_paper":"/paper/2412.07544"},"observation_digest":"sha256:11ecbf8160e172533b2bca70fb43a07ba9cf71c059349a13cb3a76b7b2212afe","observation_id":"a006eb8f-d7ee-4d9f-9d94-ea2cc54118e1","resolution":{"observed_at":"2026-08-11T18:53:41.017028Z","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-11T18:53:41.038755Z","title":null,"venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2412.07544","last_updated":"2025-03-26T13:39:58Z","snapshot_observed_at":"2026-08-12T06:09:50.881373Z","submitted_at":"2024-12-10T14:28:18Z","title":"Contractive Dynamical Imitation Policies for Efficient Out-of-Sample Recovery","version":2},"reference_index":53,"source":"arxiv_source","source_observed_at":"2026-08-11T18:53:41.038755Z"},"links":{"citing_paper":"/paper/2412.07544"},"observation_digest":"sha256:cc2fb37b25216a846a7d1fc5615626a7369d7d7601f9a358db0f4ab0613d6cc3","observation_id":"174d4559-01be-4306-9377-28a9e16a77cf","resolution":{"observed_at":"2026-08-11T18:53:41.038755Z","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-11T18:53:41.056882Z","title":"Lift”, “Can","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2412.07544","last_updated":"2025-03-26T13:39:58Z","snapshot_observed_at":"2026-08-12T06:09:50.881373Z","submitted_at":"2024-12-10T14:28:18Z","title":"Contractive Dynamical Imitation Policies for Efficient Out-of-Sample Recovery","version":2},"reference_index":54,"source":"arxiv_source","source_observed_at":"2026-08-11T18:53:41.056882Z"},"links":{"citing_paper":"/paper/2412.07544"},"observation_digest":"sha256:8075a0c1032a5b9b9fef4c834637b7461c6c24e1f6797b36ad38a25a5d0fe2b2","observation_id":"d0dc93d6-dc86-4dd8-88a3-7d80ee5605f0","resolution":{"observed_at":"2026-08-11T18:53:41.056882Z","resolver_source":null,"status":"malformed_identifier"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"paper":{"arxiv_id":"2412.07544","last_updated":"2025-03-26T13:39:58Z","latest_version":2,"primary_category":"cs.LG","snapshot_observed_at":"2026-08-12T06:09:50.881373Z","submitted_at":"2024-12-10T14:28:18Z","title":"Contractive Dynamical Imitation Policies for Efficient Out-of-Sample Recovery"},"reference_resolution":{"displayed":54,"state_counts":{"malformed_identifier":1,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":7,"verified_exact":3,"verified_fuzzy":43},"total_outbound_references":54},"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-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+00:00","source":"retraction_watch"}],"thesis":"As of 14 August 2026, this Paper Citation Record lists 54 of 54 outbound references and 0 inbound Pith citation observations for arXiv:2412.07544."}