{"as_of":"2026-08-08T07:41:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:45598c1e8c47596ba91b51bb502e7557725b4f5607bde7e64172b3587b4dda4e","coverage":[{"denominator":66,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":66,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-08T00:02:02.712285Z","state":"measured"},{"denominator":70,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":70,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-08T06:32:00.761636+00:00","state":"measured"},{"denominator":4,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":4,"source":"paper_references, paper_reference_links","source_observed_at":"2026-06-29T16:45:44.659577Z","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-02T17:27:14.845260Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2502.08697","last_updated":"2025-05-11T15:19:44Z","snapshot_observed_at":"2026-08-08T00:26:41.001589Z","submitted_at":"2025-02-12T18:59:56Z","title":"Bilevel Learning for Bilevel Planning","version":3},"cited_work":{"arxiv_id":"2502.08697","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2502.08697","snapshot_observed_at":"2026-07-02T17:27:14.845260Z","title":"Bilevel learning for bilevel planning","venue":null,"work_id":"5d9f708e-2e88-4a1c-a99b-442b8235817a","year":2025},"citing_paper":{"arxiv_id":"2603.25903","last_updated":"2026-04-16T00:09:18Z","snapshot_observed_at":"2026-07-06T22:50:41.736941Z","submitted_at":"2026-03-26T20:50:36Z","title":"Emergent Neural Automaton Policies: Learning Symbolic Structure from Visuomotor Trajectories","version":2},"reference_index":28,"source":"pdf_text","source_observed_at":"2026-05-15T00:08:16.186576Z"},"links":{"cited_paper":"/paper/2502.08697","citing_paper":"/paper/2603.25903"},"observation_digest":"sha256:66631e47e01744e9ac14157f7b6e5e122dce4210d3465eacf254a12d8dd5912a","observation_id":"85f9aea1-a2d2-4b68-a08e-1230a856a198","resolution":{"observed_at":"2026-05-15T00:08:21.427216Z","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":{"arxiv_id":"2502.08697","last_updated":"2025-05-11T15:19:44Z","snapshot_observed_at":"2026-08-08T00:26:41.001589Z","submitted_at":"2025-02-12T18:59:56Z","title":"Bilevel Learning for Bilevel Planning","version":3},"cited_work":{"arxiv_id":"2502.08697","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2502.08697","snapshot_observed_at":"2026-07-02T17:27:14.845260Z","title":"Bilevel learning for bilevel planning","venue":null,"work_id":"5d9f708e-2e88-4a1c-a99b-442b8235817a","year":2025},"citing_paper":{"arxiv_id":"2604.08846","last_updated":"2026-04-10T01:01:56Z","snapshot_observed_at":"2026-08-02T14:54:38.934183Z","submitted_at":"2026-04-10T01:01:56Z","title":"Dictionary-Aligned Concept Control for Safeguarding Multimodal LLMs","version":1},"reference_index":38,"source":"pdf_text","source_observed_at":"2026-05-10T18:04:05.157103Z"},"links":{"cited_paper":"/paper/2502.08697","citing_paper":"/paper/2604.08846"},"observation_digest":"sha256:82aac950a4cae33fc2197a5afb3cfe7044ae4067192dbf9cf333a591fe7d8aee","observation_id":"268a69ea-c732-49c7-a9d4-d401610b4903","resolution":{"observed_at":"2026-05-11T05:35:57.417210Z","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":{"arxiv_id":"2502.08697","last_updated":"2025-05-11T15:19:44Z","snapshot_observed_at":"2026-08-08T00:26:41.001589Z","submitted_at":"2025-02-12T18:59:56Z","title":"Bilevel Learning for Bilevel Planning","version":3},"cited_work":{"arxiv_id":"2502.08697","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2502.08697","snapshot_observed_at":"2026-07-02T17:27:14.845260Z","title":"Bilevel learning for bilevel planning","venue":null,"work_id":"5d9f708e-2e88-4a1c-a99b-442b8235817a","year":2025},"citing_paper":{"arxiv_id":"2605.26828","last_updated":"2026-05-26T10:45:29Z","snapshot_observed_at":"2026-08-05T23:16:42.290152Z","submitted_at":"2026-05-26T10:45:29Z","title":"Learning Compositional Symbolic Task Rules from Demonstrations with Inductive Logic Programming","version":1},"reference_index":1,"source":"pdf_text","source_observed_at":"2026-06-29T16:45:44.659577Z"},"links":{"cited_paper":"/paper/2502.08697","citing_paper":"/paper/2605.26828"},"observation_digest":"sha256:19f10f08a0d577db9c86e596cd04763cc66bb4b65bec8f46d6f4b3856691acb7","observation_id":"ed6e7735-852e-4f3e-a9d4-68d2d292925e","resolution":{"observed_at":"2026-06-29T16:53:41.325972Z","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":{"arxiv_id":"2502.08697","last_updated":"2025-05-11T15:19:44Z","snapshot_observed_at":"2026-08-08T00:26:41.001589Z","submitted_at":"2025-02-12T18:59:56Z","title":"Bilevel Learning for Bilevel Planning","version":3},"cited_work":{"arxiv_id":"2502.08697","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2502.08697","snapshot_observed_at":"2026-07-02T17:27:14.845260Z","title":"Bilevel learning for bilevel planning","venue":null,"work_id":"5d9f708e-2e88-4a1c-a99b-442b8235817a","year":2025},"citing_paper":{"arxiv_id":"2606.06877","last_updated":"2026-06-05T03:44:48Z","snapshot_observed_at":"2026-08-04T20:13:04.967435Z","submitted_at":"2026-06-05T03:44:48Z","title":"Neuro-Symbolic Learning for Long-Horizon Task Planning Under Complex Logical Constraints","version":1},"reference_index":35,"source":"pdf_text","source_observed_at":"2026-06-27T22:04:01.280390Z"},"links":{"cited_paper":"/paper/2502.08697","citing_paper":"/paper/2606.06877"},"observation_digest":"sha256:94e5281c12c7f92a9fe457cc1c156c23ab46bfec5ec22bd2c33738dc7f339a54","observation_id":"9f2311c5-76f7-49f2-92e2-cf25cb7c8283","resolution":{"observed_at":"2026-07-02T17:27:14.847930Z","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"}}],"links":{"evidence":"/evidence","html":"/paper/2502.08697/citation-record","integrity":"/paper/2502.08697/integrity","json":"/paper/2502.08697/citation-record.json","paper":"/paper/2502.08697"},"outbound":[{"citation":{"cited_paper":{"arxiv_id":"2310.17596","last_updated":"2023-10-26T17:17:31Z","snapshot_observed_at":"2026-07-06T02:11:23.670680Z","submitted_at":"2023-10-26T17:17:31Z","title":"MimicGen: A Data Generation System for Scalable Robot Learning using Human Demonstrations","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2310.17596","snapshot_observed_at":"2026-08-08T00:02:01.959293Z","title":"Mimicgen: A data generation system for scalable robot learning using human demonstrations","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2502.08697","last_updated":"2025-05-11T15:19:44Z","snapshot_observed_at":"2026-08-08T00:26:41.001589Z","submitted_at":"2025-02-12T18:59:56Z","title":"Bilevel Learning for Bilevel Planning","version":3},"reference_index":1,"source":"pdf_text","source_observed_at":"2026-08-08T00:02:01.959293Z"},"links":{"cited_paper":"/paper/2310.17596","citing_paper":"/paper/2502.08697"},"observation_digest":"sha256:fe6e8baeebb2255164473b1ea178083e39a2983230b46ef0903aecc810c8e1b5","observation_id":"0326365a-0a89-434e-9077-758fb111fa85","resolution":{"observed_at":"2026-08-08T00:02:01.959293Z","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-08T00:02:04.035237Z","title":"Dif- fusion policy: Visuomotor policy learning via action diffusion","venue":null,"work_id":"b1b14d3b-0162-4855-aad7-1cdbcc8192f2","year":2023},"citing_paper":{"arxiv_id":"2502.08697","last_updated":"2025-05-11T15:19:44Z","snapshot_observed_at":"2026-08-08T00:26:41.001589Z","submitted_at":"2025-02-12T18:59:56Z","title":"Bilevel Learning for Bilevel Planning","version":3},"reference_index":2,"source":"pdf_text","source_observed_at":"2026-08-08T00:02:01.965218Z"},"links":{"citing_paper":"/paper/2502.08697"},"observation_digest":"sha256:428ab7c915536356b3fe316855871e932feff73a18a1664603535e1d21d75397","observation_id":"31b0a8b4-803e-4b6b-9a18-472fadb02788","resolution":{"observed_at":"2026-08-08T00:02:04.039975Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-08T00:02:04.019559Z","title":"Learning fine-grained bimanual manipulation with low-cost hardware","venue":null,"work_id":"ab38b9bf-a495-40c4-8e84-db0a0f2805c4","year":2023},"citing_paper":{"arxiv_id":"2502.08697","last_updated":"2025-05-11T15:19:44Z","snapshot_observed_at":"2026-08-08T00:26:41.001589Z","submitted_at":"2025-02-12T18:59:56Z","title":"Bilevel Learning for Bilevel Planning","version":3},"reference_index":3,"source":"pdf_text","source_observed_at":"2026-08-08T00:02:01.970154Z"},"links":{"citing_paper":"/paper/2502.08697"},"observation_digest":"sha256:18616535d9501c7737ef288678383c7116082f0af667ef93e50ddefcf53eaeb8","observation_id":"7df9b183-4647-4e4f-977e-30befc5ea49d","resolution":{"observed_at":"2026-08-08T00:02:04.024618Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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":{"arxiv_id":"2407.01812","last_updated":"2024-10-15T14:50:29Z","snapshot_observed_at":"2026-08-03T18:37:18.872911Z","submitted_at":"2024-07-01T21:23:26Z","title":"Equivariant Diffusion Policy","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2407.01812","snapshot_observed_at":"2026-08-08T00:02:01.974683Z","title":"Equivariant diffusion policy","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2502.08697","last_updated":"2025-05-11T15:19:44Z","snapshot_observed_at":"2026-08-08T00:26:41.001589Z","submitted_at":"2025-02-12T18:59:56Z","title":"Bilevel Learning for Bilevel Planning","version":3},"reference_index":4,"source":"pdf_text","source_observed_at":"2026-08-08T00:02:01.974683Z"},"links":{"cited_paper":"/paper/2407.01812","citing_paper":"/paper/2502.08697"},"observation_digest":"sha256:ca6f671f967a01cf73cde5ef7557cb81d051b07ea6acb21f46ab0c766eab8d7e","observation_id":"4567d14a-51e1-49f5-8ae3-75f869a276fe","resolution":{"observed_at":"2026-08-08T00:02:01.974683Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2407.01479","last_updated":"2024-10-29T17:49:41Z","snapshot_observed_at":"2026-07-06T18:39:43.472708Z","submitted_at":"2024-07-01T17:09:43Z","title":"EquiBot: SIM(3)-Equivariant Diffusion Policy for Generalizable and Data Efficient Learning","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2407.01479","snapshot_observed_at":"2026-08-08T00:02:01.979758Z","title":"Equibot: Sim (3)-equivariant diffusion policy for generalizable and data efficient learning","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2502.08697","last_updated":"2025-05-11T15:19:44Z","snapshot_observed_at":"2026-08-08T00:26:41.001589Z","submitted_at":"2025-02-12T18:59:56Z","title":"Bilevel Learning for Bilevel Planning","version":3},"reference_index":5,"source":"pdf_text","source_observed_at":"2026-08-08T00:02:01.979758Z"},"links":{"cited_paper":"/paper/2407.01479","citing_paper":"/paper/2502.08697"},"observation_digest":"sha256:918fa1e980ed7509897f3432835908f9ac5e4011ef3ecacb43b393da484dc049","observation_id":"716a7269-828e-47a6-98d8-8ed082127130","resolution":{"observed_at":"2026-08-08T00:02:01.979758Z","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-08T00:02:04.004764Z","title":"What Planning Problems Can A Relational Neural Network Solve? In Proceedings of the Advances in Neural Information Processing Systems (NeurIPS), volume 36, 2024","venue":null,"work_id":"c02e957d-b329-49a3-913f-cec732036d80","year":2024},"citing_paper":{"arxiv_id":"2502.08697","last_updated":"2025-05-11T15:19:44Z","snapshot_observed_at":"2026-08-08T00:26:41.001589Z","submitted_at":"2025-02-12T18:59:56Z","title":"Bilevel Learning for Bilevel Planning","version":3},"reference_index":6,"source":"pdf_text","source_observed_at":"2026-08-08T00:02:01.984975Z"},"links":{"citing_paper":"/paper/2502.08697"},"observation_digest":"sha256:87498b5ee74ca64cf774ee0628f29e6d873856f3714da3de35c74a651e9f31f1","observation_id":"df035090-0b92-49dd-ba8e-8073ee00bba2","resolution":{"observed_at":"2026-08-08T00:02:04.009768Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-08T00:02:03.989839Z","title":"LogiCity: Advancing Neuro-Symbolic AI with Abstract Urban Simulation","venue":null,"work_id":"9cede512-7624-4673-b0f1-cf2a834943b0","year":2024},"citing_paper":{"arxiv_id":"2502.08697","last_updated":"2025-05-11T15:19:44Z","snapshot_observed_at":"2026-08-08T00:26:41.001589Z","submitted_at":"2025-02-12T18:59:56Z","title":"Bilevel Learning for Bilevel Planning","version":3},"reference_index":7,"source":"pdf_text","source_observed_at":"2026-08-08T00:02:01.989400Z"},"links":{"citing_paper":"/paper/2502.08697"},"observation_digest":"sha256:77e958b02626128c054213c4350703ca9a577fa648569b0a4132b0a86e4c0a46","observation_id":"4d5e351d-b84b-45a7-88a9-36d879d980c7","resolution":{"observed_at":"2026-08-08T00:02:03.994572Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-08T00:02:03.974717Z","title":"Towards a unified theory of state abstraction for mdps","venue":null,"work_id":"9ad397b0-308f-4ceb-a7e0-deb4df4f7ada","year":2006},"citing_paper":{"arxiv_id":"2502.08697","last_updated":"2025-05-11T15:19:44Z","snapshot_observed_at":"2026-08-08T00:26:41.001589Z","submitted_at":"2025-02-12T18:59:56Z","title":"Bilevel Learning for Bilevel Planning","version":3},"reference_index":8,"source":"pdf_text","source_observed_at":"2026-08-08T00:02:01.994164Z"},"links":{"citing_paper":"/paper/2502.08697"},"observation_digest":"sha256:8087a6d2e7cad64447f1346e2190ad007463a0a3318bbca5c846b621167426cb","observation_id":"80f51088-a42f-4096-a682-0872851c023d","resolution":{"observed_at":"2026-08-08T00:02:03.979600Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-08T00:02:03.960025Z","title":"State abstractions for lifelong reinforce- ment learning","venue":null,"work_id":"f78c6ff1-0cd5-4434-9248-e772cdc04c00","year":2018},"citing_paper":{"arxiv_id":"2502.08697","last_updated":"2025-05-11T15:19:44Z","snapshot_observed_at":"2026-08-08T00:26:41.001589Z","submitted_at":"2025-02-12T18:59:56Z","title":"Bilevel Learning for Bilevel Planning","version":3},"reference_index":9,"source":"pdf_text","source_observed_at":"2026-08-08T00:02:01.998227Z"},"links":{"citing_paper":"/paper/2502.08697"},"observation_digest":"sha256:9c24cfd3f49927ee27f57a9c552cf8ae53cc0d4d8479282da6cafcdc9ba1886a","observation_id":"5540c254-5698-4e82-aaea-1e18e3513c62","resolution":{"observed_at":"2026-08-08T00:02:03.964999Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-08T00:02:03.945273Z","title":"From skills to symbols: Learning symbolic representations for abstract high-level planning","venue":null,"work_id":"25426d67-db58-40a9-9a28-9b6700c7538f","year":2018},"citing_paper":{"arxiv_id":"2502.08697","last_updated":"2025-05-11T15:19:44Z","snapshot_observed_at":"2026-08-08T00:26:41.001589Z","submitted_at":"2025-02-12T18:59:56Z","title":"Bilevel Learning for Bilevel Planning","version":3},"reference_index":10,"source":"pdf_text","source_observed_at":"2026-08-08T00:02:02.002165Z"},"links":{"citing_paper":"/paper/2502.08697"},"observation_digest":"sha256:636a9977482cd8d2c76a2d0c3eee55c4f6e7e91d98fe78d4ce608aafde237585","observation_id":"99c1452d-d3ad-4fac-afbe-d4afbab2e437","resolution":{"observed_at":"2026-08-08T00:02:03.950414Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-08T00:02:03.930430Z","title":"Learning Grounded Action Abstrac- tions From Language","venue":null,"work_id":"81262326-d9eb-442a-a9da-8111ff5200d0","year":2024},"citing_paper":{"arxiv_id":"2502.08697","last_updated":"2025-05-11T15:19:44Z","snapshot_observed_at":"2026-08-08T00:26:41.001589Z","submitted_at":"2025-02-12T18:59:56Z","title":"Bilevel Learning for Bilevel Planning","version":3},"reference_index":11,"source":"pdf_text","source_observed_at":"2026-08-08T00:02:02.006186Z"},"links":{"citing_paper":"/paper/2502.08697"},"observation_digest":"sha256:f0a9beeea9b3eda697653d55b8a157736ffe7cbacb844cfc7e9d579844fdf5aa","observation_id":"264217f9-0841-4f20-97f3-303dfdf38e82","resolution":{"observed_at":"2026-08-08T00:02:03.935398Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-08T00:02:03.915678Z","title":"Discovering State And Action Abstractions For Generalized Task And Motion Planning","venue":null,"work_id":"c58592af-0472-46f0-b27e-3b19b811eb58","year":2022},"citing_paper":{"arxiv_id":"2502.08697","last_updated":"2025-05-11T15:19:44Z","snapshot_observed_at":"2026-08-08T00:26:41.001589Z","submitted_at":"2025-02-12T18:59:56Z","title":"Bilevel Learning for Bilevel Planning","version":3},"reference_index":12,"source":"pdf_text","source_observed_at":"2026-08-08T00:02:02.011497Z"},"links":{"citing_paper":"/paper/2502.08697"},"observation_digest":"sha256:053ab7cbed22c9cc4709c76d997a939f3cc6bb72b9c2659d8bf9349b2120efdc","observation_id":"744425cc-9f97-4f3b-8ee4-c2b27b790073","resolution":{"observed_at":"2026-08-08T00:02:03.920498Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-08T00:02:03.900761Z","title":"Guiding Long-Horizon Task and Motion Planning with Vision Language Models, 2024","venue":null,"work_id":"44caa515-fbe5-467e-bb8a-cef694be84f8","year":2024},"citing_paper":{"arxiv_id":"2502.08697","last_updated":"2025-05-11T15:19:44Z","snapshot_observed_at":"2026-08-08T00:26:41.001589Z","submitted_at":"2025-02-12T18:59:56Z","title":"Bilevel Learning for Bilevel Planning","version":3},"reference_index":13,"source":"pdf_text","source_observed_at":"2026-08-08T00:02:02.016532Z"},"links":{"citing_paper":"/paper/2502.08697"},"observation_digest":"sha256:2c85e9f314dd9ddea6c4dc284b93fbfb5981d8ca13c53b002e44ee468250b43f","observation_id":"97c8481f-b937-4ffa-a03a-86b22b2c4401","resolution":{"observed_at":"2026-08-08T00:02:03.905829Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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-08-08T00:02:02.021533Z","title":"From Reals to Logic and Back: Inventing Symbolic V ocabularies, Actions and Models for Planning from Raw Data","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2502.08697","last_updated":"2025-05-11T15:19:44Z","snapshot_observed_at":"2026-08-08T00:26:41.001589Z","submitted_at":"2025-02-12T18:59:56Z","title":"Bilevel Learning for Bilevel Planning","version":3},"reference_index":14,"source":"pdf_text","source_observed_at":"2026-08-08T00:02:02.021533Z"},"links":{"citing_paper":"/paper/2502.08697"},"observation_digest":"sha256:36901f9036dd28239836b0dfc89461efefe0aa43cd2fc7ccceba9fe062f9c4fc","observation_id":"b5b160d9-2c7e-4cc9-b265-91b864b06b5f","resolution":{"observed_at":"2026-08-08T00:02:02.021533Z","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-08T00:02:03.885849Z","title":"Learning Symbolic Operators for Task and Motion Planning","venue":null,"work_id":"e9580492-f263-4de0-8503-2f5791749c56","year":2021},"citing_paper":{"arxiv_id":"2502.08697","last_updated":"2025-05-11T15:19:44Z","snapshot_observed_at":"2026-08-08T00:26:41.001589Z","submitted_at":"2025-02-12T18:59:56Z","title":"Bilevel Learning for Bilevel Planning","version":3},"reference_index":15,"source":"pdf_text","source_observed_at":"2026-08-08T00:02:02.026018Z"},"links":{"citing_paper":"/paper/2502.08697"},"observation_digest":"sha256:9980c94f23cf09a7c7134505d4cf8e2807a488152f396d25e9c92c9179b81c3c","observation_id":"dc5fbc7a-0d1e-4059-bbe0-4f0e7be9513e","resolution":{"observed_at":"2026-08-08T00:02:03.890708Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-08T00:02:03.871370Z","title":"Tenenbaum, Tom´as Lozano-P´erez, and Leslie Pack Kaelbling","venue":null,"work_id":"41a3d949-c048-4339-8d50-345b42f88714","year":2022},"citing_paper":{"arxiv_id":"2502.08697","last_updated":"2025-05-11T15:19:44Z","snapshot_observed_at":"2026-08-08T00:26:41.001589Z","submitted_at":"2025-02-12T18:59:56Z","title":"Bilevel Learning for Bilevel Planning","version":3},"reference_index":16,"source":"pdf_text","source_observed_at":"2026-08-08T00:02:02.030446Z"},"links":{"citing_paper":"/paper/2502.08697"},"observation_digest":"sha256:59bfda48767a9f07ea5c31d4a46d4d18d4e5abbefe5f2810ca5c0d17e0849162","observation_id":"c1da0b19-3b57-4001-a4e9-d29233096ce3","resolution":{"observed_at":"2026-08-08T00:02:03.875999Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-08T00:02:03.856535Z","title":"Predicate Invention for Bilevel Planning","venue":null,"work_id":"0a302f51-e339-4e96-9db0-46b185662303","year":2023},"citing_paper":{"arxiv_id":"2502.08697","last_updated":"2025-05-11T15:19:44Z","snapshot_observed_at":"2026-08-08T00:26:41.001589Z","submitted_at":"2025-02-12T18:59:56Z","title":"Bilevel Learning for Bilevel Planning","version":3},"reference_index":17,"source":"pdf_text","source_observed_at":"2026-08-08T00:02:02.035298Z"},"links":{"citing_paper":"/paper/2502.08697"},"observation_digest":"sha256:a3142a4291ee3e5a556be33e35e17ffa4283fe0f4e8afbb55062d381b40dfb84","observation_id":"8e3bd6a3-d139-462b-9a8c-2bbafcbec695","resolution":{"observed_at":"2026-08-08T00:02:03.861351Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-08T00:02:03.842507Z","title":"GLIB: Efficient Exploration for Relational Model-Based Rein- forcement Learning via Goal-Literal Babbling","venue":null,"work_id":"5ea1765b-d3c4-4110-8530-4dc55c0fda57","year":2021},"citing_paper":{"arxiv_id":"2502.08697","last_updated":"2025-05-11T15:19:44Z","snapshot_observed_at":"2026-08-08T00:26:41.001589Z","submitted_at":"2025-02-12T18:59:56Z","title":"Bilevel Learning for Bilevel Planning","version":3},"reference_index":18,"source":"pdf_text","source_observed_at":"2026-08-08T00:02:02.040016Z"},"links":{"citing_paper":"/paper/2502.08697"},"observation_digest":"sha256:1343c972340987ac7c14a188d8f04a0b990976d49232bd80f43219efc8a192fa","observation_id":"541f9a5b-403b-4fbe-a2b1-7881cb7d6777","resolution":{"observed_at":"2026-08-08T00:02:03.846961Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-08T00:02:03.827982Z","title":"Practice Makes Perfect: Planning To Learn Skill Parameter Policies","venue":null,"work_id":"45b0c578-bb79-461e-9bf2-ff021d463e40","year":2024},"citing_paper":{"arxiv_id":"2502.08697","last_updated":"2025-05-11T15:19:44Z","snapshot_observed_at":"2026-08-08T00:26:41.001589Z","submitted_at":"2025-02-12T18:59:56Z","title":"Bilevel Learning for Bilevel Planning","version":3},"reference_index":19,"source":"pdf_text","source_observed_at":"2026-08-08T00:02:02.061495Z"},"links":{"citing_paper":"/paper/2502.08697"},"observation_digest":"sha256:11dbbec556670b9673f445ab7fb7918edcfc88eedc6eee38704f1bc4ae7f834e","observation_id":"70ba1a4c-6702-4eeb-9b7c-ed56d64a698a","resolution":{"observed_at":"2026-08-08T00:02:03.832933Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-08T00:02:03.813311Z","title":"Learning Efficient Abstract Planning Models That Choose What to Predict","venue":null,"work_id":"35d41900-2ec9-4d72-a182-17a815625cf7","year":2023},"citing_paper":{"arxiv_id":"2502.08697","last_updated":"2025-05-11T15:19:44Z","snapshot_observed_at":"2026-08-08T00:26:41.001589Z","submitted_at":"2025-02-12T18:59:56Z","title":"Bilevel Learning for Bilevel Planning","version":3},"reference_index":20,"source":"pdf_text","source_observed_at":"2026-08-08T00:02:02.095939Z"},"links":{"citing_paper":"/paper/2502.08697"},"observation_digest":"sha256:14282eef9e05c720f5c6b6b5aa2a63939637c4a8155000a0236b668434faa04a","observation_id":"303dba06-a92d-4d7a-8a53-eea8ed85deba","resolution":{"observed_at":"2026-08-08T00:02:03.818007Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-08T00:02:03.798750Z","title":"VisualPredicator: Learning Abstract World Models With Neuro-Symbolic Predicates For Robot Planning, 2024","venue":null,"work_id":"6ecd0b02-04a5-4efb-883f-69ff9ce9b52c","year":2024},"citing_paper":{"arxiv_id":"2502.08697","last_updated":"2025-05-11T15:19:44Z","snapshot_observed_at":"2026-08-08T00:26:41.001589Z","submitted_at":"2025-02-12T18:59:56Z","title":"Bilevel Learning for Bilevel Planning","version":3},"reference_index":21,"source":"pdf_text","source_observed_at":"2026-08-08T00:02:02.130417Z"},"links":{"citing_paper":"/paper/2502.08697"},"observation_digest":"sha256:76e420d5b509a937f175ae4ba4a4446cebcd3053e25045ee2c7711baa7713bf3","observation_id":"a108b778-3859-451f-a05f-3eb4141e533a","resolution":{"observed_at":"2026-08-08T00:02:03.803533Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-08T00:02:03.783647Z","title":"Active learning for teaching a robot grounded relational symbols","venue":null,"work_id":"a8ff6e10-caa8-43f1-a943-22dda0184d0f","year":2013},"citing_paper":{"arxiv_id":"2502.08697","last_updated":"2025-05-11T15:19:44Z","snapshot_observed_at":"2026-08-08T00:26:41.001589Z","submitted_at":"2025-02-12T18:59:56Z","title":"Bilevel Learning for Bilevel Planning","version":3},"reference_index":22,"source":"pdf_text","source_observed_at":"2026-08-08T00:02:02.159671Z"},"links":{"citing_paper":"/paper/2502.08697"},"observation_digest":"sha256:76867b9ef2515395cfcc6423d62ad49db245f734027839ec2eec7cc85cebee29","observation_id":"45328fc2-1f90-45c9-b959-eb963ad11f8c","resolution":{"observed_at":"2026-08-08T00:02:03.788351Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-08T00:02:03.769206Z","title":"From skills to symbols: Learning symbolic representations for abstract high-level planning","venue":null,"work_id":"6e17e503-a79f-4b98-9608-5c4c1b0da83b","year":2018},"citing_paper":{"arxiv_id":"2502.08697","last_updated":"2025-05-11T15:19:44Z","snapshot_observed_at":"2026-08-08T00:26:41.001589Z","submitted_at":"2025-02-12T18:59:56Z","title":"Bilevel Learning for Bilevel Planning","version":3},"reference_index":23,"source":"pdf_text","source_observed_at":"2026-08-08T00:02:02.187822Z"},"links":{"citing_paper":"/paper/2502.08697"},"observation_digest":"sha256:f4ce31d2e8aaaf6b74499fb9529e05f277f2c8cec38d67d24d95ebd6343f1372","observation_id":"334e3079-9ece-4fa6-a929-20fe5b30c823","resolution":{"observed_at":"2026-08-08T00:02:03.773870Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-08T00:02:03.754429Z","title":"Embodied Active Learning of Relational State Abstractions for Bilevel Planning","venue":null,"work_id":"4bc12b79-8e21-40dc-924a-0a145de865f1","year":2023},"citing_paper":{"arxiv_id":"2502.08697","last_updated":"2025-05-11T15:19:44Z","snapshot_observed_at":"2026-08-08T00:26:41.001589Z","submitted_at":"2025-02-12T18:59:56Z","title":"Bilevel Learning for Bilevel Planning","version":3},"reference_index":24,"source":"pdf_text","source_observed_at":"2026-08-08T00:02:02.218577Z"},"links":{"citing_paper":"/paper/2502.08697"},"observation_digest":"sha256:30c6a67326fa799951f950dc10ce87f2db6ba20256a89e16951cedfd96344b9e","observation_id":"fc4614d0-aec0-4fbb-a6fd-3fbca09455b1","resolution":{"observed_at":"2026-08-08T00:02:03.759222Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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":{"arxiv_id":"2405.19758","last_updated":"2024-05-30T07:08:40Z","snapshot_observed_at":"2026-08-08T00:26:35.455783Z","submitted_at":"2024-05-30T07:08:40Z","title":"InterPreT: Interactive Predicate Learning from Language Feedback for Generalizable Task Planning","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2405.19758","snapshot_observed_at":"2026-08-08T00:02:02.257233Z","title":"InterPreT: Interactive Predicate Learning from Language Feedback for Generalizable Task Planning","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2502.08697","last_updated":"2025-05-11T15:19:44Z","snapshot_observed_at":"2026-08-08T00:26:41.001589Z","submitted_at":"2025-02-12T18:59:56Z","title":"Bilevel Learning for Bilevel Planning","version":3},"reference_index":25,"source":"pdf_text","source_observed_at":"2026-08-08T00:02:02.257233Z"},"links":{"cited_paper":"/paper/2405.19758","citing_paper":"/paper/2502.08697"},"observation_digest":"sha256:60f748dfcecc316e5fa7627ec2c17872dce082444928844458107d06dda488b0","observation_id":"a332e0f7-2085-4d34-9f74-f4dd6123d8ee","resolution":{"observed_at":"2026-08-08T00:02:02.257233Z","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-08T00:02:03.739961Z","title":"Grounding Predi- cates through Actions","venue":null,"work_id":"6fd95ae4-90fa-4322-849b-20ceeb4aa2cb","year":2022},"citing_paper":{"arxiv_id":"2502.08697","last_updated":"2025-05-11T15:19:44Z","snapshot_observed_at":"2026-08-08T00:26:41.001589Z","submitted_at":"2025-02-12T18:59:56Z","title":"Bilevel Learning for Bilevel Planning","version":3},"reference_index":26,"source":"pdf_text","source_observed_at":"2026-08-08T00:02:02.275994Z"},"links":{"citing_paper":"/paper/2502.08697"},"observation_digest":"sha256:5814fa50261bdb11ff0ea6e560899be6b9c64230f23b396e3c8d19a3b6a781ff","observation_id":"1ebb3843-8fcf-49d8-b65e-6338c81d83a0","resolution":{"observed_at":"2026-08-08T00:02:03.744638Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-08T00:02:03.725142Z","title":"Classical Planning in Deep Latent Space: Bridging the Subsymbolic-Symbolic Boundary","venue":null,"work_id":"12814291-7d86-41c4-925e-19b27939122b","year":2018},"citing_paper":{"arxiv_id":"2502.08697","last_updated":"2025-05-11T15:19:44Z","snapshot_observed_at":"2026-08-08T00:26:41.001589Z","submitted_at":"2025-02-12T18:59:56Z","title":"Bilevel Learning for Bilevel Planning","version":3},"reference_index":27,"source":"pdf_text","source_observed_at":"2026-08-08T00:02:02.297787Z"},"links":{"citing_paper":"/paper/2502.08697"},"observation_digest":"sha256:476328f775c04c7e45236c1a8089ecf1eee5870f3a9ee7896fdf8085f06e890d","observation_id":"0f1ba871-3f0c-4294-8692-0278e7b569d2","resolution":{"observed_at":"2026-08-08T00:02:03.730233Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-08T00:02:03.710055Z","title":"Unsupervised Grounding of Plannable First-Order Logic Representation From Images","venue":null,"work_id":"980e95cd-c4db-419e-825f-d7ed471a732c","year":2019},"citing_paper":{"arxiv_id":"2502.08697","last_updated":"2025-05-11T15:19:44Z","snapshot_observed_at":"2026-08-08T00:26:41.001589Z","submitted_at":"2025-02-12T18:59:56Z","title":"Bilevel Learning for Bilevel Planning","version":3},"reference_index":28,"source":"pdf_text","source_observed_at":"2026-08-08T00:02:02.318321Z"},"links":{"citing_paper":"/paper/2502.08697"},"observation_digest":"sha256:27d81c9fd81c8104ed951355f219998a4b460350942b8c06450f8b94056a303b","observation_id":"27a1ec22-b6c4-4ac3-a815-91d326191c2e","resolution":{"observed_at":"2026-08-08T00:02:03.715223Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-08T00:02:03.695772Z","title":"Learning Neural- Dymbolic Descriptive Planning Models via Cube-Space Priors: the V oyage Home (to STRIPS)","venue":null,"work_id":"7e1ccfe7-a048-44a3-919c-3fafc285e382","year":2021},"citing_paper":{"arxiv_id":"2502.08697","last_updated":"2025-05-11T15:19:44Z","snapshot_observed_at":"2026-08-08T00:26:41.001589Z","submitted_at":"2025-02-12T18:59:56Z","title":"Bilevel Learning for Bilevel Planning","version":3},"reference_index":29,"source":"pdf_text","source_observed_at":"2026-08-08T00:02:02.322757Z"},"links":{"citing_paper":"/paper/2502.08697"},"observation_digest":"sha256:3a937405e007c4b0f7214838251eb165f6f237928017ac19a52037089b892513","observation_id":"85c202c9-dca0-4b79-9623-e5a81aaa8691","resolution":{"observed_at":"2026-08-08T00:02:03.700663Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-08T00:02:03.681020Z","title":"Bisimulation Makes Analogies in Goal-conditioned Reinforcement Learning","venue":null,"work_id":"7f3b713d-fc29-494b-b455-0f8f23291412","year":2022},"citing_paper":{"arxiv_id":"2502.08697","last_updated":"2025-05-11T15:19:44Z","snapshot_observed_at":"2026-08-08T00:26:41.001589Z","submitted_at":"2025-02-12T18:59:56Z","title":"Bilevel Learning for Bilevel Planning","version":3},"reference_index":30,"source":"pdf_text","source_observed_at":"2026-08-08T00:02:02.327293Z"},"links":{"citing_paper":"/paper/2502.08697"},"observation_digest":"sha256:aa69aca05ada645d3670f8131032dfbb12cdeeff24bf662c2e6408a01c1b9f1e","observation_id":"6b64f9f0-bc78-4e11-86f2-a6bf03d1ca08","resolution":{"observed_at":"2026-08-08T00:02:03.685952Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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-08-08T00:02:02.331349Z","title":"Predicate Invention from Pixels via Pretrained Vision- Language Models","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2502.08697","last_updated":"2025-05-11T15:19:44Z","snapshot_observed_at":"2026-08-08T00:26:41.001589Z","submitted_at":"2025-02-12T18:59:56Z","title":"Bilevel Learning for Bilevel Planning","version":3},"reference_index":31,"source":"pdf_text","source_observed_at":"2026-08-08T00:02:02.331349Z"},"links":{"citing_paper":"/paper/2502.08697"},"observation_digest":"sha256:8d5fbbc99c8505ff20d228affe32eb79ed8cf4b733aa9625abdfd3e03f8d2eee","observation_id":"926c4f14-35f1-41e8-9c48-36d556b8e4c0","resolution":{"observed_at":"2026-08-08T00:02:02.331349Z","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-08T00:02:03.665751Z","title":"Tenenbaum, Tom ´as Lozano-P´erez, and Leslie Pack Kaelbling","venue":null,"work_id":"87b9f59d-1fc4-4db2-92bc-e6b5b35858ce","year":2022},"citing_paper":{"arxiv_id":"2502.08697","last_updated":"2025-05-11T15:19:44Z","snapshot_observed_at":"2026-08-08T00:26:41.001589Z","submitted_at":"2025-02-12T18:59:56Z","title":"Bilevel Learning for Bilevel Planning","version":3},"reference_index":32,"source":"pdf_text","source_observed_at":"2026-08-08T00:02:02.335548Z"},"links":{"citing_paper":"/paper/2502.08697"},"observation_digest":"sha256:5e4f119b7278e3dd1ef6b279898b97e7015c59b4b3070341fc87624d41675d75","observation_id":"1fe75e69-dc02-4643-9bb8-6acb04dd54a3","resolution":{"observed_at":"2026-08-08T00:02:03.670631Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-08T00:02:03.650802Z","title":"Integrated Task and Motion Planning","venue":null,"work_id":"78ccd65c-bb9b-4782-93fd-a624ca463c0e","year":2021},"citing_paper":{"arxiv_id":"2502.08697","last_updated":"2025-05-11T15:19:44Z","snapshot_observed_at":"2026-08-08T00:26:41.001589Z","submitted_at":"2025-02-12T18:59:56Z","title":"Bilevel Learning for Bilevel Planning","version":3},"reference_index":33,"source":"pdf_text","source_observed_at":"2026-08-08T00:02:02.339687Z"},"links":{"citing_paper":"/paper/2502.08697"},"observation_digest":"sha256:54c5cfc24c1aaa742b6448ccadfed8a54fb5d62932afccdc8ae12abaf39a4b4f","observation_id":"931b0a2a-f353-45cd-be28-fe1ec787192b","resolution":{"observed_at":"2026-08-08T00:02:03.655638Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-08T00:02:03.636807Z","title":"The Fast Downward Planning System","venue":null,"work_id":"5bf0a19f-1a4f-44f3-850a-4676cca7bf4e","year":2006},"citing_paper":{"arxiv_id":"2502.08697","last_updated":"2025-05-11T15:19:44Z","snapshot_observed_at":"2026-08-08T00:26:41.001589Z","submitted_at":"2025-02-12T18:59:56Z","title":"Bilevel Learning for Bilevel Planning","version":3},"reference_index":34,"source":"pdf_text","source_observed_at":"2026-08-08T00:02:02.343807Z"},"links":{"citing_paper":"/paper/2502.08697"},"observation_digest":"sha256:1d3e068785e15c0036bcde001d6088aa67fd5a1f6bb3909862184ec28fbd85c6","observation_id":"e3b8946a-4a4c-49b2-b1f0-e0bd42eb1aa6","resolution":{"observed_at":"2026-08-08T00:02:03.641328Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-08T00:02:03.622789Z","title":"Divergence Measures based on the Shannon Entropy","venue":null,"work_id":"c0635337-a180-487b-80db-3a9df4b24170","year":1991},"citing_paper":{"arxiv_id":"2502.08697","last_updated":"2025-05-11T15:19:44Z","snapshot_observed_at":"2026-08-08T00:26:41.001589Z","submitted_at":"2025-02-12T18:59:56Z","title":"Bilevel Learning for Bilevel Planning","version":3},"reference_index":35,"source":"pdf_text","source_observed_at":"2026-08-08T00:02:02.347818Z"},"links":{"citing_paper":"/paper/2502.08697"},"observation_digest":"sha256:bcd4d612de5a898006a4ba63a5ae979b37ce23ccaec53d48314349f0edd0fcd3","observation_id":"1e44301e-8acb-4c70-8a27-11c1481fb1d7","resolution":{"observed_at":"2026-08-08T00:02:03.627207Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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":{"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-08T00:02:02.352118Z","title":"Kingma and Jimmy Ba","venue":null,"work_id":null,"year":2014},"citing_paper":{"arxiv_id":"2502.08697","last_updated":"2025-05-11T15:19:44Z","snapshot_observed_at":"2026-08-08T00:26:41.001589Z","submitted_at":"2025-02-12T18:59:56Z","title":"Bilevel Learning for Bilevel Planning","version":3},"reference_index":36,"source":"pdf_text","source_observed_at":"2026-08-08T00:02:02.352118Z"},"links":{"cited_paper":"/paper/1412.6980","citing_paper":"/paper/2502.08697"},"observation_digest":"sha256:90ae1483b9b5653d1b0b0c26544b07a905e7fb491d51d63c93947634f3b25c5b","observation_id":"b1b0e948-9031-42d0-974c-4e43a648ab9f","resolution":{"observed_at":"2026-08-08T00:02:02.352118Z","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-08T00:02:03.608988Z","title":"Learning Representations by Back-propagating Errors","venue":null,"work_id":"f1b3606e-03fd-43b6-989d-a1b58d1b7e3c","year":1986},"citing_paper":{"arxiv_id":"2502.08697","last_updated":"2025-05-11T15:19:44Z","snapshot_observed_at":"2026-08-08T00:26:41.001589Z","submitted_at":"2025-02-12T18:59:56Z","title":"Bilevel Learning for Bilevel Planning","version":3},"reference_index":37,"source":"pdf_text","source_observed_at":"2026-08-08T00:02:02.356372Z"},"links":{"citing_paper":"/paper/2502.08697"},"observation_digest":"sha256:85dc891e23fc6f35b1a49bddc276c81d37dbdddc79b4b6dd2bc37c326ca275da","observation_id":"e8f42a3c-6364-4135-af7f-09659ee6d0d0","resolution":{"observed_at":"2026-08-08T00:02:03.613560Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-08T00:02:03.594245Z","title":"Efficient Selectivity and Backup Operators in Monte-Carlo Tree Search","venue":null,"work_id":"23812bad-bdcf-4465-9520-9c2509b4ef1a","year":2006},"citing_paper":{"arxiv_id":"2502.08697","last_updated":"2025-05-11T15:19:44Z","snapshot_observed_at":"2026-08-08T00:26:41.001589Z","submitted_at":"2025-02-12T18:59:56Z","title":"Bilevel Learning for Bilevel Planning","version":3},"reference_index":38,"source":"pdf_text","source_observed_at":"2026-08-08T00:02:02.361327Z"},"links":{"citing_paper":"/paper/2502.08697"},"observation_digest":"sha256:98360be942b71c6b7bcb61c188f5f7cd392fd7f5a953cfdb5678d521a42e326f","observation_id":"00a61b2d-735b-48fe-b9d4-d17c62afb946","resolution":{"observed_at":"2026-08-08T00:02:03.599355Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-08T00:02:03.579734Z","title":"Mastering the Game of Go without Human Knowledge","venue":null,"work_id":"6198209d-b56d-40de-bd85-12fb840275e5","year":2017},"citing_paper":{"arxiv_id":"2502.08697","last_updated":"2025-05-11T15:19:44Z","snapshot_observed_at":"2026-08-08T00:26:41.001589Z","submitted_at":"2025-02-12T18:59:56Z","title":"Bilevel Learning for Bilevel Planning","version":3},"reference_index":39,"source":"pdf_text","source_observed_at":"2026-08-08T00:02:02.366182Z"},"links":{"citing_paper":"/paper/2502.08697"},"observation_digest":"sha256:4ac84d04eddbe47284f50b3d04a0298dc684b4cc3375b79dc25bb5ee78513781","observation_id":"31b455eb-09bd-4380-bdae-bffc7b6a478b","resolution":{"observed_at":"2026-08-08T00:02:03.584454Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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":{"arxiv_id":"1806.01261","last_updated":"2018-10-17T17:51:36Z","snapshot_observed_at":"2026-07-06T06:42:54.610341Z","submitted_at":"2018-06-04T17:58:18Z","title":"Relational inductive biases, deep learning, and graph networks","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1806.01261","snapshot_observed_at":"2026-08-08T00:02:02.370621Z","title":"Relational Inductive Biases, Deep Learning, and Graph Networks","venue":null,"work_id":null,"year":2018},"citing_paper":{"arxiv_id":"2502.08697","last_updated":"2025-05-11T15:19:44Z","snapshot_observed_at":"2026-08-08T00:26:41.001589Z","submitted_at":"2025-02-12T18:59:56Z","title":"Bilevel Learning for Bilevel Planning","version":3},"reference_index":40,"source":"pdf_text","source_observed_at":"2026-08-08T00:02:02.370621Z"},"links":{"cited_paper":"/paper/1806.01261","citing_paper":"/paper/2502.08697"},"observation_digest":"sha256:390f6a293f2dcdfdcb8d10ebebfbf050a35887e9a7a107d3bb4f3947df6e8e8e","observation_id":"dd7120fd-3e4e-4f23-9ebb-22c0ad794732","resolution":{"observed_at":"2026-08-08T00:02:02.370621Z","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-08T00:02:03.565515Z","title":"Attention is All You Need","venue":null,"work_id":"bbc98cbf-b82f-452b-81c1-b4eb87f1b748","year":2017},"citing_paper":{"arxiv_id":"2502.08697","last_updated":"2025-05-11T15:19:44Z","snapshot_observed_at":"2026-08-08T00:26:41.001589Z","submitted_at":"2025-02-12T18:59:56Z","title":"Bilevel Learning for Bilevel Planning","version":3},"reference_index":41,"source":"pdf_text","source_observed_at":"2026-08-08T00:02:02.375708Z"},"links":{"citing_paper":"/paper/2502.08697"},"observation_digest":"sha256:919c5e3da594a086e8979c76d3263e9061eaa5d0456226a1a004ad746fa48e4c","observation_id":"bcb2ec7f-4e2e-4bcc-8bdf-8de31168ef10","resolution":{"observed_at":"2026-08-08T00:02:03.570113Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-08T00:02:03.550300Z","title":"Language Segment-Anything","venue":null,"work_id":"ce61cb4f-6769-44fe-a18b-bf4d152578df","year":2024},"citing_paper":{"arxiv_id":"2502.08697","last_updated":"2025-05-11T15:19:44Z","snapshot_observed_at":"2026-08-08T00:26:41.001589Z","submitted_at":"2025-02-12T18:59:56Z","title":"Bilevel Learning for Bilevel Planning","version":3},"reference_index":42,"source":"pdf_text","source_observed_at":"2026-08-08T00:02:02.380666Z"},"links":{"citing_paper":"/paper/2502.08697"},"observation_digest":"sha256:be1931566403aeeaf8e45f21004915d8131416dcc1ca4c463a0cd7925e9b418a","observation_id":"84da41bf-2548-410c-8a30-61fc3c31f0b3","resolution":{"observed_at":"2026-08-08T00:02:03.555057Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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":{"arxiv_id":"2408.00714","last_updated":"2024-10-28T16:37:57Z","snapshot_observed_at":"2026-07-06T18:55:41.459417Z","submitted_at":"2024-08-01T17:00:08Z","title":"SAM 2: Segment Anything in Images and Videos","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2408.00714","snapshot_observed_at":"2026-08-08T00:02:02.385466Z","title":"Sam 2: Segment Anything in Images and Videos","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2502.08697","last_updated":"2025-05-11T15:19:44Z","snapshot_observed_at":"2026-08-08T00:26:41.001589Z","submitted_at":"2025-02-12T18:59:56Z","title":"Bilevel Learning for Bilevel Planning","version":3},"reference_index":43,"source":"pdf_text","source_observed_at":"2026-08-08T00:02:02.385466Z"},"links":{"cited_paper":"/paper/2408.00714","citing_paper":"/paper/2502.08697"},"observation_digest":"sha256:67e7403ac920d333e561db89ca6119a4e085723f5a8ae3deafebd09b04fec5d0","observation_id":"f9f3b928-b772-40e5-8316-fe629386fddd","resolution":{"observed_at":"2026-08-08T00:02:02.385466Z","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-08T00:02:03.535262Z","title":"Hi- erarchical Task and Motion Planning in the Now","venue":null,"work_id":"658f93d1-982e-407a-b63a-957a531c5dec","year":2011},"citing_paper":{"arxiv_id":"2502.08697","last_updated":"2025-05-11T15:19:44Z","snapshot_observed_at":"2026-08-08T00:26:41.001589Z","submitted_at":"2025-02-12T18:59:56Z","title":"Bilevel Learning for Bilevel Planning","version":3},"reference_index":44,"source":"pdf_text","source_observed_at":"2026-08-08T00:02:02.390730Z"},"links":{"citing_paper":"/paper/2502.08697"},"observation_digest":"sha256:2edf679290daedd5d210d3d608af50393fa0c7324740beb0b8a11d5945445fe1","observation_id":"b0730161-90a8-4444-8f8e-a9ac27596195","resolution":{"observed_at":"2026-08-08T00:02:03.540368Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-08T00:02:03.519592Z","title":"Relay Policy Learning: Solv- ing Long-Horizon Tasks via Imitation and Reinforcement Learning","venue":null,"work_id":"3b439f2b-8769-4118-afdf-4c8bd6ce6927","year":2020},"citing_paper":{"arxiv_id":"2502.08697","last_updated":"2025-05-11T15:19:44Z","snapshot_observed_at":"2026-08-08T00:26:41.001589Z","submitted_at":"2025-02-12T18:59:56Z","title":"Bilevel Learning for Bilevel Planning","version":3},"reference_index":45,"source":"pdf_text","source_observed_at":"2026-08-08T00:02:02.395333Z"},"links":{"citing_paper":"/paper/2502.08697"},"observation_digest":"sha256:b0d9dc9503cca5b4f12684e9a77cf87309fbce249025b8a63f10c47bb316e889","observation_id":"08709afb-bbfd-4c04-b0d2-71b94608cef7","resolution":{"observed_at":"2026-08-08T00:02:03.524580Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-08T00:02:03.504404Z","title":"Augment- ing Reinforcement Learning with Behavior Primitives for Diverse Manipulation Tasks","venue":null,"work_id":"d745c1d6-198e-416d-8599-c609c6bdc442","year":2022},"citing_paper":{"arxiv_id":"2502.08697","last_updated":"2025-05-11T15:19:44Z","snapshot_observed_at":"2026-08-08T00:26:41.001589Z","submitted_at":"2025-02-12T18:59:56Z","title":"Bilevel Learning for Bilevel Planning","version":3},"reference_index":46,"source":"pdf_text","source_observed_at":"2026-08-08T00:02:02.410207Z"},"links":{"citing_paper":"/paper/2502.08697"},"observation_digest":"sha256:e72bb05fe6e810a3d25b44fe5de79d28558f5ca9272b5698a988b1941f582997","observation_id":"af89e26f-eed6-4db9-b055-9049d1b771d4","resolution":{"observed_at":"2026-08-08T00:02:03.509365Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-08T00:02:03.490213Z","title":"Neural Logic Machines","venue":null,"work_id":"635ae280-952a-4cf5-a414-e07967c17908","year":2019},"citing_paper":{"arxiv_id":"2502.08697","last_updated":"2025-05-11T15:19:44Z","snapshot_observed_at":"2026-08-08T00:26:41.001589Z","submitted_at":"2025-02-12T18:59:56Z","title":"Bilevel Learning for Bilevel Planning","version":3},"reference_index":47,"source":"pdf_text","source_observed_at":"2026-08-08T00:02:02.418370Z"},"links":{"citing_paper":"/paper/2502.08697"},"observation_digest":"sha256:f540e4ba77d47abdeb0492cd784eca6bc28d83930c552d623891de6383a25e7e","observation_id":"22e74c44-d1fc-449d-b250-19e5d666ed63","resolution":{"observed_at":"2026-08-08T00:02:03.494687Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-08T00:02:03.475655Z","title":"Directed-Info GAIL: Learning Hierar- chical Policies from Unsegmented Demonstrations using Directed Information","venue":null,"work_id":"581cb294-1d61-4b65-acbb-6dba415932b6","year":2018},"citing_paper":{"arxiv_id":"2502.08697","last_updated":"2025-05-11T15:19:44Z","snapshot_observed_at":"2026-08-08T00:26:41.001589Z","submitted_at":"2025-02-12T18:59:56Z","title":"Bilevel Learning for Bilevel Planning","version":3},"reference_index":48,"source":"pdf_text","source_observed_at":"2026-08-08T00:02:02.423259Z"},"links":{"citing_paper":"/paper/2502.08697"},"observation_digest":"sha256:2a713fb337d389fa76fa509c010f948469b32aba201e49e84feccfb93e0367cf","observation_id":"e3239d39-70fe-4543-b9d2-cd750de34acd","resolution":{"observed_at":"2026-08-08T00:02:03.480811Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-08T00:02:03.460717Z","title":"Compile: Compositional Imitation Learning and Execution","venue":null,"work_id":"5acd8dd2-c156-4bf3-9096-33ed508198ca","year":2019},"citing_paper":{"arxiv_id":"2502.08697","last_updated":"2025-05-11T15:19:44Z","snapshot_observed_at":"2026-08-08T00:26:41.001589Z","submitted_at":"2025-02-12T18:59:56Z","title":"Bilevel Learning for Bilevel Planning","version":3},"reference_index":49,"source":"pdf_text","source_observed_at":"2026-08-08T00:02:02.428102Z"},"links":{"citing_paper":"/paper/2502.08697"},"observation_digest":"sha256:c56a088eda26111dbcb856280f2b044f1418f2905a379192d54eaa7657263474","observation_id":"6b67e16e-219f-4432-879a-af83de231bc7","resolution":{"observed_at":"2026-08-08T00:02:03.465799Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-08T00:02:03.445702Z","title":"PDSketch: Integrated Domain Programming, Learning, and Planning","venue":null,"work_id":"064fe9f1-acef-4ecb-8fb5-f73fb9deef5e","year":2022},"citing_paper":{"arxiv_id":"2502.08697","last_updated":"2025-05-11T15:19:44Z","snapshot_observed_at":"2026-08-08T00:26:41.001589Z","submitted_at":"2025-02-12T18:59:56Z","title":"Bilevel Learning for Bilevel Planning","version":3},"reference_index":50,"source":"pdf_text","source_observed_at":"2026-08-08T00:02:02.433007Z"},"links":{"citing_paper":"/paper/2502.08697"},"observation_digest":"sha256:5e19c89e4ac12b9cc32add15c3511ce17d56343b7cca0f1347a121c190cf0e6b","observation_id":"d8e6f83c-2ae8-4e7d-bf34-74856bca85f4","resolution":{"observed_at":"2026-08-08T00:02:03.450762Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-08T00:02:03.430561Z","title":"BLADE: Learning Compositional Behaviors from Demonstration and Language","venue":null,"work_id":"07a7a999-94b1-4dd1-a243-06b8792c8a0c","year":2024},"citing_paper":{"arxiv_id":"2502.08697","last_updated":"2025-05-11T15:19:44Z","snapshot_observed_at":"2026-08-08T00:26:41.001589Z","submitted_at":"2025-02-12T18:59:56Z","title":"Bilevel Learning for Bilevel Planning","version":3},"reference_index":51,"source":"pdf_text","source_observed_at":"2026-08-08T00:02:02.437043Z"},"links":{"citing_paper":"/paper/2502.08697"},"observation_digest":"sha256:c3e40fd3b73964c3a47fe2d8e9eca91221b926eeefb66365be3cdd79ed4ec11b","observation_id":"fbbe30fd-8da4-4eba-80e7-9fd3ac01f6fa","resolution":{"observed_at":"2026-08-08T00:02:03.435543Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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":{"arxiv_id":"2410.23254","last_updated":"2024-10-30T17:37:31Z","snapshot_observed_at":"2026-08-04T21:03:53.705180Z","submitted_at":"2024-10-30T17:37:31Z","title":"Keypoint Abstraction using Large Models for Object-Relative Imitation Learning","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2410.23254","snapshot_observed_at":"2026-08-08T00:02:02.441073Z","title":"Keypoint Abstraction using Large Models for Object-Relative Imitation Learning","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2502.08697","last_updated":"2025-05-11T15:19:44Z","snapshot_observed_at":"2026-08-08T00:26:41.001589Z","submitted_at":"2025-02-12T18:59:56Z","title":"Bilevel Learning for Bilevel Planning","version":3},"reference_index":52,"source":"pdf_text","source_observed_at":"2026-08-08T00:02:02.441073Z"},"links":{"cited_paper":"/paper/2410.23254","citing_paper":"/paper/2502.08697"},"observation_digest":"sha256:7229c0ece39495223ed224a5db266fa83fc0ec4e2c62ef8d6fd25676178d78ee","observation_id":"38a74271-8fa9-47a3-96a3-284f4c9ab682","resolution":{"observed_at":"2026-08-08T00:02:02.441073Z","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-08T00:02:03.414740Z","title":"Gener- alized Planning in PDDL Domains with Pretrained Large Language Models","venue":null,"work_id":"08a1578b-8a3b-4522-95a9-4a9aa1e88dc0","year":2024},"citing_paper":{"arxiv_id":"2502.08697","last_updated":"2025-05-11T15:19:44Z","snapshot_observed_at":"2026-08-08T00:26:41.001589Z","submitted_at":"2025-02-12T18:59:56Z","title":"Bilevel Learning for Bilevel Planning","version":3},"reference_index":53,"source":"pdf_text","source_observed_at":"2026-08-08T00:02:02.445426Z"},"links":{"citing_paper":"/paper/2502.08697"},"observation_digest":"sha256:5ddc173de72b28a46f33e82dbfe7e573e78bdb3d935884f3ca61808d01aceba1","observation_id":"e7ef2d09-9bc0-4442-b7a1-cfbe2676eb1b","resolution":{"observed_at":"2026-08-08T00:02:03.420376Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-08T00:02:03.370860Z","title":"Chain-of-Thought Prompting Elicits Reasoning in Large Language Models","venue":null,"work_id":"2cfbed30-9d3f-4ec6-9290-8f6917520b4e","year":2022},"citing_paper":{"arxiv_id":"2502.08697","last_updated":"2025-05-11T15:19:44Z","snapshot_observed_at":"2026-08-08T00:26:41.001589Z","submitted_at":"2025-02-12T18:59:56Z","title":"Bilevel Learning for Bilevel Planning","version":3},"reference_index":54,"source":"pdf_text","source_observed_at":"2026-08-08T00:02:02.449667Z"},"links":{"citing_paper":"/paper/2502.08697"},"observation_digest":"sha256:655ac67d677b44b45fdd50e4ed6697fdfee7a64f24be3c8259a0100593893060","observation_id":"e190f1f7-7668-4561-90db-6eff55621c47","resolution":{"observed_at":"2026-08-08T00:02:03.403843Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-08T00:02:03.326019Z","title":"V oxPoser: Composable 3D Value Maps for Robotic Manipulation with Language Models","venue":null,"work_id":"45d0c594-f8f9-4e7c-81ea-8fd8d59c15b5","year":2023},"citing_paper":{"arxiv_id":"2502.08697","last_updated":"2025-05-11T15:19:44Z","snapshot_observed_at":"2026-08-08T00:26:41.001589Z","submitted_at":"2025-02-12T18:59:56Z","title":"Bilevel Learning for Bilevel Planning","version":3},"reference_index":55,"source":"pdf_text","source_observed_at":"2026-08-08T00:02:02.476422Z"},"links":{"citing_paper":"/paper/2502.08697"},"observation_digest":"sha256:46195c2e1beec29e2395bda7193727de0d21faf94bf97a0746c2b586c5593271","observation_id":"6302c8cb-a72e-4e4e-9a39-eaab1e11a65b","resolution":{"observed_at":"2026-08-08T00:02:03.345882Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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":{"arxiv_id":"2311.17842","last_updated":"2023-12-24T03:48:40Z","snapshot_observed_at":"2026-08-07T02:37:30.672574Z","submitted_at":"2023-11-29T17:46:25Z","title":"Look Before You Leap: Unveiling the Power of GPT-4V in Robotic Vision-Language Planning","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2311.17842","snapshot_observed_at":"2026-08-08T00:02:02.506842Z","title":"Look Before You Leap: Unveiling the Power of GPT-4v in Robotic Vision-Language Planning","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2502.08697","last_updated":"2025-05-11T15:19:44Z","snapshot_observed_at":"2026-08-08T00:26:41.001589Z","submitted_at":"2025-02-12T18:59:56Z","title":"Bilevel Learning for Bilevel Planning","version":3},"reference_index":56,"source":"pdf_text","source_observed_at":"2026-08-08T00:02:02.506842Z"},"links":{"cited_paper":"/paper/2311.17842","citing_paper":"/paper/2502.08697"},"observation_digest":"sha256:d7ef07495e503f915294357b886477eef5e02e353191f5b838de32474e4e0114","observation_id":"5406b303-0436-4e37-9c41-6f9c14b71bb2","resolution":{"observed_at":"2026-08-08T00:02:02.506842Z","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-08T00:02:03.294054Z","title":"Open-World Task and Motion Planning via Vision-Language Model Inferred Constraints","venue":null,"work_id":"628878af-0d26-4018-a614-75ec0fe20f5a","year":2024},"citing_paper":{"arxiv_id":"2502.08697","last_updated":"2025-05-11T15:19:44Z","snapshot_observed_at":"2026-08-08T00:26:41.001589Z","submitted_at":"2025-02-12T18:59:56Z","title":"Bilevel Learning for Bilevel Planning","version":3},"reference_index":57,"source":"pdf_text","source_observed_at":"2026-08-08T00:02:02.541415Z"},"links":{"citing_paper":"/paper/2502.08697"},"observation_digest":"sha256:c45dda773954ceb5f6df40b6cde7c4a7aa72d51ac811a33bb1f060073ef87ad5","observation_id":"9130dc0e-c63e-46d2-89b6-2cce8b41c63a","resolution":{"observed_at":"2026-08-08T00:02:03.299133Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-08T00:02:03.278262Z","title":"Pddlstream: Integrating Symbolic Planners and Blackbox Samplers via Optimistic Adaptive Planning","venue":null,"work_id":"bfc4a788-dee2-49c4-ac2b-fcb5cce3cf9c","year":2020},"citing_paper":{"arxiv_id":"2502.08697","last_updated":"2025-05-11T15:19:44Z","snapshot_observed_at":"2026-08-08T00:26:41.001589Z","submitted_at":"2025-02-12T18:59:56Z","title":"Bilevel Learning for Bilevel Planning","version":3},"reference_index":58,"source":"pdf_text","source_observed_at":"2026-08-08T00:02:02.569168Z"},"links":{"citing_paper":"/paper/2502.08697"},"observation_digest":"sha256:21819f94305849237647adc9ec8978d0d9fad287db5028522013fc586df27013","observation_id":"fbdadb50-cc9d-45e3-ae10-d27d95dae3df","resolution":{"observed_at":"2026-08-08T00:02:03.283063Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-08T00:02:03.264290Z","title":"Howe, Craig A","venue":null,"work_id":"d2f5c0fd-ab98-4b8b-865d-d41903be2da6","year":1998},"citing_paper":{"arxiv_id":"2502.08697","last_updated":"2025-05-11T15:19:44Z","snapshot_observed_at":"2026-08-08T00:26:41.001589Z","submitted_at":"2025-02-12T18:59:56Z","title":"Bilevel Learning for Bilevel Planning","version":3},"reference_index":59,"source":"pdf_text","source_observed_at":"2026-08-08T00:02:02.593129Z"},"links":{"citing_paper":"/paper/2502.08697"},"observation_digest":"sha256:6d9ec771d0165040dfe57538c801050f2690109f304ba4120e2fde7b4cf2b8f6","observation_id":"86c4d678-dc42-4bf9-b633-e65007eac2fc","resolution":{"observed_at":"2026-08-08T00:02:03.269228Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-08T00:02:03.249572Z","title":"Anytime Motion Plan- ning using the RRT","venue":null,"work_id":"9af8c235-60d4-44fb-92b4-9e0eac1844f6","year":2011},"citing_paper":{"arxiv_id":"2502.08697","last_updated":"2025-05-11T15:19:44Z","snapshot_observed_at":"2026-08-08T00:26:41.001589Z","submitted_at":"2025-02-12T18:59:56Z","title":"Bilevel Learning for Bilevel Planning","version":3},"reference_index":60,"source":"pdf_text","source_observed_at":"2026-08-08T00:02:02.619291Z"},"links":{"citing_paper":"/paper/2502.08697"},"observation_digest":"sha256:eace6177e098a5ccff9ce8a8a5b1ecb3d7e01f4684319638fcc7bdc85a6bf664","observation_id":"30457b50-e26d-44b6-81d4-cd215f6cbf1a","resolution":{"observed_at":"2026-08-08T00:02:03.254039Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-08T00:02:03.232477Z","title":"Skill-based curiosity for intrinsically motivated reinforcement learning","venue":null,"work_id":"f95936ff-426e-41b7-a424-b7394bec65b4","year":2020},"citing_paper":{"arxiv_id":"2502.08697","last_updated":"2025-05-11T15:19:44Z","snapshot_observed_at":"2026-08-08T00:26:41.001589Z","submitted_at":"2025-02-12T18:59:56Z","title":"Bilevel Learning for Bilevel Planning","version":3},"reference_index":61,"source":"pdf_text","source_observed_at":"2026-08-08T00:02:02.639776Z"},"links":{"citing_paper":"/paper/2502.08697"},"observation_digest":"sha256:714bcc9f00d64234dcd9a489f16ca95654acd1c78adcefa62ed380b0978c1363","observation_id":"98133825-cf77-4f0c-8f51-da39b9721b0d","resolution":{"observed_at":"2026-08-08T00:02:03.237553Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-08T00:02:03.217684Z","title":null,"venue":null,"work_id":"734c4784-0856-47c7-bc7d-11e66aad1c39","year":2004},"citing_paper":{"arxiv_id":"2502.08697","last_updated":"2025-05-11T15:19:44Z","snapshot_observed_at":"2026-08-08T00:26:41.001589Z","submitted_at":"2025-02-12T18:59:56Z","title":"Bilevel Learning for Bilevel Planning","version":3},"reference_index":62,"source":"pdf_text","source_observed_at":"2026-08-08T00:02:02.658648Z"},"links":{"citing_paper":"/paper/2502.08697"},"observation_digest":"sha256:cd1f15f20892d2127857b9f4466064c83de0c347962f69ab6aa566ff79ec20cf","observation_id":"1b0df965-515b-4cde-ac18-31cec39199a5","resolution":{"observed_at":"2026-08-08T00:02:03.222191Z","resolver_source":"raw_fallback","status":"unresolved"},"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":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-08T00:02:03.202518Z","title":"Hybrid Declarative-Imperative Representations for Hybrid Discrete-Continuous Decision- Making","venue":null,"work_id":"85443bba-92ba-4728-84d6-85bf94e1e6da","year":null},"citing_paper":{"arxiv_id":"2502.08697","last_updated":"2025-05-11T15:19:44Z","snapshot_observed_at":"2026-08-08T00:26:41.001589Z","submitted_at":"2025-02-12T18:59:56Z","title":"Bilevel Learning for Bilevel Planning","version":3},"reference_index":63,"source":"pdf_text","source_observed_at":"2026-08-08T00:02:02.679284Z"},"links":{"citing_paper":"/paper/2502.08697"},"observation_digest":"sha256:6b39e1cfa156827693b4da93335f4d9b9c12b43fd4afa55d575be204dc88dc42","observation_id":"eae53c3a-5bc0-4270-b721-8bec9c026028","resolution":{"observed_at":"2026-08-08T00:02:03.207468Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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":{"arxiv_id":"2007.08501","last_updated":"2020-07-16T17:53:02Z","snapshot_observed_at":"2026-07-06T09:38:53.228850Z","submitted_at":"2020-07-16T17:53:02Z","title":"Accelerating 3D Deep Learning with PyTorch3D","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2007.08501","snapshot_observed_at":"2026-08-08T00:02:02.701278Z","title":"Accelerating 3D Deep Learning with Py- Torch3D","venue":null,"work_id":null,"year":2007},"citing_paper":{"arxiv_id":"2502.08697","last_updated":"2025-05-11T15:19:44Z","snapshot_observed_at":"2026-08-08T00:26:41.001589Z","submitted_at":"2025-02-12T18:59:56Z","title":"Bilevel Learning for Bilevel Planning","version":3},"reference_index":64,"source":"pdf_text","source_observed_at":"2026-08-08T00:02:02.701278Z"},"links":{"cited_paper":"/paper/2007.08501","citing_paper":"/paper/2502.08697"},"observation_digest":"sha256:c9c349bd979f374177887a9e6dd71e3d4bf845f7ab83250f7a02f818cb91a231","observation_id":"0a4183f1-ae7a-4bbc-b0dd-ea14d8dba546","resolution":{"observed_at":"2026-08-08T00:02:02.701278Z","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-08T00:02:03.185708Z","title":"Pointnet: Deep Learning on Point Sets for 3D Classification and Segmentation","venue":null,"work_id":"3f554235-aabd-4cbb-a6af-e4d52a9e9b62","year":2017},"citing_paper":{"arxiv_id":"2502.08697","last_updated":"2025-05-11T15:19:44Z","snapshot_observed_at":"2026-08-08T00:26:41.001589Z","submitted_at":"2025-02-12T18:59:56Z","title":"Bilevel Learning for Bilevel Planning","version":3},"reference_index":65,"source":"pdf_text","source_observed_at":"2026-08-08T00:02:02.707026Z"},"links":{"citing_paper":"/paper/2502.08697"},"observation_digest":"sha256:2617c3d95f164c96f490fc86138aa0ec86c72a8bd49d67ffbde563ede2955801","observation_id":"23e4bab2-569f-4fd2-a3b6-677c68b2bfbf","resolution":{"observed_at":"2026-08-08T00:02:03.191507Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-08T00:02:03.169231Z","title":"grounded on","venue":null,"work_id":"386c4274-1ab9-4423-bddd-7879995b12e1","year":2016},"citing_paper":{"arxiv_id":"2502.08697","last_updated":"2025-05-11T15:19:44Z","snapshot_observed_at":"2026-08-08T00:26:41.001589Z","submitted_at":"2025-02-12T18:59:56Z","title":"Bilevel Learning for Bilevel Planning","version":3},"reference_index":66,"source":"pdf_text","source_observed_at":"2026-08-08T00:02:02.712285Z"},"links":{"citing_paper":"/paper/2502.08697"},"observation_digest":"sha256:4967be84b819ce4c8ad50d8a6633a96e4c8a5e6d25ba3af62483e3c94728cd99","observation_id":"d8d51992-c589-4f38-aab1-d642afbf875e","resolution":{"observed_at":"2026-08-08T00:02:03.174874Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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":"2502.08697","last_updated":"2025-05-11T15:19:44Z","latest_version":3,"primary_category":"cs.RO","snapshot_observed_at":"2026-08-08T00:26:41.001589Z","submitted_at":"2025-02-12T18:59:56Z","title":"Bilevel Learning for Bilevel Planning"},"reference_resolution":{"displayed":66,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":13,"verified_exact":0,"verified_fuzzy":53},"total_outbound_references":66},"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 8 August 2026, this Paper Citation Record lists 66 of 66 outbound references and 4 inbound Pith citation observations for arXiv:2502.08697."}