{"as_of":"2026-08-10T20:40:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:ddd23ca8b0e7015662c8df22184465c9e81c2a87666c1c3d2a8ea3012b77baf2","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-09T00:41:49.799144Z","state":"measured"},{"denominator":56,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":56,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-10T06:31:04.303077+00:00","state":"measured"},{"denominator":2,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":2,"source":"paper_references, paper_reference_links","source_observed_at":"2026-07-14T10:12:06.757775Z","state":"measured"},{"denominator":1,"lane":"external_citation_measurements","note":"A source-named dated measurement, never combined with another source.","records_observed":0,"source":"arxiv_reference","source_observed_at":"2026-07-04T08:49:41.819160Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2502.03822","last_updated":"2025-04-26T01:45:28Z","snapshot_observed_at":"2026-08-09T04:47:05.592842Z","submitted_at":"2025-02-06T07:18:04Z","title":"Dynamic Rank Adjustment in Diffusion Policies for Efficient and Flexible Training","version":3},"cited_work":{"arxiv_id":"2502.03822","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2502.03822","snapshot_observed_at":"2026-07-04T08:49:41.819160Z","title":null,"venue":null,"work_id":"5096ec97-aa4b-4fba-bcdd-12b0e2d67980","year":2025},"citing_paper":{"arxiv_id":"2606.22278","last_updated":"2026-06-21T00:11:46Z","snapshot_observed_at":"2026-08-07T05:45:40.967519Z","submitted_at":"2026-06-21T00:11:46Z","title":"Any-Body Guard: Universal Safeguarding for Manipulation Policies via Action Masking","version":1},"reference_index":45,"source":"pdf_text","source_observed_at":"2026-06-26T10:59:44.035262Z"},"links":{"cited_paper":"/paper/2502.03822","citing_paper":"/paper/2606.22278"},"observation_digest":"sha256:2cdd4b5febcf15348bb63398c3a6cc9208f8eb8d98955828fc514e6c215f746c","observation_id":"55652150-2f63-476a-9809-1ba6f20642bd","resolution":{"observed_at":"2026-07-04T08:49:41.820579Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2502.03822","last_updated":"2025-04-26T01:45:28Z","snapshot_observed_at":"2026-08-09T04:47:05.592842Z","submitted_at":"2025-02-06T07:18:04Z","title":"Dynamic Rank Adjustment in Diffusion Policies for Efficient and Flexible Training","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2502.03822","snapshot_observed_at":"2026-07-14T10:12:06.757775Z","title":null,"venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2607.10655","last_updated":"2026-07-12T08:42:36Z","snapshot_observed_at":"2026-08-04T20:11:45.150716Z","submitted_at":"2026-07-12T08:42:36Z","title":"Artificial Foveated Perception for Mitigating Shortcut Learning in Robotic Foundation Models","version":1},"reference_index":8,"source":"pdf_text","source_observed_at":"2026-07-14T10:12:06.757775Z"},"links":{"cited_paper":"/paper/2502.03822","citing_paper":"/paper/2607.10655"},"observation_digest":"sha256:51d7f43752c59333d0175fc4f3d7099019a01dedc627886ba98c2a6dcbc6ff50","observation_id":"94b6ef1a-f661-42e9-981e-024113dfc42a","resolution":{"observed_at":"2026-07-14T10:12:06.757775Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"links":{"evidence":"/evidence","html":"/paper/2502.03822/citation-record","integrity":"/paper/2502.03822/integrity","json":"/paper/2502.03822/citation-record.json","paper":"/paper/2502.03822"},"outbound":[{"citation":{"cited_paper":{"arxiv_id":"2012.13255","last_updated":"2020-12-22T07:42:30Z","snapshot_observed_at":"2026-08-08T07:37:46.709970Z","submitted_at":"2020-12-22T07:42:30Z","title":"Intrinsic Dimensionality Explains the Effectiveness of Language Model Fine-Tuning","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2012.13255","snapshot_observed_at":"2026-08-09T00:41:49.611432Z","title":"Intrinsic dimensionality explains the effective- ness of language model fine-tuning","venue":null,"work_id":null,"year":2012},"citing_paper":{"arxiv_id":"2502.03822","last_updated":"2025-04-26T01:45:28Z","snapshot_observed_at":"2026-08-09T04:47:05.592842Z","submitted_at":"2025-02-06T07:18:04Z","title":"Dynamic Rank Adjustment in Diffusion Policies for Efficient and Flexible Training","version":3},"reference_index":1,"source":"pdf_text","source_observed_at":"2026-08-09T00:41:49.611432Z"},"links":{"cited_paper":"/paper/2012.13255","citing_paper":"/paper/2502.03822"},"observation_digest":"sha256:6bfd99e691bff5161aaff44f78b58cc8e31371deca691ccd4b9555fed3194229","observation_id":"2d67a427-911d-4180-82ba-808941a99a23","resolution":{"observed_at":"2026-08-09T00:41:49.611432Z","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-09T00:41:50.802057Z","title":"Vision-based trajectory planning via imitation learning for autonomous vehicles","venue":null,"work_id":"6a65fb3f-ec84-4200-a008-4f786d39ab2e","year":2019},"citing_paper":{"arxiv_id":"2502.03822","last_updated":"2025-04-26T01:45:28Z","snapshot_observed_at":"2026-08-09T04:47:05.592842Z","submitted_at":"2025-02-06T07:18:04Z","title":"Dynamic Rank Adjustment in Diffusion Policies for Efficient and Flexible Training","version":3},"reference_index":2,"source":"pdf_text","source_observed_at":"2026-08-09T00:41:49.616641Z"},"links":{"citing_paper":"/paper/2502.03822"},"observation_digest":"sha256:6a32ab1b10f5e2b485600c5f007f9c69498273c903c349d05de03722d36c1254","observation_id":"b4780959-ebfc-4dc4-a6e7-bee6ff532c70","resolution":{"observed_at":"2026-08-09T00:41:50.805528Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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-09T00:41:49.620606Z","title":"Diffusion policy: Visuomotor policy learning via action diffusion","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2502.03822","last_updated":"2025-04-26T01:45:28Z","snapshot_observed_at":"2026-08-09T04:47:05.592842Z","submitted_at":"2025-02-06T07:18:04Z","title":"Dynamic Rank Adjustment in Diffusion Policies for Efficient and Flexible Training","version":3},"reference_index":3,"source":"pdf_text","source_observed_at":"2026-08-09T00:41:49.620606Z"},"links":{"citing_paper":"/paper/2502.03822"},"observation_digest":"sha256:a829401081abdec719de74baba457d79faaca7f41cc89c77feb50724d867c0ef","observation_id":"dd712e8c-c37f-4477-9b3f-5a936f54ad22","resolution":{"observed_at":"2026-08-09T00:41:49.620606Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2309.17400","last_updated":"2024-06-21T16:45:11Z","snapshot_observed_at":"2026-08-06T10:08:54.816113Z","submitted_at":"2023-09-29T17:01:02Z","title":"Directly Fine-Tuning Diffusion Models on Differentiable Rewards","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2309.17400","snapshot_observed_at":"2026-08-09T00:41:49.624573Z","title":"Directly fine-tuning diffusion models on differen- tiable rewards","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2502.03822","last_updated":"2025-04-26T01:45:28Z","snapshot_observed_at":"2026-08-09T04:47:05.592842Z","submitted_at":"2025-02-06T07:18:04Z","title":"Dynamic Rank Adjustment in Diffusion Policies for Efficient and Flexible Training","version":3},"reference_index":4,"source":"pdf_text","source_observed_at":"2026-08-09T00:41:49.624573Z"},"links":{"cited_paper":"/paper/2309.17400","citing_paper":"/paper/2502.03822"},"observation_digest":"sha256:8cff8b0f4e11cb9c3d48280ca85cd10fcc5ea25c501c98431885d0fe8e57480a","observation_id":"f92741bb-0857-445b-9cb1-7569be6d97ea","resolution":{"observed_at":"2026-08-09T00:41:49.624573Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2109.02355","last_updated":"2021-09-06T10:48:40Z","snapshot_observed_at":"2026-08-10T11:57:15.576139Z","submitted_at":"2021-09-06T10:48:40Z","title":"A Farewell to the Bias-Variance Tradeoff? An Overview of the Theory of Overparameterized Machine Learning","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2109.02355","snapshot_observed_at":"2026-08-09T00:41:49.628664Z","title":"A farewell to the bias-variance tradeoff? an overview of the theory of overparameterized machine learning","venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2502.03822","last_updated":"2025-04-26T01:45:28Z","snapshot_observed_at":"2026-08-09T04:47:05.592842Z","submitted_at":"2025-02-06T07:18:04Z","title":"Dynamic Rank Adjustment in Diffusion Policies for Efficient and Flexible Training","version":3},"reference_index":5,"source":"pdf_text","source_observed_at":"2026-08-09T00:41:49.628664Z"},"links":{"cited_paper":"/paper/2109.02355","citing_paper":"/paper/2502.03822"},"observation_digest":"sha256:2c1630296f8af4abb05d3c98083143f0f51b845b3a9d63339bdf1148e69d5c94","observation_id":"7c099491-724f-433a-9cc2-b4cc6bab26e9","resolution":{"observed_at":"2026-08-09T00:41:49.628664Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2305.14314","last_updated":"2023-05-23T17:50:33Z","snapshot_observed_at":"2026-07-06T02:11:23.670680Z","submitted_at":"2023-05-23T17:50:33Z","title":"QLoRA: Efficient Finetuning of Quantized LLMs","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2305.14314","snapshot_observed_at":"2026-08-09T00:41:49.632815Z","title":"Qlora: efficient finetuning of quan- tized llms (2023)","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2502.03822","last_updated":"2025-04-26T01:45:28Z","snapshot_observed_at":"2026-08-09T04:47:05.592842Z","submitted_at":"2025-02-06T07:18:04Z","title":"Dynamic Rank Adjustment in Diffusion Policies for Efficient and Flexible Training","version":3},"reference_index":6,"source":"pdf_text","source_observed_at":"2026-08-09T00:41:49.632815Z"},"links":{"cited_paper":"/paper/2305.14314","citing_paper":"/paper/2502.03822"},"observation_digest":"sha256:114f1763e90103e45b547dc498635923a1a31451514974f7e630608f0f710d6c","observation_id":"22e334de-582c-4bab-99a4-989467e6f965","resolution":{"observed_at":"2026-08-09T00:41:49.632815Z","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-09T00:41:50.785336Z","title":"On the power of over- parametrization in neural networks with quadratic acti- vation","venue":null,"work_id":"6e70583b-e7e8-4d1b-bb87-fc5e5ccbbc9a","year":2018},"citing_paper":{"arxiv_id":"2502.03822","last_updated":"2025-04-26T01:45:28Z","snapshot_observed_at":"2026-08-09T04:47:05.592842Z","submitted_at":"2025-02-06T07:18:04Z","title":"Dynamic Rank Adjustment in Diffusion Policies for Efficient and Flexible Training","version":3},"reference_index":7,"source":"pdf_text","source_observed_at":"2026-08-09T00:41:49.637087Z"},"links":{"citing_paper":"/paper/2502.03822"},"observation_digest":"sha256:2f07dec5a9c96a039ce1dd81b62439f4094d892712973b2e75644a19cac3da6c","observation_id":"84774fbb-6de9-4ae8-aae5-cbb7af4246ed","resolution":{"observed_at":"2026-08-09T00:41:50.789100Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1812.05905","last_updated":"2019-01-29T12:10:47Z","snapshot_observed_at":"2026-08-01T15:24:35.515954Z","submitted_at":"2018-12-13T04:44:29Z","title":"Soft Actor-Critic Algorithms and Applications","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1812.05905","snapshot_observed_at":"2026-08-09T00:41:49.640561Z","title":"Soft actor-critic algorithms and applications","venue":null,"work_id":null,"year":2018},"citing_paper":{"arxiv_id":"2502.03822","last_updated":"2025-04-26T01:45:28Z","snapshot_observed_at":"2026-08-09T04:47:05.592842Z","submitted_at":"2025-02-06T07:18:04Z","title":"Dynamic Rank Adjustment in Diffusion Policies for Efficient and Flexible Training","version":3},"reference_index":8,"source":"pdf_text","source_observed_at":"2026-08-09T00:41:49.640561Z"},"links":{"cited_paper":"/paper/1812.05905","citing_paper":"/paper/2502.03822"},"observation_digest":"sha256:50eb294e406e69e1f1fc359698beda8a1e092b9f581f944736fb09bc96e9b4c3","observation_id":"2a23fcb8-5d5d-474b-93ce-290ef0515c04","resolution":{"observed_at":"2026-08-09T00:41:49.640561Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2305.12821","last_updated":"2023-05-22T08:29:00Z","snapshot_observed_at":"2026-08-01T20:31:21.496677Z","submitted_at":"2023-05-22T08:29:00Z","title":"FurnitureBench: Reproducible Real-World Benchmark for Long-Horizon Complex Manipulation","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2305.12821","snapshot_observed_at":"2026-08-09T00:41:49.644409Z","title":"Furniturebench: Reproducible real-world bench- mark for long-horizon complex manipulation","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2502.03822","last_updated":"2025-04-26T01:45:28Z","snapshot_observed_at":"2026-08-09T04:47:05.592842Z","submitted_at":"2025-02-06T07:18:04Z","title":"Dynamic Rank Adjustment in Diffusion Policies for Efficient and Flexible Training","version":3},"reference_index":9,"source":"pdf_text","source_observed_at":"2026-08-09T00:41:49.644409Z"},"links":{"cited_paper":"/paper/2305.12821","citing_paper":"/paper/2502.03822"},"observation_digest":"sha256:b2f186b890f095f5dfd61249339a4e4969627b3ce7598ac91748425e57117b49","observation_id":"53418216-90d7-4475-b495-fa6a0f5bfdd2","resolution":{"observed_at":"2026-08-09T00:41:49.644409Z","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-09T00:41:49.648252Z","title":"Denoising diffusion probabilistic models","venue":null,"work_id":null,"year":2020},"citing_paper":{"arxiv_id":"2502.03822","last_updated":"2025-04-26T01:45:28Z","snapshot_observed_at":"2026-08-09T04:47:05.592842Z","submitted_at":"2025-02-06T07:18:04Z","title":"Dynamic Rank Adjustment in Diffusion Policies for Efficient and Flexible Training","version":3},"reference_index":10,"source":"pdf_text","source_observed_at":"2026-08-09T00:41:49.648252Z"},"links":{"citing_paper":"/paper/2502.03822"},"observation_digest":"sha256:5af745ef5aa5fa8668644dc3a461228c19d5cc1d98f6ae7ab82695b197533e1d","observation_id":"c80bb809-5d13-4139-a0b1-5f451a7e1ac9","resolution":{"observed_at":"2026-08-09T00:41:49.648252Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2109.08273","last_updated":"2021-09-17T01:21:16Z","snapshot_observed_at":"2026-08-10T13:48:30.104027Z","submitted_at":"2021-09-17T01:21:16Z","title":"ThriftyDAgger: Budget-Aware Novelty and Risk Gating for Interactive Imitation Learning","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2109.08273","snapshot_observed_at":"2026-08-09T00:41:49.651819Z","title":"Thriftydagger: Budget-aware novelty and risk gating for interactive imitation learning","venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2502.03822","last_updated":"2025-04-26T01:45:28Z","snapshot_observed_at":"2026-08-09T04:47:05.592842Z","submitted_at":"2025-02-06T07:18:04Z","title":"Dynamic Rank Adjustment in Diffusion Policies for Efficient and Flexible Training","version":3},"reference_index":11,"source":"pdf_text","source_observed_at":"2026-08-09T00:41:49.651819Z"},"links":{"cited_paper":"/paper/2109.08273","citing_paper":"/paper/2502.03822"},"observation_digest":"sha256:72bda4076343b618f52f458742d4bf25075534b95908d0bd0cd0aee57caea1bc","observation_id":"7f1bd004-2ce4-4029-a10f-5defd372a75a","resolution":{"observed_at":"2026-08-09T00:41:49.651819Z","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-09T00:41:50.768990Z","title":"Lazydagger: Reducing context switching in interactive imitation learning","venue":null,"work_id":"b29282e5-7e75-4521-a331-b9e90f0394ed","year":2021},"citing_paper":{"arxiv_id":"2502.03822","last_updated":"2025-04-26T01:45:28Z","snapshot_observed_at":"2026-08-09T04:47:05.592842Z","submitted_at":"2025-02-06T07:18:04Z","title":"Dynamic Rank Adjustment in Diffusion Policies for Efficient and Flexible Training","version":3},"reference_index":12,"source":"pdf_text","source_observed_at":"2026-08-09T00:41:49.655256Z"},"links":{"citing_paper":"/paper/2502.03822"},"observation_digest":"sha256:791736c187a78073cd7579188c1106deed9db671e1aa8c4597cd57c98f5afc71","observation_id":"04afd11f-cb13-448e-82c6-2da21ac46320","resolution":{"observed_at":"2026-08-09T00:41:50.772637Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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-09T00:41:49.658537Z","title":"Lora: Low-rank adaptation of large language models","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2502.03822","last_updated":"2025-04-26T01:45:28Z","snapshot_observed_at":"2026-08-09T04:47:05.592842Z","submitted_at":"2025-02-06T07:18:04Z","title":"Dynamic Rank Adjustment in Diffusion Policies for Efficient and Flexible Training","version":3},"reference_index":13,"source":"pdf_text","source_observed_at":"2026-08-09T00:41:49.658537Z"},"links":{"citing_paper":"/paper/2502.03822"},"observation_digest":"sha256:178f0fc0702eaac986edc16152b5c6d8b540cc14143e515ff24947419c080d7e","observation_id":"dc3bb717-6c9e-40f3-9afb-2d0f165cb412","resolution":{"observed_at":"2026-08-09T00:41:49.658537Z","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-09T00:41:50.753027Z","title":"Real-time obstacle avoidance in robotic manipulation using imitation learn- ing","venue":null,"work_id":"e59755f0-5233-4be4-b548-982d98d92d91","year":2020},"citing_paper":{"arxiv_id":"2502.03822","last_updated":"2025-04-26T01:45:28Z","snapshot_observed_at":"2026-08-09T04:47:05.592842Z","submitted_at":"2025-02-06T07:18:04Z","title":"Dynamic Rank Adjustment in Diffusion Policies for Efficient and Flexible Training","version":3},"reference_index":14,"source":"pdf_text","source_observed_at":"2026-08-09T00:41:49.661928Z"},"links":{"citing_paper":"/paper/2502.03822"},"observation_digest":"sha256:5551c1ff9f1a12e6615e9ad2680cbbb08eeea582db601055db7b84093ec9cd0d","observation_id":"fc9ff3ba-ede5-4884-8ee8-a5e450bacad0","resolution":{"observed_at":"2026-08-09T00:41:50.756589Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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-09T00:41:50.742448Z","title":"A geometric perspective on visual imitation learning","venue":null,"work_id":"7d95cf71-3bbf-49bb-99b5-e7ef35ad1f1f","year":2020},"citing_paper":{"arxiv_id":"2502.03822","last_updated":"2025-04-26T01:45:28Z","snapshot_observed_at":"2026-08-09T04:47:05.592842Z","submitted_at":"2025-02-06T07:18:04Z","title":"Dynamic Rank Adjustment in Diffusion Policies for Efficient and Flexible Training","version":3},"reference_index":15,"source":"pdf_text","source_observed_at":"2026-08-09T00:41:49.665136Z"},"links":{"citing_paper":"/paper/2502.03822"},"observation_digest":"sha256:58e405f47cfd720d432ae3791d8bd343de002c6c425a3a02cf8db2b199de5b86","observation_id":"26d2c7ed-cd3f-46a0-9994-d104a476ff23","resolution":{"observed_at":"2026-08-09T00:41:50.746015Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2001.08361","last_updated":"2020-01-23T03:59:20Z","snapshot_observed_at":"2026-07-06T08:52:12.656082Z","submitted_at":"2020-01-23T03:59:20Z","title":"Scaling Laws for Neural Language Models","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2001.08361","snapshot_observed_at":"2026-08-09T00:41:49.668415Z","title":"Scal- ing laws for neural language models","venue":null,"work_id":null,"year":2001},"citing_paper":{"arxiv_id":"2502.03822","last_updated":"2025-04-26T01:45:28Z","snapshot_observed_at":"2026-08-09T04:47:05.592842Z","submitted_at":"2025-02-06T07:18:04Z","title":"Dynamic Rank Adjustment in Diffusion Policies for Efficient and Flexible Training","version":3},"reference_index":16,"source":"pdf_text","source_observed_at":"2026-08-09T00:41:49.668415Z"},"links":{"cited_paper":"/paper/2001.08361","citing_paper":"/paper/2502.03822"},"observation_digest":"sha256:4a0eaedb01025eb6973bfc481150204c7ef244e187bfa50aac42f198befa2407","observation_id":"4f60361d-b53e-40f9-b429-b0980ba5e0e4","resolution":{"observed_at":"2026-08-09T00:41:49.668415Z","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-09T00:41:49.675132Z","title":"Hg-dagger: Inter- active imitation learning with human experts","venue":null,"work_id":null,"year":2019},"citing_paper":{"arxiv_id":"2502.03822","last_updated":"2025-04-26T01:45:28Z","snapshot_observed_at":"2026-08-09T04:47:05.592842Z","submitted_at":"2025-02-06T07:18:04Z","title":"Dynamic Rank Adjustment in Diffusion Policies for Efficient and Flexible Training","version":3},"reference_index":18,"source":"pdf_text","source_observed_at":"2026-08-09T00:41:49.675132Z"},"links":{"citing_paper":"/paper/2502.03822"},"observation_digest":"sha256:0a42712043a65f85319a7f25a528aceab4bd91722f3b53a09bd0195548c18696","observation_id":"9f01ae8a-b485-4dee-959f-ec77f436a24f","resolution":{"observed_at":"2026-08-09T00:41:49.675132Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1412.6980","last_updated":"2017-01-30T01:27:54Z","snapshot_observed_at":"2026-07-06T02:11:23.670680Z","submitted_at":"2014-12-22T13:54:29Z","title":"Adam: A Method for Stochastic Optimization","version":9},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1412.6980","snapshot_observed_at":"2026-08-09T00:41:49.678563Z","title":"Adam: A method for stochastic optimization","venue":null,"work_id":null,"year":2014},"citing_paper":{"arxiv_id":"2502.03822","last_updated":"2025-04-26T01:45:28Z","snapshot_observed_at":"2026-08-09T04:47:05.592842Z","submitted_at":"2025-02-06T07:18:04Z","title":"Dynamic Rank Adjustment in Diffusion Policies for Efficient and Flexible Training","version":3},"reference_index":19,"source":"pdf_text","source_observed_at":"2026-08-09T00:41:49.678563Z"},"links":{"cited_paper":"/paper/1412.6980","citing_paper":"/paper/2502.03822"},"observation_digest":"sha256:d60cf1588d44e2c7aaffac3c5c6bc2df11d2e88c5922fccbfdf037e4769286ef","observation_id":"170fa581-9597-436b-8a85-9906321f769c","resolution":{"observed_at":"2026-08-09T00:41:49.678563Z","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-09T00:41:50.725466Z","title":"Dynamical low-rank approximation","venue":null,"work_id":"868354c7-4022-4e4c-ae05-962285e57e5d","year":2007},"citing_paper":{"arxiv_id":"2502.03822","last_updated":"2025-04-26T01:45:28Z","snapshot_observed_at":"2026-08-09T04:47:05.592842Z","submitted_at":"2025-02-06T07:18:04Z","title":"Dynamic Rank Adjustment in Diffusion Policies for Efficient and Flexible Training","version":3},"reference_index":20,"source":"pdf_text","source_observed_at":"2026-08-09T00:41:49.682209Z"},"links":{"citing_paper":"/paper/2502.03822"},"observation_digest":"sha256:c61f7aea7eaf4a84e9c66f4e635580dfac7c0c93d5f195e5e806c4d2ce38ae5a","observation_id":"b00d2823-187e-4fa6-9a02-995b2ec94d10","resolution":{"observed_at":"2026-08-09T00:41:50.729326Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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-09T00:41:49.685297Z","title":"Imagenet classification with deep convolutional neural networks","venue":null,"work_id":null,"year":2012},"citing_paper":{"arxiv_id":"2502.03822","last_updated":"2025-04-26T01:45:28Z","snapshot_observed_at":"2026-08-09T04:47:05.592842Z","submitted_at":"2025-02-06T07:18:04Z","title":"Dynamic Rank Adjustment in Diffusion Policies for Efficient and Flexible Training","version":3},"reference_index":21,"source":"pdf_text","source_observed_at":"2026-08-09T00:41:49.685297Z"},"links":{"citing_paper":"/paper/2502.03822"},"observation_digest":"sha256:255afc48b9f2e4c57fff20dc30091ebf9f463d7b6482455e4c3f7824bbefbafb","observation_id":"4a8fb48a-5618-4ee6-bf59-46c7d3e0b93f","resolution":{"observed_at":"2026-08-09T00:41:49.685297Z","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-09T00:41:50.709108Z","title":"Beyond pick-and- place: Tackling robotic stacking of diverse shapes","venue":null,"work_id":"b7ce774a-b9e2-4fa5-b030-b7b93eeefefa","year":2021},"citing_paper":{"arxiv_id":"2502.03822","last_updated":"2025-04-26T01:45:28Z","snapshot_observed_at":"2026-08-09T04:47:05.592842Z","submitted_at":"2025-02-06T07:18:04Z","title":"Dynamic Rank Adjustment in Diffusion Policies for Efficient and Flexible Training","version":3},"reference_index":22,"source":"pdf_text","source_observed_at":"2026-08-09T00:41:49.688506Z"},"links":{"citing_paper":"/paper/2502.03822"},"observation_digest":"sha256:51c175d54899abef8f34f07f21f3a63ad5d7e00ad464c75c36dd27ada652ea44","observation_id":"f9cdaa80-9150-4436-9a01-0aa4cc052e85","resolution":{"observed_at":"2026-08-09T00:41:50.712628Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2410.14868","last_updated":"2025-03-24T03:10:14Z","snapshot_observed_at":"2026-08-10T17:41:16.805496Z","submitted_at":"2024-10-18T21:28:50Z","title":"Diff-DAgger: Uncertainty Estimation with Diffusion Policy for Robotic Manipulation","version":4},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2410.14868","snapshot_observed_at":"2026-08-09T00:41:49.691694Z","title":"Diff-dagger: Un- certainty estimation with diffusion policy for robotic manipulation","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2502.03822","last_updated":"2025-04-26T01:45:28Z","snapshot_observed_at":"2026-08-09T04:47:05.592842Z","submitted_at":"2025-02-06T07:18:04Z","title":"Dynamic Rank Adjustment in Diffusion Policies for Efficient and Flexible Training","version":3},"reference_index":23,"source":"pdf_text","source_observed_at":"2026-08-09T00:41:49.691694Z"},"links":{"cited_paper":"/paper/2410.14868","citing_paper":"/paper/2502.03822"},"observation_digest":"sha256:328f96e7e9d892f04589f2b1fe6fa42ba7ed7dbeec642cd6654d7de9ca05f03d","observation_id":"eb952603-bcff-40d6-a192-f9e0a357c42b","resolution":{"observed_at":"2026-08-09T00:41:49.691694Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1804.08838","last_updated":"2018-04-24T04:29:10Z","snapshot_observed_at":"2026-08-06T23:47:57.134059Z","submitted_at":"2018-04-24T04:29:10Z","title":"Measuring the Intrinsic Dimension of Objective Landscapes","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1804.08838","snapshot_observed_at":"2026-08-09T00:41:49.695004Z","title":"Measuring the intrinsic dimension of objective landscapes","venue":null,"work_id":null,"year":2018},"citing_paper":{"arxiv_id":"2502.03822","last_updated":"2025-04-26T01:45:28Z","snapshot_observed_at":"2026-08-09T04:47:05.592842Z","submitted_at":"2025-02-06T07:18:04Z","title":"Dynamic Rank Adjustment in Diffusion Policies for Efficient and Flexible Training","version":3},"reference_index":24,"source":"pdf_text","source_observed_at":"2026-08-09T00:41:49.695004Z"},"links":{"cited_paper":"/paper/1804.08838","citing_paper":"/paper/2502.03822"},"observation_digest":"sha256:edd94ac7e6152368c28d6e665142e5b00f7dbab80fc428431a9536dedb6af643","observation_id":"470f9e37-91d8-47a9-a686-9a293028253c","resolution":{"observed_at":"2026-08-09T00:41:49.695004Z","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-09T00:41:50.698161Z","title":"Recov- ery guarantee of weighted low-rank approximation via alternating minimization","venue":null,"work_id":"6cbd2c49-ae02-4f88-b261-d4e78fd8c444","year":2016},"citing_paper":{"arxiv_id":"2502.03822","last_updated":"2025-04-26T01:45:28Z","snapshot_observed_at":"2026-08-09T04:47:05.592842Z","submitted_at":"2025-02-06T07:18:04Z","title":"Dynamic Rank Adjustment in Diffusion Policies for Efficient and Flexible Training","version":3},"reference_index":25,"source":"pdf_text","source_observed_at":"2026-08-09T00:41:49.698359Z"},"links":{"citing_paper":"/paper/2502.03822"},"observation_digest":"sha256:0eb68d36015a4d7fea42139e33a88a59b14a5c6b0c1ce6b04169d90910d44031","observation_id":"d878819a-15c5-4184-9d89-b131d75ac0ab","resolution":{"observed_at":"2026-08-09T00:41:50.701961Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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-09T00:41:50.687866Z","title":"Al- gorithmic regularization in over-parameterized matrix sensing and neural networks with quadratic activations","venue":null,"work_id":"a0edde79-6243-4c67-9a24-46c78ae7b124","year":2018},"citing_paper":{"arxiv_id":"2502.03822","last_updated":"2025-04-26T01:45:28Z","snapshot_observed_at":"2026-08-09T04:47:05.592842Z","submitted_at":"2025-02-06T07:18:04Z","title":"Dynamic Rank Adjustment in Diffusion Policies for Efficient and Flexible Training","version":3},"reference_index":26,"source":"pdf_text","source_observed_at":"2026-08-09T00:41:49.701608Z"},"links":{"citing_paper":"/paper/2502.03822"},"observation_digest":"sha256:fcb0cd61fbdeb2fb37ddbcdac1fed082c0e9ecc9a9091f310f01f3a1f2afe2fd","observation_id":"e6d5c1e9-1974-455f-b45b-3ef4bc125c8c","resolution":{"observed_at":"2026-08-09T00:41:50.691585Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2402.09353","last_updated":"2024-07-09T05:59:16Z","snapshot_observed_at":"2026-07-06T02:11:23.670680Z","submitted_at":"2024-02-14T17:59:34Z","title":"DoRA: Weight-Decomposed Low-Rank Adaptation","version":6},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2402.09353","snapshot_observed_at":"2026-08-09T00:41:49.704940Z","title":"Dora: Weight-decomposed low- rank adaptation","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2502.03822","last_updated":"2025-04-26T01:45:28Z","snapshot_observed_at":"2026-08-09T04:47:05.592842Z","submitted_at":"2025-02-06T07:18:04Z","title":"Dynamic Rank Adjustment in Diffusion Policies for Efficient and Flexible Training","version":3},"reference_index":27,"source":"pdf_text","source_observed_at":"2026-08-09T00:41:49.704940Z"},"links":{"cited_paper":"/paper/2402.09353","citing_paper":"/paper/2502.03822"},"observation_digest":"sha256:9fa8b19a309060394c2a88841a8c67518136de73c34b7454d71cd0cfdb98e561","observation_id":"8dbc69f8-9f56-48d2-a2cf-8a12c85be071","resolution":{"observed_at":"2026-08-09T00:41:49.704940Z","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-09T00:41:50.676921Z","title":"Learning high-speed flight in the wild","venue":null,"work_id":"25fdb1b5-e1f0-4981-801c-d94f8b424f27","year":2021},"citing_paper":{"arxiv_id":"2502.03822","last_updated":"2025-04-26T01:45:28Z","snapshot_observed_at":"2026-08-09T04:47:05.592842Z","submitted_at":"2025-02-06T07:18:04Z","title":"Dynamic Rank Adjustment in Diffusion Policies for Efficient and Flexible Training","version":3},"reference_index":28,"source":"pdf_text","source_observed_at":"2026-08-09T00:41:49.708451Z"},"links":{"citing_paper":"/paper/2502.03822"},"observation_digest":"sha256:6ee6a04ffef08caaea5719ba0970d9722c36e06b317c71d24620bc32f22917cf","observation_id":"133ed8c7-43cf-4f26-be4c-f4b766aeb0d5","resolution":{"observed_at":"2026-08-09T00:41:50.680987Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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-09T00:41:50.666732Z","title":"What matters in learning from offline human demonstra- tions for robot manipulation","venue":null,"work_id":"c4027f5c-a722-4187-94c5-3adc5d0563c5","year":2021},"citing_paper":{"arxiv_id":"2502.03822","last_updated":"2025-04-26T01:45:28Z","snapshot_observed_at":"2026-08-09T04:47:05.592842Z","submitted_at":"2025-02-06T07:18:04Z","title":"Dynamic Rank Adjustment in Diffusion Policies for Efficient and Flexible Training","version":3},"reference_index":29,"source":"pdf_text","source_observed_at":"2026-08-09T00:41:49.711791Z"},"links":{"citing_paper":"/paper/2502.03822"},"observation_digest":"sha256:45f7146456e51de743d90a8d1abaffd7b85ab00745f435f186c442efdddcf9fd","observation_id":"9f236898-19ff-4cb5-8f47-f43b6a41a150","resolution":{"observed_at":"2026-08-09T00:41:50.670421Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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-09T00:41:49.714934Z","title":"Pytorch: An imperative style, high-performance deep learning library","venue":null,"work_id":null,"year":2019},"citing_paper":{"arxiv_id":"2502.03822","last_updated":"2025-04-26T01:45:28Z","snapshot_observed_at":"2026-08-09T04:47:05.592842Z","submitted_at":"2025-02-06T07:18:04Z","title":"Dynamic Rank Adjustment in Diffusion Policies for Efficient and Flexible Training","version":3},"reference_index":30,"source":"pdf_text","source_observed_at":"2026-08-09T00:41:49.714934Z"},"links":{"citing_paper":"/paper/2502.03822"},"observation_digest":"sha256:653a2e9813d9c942cc99b4625aa7feef17fd66d921f63acf2828c8221b80bcd2","observation_id":"c4e14ac3-5593-4ffb-bf03-02992bbd291e","resolution":{"observed_at":"2026-08-09T00:41:49.714934Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2405.07503","last_updated":"2024-06-28T21:56:25Z","snapshot_observed_at":"2026-08-06T22:06:11.020007Z","submitted_at":"2024-05-13T06:53:42Z","title":"Consistency Policy: Accelerated Visuomotor Policies via Consistency Distillation","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2405.07503","snapshot_observed_at":"2026-08-09T00:41:49.718172Z","title":"Consistency policy: Accelerated visuomotor policies via consistency distillation","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2502.03822","last_updated":"2025-04-26T01:45:28Z","snapshot_observed_at":"2026-08-09T04:47:05.592842Z","submitted_at":"2025-02-06T07:18:04Z","title":"Dynamic Rank Adjustment in Diffusion Policies for Efficient and Flexible Training","version":3},"reference_index":31,"source":"pdf_text","source_observed_at":"2026-08-09T00:41:49.718172Z"},"links":{"cited_paper":"/paper/2405.07503","citing_paper":"/paper/2502.03822"},"observation_digest":"sha256:d3523f6c8afbd9cbce4bc3de11b0515420f217e08aa119df073b50b727434d73","observation_id":"917f3e7b-63d2-40a8-b55d-3963efe33835","resolution":{"observed_at":"2026-08-09T00:41:49.718172Z","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-09T00:41:49.721554Z","title":"High-resolution image synthesis with latent diffusion models","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2502.03822","last_updated":"2025-04-26T01:45:28Z","snapshot_observed_at":"2026-08-09T04:47:05.592842Z","submitted_at":"2025-02-06T07:18:04Z","title":"Dynamic Rank Adjustment in Diffusion Policies for Efficient and Flexible Training","version":3},"reference_index":32,"source":"pdf_text","source_observed_at":"2026-08-09T00:41:49.721554Z"},"links":{"citing_paper":"/paper/2502.03822"},"observation_digest":"sha256:a1ba839fbf491bcd52257f32923f85a7ef58bbbaa7eec07454befdca41839d42","observation_id":"a594f0ab-7ecd-4fad-b73d-b5d156f078aa","resolution":{"observed_at":"2026-08-09T00:41:49.721554Z","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-09T00:41:50.644798Z","title":"U- net: Convolutional networks for biomedical image seg- mentation","venue":null,"work_id":"73dfe6cf-e81e-48a2-aa00-c9d19e144a2b","year":2015},"citing_paper":{"arxiv_id":"2502.03822","last_updated":"2025-04-26T01:45:28Z","snapshot_observed_at":"2026-08-09T04:47:05.592842Z","submitted_at":"2025-02-06T07:18:04Z","title":"Dynamic Rank Adjustment in Diffusion Policies for Efficient and Flexible Training","version":3},"reference_index":33,"source":"pdf_text","source_observed_at":"2026-08-09T00:41:49.724945Z"},"links":{"citing_paper":"/paper/2502.03822"},"observation_digest":"sha256:dd202ee57dcf805ea1dc39417a4c3ffa9bdb46ba39a6b5d9d14363e0ca2b2496","observation_id":"fd5b4e99-5f03-4360-8de2-6e291a85f3d4","resolution":{"observed_at":"2026-08-09T00:41:50.648348Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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-09T00:41:49.728594Z","title":"A reduction of imitation learning and structured prediction to no-regret online learning","venue":null,"work_id":null,"year":2011},"citing_paper":{"arxiv_id":"2502.03822","last_updated":"2025-04-26T01:45:28Z","snapshot_observed_at":"2026-08-09T04:47:05.592842Z","submitted_at":"2025-02-06T07:18:04Z","title":"Dynamic Rank Adjustment in Diffusion Policies for Efficient and Flexible Training","version":3},"reference_index":34,"source":"pdf_text","source_observed_at":"2026-08-09T00:41:49.728594Z"},"links":{"citing_paper":"/paper/2502.03822"},"observation_digest":"sha256:daec7a46fb57cf902285ba7b76e0c765f55b22283f03c22a979351e25fce2b7a","observation_id":"704c6f59-499b-4c53-903f-cd1e50567889","resolution":{"observed_at":"2026-08-09T00:41:49.728594Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1707.06347","last_updated":"2017-08-28T09:20:06Z","snapshot_observed_at":"2026-07-06T02:11:23.670680Z","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-09T00:41:49.732229Z","title":"Proximal policy optimization algorithms","venue":null,"work_id":null,"year":2017},"citing_paper":{"arxiv_id":"2502.03822","last_updated":"2025-04-26T01:45:28Z","snapshot_observed_at":"2026-08-09T04:47:05.592842Z","submitted_at":"2025-02-06T07:18:04Z","title":"Dynamic Rank Adjustment in Diffusion Policies for Efficient and Flexible Training","version":3},"reference_index":35,"source":"pdf_text","source_observed_at":"2026-08-09T00:41:49.732229Z"},"links":{"cited_paper":"/paper/1707.06347","citing_paper":"/paper/2502.03822"},"observation_digest":"sha256:051feef477d71e4c92d0bdeffb7623db530d837819670db61a9aa3ee62b948d0","observation_id":"85e667c2-63b5-4bbe-8a1a-87291b30dcec","resolution":{"observed_at":"2026-08-09T00:41:49.732229Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2010.02502","last_updated":"2022-10-05T20:19:21Z","snapshot_observed_at":"2026-07-06T10:01:50.133383Z","submitted_at":"2020-10-06T06:15:51Z","title":"Denoising Diffusion Implicit Models","version":4},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2010.02502","snapshot_observed_at":"2026-08-09T00:41:49.735795Z","title":"Denoising diffusion implicit models","venue":null,"work_id":null,"year":2010},"citing_paper":{"arxiv_id":"2502.03822","last_updated":"2025-04-26T01:45:28Z","snapshot_observed_at":"2026-08-09T04:47:05.592842Z","submitted_at":"2025-02-06T07:18:04Z","title":"Dynamic Rank Adjustment in Diffusion Policies for Efficient and Flexible Training","version":3},"reference_index":36,"source":"pdf_text","source_observed_at":"2026-08-09T00:41:49.735795Z"},"links":{"cited_paper":"/paper/2010.02502","citing_paper":"/paper/2502.03822"},"observation_digest":"sha256:7a653c65992931f98108f292cbdd76948e52c9fe31ac000c68287e8acf7769b4","observation_id":"828ee58c-5695-4569-a93a-dc2710d89048","resolution":{"observed_at":"2026-08-09T00:41:49.735795Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2102.02872","last_updated":"2021-02-11T14:55:12Z","snapshot_observed_at":"2026-07-06T10:38:35.211339Z","submitted_at":"2021-02-04T20:18:56Z","title":"Feedback in Imitation Learning: The Three Regimes of Covariate Shift","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2102.02872","snapshot_observed_at":"2026-08-09T00:41:49.739817Z","title":"Feedback in imitation learning: The three regimes of covariate shift","venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2502.03822","last_updated":"2025-04-26T01:45:28Z","snapshot_observed_at":"2026-08-09T04:47:05.592842Z","submitted_at":"2025-02-06T07:18:04Z","title":"Dynamic Rank Adjustment in Diffusion Policies for Efficient and Flexible Training","version":3},"reference_index":37,"source":"pdf_text","source_observed_at":"2026-08-09T00:41:49.739817Z"},"links":{"cited_paper":"/paper/2102.02872","citing_paper":"/paper/2502.03822"},"observation_digest":"sha256:ee9fb641c4d1bcd98c463a520564469ba3cf23822a0cd4a562ffd3f2e0818a4e","observation_id":"17116d68-8c7f-4605-8f48-caccb8bc4b37","resolution":{"observed_at":"2026-08-09T00:41:49.739817Z","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-09T00:41:49.743214Z","title":"Nomad: Goal masked diffusion policies for navigation and exploration","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2502.03822","last_updated":"2025-04-26T01:45:28Z","snapshot_observed_at":"2026-08-09T04:47:05.592842Z","submitted_at":"2025-02-06T07:18:04Z","title":"Dynamic Rank Adjustment in Diffusion Policies for Efficient and Flexible Training","version":3},"reference_index":38,"source":"pdf_text","source_observed_at":"2026-08-09T00:41:49.743214Z"},"links":{"citing_paper":"/paper/2502.03822"},"observation_digest":"sha256:f6ca6429e4a35846c105aa71f58be9981a8a2120a9aa8cb34451c26eef09a2be","observation_id":"e26e87ca-edc2-44d4-8028-a5f49f3f1ed3","resolution":{"observed_at":"2026-08-09T00:41:49.743214Z","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-09T00:41:50.623307Z","title":"Introduction to linear algebra","venue":null,"work_id":"7b7fbb0b-b50e-46ab-b106-f13e9020c9eb","year":2022},"citing_paper":{"arxiv_id":"2502.03822","last_updated":"2025-04-26T01:45:28Z","snapshot_observed_at":"2026-08-09T04:47:05.592842Z","submitted_at":"2025-02-06T07:18:04Z","title":"Dynamic Rank Adjustment in Diffusion Policies for Efficient and Flexible Training","version":3},"reference_index":39,"source":"pdf_text","source_observed_at":"2026-08-09T00:41:49.746550Z"},"links":{"citing_paper":"/paper/2502.03822"},"observation_digest":"sha256:7fc05ba2be2c14f6ba0b88fcce6058233a89ffae090483ace6d3c0dec912da24","observation_id":"85349d9d-ed46-4089-a662-9dd4dbcdb389","resolution":{"observed_at":"2026-08-09T00:41:50.626772Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2303.00638","last_updated":"2024-05-02T14:51:02Z","snapshot_observed_at":"2026-08-08T23:54:47.452165Z","submitted_at":"2023-03-01T16:40:54Z","title":"MEGA-DAgger: Imitation Learning with Multiple Imperfect Experts","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2303.00638","snapshot_observed_at":"2026-08-09T00:41:49.749754Z","title":"Mega-dagger: Imitation learn- ing with multiple imperfect experts","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2502.03822","last_updated":"2025-04-26T01:45:28Z","snapshot_observed_at":"2026-08-09T04:47:05.592842Z","submitted_at":"2025-02-06T07:18:04Z","title":"Dynamic Rank Adjustment in Diffusion Policies for Efficient and Flexible Training","version":3},"reference_index":40,"source":"pdf_text","source_observed_at":"2026-08-09T00:41:49.749754Z"},"links":{"cited_paper":"/paper/2303.00638","citing_paper":"/paper/2502.03822"},"observation_digest":"sha256:9dcdbbbb9b02573f136284cf32b3af9a3cc96f6dd3fa3fecca449ffb166bc36b","observation_id":"d300da6b-8b78-4a9a-ba07-3507c82bb517","resolution":{"observed_at":"2026-08-09T00:41:49.749754Z","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-09T00:41:50.613258Z","title":"A benchmark comparison of imitation learning-based control policies for autonomous racing","venue":null,"work_id":"ecf4c739-ec5a-48c5-adb2-56e2eaf6a343","year":2023},"citing_paper":{"arxiv_id":"2502.03822","last_updated":"2025-04-26T01:45:28Z","snapshot_observed_at":"2026-08-09T04:47:05.592842Z","submitted_at":"2025-02-06T07:18:04Z","title":"Dynamic Rank Adjustment in Diffusion Policies for Efficient and Flexible Training","version":3},"reference_index":41,"source":"pdf_text","source_observed_at":"2026-08-09T00:41:49.753090Z"},"links":{"citing_paper":"/paper/2502.03822"},"observation_digest":"sha256:a8c9444bdc85ea59e4c6c063d3e9bf9633b2faca891995b6bdd6e6a4e8dceac5","observation_id":"904048d8-e06e-4b7f-8628-ca1c2fcc0c11","resolution":{"observed_at":"2026-08-09T00:41:50.616850Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":"2409.14615","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-09T00:41:50.277027Z","title":"A comparative study on state-action spaces for learning viewpoint selection and manipulation with diffusion policy","venue":null,"work_id":"9222d814-56fb-4407-bb53-ae859694ce40","year":2024},"citing_paper":{"arxiv_id":"2502.03822","last_updated":"2025-04-26T01:45:28Z","snapshot_observed_at":"2026-08-09T04:47:05.592842Z","submitted_at":"2025-02-06T07:18:04Z","title":"Dynamic Rank Adjustment in Diffusion Policies for Efficient and Flexible Training","version":3},"reference_index":42,"source":"pdf_text","source_observed_at":"2026-08-09T00:41:49.756323Z"},"links":{"citing_paper":"/paper/2502.03822"},"observation_digest":"sha256:0842ba7a9fb7e15dc4f2176e209cd895076ebac42fa5d03dfb1614682a9a8b53","observation_id":"e0f6d258-edf9-410b-9f70-734e4d7e90d5","resolution":{"observed_at":"2026-08-09T00:41:50.282823Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2210.07558","last_updated":"2023-04-19T04:28:24Z","snapshot_observed_at":"2026-08-09T23:49:57.663991Z","submitted_at":"2022-10-14T06:29:22Z","title":"DyLoRA: Parameter Efficient Tuning of Pre-trained Models using Dynamic Search-Free Low-Rank Adaptation","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2210.07558","snapshot_observed_at":"2026-08-09T00:41:49.759637Z","title":"Dylora: Parameter efficient tuning of pre-trained models using dynamic search-free low-rank adaptation","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2502.03822","last_updated":"2025-04-26T01:45:28Z","snapshot_observed_at":"2026-08-09T04:47:05.592842Z","submitted_at":"2025-02-06T07:18:04Z","title":"Dynamic Rank Adjustment in Diffusion Policies for Efficient and Flexible Training","version":3},"reference_index":43,"source":"pdf_text","source_observed_at":"2026-08-09T00:41:49.759637Z"},"links":{"cited_paper":"/paper/2210.07558","citing_paper":"/paper/2502.03822"},"observation_digest":"sha256:2af0f1157994724090c5a457a2b90054e0d7c298e9031b606e263f88ef83a1ca","observation_id":"cc6d4192-1585-4329-8e33-b906f9b0926a","resolution":{"observed_at":"2026-08-09T00:41:49.759637Z","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-09T00:41:49.763301Z","title":"Attention is all you need","venue":null,"work_id":null,"year":2017},"citing_paper":{"arxiv_id":"2502.03822","last_updated":"2025-04-26T01:45:28Z","snapshot_observed_at":"2026-08-09T04:47:05.592842Z","submitted_at":"2025-02-06T07:18:04Z","title":"Dynamic Rank Adjustment in Diffusion Policies for Efficient and Flexible Training","version":3},"reference_index":44,"source":"pdf_text","source_observed_at":"2026-08-09T00:41:49.763301Z"},"links":{"citing_paper":"/paper/2502.03822"},"observation_digest":"sha256:0caca08bb784753a8a85d9e0b538427788c90070aa1dc224b88bf0b80574fef7","observation_id":"05d100ef-320c-4dfd-a406-116f993d8051","resolution":{"observed_at":"2026-08-09T00:41:49.763301Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2410.21257","last_updated":"2024-10-28T17:54:31Z","snapshot_observed_at":"2026-08-02T22:00:37.355909Z","submitted_at":"2024-10-28T17:54:31Z","title":"One-Step Diffusion Policy: Fast Visuomotor Policies via Diffusion Distillation","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2410.21257","snapshot_observed_at":"2026-08-09T00:41:49.766154Z","title":"One-step diffusion policy: Fast visuomotor policies via diffusion distillation","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2502.03822","last_updated":"2025-04-26T01:45:28Z","snapshot_observed_at":"2026-08-09T04:47:05.592842Z","submitted_at":"2025-02-06T07:18:04Z","title":"Dynamic Rank Adjustment in Diffusion Policies for Efficient and Flexible Training","version":3},"reference_index":45,"source":"pdf_text","source_observed_at":"2026-08-09T00:41:49.766154Z"},"links":{"cited_paper":"/paper/2410.21257","citing_paper":"/paper/2502.03822"},"observation_digest":"sha256:c36a327cfd6f7ae85eae83c5e08b259beb3e3794615782e083a1b326a1a4d363","observation_id":"56a84950-8155-45a2-b957-d171e9e2bf1b","resolution":{"observed_at":"2026-08-09T00:41:49.766154Z","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-09T00:41:50.597381Z","title":"Deep learning for optimization of trajectories for quadrotors","venue":null,"work_id":"7a9d28ab-f8ad-41c9-8ae9-28230f89a300","year":2024},"citing_paper":{"arxiv_id":"2502.03822","last_updated":"2025-04-26T01:45:28Z","snapshot_observed_at":"2026-08-09T04:47:05.592842Z","submitted_at":"2025-02-06T07:18:04Z","title":"Dynamic Rank Adjustment in Diffusion Policies for Efficient and Flexible Training","version":3},"reference_index":46,"source":"pdf_text","source_observed_at":"2026-08-09T00:41:49.769738Z"},"links":{"citing_paper":"/paper/2502.03822"},"observation_digest":"sha256:c98293541d1418a26393d2b73bb6982fbb9458b6e1a2ca8bcb7561a4ee80e423","observation_id":"fddc211a-5248-4ed6-8dca-5ee46c21fd02","resolution":{"observed_at":"2026-08-09T00:41:50.600980Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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-09T00:41:50.586343Z","title":"Trained rank pruning for efficient deep neural networks","venue":null,"work_id":"713444a9-deaf-4966-836c-81f64d693eb5","year":2019},"citing_paper":{"arxiv_id":"2502.03822","last_updated":"2025-04-26T01:45:28Z","snapshot_observed_at":"2026-08-09T04:47:05.592842Z","submitted_at":"2025-02-06T07:18:04Z","title":"Dynamic Rank Adjustment in Diffusion Policies for Efficient and Flexible Training","version":3},"reference_index":47,"source":"pdf_text","source_observed_at":"2026-08-09T00:41:49.772979Z"},"links":{"citing_paper":"/paper/2502.03822"},"observation_digest":"sha256:3f4b2a45d081047001cf1b814589eda2cd82e25ac5b7359e4140922734947fbd","observation_id":"f36807c8-9a5b-44a8-9ca2-1ea1d3932d05","resolution":{"observed_at":"2026-08-09T00:41:50.590526Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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-09T00:41:50.575430Z","title":"A survey of imitation learning: Al- gorithms, recent developments, and challenges","venue":null,"work_id":"6107ca23-ae53-4a5e-a377-fa415a67e23c","year":2024},"citing_paper":{"arxiv_id":"2502.03822","last_updated":"2025-04-26T01:45:28Z","snapshot_observed_at":"2026-08-09T04:47:05.592842Z","submitted_at":"2025-02-06T07:18:04Z","title":"Dynamic Rank Adjustment in Diffusion Policies for Efficient and Flexible Training","version":3},"reference_index":48,"source":"pdf_text","source_observed_at":"2026-08-09T00:41:49.776255Z"},"links":{"citing_paper":"/paper/2502.03822"},"observation_digest":"sha256:3a7776501e8f876f820f8718a81cc7a8b2a7b1f18ee5019f1ce887d0292aa538","observation_id":"5fd68848-74c3-4644-8f3a-e6437bae76c6","resolution":{"observed_at":"2026-08-09T00:41:50.579278Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-09T00:41:50.076985Z","title":"Kebria, Abbas Khosravi, and Saeid Nahavandi","venue":null,"work_id":"447efec4-e0ff-4b2a-8e9d-4701f74a2596","year":2024},"citing_paper":{"arxiv_id":"2502.03822","last_updated":"2025-04-26T01:45:28Z","snapshot_observed_at":"2026-08-09T04:47:05.592842Z","submitted_at":"2025-02-06T07:18:04Z","title":"Dynamic Rank Adjustment in Diffusion Policies for Efficient and Flexible Training","version":3},"reference_index":49,"source":"pdf_text","source_observed_at":"2026-08-09T00:41:49.779547Z"},"links":{"citing_paper":"/paper/2502.03822"},"observation_digest":"sha256:45f44d2aada6e1456dd201e9581c3a2276635e5c79632734b351deee71283d50","observation_id":"f827a317-06e1-4991-b53c-91a3898b2fab","resolution":{"observed_at":"2026-08-09T00:41:50.080852Z","resolver_source":"arxiv_id_nonexistent","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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-09T00:41:49.782684Z","title":"3d diffusion policy: Generalizable visuomotor policy learning via simple 3d representations","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2502.03822","last_updated":"2025-04-26T01:45:28Z","snapshot_observed_at":"2026-08-09T04:47:05.592842Z","submitted_at":"2025-02-06T07:18:04Z","title":"Dynamic Rank Adjustment in Diffusion Policies for Efficient and Flexible Training","version":3},"reference_index":50,"source":"pdf_text","source_observed_at":"2026-08-09T00:41:49.782684Z"},"links":{"citing_paper":"/paper/2502.03822"},"observation_digest":"sha256:1631aa797103b45b6ed2cf7f414cb26896f7727b18b63f4e81b9067502b2edc2","observation_id":"85bd96f0-5024-40f8-8e6f-e8aeae8cd658","resolution":{"observed_at":"2026-08-09T00:41:49.782684Z","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-09T00:41:50.557724Z","title":"Improving training efficiency of diffusion models via multi-stage framework and tailored multi-decoder architecture","venue":null,"work_id":"97f69dd3-3041-48b9-ad60-a25199eaa4a7","year":2024},"citing_paper":{"arxiv_id":"2502.03822","last_updated":"2025-04-26T01:45:28Z","snapshot_observed_at":"2026-08-09T04:47:05.592842Z","submitted_at":"2025-02-06T07:18:04Z","title":"Dynamic Rank Adjustment in Diffusion Policies for Efficient and Flexible Training","version":3},"reference_index":51,"source":"pdf_text","source_observed_at":"2026-08-09T00:41:49.785960Z"},"links":{"citing_paper":"/paper/2502.03822"},"observation_digest":"sha256:f2331d47d3ad2c4ad908c06bdc1e7ab7833bfd7335e3e6b52b319a8b27fc3abf","observation_id":"1b3c0844-10a8-4323-9ebd-473f9a1f38e6","resolution":{"observed_at":"2026-08-09T00:41:50.561910Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2402.17768","last_updated":"2024-06-05T17:33:56Z","snapshot_observed_at":"2026-07-06T17:36:23.851926Z","submitted_at":"2024-02-27T18:59:18Z","title":"Diffusion Meets DAgger: Supercharging Eye-in-hand Imitation Learning","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2402.17768","snapshot_observed_at":"2026-08-09T00:41:49.789257Z","title":"Diffusion meets dagger: Supercharg- ing eye-in-hand imitation learning","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2502.03822","last_updated":"2025-04-26T01:45:28Z","snapshot_observed_at":"2026-08-09T04:47:05.592842Z","submitted_at":"2025-02-06T07:18:04Z","title":"Dynamic Rank Adjustment in Diffusion Policies for Efficient and Flexible Training","version":3},"reference_index":52,"source":"pdf_text","source_observed_at":"2026-08-09T00:41:49.789257Z"},"links":{"cited_paper":"/paper/2402.17768","citing_paper":"/paper/2502.03822"},"observation_digest":"sha256:05678928c10da43b2c679723a7d3658f0b89033d8df6ffa5ee25e89b7688691f","observation_id":"a40e7afb-5965-4c60-a8b5-f2e53e816495","resolution":{"observed_at":"2026-08-09T00:41:49.789257Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2303.18223","last_updated":"2026-03-18T05:34:39Z","snapshot_observed_at":"2026-08-06T23:27:24.356320Z","submitted_at":"2023-03-31T17:28:46Z","title":"A Survey of Large Language Models","version":19},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2303.18223","snapshot_observed_at":"2026-08-09T00:41:49.792641Z","title":"A survey of large language models","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2502.03822","last_updated":"2025-04-26T01:45:28Z","snapshot_observed_at":"2026-08-09T04:47:05.592842Z","submitted_at":"2025-02-06T07:18:04Z","title":"Dynamic Rank Adjustment in Diffusion Policies for Efficient and Flexible Training","version":3},"reference_index":53,"source":"pdf_text","source_observed_at":"2026-08-09T00:41:49.792641Z"},"links":{"cited_paper":"/paper/2303.18223","citing_paper":"/paper/2502.03822"},"observation_digest":"sha256:9254861cc4cef0cc357cb79aa430a64c1e21fa24ca2c56f52a8d2f993fcb7966","observation_id":"be69a799-5176-4700-8aba-a2f97d06cb26","resolution":{"observed_at":"2026-08-09T00:41:49.792641Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2409.05289","last_updated":"2024-10-22T06:23:49Z","snapshot_observed_at":"2026-07-06T19:12:19.677411Z","submitted_at":"2024-09-09T02:54:24Z","title":"Developing Path Planning with Behavioral Cloning and Proximal Policy Optimization for Path-Tracking and Static Obstacle Nudging","version":3},"cited_work":{"arxiv_id":"2409.05289","doi":null,"metadata_source":"pith","pith_arxiv_id":"2409.05289","snapshot_observed_at":"2026-08-09T00:41:49.839810Z","title":"Developing Path Planning with Behavioral Cloning and Proximal Policy Optimization for Path-Tracking and Static Obstacle Nudging","venue":"cs.RO","work_id":"c99170c1-1896-4c6a-91b3-3a8a1baedf57","year":2024},"citing_paper":{"arxiv_id":"2502.03822","last_updated":"2025-04-26T01:45:28Z","snapshot_observed_at":"2026-08-09T04:47:05.592842Z","submitted_at":"2025-02-06T07:18:04Z","title":"Dynamic Rank Adjustment in Diffusion Policies for Efficient and Flexible Training","version":3},"reference_index":54,"source":"pdf_text","source_observed_at":"2026-08-09T00:41:49.795885Z"},"links":{"cited_paper":"/paper/2409.05289","citing_paper":"/paper/2502.03822"},"observation_digest":"sha256:5b5e9ad45bbeee162b2be1adedf1ebb4d50e0473bb8f764c2aa8dd654348a4ac","observation_id":"efce45ae-7e87-4b6e-97cd-c67f623e9c65","resolution":{"observed_at":"2026-08-09T00:41:49.845490Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2009.12293","last_updated":"2025-01-18T02:57:38Z","snapshot_observed_at":"2026-07-06T02:11:23.670680Z","submitted_at":"2020-09-25T15:32:31Z","title":"robosuite: A Modular Simulation Framework and Benchmark for Robot Learning","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2009.12293","snapshot_observed_at":"2026-08-09T00:41:49.799144Z","title":"robosuite: A modular simulation frame- work and benchmark for robot learning","venue":null,"work_id":null,"year":2009},"citing_paper":{"arxiv_id":"2502.03822","last_updated":"2025-04-26T01:45:28Z","snapshot_observed_at":"2026-08-09T04:47:05.592842Z","submitted_at":"2025-02-06T07:18:04Z","title":"Dynamic Rank Adjustment in Diffusion Policies for Efficient and Flexible Training","version":3},"reference_index":55,"source":"pdf_text","source_observed_at":"2026-08-09T00:41:49.799144Z"},"links":{"cited_paper":"/paper/2009.12293","citing_paper":"/paper/2502.03822"},"observation_digest":"sha256:d5c6495da8168e3d622f3c366a37d522e4a4e20d51384219c6e24354917f3e5e","observation_id":"7fb5f092-ef89-433f-8c5b-20d6d9bacb36","resolution":{"observed_at":"2026-08-09T00:41:49.799144Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"paper":{"arxiv_id":"2502.03822","last_updated":"2025-04-26T01:45:28Z","latest_version":3,"primary_category":"cs.RO","snapshot_observed_at":"2026-08-09T04:47:05.592842Z","submitted_at":"2025-02-06T07:18:04Z","title":"Dynamic Rank Adjustment in Diffusion Policies for Efficient and Flexible Training"},"reference_resolution":{"displayed":54,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":33,"verified_exact":3,"verified_fuzzy":18},"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-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"thesis":"As of 10 August 2026, this Paper Citation Record lists 54 of 54 outbound references and 2 inbound Pith citation observations for arXiv:2502.03822."}