{"as_of":"2026-08-22T21:23:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:bc16a6833f3f8eb83b514a875be14244b4ef5c2465614a0a0b394561d542b855","coverage":[{"denominator":22,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":22,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-10T15:02:58.498032Z","state":"measured"},{"denominator":22,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":22,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-22T06:32:14.747728+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/2501.14856/citation-record","integrity":"/paper/2501.14856/integrity","json":"/paper/2501.14856/citation-record.json","paper":"/paper/2501.14856"},"outbound":[{"citation":{"cited_paper":{"arxiv_id":"1701.04862","last_updated":"2017-01-17T20:46:21Z","snapshot_observed_at":"2026-08-15T11:23:36.583037Z","submitted_at":"2017-01-17T20:46:21Z","title":"Towards Principled Methods for Training Generative Adversarial Networks","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1701.04862","snapshot_observed_at":"2026-08-10T15:02:58.405213Z","title":"Towards principled methods for training generative adversarial networks","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2501.14856","last_updated":"2025-02-12T10:36:26Z","snapshot_observed_at":"2026-08-17T22:41:36.314073Z","submitted_at":"2025-01-24T17:15:49Z","title":"Noise-conditioned Energy-based Annealed Rewards (NEAR): A Generative Framework for Imitation Learning from Observation","version":2},"reference_index":1,"source":"pdf_text","source_observed_at":"2026-08-10T15:02:58.405213Z"},"links":{"cited_paper":"/paper/1701.04862","citing_paper":"/paper/2501.14856"},"observation_digest":"sha256:8649f3d17a0aae7972eeb266b50708999b4001f9c83f117389cf3692055c5c8e","observation_id":"a94f2edf-f447-4fd6-8c82-6ac064b3bd89","resolution":{"observed_at":"2026-08-10T15:02:58.405213Z","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-10T15:02:58.934618Z","title":"Annealed importance sampling","venue":null,"work_id":"49474a78-fb06-44fa-add2-d1c18854b7b1","year":2025},"citing_paper":{"arxiv_id":"2501.14856","last_updated":"2025-02-12T10:36:26Z","snapshot_observed_at":"2026-08-17T22:41:36.314073Z","submitted_at":"2025-01-24T17:15:49Z","title":"Noise-conditioned Energy-based Annealed Rewards (NEAR): A Generative Framework for Imitation Learning from Observation","version":2},"reference_index":7,"source":"pdf_text","source_observed_at":"2026-08-10T15:02:58.434040Z"},"links":{"citing_paper":"/paper/2501.14856"},"observation_digest":"sha256:2efc0d9daf144036f24656c2081e1f16d13487fc1f8c49c2503e67ffb4c86987","observation_id":"6ca16a69-ef83-444c-9fd3-c0a1a35b1a43","resolution":{"observed_at":"2026-08-10T15:02:58.938667Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-22T06:32:14.747728+00:00","source":"crossref"},{"observed_at":"2026-08-22T06:32:06.552537+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1506.02438","last_updated":"2018-10-20T18:55:07Z","snapshot_observed_at":"2026-08-15T05:06:05.489107Z","submitted_at":"2015-06-08T11:12:48Z","title":"High-Dimensional Continuous Control Using Generalized Advantage Estimation","version":6},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1506.02438","snapshot_observed_at":"2026-08-10T15:02:58.438228Z","title":"High- dimensional continuous control using generalized advantage estimation","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2501.14856","last_updated":"2025-02-12T10:36:26Z","snapshot_observed_at":"2026-08-17T22:41:36.314073Z","submitted_at":"2025-01-24T17:15:49Z","title":"Noise-conditioned Energy-based Annealed Rewards (NEAR): A Generative Framework for Imitation Learning from Observation","version":2},"reference_index":8,"source":"pdf_text","source_observed_at":"2026-08-10T15:02:58.438228Z"},"links":{"cited_paper":"/paper/1506.02438","citing_paper":"/paper/2501.14856"},"observation_digest":"sha256:3de04672aba18ed5f75dc9e204d9ce305e1b903beaf7413d9803c3ccbe4c4f3e","observation_id":"0964c205-1aa6-4bfd-92fb-510447c21789","resolution":{"observed_at":"2026-08-10T15:02:58.438228Z","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-10T15:02:58.843066Z","title":"The average dynamic time warping pose error is then computed as the average DTW score of allτm across all expert trajectories ˆτj with ∥ˆxi − xi∥2 as the cost function","venue":null,"work_id":"baba55d1-affd-4625-82e7-8f1435941086","year":2018},"citing_paper":{"arxiv_id":"2501.14856","last_updated":"2025-02-12T10:36:26Z","snapshot_observed_at":"2026-08-17T22:41:36.314073Z","submitted_at":"2025-01-24T17:15:49Z","title":"Noise-conditioned Energy-based Annealed Rewards (NEAR): A Generative Framework for Imitation Learning from Observation","version":2},"reference_index":19,"source":"pdf_text","source_observed_at":"2026-08-10T15:02:58.485164Z"},"links":{"citing_paper":"/paper/2501.14856"},"observation_digest":"sha256:e6fe59b51f436f5e7899d7f88e7ba4396c8279945350791ff873857b14d427ff","observation_id":"f74dc2a3-89d2-4e07-be08-e83b7eacd87e","resolution":{"observed_at":"2026-08-10T15:02:58.847953Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-22T06:32:14.747728+00:00","source":"crossref"},{"observed_at":"2026-08-22T06:32:06.552537+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-10T15:02:58.829735Z","title":"The smoothness of the character’s trajectory is an interesting metric to determine the policy’s ability to perform periodic motions in a controlled manner","venue":null,"work_id":"68505b5c-8265-4fe0-abba-b6731d881694","year":2018},"citing_paper":{"arxiv_id":"2501.14856","last_updated":"2025-02-12T10:36:26Z","snapshot_observed_at":"2026-08-17T22:41:36.314073Z","submitted_at":"2025-01-24T17:15:49Z","title":"Noise-conditioned Energy-based Annealed Rewards (NEAR): A Generative Framework for Imitation Learning from Observation","version":2},"reference_index":20,"source":"pdf_text","source_observed_at":"2026-08-10T15:02:58.489396Z"},"links":{"citing_paper":"/paper/2501.14856"},"observation_digest":"sha256:09a0be953f7b8d840de930b640065eb43929f1cb41effbc4337f89deab38c28b","observation_id":"69f823dc-2142-4934-a4f2-87f6a983f2fb","resolution":{"observed_at":"2026-08-10T15:02:58.834237Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-22T06:32:14.747728+00:00","source":"crossref"},{"observed_at":"2026-08-22T06:32:06.552537+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-10T15:02:58.815671Z","title":"The agent aims to reach the goal position at the bottom right (the episode ends when the agent’s position is within some threshold of the goal)","venue":null,"work_id":"342a9fd7-cf80-49e1-aec7-3da6ef649fa0","year":2017},"citing_paper":{"arxiv_id":"2501.14856","last_updated":"2025-02-12T10:36:26Z","snapshot_observed_at":"2026-08-17T22:41:36.314073Z","submitted_at":"2025-01-24T17:15:49Z","title":"Noise-conditioned Energy-based Annealed Rewards (NEAR): A Generative Framework for Imitation Learning from Observation","version":2},"reference_index":21,"source":"pdf_text","source_observed_at":"2026-08-10T15:02:58.493601Z"},"links":{"citing_paper":"/paper/2501.14856"},"observation_digest":"sha256:28db93e8e551b952cdf852a49792a21312e2232c40eee10b369e4e871cb8668d","observation_id":"ba6b39a0-898c-4314-a1c9-b54797abf345","resolution":{"observed_at":"2026-08-10T15:02:58.820443Z","resolver_source":"raw_fallback","status":"malformed_identifier"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-22T06:32:14.747728+00:00","source":"crossref"},{"observed_at":"2026-08-22T06:32:06.552537+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-10T15:02:58.802646Z","title":null,"venue":null,"work_id":"3c12efc0-8fe8-4383-9b00-8e3965f4f87b","year":2017},"citing_paper":{"arxiv_id":"2501.14856","last_updated":"2025-02-12T10:36:26Z","snapshot_observed_at":"2026-08-17T22:41:36.314073Z","submitted_at":"2025-01-24T17:15:49Z","title":"Noise-conditioned Energy-based Annealed Rewards (NEAR): A Generative Framework for Imitation Learning from Observation","version":2},"reference_index":22,"source":"pdf_text","source_observed_at":"2026-08-10T15:02:58.498032Z"},"links":{"citing_paper":"/paper/2501.14856"},"observation_digest":"sha256:c5043c3c69b62a858c96568634f77de7748deb218d40e564ccbc1223dbb3b1c4","observation_id":"53411cb2-ba15-42b3-a672-7f10d3bf9082","resolution":{"observed_at":"2026-08-10T15:02:58.806743Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-22T06:32:14.747728+00:00","source":"crossref"},{"observed_at":"2026-08-22T06:32:06.552537+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-10T15:02:58.872043Z","title":"The decoder has (1024, 512,","venue":null,"work_id":"d4d78995-1d70-4d06-82f8-c05492a53938","year":null},"citing_paper":{"arxiv_id":"2501.14856","last_updated":"2025-02-12T10:36:26Z","snapshot_observed_at":"2026-08-17T22:41:36.314073Z","submitted_at":"2025-01-24T17:15:49Z","title":"Noise-conditioned Energy-based Annealed Rewards (NEAR): A Generative Framework for Imitation Learning from Observation","version":2},"reference_index":1024,"source":"pdf_text","source_observed_at":"2026-08-10T15:02:58.477231Z"},"links":{"citing_paper":"/paper/2501.14856"},"observation_digest":"sha256:bc13b45b742f6e52a942a3120b4892bdc45c3fb7b7d7987152239bf17229ba7b","observation_id":"c8b2044c-add5-4280-9230-51e1c25d89b1","resolution":{"observed_at":"2026-08-10T15:02:58.876759Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-22T06:32:14.747728+00:00","source":"crossref"},{"observed_at":"2026-08-22T06:32:06.552537+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1705.07215","last_updated":"2017-12-10T15:24:13Z","snapshot_observed_at":"2026-08-14T20:59:26.167385Z","submitted_at":"2017-05-19T22:41:56Z","title":"On Convergence and Stability of GANs","version":5},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1705.07215","snapshot_observed_at":"2026-08-10T15:02:58.424691Z","title":"On convergence and stability of gans","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2501.14856","last_updated":"2025-02-12T10:36:26Z","snapshot_observed_at":"2026-08-17T22:41:36.314073Z","submitted_at":"2025-01-24T17:15:49Z","title":"Noise-conditioned Energy-based Annealed Rewards (NEAR): A Generative Framework for Imitation Learning from Observation","version":2},"reference_index":1983,"source":"pdf_text","source_observed_at":"2026-08-10T15:02:58.424691Z"},"links":{"cited_paper":"/paper/1705.07215","citing_paper":"/paper/2501.14856"},"observation_digest":"sha256:cfadc3b7d9f44acc9104c1c836518820b8d442cdedbef5ed45514fefe2cd3c15","observation_id":"1e7c7844-a4ed-4319-8982-5ecc58fe837f","resolution":{"observed_at":"2026-08-10T15:02:58.424691Z","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-10T15:02:58.885762Z","title":"When using the environment-supplied task reward, we set wtask = wenergy = 0.5","venue":null,"work_id":"ab861523-f295-458d-8bf3-e0d61135f4c1","year":2015},"citing_paper":{"arxiv_id":"2501.14856","last_updated":"2025-02-12T10:36:26Z","snapshot_observed_at":"2026-08-17T22:41:36.314073Z","submitted_at":"2025-01-24T17:15:49Z","title":"Noise-conditioned Energy-based Annealed Rewards (NEAR): A Generative Framework for Imitation Learning from Observation","version":2},"reference_index":1988,"source":"pdf_text","source_observed_at":"2026-08-10T15:02:58.473142Z"},"links":{"citing_paper":"/paper/2501.14856"},"observation_digest":"sha256:f9d7f414469df0f5e3cd2df4708e9a6792c46e18b5c58580c9c6075c8c0bd7e6","observation_id":"a47aaee4-d247-495c-8d38-13fdd3cc5d8c","resolution":{"observed_at":"2026-08-10T15:02:58.891580Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-22T06:32:14.747728+00:00","source":"crossref"},{"observed_at":"2026-08-22T06:32:06.552537+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2410.05429","last_updated":"2024-10-07T18:49:55Z","snapshot_observed_at":"2026-08-16T13:11:46.796126Z","submitted_at":"2024-10-07T18:49:55Z","title":"Diffusion Imitation from Observation","version":1},"cited_work":{"arxiv_id":"2410.05429","doi":null,"metadata_source":"pith","pith_arxiv_id":"2410.05429","snapshot_observed_at":"2026-08-10T15:02:58.622648Z","title":"Diffusion Imitation from Observation","venue":"cs.LG","work_id":"2a5d83b9-2235-49dd-a1c5-a3d1047e0e77","year":2024},"citing_paper":{"arxiv_id":"2501.14856","last_updated":"2025-02-12T10:36:26Z","snapshot_observed_at":"2026-08-17T22:41:36.314073Z","submitted_at":"2025-01-24T17:15:49Z","title":"Noise-conditioned Energy-based Annealed Rewards (NEAR): A Generative Framework for Imitation Learning from Observation","version":2},"reference_index":1989,"source":"pdf_text","source_observed_at":"2026-08-10T15:02:58.419904Z"},"links":{"cited_paper":"/paper/2410.05429","citing_paper":"/paper/2501.14856"},"observation_digest":"sha256:6a43f93e3ac15755249ad0b249a08469c0c4a9fb17f08bf5a165e73915d0b64a","observation_id":"48d39cc6-fdce-43ce-a7fa-7fcf72b0904c","resolution":{"observed_at":"2026-08-10T15:02:58.629076Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-22T06:32:14.747728+00:00","source":"crossref"},{"observed_at":"2026-08-22T06:32:06.552537+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-10T15:02:58.451219Z","title":"Calm: Conditional adversarial latent models for directable virtual characters","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2501.14856","last_updated":"2025-02-12T10:36:26Z","snapshot_observed_at":"2026-08-17T22:41:36.314073Z","submitted_at":"2025-01-24T17:15:49Z","title":"Noise-conditioned Energy-based Annealed Rewards (NEAR): A Generative Framework for Imitation Learning from Observation","version":2},"reference_index":1999,"source":"pdf_text","source_observed_at":"2026-08-10T15:02:58.451219Z"},"links":{"citing_paper":"/paper/2501.14856"},"observation_digest":"sha256:d93875fe4b8f352395a4076dd8dcc4013ac6066242d63ef4d7e12f930b89f5f7","observation_id":"6a1f68be-625f-4626-be4d-933a32674882","resolution":{"observed_at":"2026-08-10T15:02:58.451219Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2303.04137","last_updated":"2024-03-14T04:36:31Z","snapshot_observed_at":"2026-08-08T17:26:38.829859Z","submitted_at":"2023-03-07T18:50:03Z","title":"Diffusion Policy: Visuomotor Policy Learning via Action Diffusion","version":5},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2303.04137","snapshot_observed_at":"2026-08-10T15:02:58.410768Z","title":"Diffusion policy: Visuomotor policy learning via action diffusion","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2501.14856","last_updated":"2025-02-12T10:36:26Z","snapshot_observed_at":"2026-08-17T22:41:36.314073Z","submitted_at":"2025-01-24T17:15:49Z","title":"Noise-conditioned Energy-based Annealed Rewards (NEAR): A Generative Framework for Imitation Learning from Observation","version":2},"reference_index":2008,"source":"pdf_text","source_observed_at":"2026-08-10T15:02:58.410768Z"},"links":{"cited_paper":"/paper/2303.04137","citing_paper":"/paper/2501.14856"},"observation_digest":"sha256:573054c4ef33da29f274f968949f77cd2d020961001a10a1839e12b4f97a51d0","observation_id":"b070fa24-76c0-4a1c-9925-83a20c2ed091","resolution":{"observed_at":"2026-08-10T15:02:58.410768Z","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-10T15:02:58.857115Z","title":"Further, we standardise samples before passing them to the network","venue":null,"work_id":"41cb3df4-13a7-4481-a0a8-b0bcd7f28038","year":2020},"citing_paper":{"arxiv_id":"2501.14856","last_updated":"2025-02-12T10:36:26Z","snapshot_observed_at":"2026-08-17T22:41:36.314073Z","submitted_at":"2025-01-24T17:15:49Z","title":"Noise-conditioned Energy-based Annealed Rewards (NEAR): A Generative Framework for Imitation Learning from Observation","version":2},"reference_index":2010,"source":"pdf_text","source_observed_at":"2026-08-10T15:02:58.481160Z"},"links":{"citing_paper":"/paper/2501.14856"},"observation_digest":"sha256:60f5231fe3531dbdc511a43e1790b8bbadbb996ae3096f9a631b557f9b711032","observation_id":"e3c1530a-9682-4475-a186-74c176b8d3cc","resolution":{"observed_at":"2026-08-10T15:02:58.862251Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-22T06:32:14.747728+00:00","source":"crossref"},{"observed_at":"2026-08-22T06:32:06.552537+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-10T15:02:58.900249Z","title":"Lemma A.1","venue":null,"work_id":"cfe1d917-b6e8-4343-8dcb-88653a633a3d","year":1989},"citing_paper":{"arxiv_id":"2501.14856","last_updated":"2025-02-12T10:36:26Z","snapshot_observed_at":"2026-08-17T22:41:36.314073Z","submitted_at":"2025-01-24T17:15:49Z","title":"Noise-conditioned Energy-based Annealed Rewards (NEAR): A Generative Framework for Imitation Learning from Observation","version":2},"reference_index":2011,"source":"pdf_text","source_observed_at":"2026-08-10T15:02:58.468294Z"},"links":{"citing_paper":"/paper/2501.14856"},"observation_digest":"sha256:2a6e20d44d5592c37e5631f6f56f1092190d2b87bc708af9ddfb84fc5419e23c","observation_id":"e6028bf2-01c3-4535-b1f7-35408054b2d3","resolution":{"observed_at":"2026-08-10T15:02:58.904387Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-22T06:32:14.747728+00:00","source":"crossref"},{"observed_at":"2026-08-22T06:32:06.552537+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1707.06347","last_updated":"2017-08-28T09:20:06Z","snapshot_observed_at":"2026-08-20T07:04:06.309989Z","submitted_at":"2017-07-20T02:32:33Z","title":"Proximal Policy Optimization Algorithms","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1707.06347","snapshot_observed_at":"2026-08-10T15:02:58.443048Z","title":"Proximal policy optimization algorithms","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2501.14856","last_updated":"2025-02-12T10:36:26Z","snapshot_observed_at":"2026-08-17T22:41:36.314073Z","submitted_at":"2025-01-24T17:15:49Z","title":"Noise-conditioned Energy-based Annealed Rewards (NEAR): A Generative Framework for Imitation Learning from Observation","version":2},"reference_index":2015,"source":"pdf_text","source_observed_at":"2026-08-10T15:02:58.443048Z"},"links":{"cited_paper":"/paper/1707.06347","citing_paper":"/paper/2501.14856"},"observation_digest":"sha256:5dd952eddf7cd25f793281b62d8599d7e210a88c048c9ccbf2a8812a0b4d092e","observation_id":"12b1156e-e6df-49b4-a962-3640beaf4b3c","resolution":{"observed_at":"2026-08-10T15:02:58.443048Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2108.10470","last_updated":"2021-08-25T23:42:59Z","snapshot_observed_at":"2026-07-06T11:40:56.544714Z","submitted_at":"2021-08-24T01:38:11Z","title":"Isaac Gym: High Performance GPU-Based Physics Simulation For Robot Learning","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2108.10470","snapshot_observed_at":"2026-08-10T15:02:58.429362Z","title":"Isaac gym: High performance gpu-based physics simulation for robot learning","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2501.14856","last_updated":"2025-02-12T10:36:26Z","snapshot_observed_at":"2026-08-17T22:41:36.314073Z","submitted_at":"2025-01-24T17:15:49Z","title":"Noise-conditioned Energy-based Annealed Rewards (NEAR): A Generative Framework for Imitation Learning from Observation","version":2},"reference_index":2017,"source":"pdf_text","source_observed_at":"2026-08-10T15:02:58.429362Z"},"links":{"cited_paper":"/paper/2108.10470","citing_paper":"/paper/2501.14856"},"observation_digest":"sha256:0b989e9b803d51da3635f151c5c9d0392e3f8aab011e2a31a11352df9b66eca7","observation_id":"e8d2855a-f123-43c0-97d7-945ebc9a3517","resolution":{"observed_at":"2026-08-10T15:02:58.429362Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1905.13566","last_updated":"2019-06-19T03:55:09Z","snapshot_observed_at":"2026-08-20T01:05:58.859364Z","submitted_at":"2019-05-30T05:54:30Z","title":"Recent Advances in Imitation Learning from Observation","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1905.13566","snapshot_observed_at":"2026-08-10T15:02:58.459904Z","title":"Recent advances in imitation learning from obser- vation","venue":null,"work_id":null,"year":1905},"citing_paper":{"arxiv_id":"2501.14856","last_updated":"2025-02-12T10:36:26Z","snapshot_observed_at":"2026-08-17T22:41:36.314073Z","submitted_at":"2025-01-24T17:15:49Z","title":"Noise-conditioned Energy-based Annealed Rewards (NEAR): A Generative Framework for Imitation Learning from Observation","version":2},"reference_index":2018,"source":"pdf_text","source_observed_at":"2026-08-10T15:02:58.459904Z"},"links":{"cited_paper":"/paper/1905.13566","citing_paper":"/paper/2501.14856"},"observation_digest":"sha256:0d5dcaf8292ace9771db51f49353ecd91f8345d12563936a2d464dcac5444a1c","observation_id":"2feb0a8d-07d2-4ab8-857e-0c39c9c9e917","resolution":{"observed_at":"2026-08-10T15:02:58.459904Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2101.03288","last_updated":"2021-02-17T19:20:09Z","snapshot_observed_at":"2026-08-16T18:53:23.567847Z","submitted_at":"2021-01-09T04:51:31Z","title":"How to Train Your Energy-Based Models","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2101.03288","snapshot_observed_at":"2026-08-10T15:02:58.447117Z","title":"How to train your energy-based models","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2501.14856","last_updated":"2025-02-12T10:36:26Z","snapshot_observed_at":"2026-08-17T22:41:36.314073Z","submitted_at":"2025-01-24T17:15:49Z","title":"Noise-conditioned Energy-based Annealed Rewards (NEAR): A Generative Framework for Imitation Learning from Observation","version":2},"reference_index":2020,"source":"pdf_text","source_observed_at":"2026-08-10T15:02:58.447117Z"},"links":{"cited_paper":"/paper/2101.03288","citing_paper":"/paper/2501.14856"},"observation_digest":"sha256:1420b95188b170420e8eb1f89597c40f1476b3a42aad55876b81274860e88560","observation_id":"914299c6-c907-4963-99bc-4542f8eaa6a5","resolution":{"observed_at":"2026-08-10T15:02:58.447117Z","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-10T15:02:58.415332Z","title":"George Cybenko","venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2501.14856","last_updated":"2025-02-12T10:36:26Z","snapshot_observed_at":"2026-08-17T22:41:36.314073Z","submitted_at":"2025-01-24T17:15:49Z","title":"Noise-conditioned Energy-based Annealed Rewards (NEAR): A Generative Framework for Imitation Learning from Observation","version":2},"reference_index":2021,"source":"pdf_text","source_observed_at":"2026-08-10T15:02:58.415332Z"},"links":{"citing_paper":"/paper/2501.14856"},"observation_digest":"sha256:f1bf3ead972f19302bd85aab60454af17eb68b50494e1b3d7c474fb8407f9aa3","observation_id":"aff63885-e3b7-43b4-9312-884df26e62b5","resolution":{"observed_at":"2026-08-10T15:02:58.415332Z","resolver_source":null,"status":"malformed_identifier"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1807.06158","last_updated":"2019-06-18T04:56:56Z","snapshot_observed_at":"2026-08-18T08:58:09.128606Z","submitted_at":"2018-07-17T00:25:15Z","title":"Generative Adversarial Imitation from Observation","version":4},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1807.06158","snapshot_observed_at":"2026-08-10T15:02:58.455513Z","title":"Generative adversarial imitation from observation","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2501.14856","last_updated":"2025-02-12T10:36:26Z","snapshot_observed_at":"2026-08-17T22:41:36.314073Z","submitted_at":"2025-01-24T17:15:49Z","title":"Noise-conditioned Energy-based Annealed Rewards (NEAR): A Generative Framework for Imitation Learning from Observation","version":2},"reference_index":2023,"source":"pdf_text","source_observed_at":"2026-08-10T15:02:58.455513Z"},"links":{"cited_paper":"/paper/1807.06158","citing_paper":"/paper/2501.14856"},"observation_digest":"sha256:9a60b732365a9ccb77f1a3064c22f92a2eeb2ad7625b0d0779b0ce59eead2868","observation_id":"eeca6cae-d144-478e-b09e-369ad1e68b98","resolution":{"observed_at":"2026-08-10T15:02:58.455513Z","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-10T15:02:58.913100Z","title":null,"venue":null,"work_id":"8224e3db-8be2-42a3-8f4b-a8e72a57acd6","year":2025},"citing_paper":{"arxiv_id":"2501.14856","last_updated":"2025-02-12T10:36:26Z","snapshot_observed_at":"2026-08-17T22:41:36.314073Z","submitted_at":"2025-01-24T17:15:49Z","title":"Noise-conditioned Energy-based Annealed Rewards (NEAR): A Generative Framework for Imitation Learning from Observation","version":2},"reference_index":2024,"source":"pdf_text","source_observed_at":"2026-08-10T15:02:58.464113Z"},"links":{"citing_paper":"/paper/2501.14856"},"observation_digest":"sha256:aae8c36aabfdbdb473799225b5410265baa06ada812e866a70fbe42b0c13e898","observation_id":"c46eef19-83dc-4f06-a990-c1c70467b530","resolution":{"observed_at":"2026-08-10T15:02:58.917195Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-22T06:32:14.747728+00:00","source":"crossref"},{"observed_at":"2026-08-22T06:32:06.552537+00:00","source":"retraction_watch"}],"state":"measured"}}],"paper":{"arxiv_id":"2501.14856","last_updated":"2025-02-12T10:36:26Z","latest_version":2,"primary_category":"cs.RO","snapshot_observed_at":"2026-08-17T22:41:36.314073Z","submitted_at":"2025-01-24T17:15:49Z","title":"Noise-conditioned Energy-based Annealed Rewards (NEAR): A Generative Framework for Imitation Learning from Observation"},"reference_resolution":{"displayed":22,"state_counts":{"malformed_identifier":2,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":12,"verified_exact":1,"verified_fuzzy":7},"total_outbound_references":22},"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-22T06:32:14.747728+00:00","source":"crossref"},{"observed_at":"2026-08-22T06:32:06.552537+00:00","source":"retraction_watch"}],"thesis":"As of 22 August 2026, this Paper Citation Record lists 22 of 22 outbound references and 0 inbound Pith citation observations for arXiv:2501.14856."}