{"as_of":"2026-08-09T05:43:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:38a9701989758c77c23b56a833b9df34c26d2e24b29b764ac7f3ebf73ad18bd6","coverage":[{"denominator":13,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":13,"source":"paper_references, paper_reference_links","source_observed_at":"2026-06-28T18:37:04.298448Z","state":"measured"},{"denominator":13,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":13,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-08T06:32:00.761636+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/2606.00730/citation-record","integrity":"/paper/2606.00730/integrity","json":"/paper/2606.00730/citation-record.json","paper":"/paper/2606.00730"},"outbound":[{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-06-28T18:37:04.298448Z","title":"2006 , publisher=","venue":null,"work_id":null,"year":2006},"citing_paper":{"arxiv_id":"2606.00730","last_updated":"2026-05-30T13:50:04Z","snapshot_observed_at":"2026-08-08T21:03:10.501752Z","submitted_at":"2026-05-30T13:50:04Z","title":"Infeasible optimization problems and the hierarchical augmented Lagrangian method in imitation learning","version":1},"reference_index":1,"source":"arxiv_source","source_observed_at":"2026-06-28T18:37:04.298448Z"},"links":{"citing_paper":"/paper/2606.00730"},"observation_digest":"sha256:6dbaa84b72bb6b7373398743236bbc2a84156b54367197258cfbc577acd5b82d","observation_id":"24b70429-fdf5-4457-b59e-458fc2b77b37","resolution":{"observed_at":"2026-06-28T18:37:04.298448Z","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-06-28T18:37:04.298448Z","title":"Journal of Convex Analysis , volume=","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2606.00730","last_updated":"2026-05-30T13:50:04Z","snapshot_observed_at":"2026-08-08T21:03:10.501752Z","submitted_at":"2026-05-30T13:50:04Z","title":"Infeasible optimization problems and the hierarchical augmented Lagrangian method in imitation learning","version":1},"reference_index":2,"source":"arxiv_source","source_observed_at":"2026-06-28T18:37:04.298448Z"},"links":{"citing_paper":"/paper/2606.00730"},"observation_digest":"sha256:18838002d5b493dbf8d795ebf0a68d947cd0e4fea3393c7763489ba016084055","observation_id":"ac5bc689-134e-4501-987f-d74df1aab622","resolution":{"observed_at":"2026-06-28T18:37:04.298448Z","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-06-28T18:37:04.298448Z","title":"2021 American Control Conference (ACC) , pages=","venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2606.00730","last_updated":"2026-05-30T13:50:04Z","snapshot_observed_at":"2026-08-08T21:03:10.501752Z","submitted_at":"2026-05-30T13:50:04Z","title":"Infeasible optimization problems and the hierarchical augmented Lagrangian method in imitation learning","version":1},"reference_index":3,"source":"arxiv_source","source_observed_at":"2026-06-28T18:37:04.298448Z"},"links":{"citing_paper":"/paper/2606.00730"},"observation_digest":"sha256:facf7bbb782a95427843055f344b5edf475f2bc3031a231d18d5114f512c4343","observation_id":"5da17abd-7f6c-4874-8437-7a3fa9b01203","resolution":{"observed_at":"2026-06-28T18:37:04.298448Z","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-06-28T18:37:04.298448Z","title":"IEEE Control Systems Letters , volume=","venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2606.00730","last_updated":"2026-05-30T13:50:04Z","snapshot_observed_at":"2026-08-08T21:03:10.501752Z","submitted_at":"2026-05-30T13:50:04Z","title":"Infeasible optimization problems and the hierarchical augmented Lagrangian method in imitation learning","version":1},"reference_index":4,"source":"arxiv_source","source_observed_at":"2026-06-28T18:37:04.298448Z"},"links":{"citing_paper":"/paper/2606.00730"},"observation_digest":"sha256:d5273fe341daf05e440806f68b48d92f5cb06296a58d1c12232b8d112d506dbb","observation_id":"541b3655-ad7d-4fc4-9b02-908e80d87584","resolution":{"observed_at":"2026-06-28T18:37:04.298448Z","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-06-28T18:37:04.298448Z","title":", author=","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2606.00730","last_updated":"2026-05-30T13:50:04Z","snapshot_observed_at":"2026-08-08T21:03:10.501752Z","submitted_at":"2026-05-30T13:50:04Z","title":"Infeasible optimization problems and the hierarchical augmented Lagrangian method in imitation learning","version":1},"reference_index":5,"source":"arxiv_source","source_observed_at":"2026-06-28T18:37:04.298448Z"},"links":{"citing_paper":"/paper/2606.00730"},"observation_digest":"sha256:20e37589c63ed2e8ca92c6698f659e21cdec21f4415fca0ec384de5ebc58f39f","observation_id":"14620c68-2838-46e6-ad54-b67071d8b436","resolution":{"observed_at":"2026-06-28T18:37:04.298448Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2103.00452","last_updated":"2021-03-12T15:57:04Z","snapshot_observed_at":"2026-08-03T13:12:36.903568Z","submitted_at":"2021-02-28T11:06:55Z","title":"EKMP: Generalized Imitation Learning with Adaptation, Nonlinear Hard Constraints and Obstacle Avoidance","version":2},"cited_work":{"arxiv_id":"2103.00452","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2103.00452","snapshot_observed_at":"2026-06-28T20:32:37.544673Z","title":"arXiv preprint arXiv:2103.00452 , year=","venue":null,"work_id":"30f0c846-c477-4f7d-9c11-42a4d834b3cc","year":null},"citing_paper":{"arxiv_id":"2606.00730","last_updated":"2026-05-30T13:50:04Z","snapshot_observed_at":"2026-08-08T21:03:10.501752Z","submitted_at":"2026-05-30T13:50:04Z","title":"Infeasible optimization problems and the hierarchical augmented Lagrangian method in imitation learning","version":1},"reference_index":6,"source":"arxiv_source","source_observed_at":"2026-06-28T18:37:04.298448Z"},"links":{"cited_paper":"/paper/2103.00452","citing_paper":"/paper/2606.00730"},"observation_digest":"sha256:ca62596d0edaa6f75c9879f6a7175faba48fc83785ef69bfcc50f56854fb4bca","observation_id":"466f06d9-53b4-4e6f-a7d9-3ba16e88726a","resolution":{"observed_at":"2026-06-28T20:32:37.546638Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+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-06-28T18:37:04.298448Z","title":"2022 IEEE 61st Conference on Decision and Control (CDC) , pages=","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2606.00730","last_updated":"2026-05-30T13:50:04Z","snapshot_observed_at":"2026-08-08T21:03:10.501752Z","submitted_at":"2026-05-30T13:50:04Z","title":"Infeasible optimization problems and the hierarchical augmented Lagrangian method in imitation learning","version":1},"reference_index":7,"source":"arxiv_source","source_observed_at":"2026-06-28T18:37:04.298448Z"},"links":{"citing_paper":"/paper/2606.00730"},"observation_digest":"sha256:7c3ab7876d9f84215d67dd8b80aebcc5ed1ae1349357d864904a83796c6e951c","observation_id":"3a3e3bde-e86c-4764-9f9a-b54054122568","resolution":{"observed_at":"2026-06-28T18:37:04.298448Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2210.11796","last_updated":"2023-08-28T09:00:50Z","snapshot_observed_at":"2026-07-06T14:08:37.178824Z","submitted_at":"2022-10-21T08:19:45Z","title":"Differentiable Constrained Imitation Learning for Robot Motion Planning and Control","version":2},"cited_work":{"arxiv_id":"2210.11796","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2210.11796","snapshot_observed_at":"2026-06-28T20:32:37.540113Z","title":"arXiv preprint arXiv:2210.11796 , year=","venue":null,"work_id":"799be658-176a-4abc-9baf-1ec336ee039d","year":null},"citing_paper":{"arxiv_id":"2606.00730","last_updated":"2026-05-30T13:50:04Z","snapshot_observed_at":"2026-08-08T21:03:10.501752Z","submitted_at":"2026-05-30T13:50:04Z","title":"Infeasible optimization problems and the hierarchical augmented Lagrangian method in imitation learning","version":1},"reference_index":8,"source":"arxiv_source","source_observed_at":"2026-06-28T18:37:04.298448Z"},"links":{"cited_paper":"/paper/2210.11796","citing_paper":"/paper/2606.00730"},"observation_digest":"sha256:940bb04bd8cbc06df5a438861395bd574b1b445781decc6073f2da06a808bf65","observation_id":"07f4b88c-61f9-4115-8f3f-89b0f25306e5","resolution":{"observed_at":"2026-06-28T20:32:37.541793Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+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-06-28T18:37:04.298448Z","title":"Mathematical Programming , volume=","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2606.00730","last_updated":"2026-05-30T13:50:04Z","snapshot_observed_at":"2026-08-08T21:03:10.501752Z","submitted_at":"2026-05-30T13:50:04Z","title":"Infeasible optimization problems and the hierarchical augmented Lagrangian method in imitation learning","version":1},"reference_index":9,"source":"arxiv_source","source_observed_at":"2026-06-28T18:37:04.298448Z"},"links":{"citing_paper":"/paper/2606.00730"},"observation_digest":"sha256:ac0f1c1ad6a8f5d07ec79c0860753a0bae1fde298a88386e1e46a59a9a4aaafa","observation_id":"71598e03-c2d6-421e-aba2-83003b5f1dde","resolution":{"observed_at":"2026-06-28T18:37:04.298448Z","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-06-28T18:37:04.298448Z","title":"Proceedings of the 2024 ACM/IEEE International Conference on Human-Robot Interaction , pages=","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2606.00730","last_updated":"2026-05-30T13:50:04Z","snapshot_observed_at":"2026-08-08T21:03:10.501752Z","submitted_at":"2026-05-30T13:50:04Z","title":"Infeasible optimization problems and the hierarchical augmented Lagrangian method in imitation learning","version":1},"reference_index":10,"source":"arxiv_source","source_observed_at":"2026-06-28T18:37:04.298448Z"},"links":{"citing_paper":"/paper/2606.00730"},"observation_digest":"sha256:8365cb4a8eca6e31a2b35d54282b600cab954f47cfa578a24ede92e14cd34a40","observation_id":"af543dbc-4695-433c-a8ce-66e79cb37a63","resolution":{"observed_at":"2026-06-28T18:37:04.298448Z","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":"2506.22428","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-28T20:32:37.541370Z","title":"arXiv preprint arXiv:2506.22428 , year=","venue":null,"work_id":"3ad78aa0-0c25-4d8d-88aa-d1b013d26a0f","year":null},"citing_paper":{"arxiv_id":"2606.00730","last_updated":"2026-05-30T13:50:04Z","snapshot_observed_at":"2026-08-08T21:03:10.501752Z","submitted_at":"2026-05-30T13:50:04Z","title":"Infeasible optimization problems and the hierarchical augmented Lagrangian method in imitation learning","version":1},"reference_index":11,"source":"arxiv_source","source_observed_at":"2026-06-28T18:37:04.298448Z"},"links":{"citing_paper":"/paper/2606.00730"},"observation_digest":"sha256:4ee5be3d596f683b2f8d86f453c5fe216c4f3bd1e749d335212f2bd9decbb0d3","observation_id":"b9083829-4d26-466c-a76b-3198aca2f0da","resolution":{"observed_at":"2026-06-28T20:32:37.543427Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+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-06-28T18:37:04.298448Z","title":"2025 IEEE International Conference on Robotics and Automation (ICRA) , pages=","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2606.00730","last_updated":"2026-05-30T13:50:04Z","snapshot_observed_at":"2026-08-08T21:03:10.501752Z","submitted_at":"2026-05-30T13:50:04Z","title":"Infeasible optimization problems and the hierarchical augmented Lagrangian method in imitation learning","version":1},"reference_index":12,"source":"arxiv_source","source_observed_at":"2026-06-28T18:37:04.298448Z"},"links":{"citing_paper":"/paper/2606.00730"},"observation_digest":"sha256:0a3f9f5b529fe2279e536b92f0087a99ded7692981a41f30409a789b13d15b5d","observation_id":"cd4f77e2-8c3c-4846-8dfc-6b4ad42ee77e","resolution":{"observed_at":"2026-06-28T18:37:04.298448Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2508.03129","last_updated":"2025-08-05T06:21:23Z","snapshot_observed_at":"2026-08-06T04:40:39.749164Z","submitted_at":"2025-08-05T06:21:23Z","title":"Safety-Aware Imitation Learning via MPC-Guided Disturbance Injection","version":1},"cited_work":{"arxiv_id":"2508.03129","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2508.03129","snapshot_observed_at":"2026-06-28T20:32:37.533073Z","title":"arXiv preprint arXiv:2508.03129 , year=","venue":null,"work_id":"599a513f-8392-41a7-9120-06d0e956ca7d","year":null},"citing_paper":{"arxiv_id":"2606.00730","last_updated":"2026-05-30T13:50:04Z","snapshot_observed_at":"2026-08-08T21:03:10.501752Z","submitted_at":"2026-05-30T13:50:04Z","title":"Infeasible optimization problems and the hierarchical augmented Lagrangian method in imitation learning","version":1},"reference_index":13,"source":"arxiv_source","source_observed_at":"2026-06-28T18:37:04.298448Z"},"links":{"cited_paper":"/paper/2508.03129","citing_paper":"/paper/2606.00730"},"observation_digest":"sha256:c4c26092148d083db3e76dc4c86d85d195fcedce73e7061cb14bdd73ce65516d","observation_id":"2cbb3eb3-cfb3-41fd-9b22-3fddc56162e2","resolution":{"observed_at":"2026-06-28T20:32:37.535797Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}}],"paper":{"arxiv_id":"2606.00730","last_updated":"2026-05-30T13:50:04Z","latest_version":1,"primary_category":"cs.RO","snapshot_observed_at":"2026-08-08T21:03:10.501752Z","submitted_at":"2026-05-30T13:50:04Z","title":"Infeasible optimization problems and the hierarchical augmented Lagrangian method in imitation learning"},"reference_resolution":{"displayed":13,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":9,"verified_exact":4,"verified_fuzzy":0},"total_outbound_references":13},"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-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"thesis":"As of 9 August 2026, this Paper Citation Record lists 13 of 13 outbound references and 0 inbound Pith citation observations for arXiv:2606.00730."}