{"as_of":"2026-08-08T10:13:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:879080208ef76454be6daf496f3df882df1a60341d8102c93bfb67718ab1dd40","coverage":[{"denominator":19,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":19,"source":"paper_references, paper_reference_links","source_observed_at":"2026-06-29T16:45:44.659577Z","state":"measured"},{"denominator":19,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":19,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-08T06:32:00.761636+00:00","state":"measured"},{"denominator":0,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":0,"source":"paper_references, paper_reference_links","source_observed_at":null,"state":"measured"},{"denominator":1,"lane":"external_citation_measurements","note":"A source-named dated measurement, never combined with another source.","records_observed":0,"source":"cited_works","source_observed_at":null,"state":"measured"}],"external_citation_measurements":[],"inbound":[],"links":{"evidence":"/evidence","html":"/paper/2605.26828/citation-record","integrity":"/paper/2605.26828/integrity","json":"/paper/2605.26828/citation-record.json","paper":"/paper/2605.26828"},"outbound":[{"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":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-06-29T16:45:44.659577Z","title":"VisualPredicator: Learning abstract world models with neuro-symbolic predicates for robot planning,","venue":null,"work_id":null,"year":null},"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":2,"source":"pdf_text","source_observed_at":"2026-06-29T16:45:44.659577Z"},"links":{"citing_paper":"/paper/2605.26828"},"observation_digest":"sha256:c38ebbf5e4460053c7982274dfe3a1cc727752f9d98364a3d1de509802ac6c36","observation_id":"b4db7c45-41f4-43f7-921a-0d444f7977c5","resolution":{"observed_at":"2026-06-29T16:45:44.659577Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-06-29T16:45:44.659577Z","title":"71 952–71 980","venue":null,"work_id":null,"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":3,"source":"pdf_text","source_observed_at":"2026-06-29T16:45:44.659577Z"},"links":{"citing_paper":"/paper/2605.26828"},"observation_digest":"sha256:ee6bc99ec72739045b75eefbd6b2df6d4bbcad715fdf3ae6ae0106297a32af26","observation_id":"bf045aea-f80e-4841-99bc-bde71a967d80","resolution":{"observed_at":"2026-06-29T16:45:44.659577Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-06-29T16:45:44.659577Z","title":"Embodied active learning of relational state abstractions for bilevel planning,","venue":null,"work_id":null,"year":2023},"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":4,"source":"pdf_text","source_observed_at":"2026-06-29T16:45:44.659577Z"},"links":{"citing_paper":"/paper/2605.26828"},"observation_digest":"sha256:27549bbdc4c2ad906d47613c0b881c9da9c057bc4e0b131022b1d99a6cda5b91","observation_id":"c0e3baa9-b424-4a8b-9287-17ff95ad19ad","resolution":{"observed_at":"2026-06-29T16:45:44.659577Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-06-29T16:45:44.659577Z","title":"Learning neuro-symbolic skills for bilevel planning,","venue":null,"work_id":null,"year":2023},"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":5,"source":"pdf_text","source_observed_at":"2026-06-29T16:45:44.659577Z"},"links":{"citing_paper":"/paper/2605.26828"},"observation_digest":"sha256:9bd8bc9c1fac89d5fa5c887ff3d15cf97971f2f889d4bc3c317d4d051a01320d","observation_id":"ace647d5-fbdb-42c4-bd50-77d8928e020b","resolution":{"observed_at":"2026-06-29T16:45:44.659577Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-06-29T16:45:44.659577Z","title":"Learning programs by learning from failures,","venue":null,"work_id":null,"year":2021},"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":6,"source":"pdf_text","source_observed_at":"2026-06-29T16:45:44.659577Z"},"links":{"citing_paper":"/paper/2605.26828"},"observation_digest":"sha256:c612bc7efed204616afd9a910bdf1bc0a1faa70285d4d9223c375fd757b46c4c","observation_id":"4fe56a43-874a-48c8-86cd-905e09644c46","resolution":{"observed_at":"2026-06-29T16:45:44.659577Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-06-29T16:45:44.659577Z","title":"Inductive learning of robot task knowledge from raw data and online expert feedback,","venue":null,"work_id":null,"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":7,"source":"pdf_text","source_observed_at":"2026-06-29T16:45:44.659577Z"},"links":{"citing_paper":"/paper/2605.26828"},"observation_digest":"sha256:1fd46682be5fb3cfc4c922d5a03a6db4bda4e029107eecbc2964262b76991c6a","observation_id":"19412538-d96e-456d-8a27-1d7f44eabf9c","resolution":{"observed_at":"2026-06-29T16:45:44.659577Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-06-29T16:45:44.659577Z","title":"Relational af- fordance learning for task-dependent robot grasping,","venue":null,"work_id":null,"year":2017},"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":8,"source":"pdf_text","source_observed_at":"2026-06-29T16:45:44.659577Z"},"links":{"citing_paper":"/paper/2605.26828"},"observation_digest":"sha256:80ffe480ea9a127fea433c343f56af40ff423c61d5b4966f90baabf941fafce2","observation_id":"e0dc8df7-9a59-4711-9f75-cc387cfdd40f","resolution":{"observed_at":"2026-06-29T16:45:44.659577Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-06-29T16:45:44.659577Z","title":"The robot engineer","venue":null,"work_id":null,"year":2015},"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":9,"source":"pdf_text","source_observed_at":"2026-06-29T16:45:44.659577Z"},"links":{"citing_paper":"/paper/2605.26828"},"observation_digest":"sha256:0ad32ca9690a2c4794d9149362c6a5f64f9c0a74dc49af366250a46b2c41129f","observation_id":"64ff32dd-9ab5-4171-b944-b92d07241952","resolution":{"observed_at":"2026-06-29T16:45:44.659577Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-06-29T16:45:44.659577Z","title":"A relational approach to tool-use learning in robots,","venue":null,"work_id":null,"year":2012},"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":10,"source":"pdf_text","source_observed_at":"2026-06-29T16:45:44.659577Z"},"links":{"citing_paper":"/paper/2605.26828"},"observation_digest":"sha256:046cd19ab5f755eb239e58dc7b641b665958489144186b0e9ee4bd43ad20b29f","observation_id":"048476f6-835e-44af-bd28-30a592301b6d","resolution":{"observed_at":"2026-06-29T16:45:44.659577Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-06-29T16:45:44.659577Z","title":"Closed loop interactive embodied reasoning for robot manipulation,","venue":null,"work_id":null,"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":11,"source":"pdf_text","source_observed_at":"2026-06-29T16:45:44.659577Z"},"links":{"citing_paper":"/paper/2605.26828"},"observation_digest":"sha256:6f220157c479aefc83b8591da1a7654be027509594a6e209b9a018e9d510184a","observation_id":"4ac63ca6-9ac3-41fe-a3cb-0eb6e333c1d1","resolution":{"observed_at":"2026-06-29T16:45:44.659577Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-06-29T16:45:44.659577Z","title":"Inductive logic programming at 30: a new introduction,","venue":null,"work_id":null,"year":2022},"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":12,"source":"pdf_text","source_observed_at":"2026-06-29T16:45:44.659577Z"},"links":{"citing_paper":"/paper/2605.26828"},"observation_digest":"sha256:ef516384705e61bd5f06a0ba6cdaf0b0e0ed3acdb6d13f06ab30e3d950b2f8f4","observation_id":"5c5f9c34-de15-4842-89b6-5878d116512f","resolution":{"observed_at":"2026-06-29T16:45:44.659577Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-06-29T16:45:44.659577Z","title":"A critical review of inductive logic programming techniques for explainable AI,","venue":null,"work_id":null,"year":2023},"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":13,"source":"pdf_text","source_observed_at":"2026-06-29T16:45:44.659577Z"},"links":{"citing_paper":"/paper/2605.26828"},"observation_digest":"sha256:a12444696528d4a34e8abf925d54ccd8cee30e9229631aa7896921f988ed4d54","observation_id":"d08df2ec-a440-4023-b90d-842201e0f634","resolution":{"observed_at":"2026-06-29T16:45:44.659577Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-06-29T16:45:44.659577Z","title":"The birth of Prolog,","venue":null,"work_id":null,"year":1996},"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":14,"source":"pdf_text","source_observed_at":"2026-06-29T16:45:44.659577Z"},"links":{"citing_paper":"/paper/2605.26828"},"observation_digest":"sha256:d2b6ec2358a4122010f169342e41b814755f5e3453a57a47ab1aa79a537259f8","observation_id":"e953a4d6-a2c4-4d12-a77b-501f3c694d5b","resolution":{"observed_at":"2026-06-29T16:45:44.659577Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-06-29T16:45:44.659577Z","title":"Predicate invention for bilevel planning,","venue":null,"work_id":null,"year":2023},"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":15,"source":"pdf_text","source_observed_at":"2026-06-29T16:45:44.659577Z"},"links":{"citing_paper":"/paper/2605.26828"},"observation_digest":"sha256:4b19f1a2ae844c7c8717c2c1b31f8d69bbbcb86588de68f3825eb59a360dc0be","observation_id":"c3917c06-207c-44de-966a-17cf649fbc0e","resolution":{"observed_at":"2026-06-29T16:45:44.659577Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-06-29T16:45:44.659577Z","title":"Learning efficient abstract planning models that choose what to predict,","venue":null,"work_id":null,"year":2023},"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":16,"source":"pdf_text","source_observed_at":"2026-06-29T16:45:44.659577Z"},"links":{"citing_paper":"/paper/2605.26828"},"observation_digest":"sha256:f089b40170e72c2a3181548ddea52805099a09151cca9382c78f1b3fa65d9590","observation_id":"72f4eedb-6550-4a85-8659-2cb66babbd48","resolution":{"observed_at":"2026-06-29T16:45:44.659577Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-06-29T16:45:44.659577Z","title":"Scallop: A language for neurosymbolic programming,","venue":null,"work_id":null,"year":2023},"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":17,"source":"pdf_text","source_observed_at":"2026-06-29T16:45:44.659577Z"},"links":{"citing_paper":"/paper/2605.26828"},"observation_digest":"sha256:a19d4ad35a00ed37f160d9754e47853c3376950733341063fdbd48e021d0e7df","observation_id":"b2e97078-9faa-4aff-b716-7cfb008ba2a5","resolution":{"observed_at":"2026-06-29T16:45:44.659577Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-06-29T16:45:44.659577Z","title":"Scallop: From probabilistic deductive databases to scalable differen- tiable reasoning,","venue":null,"work_id":null,"year":2021},"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":18,"source":"pdf_text","source_observed_at":"2026-06-29T16:45:44.659577Z"},"links":{"citing_paper":"/paper/2605.26828"},"observation_digest":"sha256:b7e3ccfee443e41a5a283cf9b8957be2b174319dd80053ae190228ea5a72ae43","observation_id":"033f865c-d52f-4f6e-8585-21bae0d4cfc7","resolution":{"observed_at":"2026-06-29T16:45:44.659577Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-06-29T16:45:44.659577Z","title":"Towards probabilistic inductive logic programming with neurosymbolic inference and relaxation,","venue":null,"work_id":null,"year":2024},"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":19,"source":"pdf_text","source_observed_at":"2026-06-29T16:45:44.659577Z"},"links":{"citing_paper":"/paper/2605.26828"},"observation_digest":"sha256:70532e7cb89052d86484bee250e5bd33859e7d1505915b873d0bf99bcd6704c2","observation_id":"3ef06148-aef4-4de8-a85f-2c726b1f34c8","resolution":{"observed_at":"2026-06-29T16:45:44.659577Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"paper":{"arxiv_id":"2605.26828","last_updated":"2026-05-26T10:45:29Z","latest_version":1,"primary_category":"cs.RO","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"},"reference_resolution":{"displayed":19,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":18,"verified_exact":1,"verified_fuzzy":0},"total_outbound_references":19},"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 19 of 19 outbound references and 0 inbound Pith citation observations for arXiv:2605.26828."}