{"as_of":"2026-08-08T11:03:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:cf7bb5d31a24df3f4d3420f6a88a34dbee34b23a10a855b546733e49ff086b8a","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-08-07T22:22:04.529265Z","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/2502.09208/citation-record","integrity":"/paper/2502.09208/integrity","json":"/paper/2502.09208/citation-record.json","paper":"/paper/2502.09208"},"outbound":[{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T22:22:04.433873Z","title":"Theory and Practice of Logic Programming 18(3-4), p","venue":null,"work_id":null,"year":2018},"citing_paper":{"arxiv_id":"2502.09208","last_updated":"2025-02-13T11:46:56Z","snapshot_observed_at":"2026-08-07T22:14:59.772894Z","submitted_at":"2025-02-13T11:46:56Z","title":"Autonomous Task Completion Based on Goal-directed Answer Set Programming","version":1},"reference_index":1,"source":"pdf_text","source_observed_at":"2026-08-07T22:22:04.433873Z"},"links":{"citing_paper":"/paper/2502.09208"},"observation_digest":"sha256:20787775710ebca47f536ccfac747a6cad5f284ecee7871b7415056357e3f435","observation_id":"8747e071-fb9a-4806-bcd7-a566f338f7eb","resolution":{"observed_at":"2026-08-07T22:22:04.433873Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2310.08419","last_updated":"2024-07-18T18:24:57Z","snapshot_observed_at":"2026-07-06T02:11:23.670680Z","submitted_at":"2023-10-12T15:38:28Z","title":"Jailbreaking Black Box Large Language Models in Twenty Queries","version":4},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2310.08419","snapshot_observed_at":"2026-08-07T22:22:04.440206Z","title":"Pappas & Eric Wong (2023): Jailbreaking Black Box Large Language Models in Twenty Queries","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2502.09208","last_updated":"2025-02-13T11:46:56Z","snapshot_observed_at":"2026-08-07T22:14:59.772894Z","submitted_at":"2025-02-13T11:46:56Z","title":"Autonomous Task Completion Based on Goal-directed Answer Set Programming","version":1},"reference_index":2,"source":"pdf_text","source_observed_at":"2026-08-07T22:22:04.440206Z"},"links":{"cited_paper":"/paper/2310.08419","citing_paper":"/paper/2502.09208"},"observation_digest":"sha256:e54c0962236de0995246b108e4cb1fbfc6e5a2b57bd926e8b0d729f00d243d8a","observation_id":"78c2854c-1ee3-4a9a-b550-7532455ff26d","resolution":{"observed_at":"2026-08-07T22:22:04.440206Z","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":"arxiv_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T22:22:05.061620Z","title":"Computer Science Review 40, p","venue":null,"work_id":"3d3cdea1-80a3-4046-b789-9daa2346fd98","year":2021},"citing_paper":{"arxiv_id":"2502.09208","last_updated":"2025-02-13T11:46:56Z","snapshot_observed_at":"2026-08-07T22:14:59.772894Z","submitted_at":"2025-02-13T11:46:56Z","title":"Autonomous Task Completion Based on Goal-directed Answer Set Programming","version":1},"reference_index":3,"source":"pdf_text","source_observed_at":"2026-08-07T22:22:04.446077Z"},"links":{"citing_paper":"/paper/2502.09208"},"observation_digest":"sha256:30afef9ea2f3f520126edf19ac8474a360cd5ee6d97d2a80f61b5eb8fbdce929","observation_id":"0dd1e07d-fa2b-4a94-93c5-8162e6faecc0","resolution":{"observed_at":"2026-08-07T22:22:05.066193Z","resolver_source":"arxiv_id_nonexistent","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":"1405.3694","last_updated":"2014-05-14T21:33:07Z","snapshot_observed_at":"2026-08-01T16:46:03.642637Z","submitted_at":"2014-05-14T21:33:07Z","title":"Clingo = ASP + Control: Preliminary Report","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1405.3694","snapshot_observed_at":"2026-08-07T22:22:04.451295Z","title":"Gebser, Roland Kaminski, Benjamin Kaufmann & Torsten Schaub (2014): Clingo = ASP + Control: Preliminary Report","venue":null,"work_id":null,"year":2014},"citing_paper":{"arxiv_id":"2502.09208","last_updated":"2025-02-13T11:46:56Z","snapshot_observed_at":"2026-08-07T22:14:59.772894Z","submitted_at":"2025-02-13T11:46:56Z","title":"Autonomous Task Completion Based on Goal-directed Answer Set Programming","version":1},"reference_index":4,"source":"pdf_text","source_observed_at":"2026-08-07T22:22:04.451295Z"},"links":{"cited_paper":"/paper/1405.3694","citing_paper":"/paper/2502.09208"},"observation_digest":"sha256:37a370c776e38d188d107953bbef9918ff1951a929fec5be550dc544da4ab353","observation_id":"fb2c4099-258e-4394-ad5f-665c7c43ad9f","resolution":{"observed_at":"2026-08-07T22:22:04.451295Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T22:22:04.457428Z","title":"Cambridge University Press, doi:10.1017/CBO9781139342124","venue":null,"work_id":null,"year":2014},"citing_paper":{"arxiv_id":"2502.09208","last_updated":"2025-02-13T11:46:56Z","snapshot_observed_at":"2026-08-07T22:14:59.772894Z","submitted_at":"2025-02-13T11:46:56Z","title":"Autonomous Task Completion Based on Goal-directed Answer Set Programming","version":1},"reference_index":5,"source":"pdf_text","source_observed_at":"2026-08-07T22:22:04.457428Z"},"links":{"citing_paper":"/paper/2502.09208"},"observation_digest":"sha256:9f61af718a8f256fb87160428a0dac0e7ceb5697b07e0c8a331e6cce1a7b0613","observation_id":"509d840c-de52-420d-8365-447a71941eb0","resolution":{"observed_at":"2026-08-07T22:22:04.457428Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T22:22:04.463173Z","title":"Applied AI Letters 2(4), p","venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2502.09208","last_updated":"2025-02-13T11:46:56Z","snapshot_observed_at":"2026-08-07T22:14:59.772894Z","submitted_at":"2025-02-13T11:46:56Z","title":"Autonomous Task Completion Based on Goal-directed Answer Set Programming","version":1},"reference_index":6,"source":"pdf_text","source_observed_at":"2026-08-07T22:22:04.463173Z"},"links":{"citing_paper":"/paper/2502.09208"},"observation_digest":"sha256:c2325bc1d1af52cc8d7d75f85332e2e918cac39f1fef32c00257111f4267da1a","observation_id":"1bb9c7f3-d70b-4598-8911-7f9f14e1ebc4","resolution":{"observed_at":"2026-08-07T22:22:04.463173Z","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":"10.1007/978-3-031-35254-6_28","metadata_source":"doi_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T22:22:04.654674Z","title":"Prolog: The Next 50 Y ears, p","venue":null,"work_id":"62c0ff04-dafc-471f-b4d5-724f9c5e31e6","year":2023},"citing_paper":{"arxiv_id":"2502.09208","last_updated":"2025-02-13T11:46:56Z","snapshot_observed_at":"2026-08-07T22:14:59.772894Z","submitted_at":"2025-02-13T11:46:56Z","title":"Autonomous Task Completion Based on Goal-directed Answer Set Programming","version":1},"reference_index":7,"source":"pdf_text","source_observed_at":"2026-08-07T22:22:04.469028Z"},"links":{"citing_paper":"/paper/2502.09208"},"observation_digest":"sha256:b97ee154c9a6934e1fa6c590a9a9f7a2050f04ba9f295dd493c75d5fe726a642","observation_id":"21b17cf5-01c4-46ab-a975-a22c5e793782","resolution":{"observed_at":"2026-08-07T22:22:04.660648Z","resolver_source":"doi","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":"2211.08064","last_updated":"2023-03-07T02:46:34Z","snapshot_observed_at":"2026-07-06T14:18:30.314936Z","submitted_at":"2022-11-15T11:34:30Z","title":"Physics-Informed Machine Learning: A Survey on Problems, Methods and Applications","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2211.08064","snapshot_observed_at":"2026-08-07T22:22:04.474739Z","title":"arXiv:2211.08064","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2502.09208","last_updated":"2025-02-13T11:46:56Z","snapshot_observed_at":"2026-08-07T22:14:59.772894Z","submitted_at":"2025-02-13T11:46:56Z","title":"Autonomous Task Completion Based on Goal-directed Answer Set Programming","version":1},"reference_index":8,"source":"pdf_text","source_observed_at":"2026-08-07T22:22:04.474739Z"},"links":{"cited_paper":"/paper/2211.08064","citing_paper":"/paper/2502.09208"},"observation_digest":"sha256:0f6ce594284ad169116a434bdd464ac82e505666993de612853bba4e3abfa972","observation_id":"03b9eec3-e558-4027-9994-010f1bfaf8a9","resolution":{"observed_at":"2026-08-07T22:22:04.474739Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2311.05232","last_updated":"2024-11-19T12:42:45Z","snapshot_observed_at":"2026-07-06T16:45:07.733095Z","submitted_at":"2023-11-09T09:25:37Z","title":"A Survey on Hallucination in Large Language Models: Principles, Taxonomy, Challenges, and Open Questions","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2311.05232","snapshot_observed_at":"2026-08-07T22:22:04.480337Z","title":"arXiv:2311.05232","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2502.09208","last_updated":"2025-02-13T11:46:56Z","snapshot_observed_at":"2026-08-07T22:14:59.772894Z","submitted_at":"2025-02-13T11:46:56Z","title":"Autonomous Task Completion Based on Goal-directed Answer Set Programming","version":1},"reference_index":9,"source":"pdf_text","source_observed_at":"2026-08-07T22:22:04.480337Z"},"links":{"cited_paper":"/paper/2311.05232","citing_paper":"/paper/2502.09208"},"observation_digest":"sha256:5167127d1a5bbc7bb54da39a580bdd3005b0c33b19d3ac06a89c155384aa5066","observation_id":"2b071ab4-df62-4cae-a7ff-02ebd90cb5fc","resolution":{"observed_at":"2026-08-07T22:22:04.480337Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2201.07207","last_updated":"2022-03-08T06:47:17Z","snapshot_observed_at":"2026-08-06T08:07:23.771593Z","submitted_at":"2022-01-18T18:59:45Z","title":"Language Models as Zero-Shot Planners: Extracting Actionable Knowledge for Embodied Agents","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2201.07207","snapshot_observed_at":"2026-08-07T22:22:04.486466Z","title":null,"venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2502.09208","last_updated":"2025-02-13T11:46:56Z","snapshot_observed_at":"2026-08-07T22:14:59.772894Z","submitted_at":"2025-02-13T11:46:56Z","title":"Autonomous Task Completion Based on Goal-directed Answer Set Programming","version":1},"reference_index":10,"source":"pdf_text","source_observed_at":"2026-08-07T22:22:04.486466Z"},"links":{"cited_paper":"/paper/2201.07207","citing_paper":"/paper/2502.09208"},"observation_digest":"sha256:8836c4f69ce4d796e325c89e4c94ee7a9392ae0b6b28cfa37dcba7d0ac94f6f6","observation_id":"7dd0974d-6b6b-4007-81c8-900fcb108520","resolution":{"observed_at":"2026-08-07T22:22:04.486466Z","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":"10.1007/s11370-021-00398-z","metadata_source":"doi_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T22:22:04.620946Z","title":"Intelligent Service Robotics 14(5), pp","venue":null,"work_id":"66ba0204-2054-4b8a-b85b-df30d066641d","year":2021},"citing_paper":{"arxiv_id":"2502.09208","last_updated":"2025-02-13T11:46:56Z","snapshot_observed_at":"2026-08-07T22:14:59.772894Z","submitted_at":"2025-02-13T11:46:56Z","title":"Autonomous Task Completion Based on Goal-directed Answer Set Programming","version":1},"reference_index":11,"source":"pdf_text","source_observed_at":"2026-08-07T22:22:04.492041Z"},"links":{"citing_paper":"/paper/2502.09208"},"observation_digest":"sha256:6a766d0091e30fbe19006f9e19aa9f7e0b1f0ddee6d5eb32b8286dbe3330ba0e","observation_id":"f4155e20-28a6-4f12-ba02-5ccc86537524","resolution":{"observed_at":"2026-08-07T22:22:04.626050Z","resolver_source":"doi","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-08-07T22:22:04.497222Z","title":"New Generation Computing 8(4), p","venue":null,"work_id":null,"year":1991},"citing_paper":{"arxiv_id":"2502.09208","last_updated":"2025-02-13T11:46:56Z","snapshot_observed_at":"2026-08-07T22:14:59.772894Z","submitted_at":"2025-02-13T11:46:56Z","title":"Autonomous Task Completion Based on Goal-directed Answer Set Programming","version":1},"reference_index":12,"source":"pdf_text","source_observed_at":"2026-08-07T22:22:04.497222Z"},"links":{"citing_paper":"/paper/2502.09208"},"observation_digest":"sha256:ded81fcf9f01e40261c7602f21d24139eb59de8bc9716542f8321fbe6adf0f78","observation_id":"365e4ff9-77cf-44d1-90f2-e8af89cb531b","resolution":{"observed_at":"2026-08-07T22:22:04.497222Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1806.07011","last_updated":"2018-06-19T02:16:44Z","snapshot_observed_at":"2026-08-03T16:15:12.385367Z","submitted_at":"2018-06-19T02:16:44Z","title":"VirtualHome: Simulating Household Activities via Programs","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1806.07011","snapshot_observed_at":"2026-08-07T22:22:04.502150Z","title":"arXiv:1806.07011","venue":null,"work_id":null,"year":2018},"citing_paper":{"arxiv_id":"2502.09208","last_updated":"2025-02-13T11:46:56Z","snapshot_observed_at":"2026-08-07T22:14:59.772894Z","submitted_at":"2025-02-13T11:46:56Z","title":"Autonomous Task Completion Based on Goal-directed Answer Set Programming","version":1},"reference_index":13,"source":"pdf_text","source_observed_at":"2026-08-07T22:22:04.502150Z"},"links":{"cited_paper":"/paper/1806.07011","citing_paper":"/paper/2502.09208"},"observation_digest":"sha256:bf4cf5879bb175d7079768277f7b83367f32fded771feb8c7216a2296e1e7f6a","observation_id":"b2e4b4fa-f3a6-4da8-b0ff-574dfb08f516","resolution":{"observed_at":"2026-08-07T22:22:04.502150Z","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":"10.4204/eptcs.385.27","metadata_source":"doi_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T22:22:04.592469Z","title":"Electronic Proceedings in The- oretical Computer Science 385, pp","venue":null,"work_id":"be8542f6-f1ce-48f1-9bab-f66bfcc11d84","year":2023},"citing_paper":{"arxiv_id":"2502.09208","last_updated":"2025-02-13T11:46:56Z","snapshot_observed_at":"2026-08-07T22:14:59.772894Z","submitted_at":"2025-02-13T11:46:56Z","title":"Autonomous Task Completion Based on Goal-directed Answer Set Programming","version":1},"reference_index":14,"source":"pdf_text","source_observed_at":"2026-08-07T22:22:04.506649Z"},"links":{"citing_paper":"/paper/2502.09208"},"observation_digest":"sha256:ef855f5668e4ab01fb1550f49bb24dc92b9bff7a9d0f98279840f4acbd7aba42","observation_id":"739a9cf0-815e-472b-9524-793d1c50b8e4","resolution":{"observed_at":"2026-08-07T22:22:04.598672Z","resolver_source":"doi","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":"arxiv_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T22:22:04.911960Z","title":"2020 IEEE/CVF Conference on Computer Vision and Pattern Recognition (CVPR) , pp","venue":null,"work_id":"8c221e69-2a8c-4d5f-b998-6af8fdabf10e","year":2019},"citing_paper":{"arxiv_id":"2502.09208","last_updated":"2025-02-13T11:46:56Z","snapshot_observed_at":"2026-08-07T22:14:59.772894Z","submitted_at":"2025-02-13T11:46:56Z","title":"Autonomous Task Completion Based on Goal-directed Answer Set Programming","version":1},"reference_index":15,"source":"pdf_text","source_observed_at":"2026-08-07T22:22:04.510935Z"},"links":{"citing_paper":"/paper/2502.09208"},"observation_digest":"sha256:8cbb7a29cb71b1b63ab470d97cf6d05a5232ea0bb0f705e5f02fbc1705922acd","observation_id":"0205de04-5bdb-47ed-8175-8a3b646d9d93","resolution":{"observed_at":"2026-08-07T22:22:04.933922Z","resolver_source":"arxiv_id_nonexistent","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":"10.18653/v1/w19-4807","metadata_source":"doi_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T22:22:04.573730Z","title":"56–62, doi:10.18653/v1/W19-4807","venue":null,"work_id":"3d7524c4-8f22-4dbb-ae52-7278c29d4534","year":2019},"citing_paper":{"arxiv_id":"2502.09208","last_updated":"2025-02-13T11:46:56Z","snapshot_observed_at":"2026-08-07T22:14:59.772894Z","submitted_at":"2025-02-13T11:46:56Z","title":"Autonomous Task Completion Based on Goal-directed Answer Set Programming","version":1},"reference_index":16,"source":"pdf_text","source_observed_at":"2026-08-07T22:22:04.515396Z"},"links":{"citing_paper":"/paper/2502.09208"},"observation_digest":"sha256:52e72052eaaddb1ea70384879c4c639f40ed11e71f2961b661f3bd8b3260038d","observation_id":"979c57ec-1b0c-43f4-8ab0-a644579510a0","resolution":{"observed_at":"2026-08-07T22:22:04.579818Z","resolver_source":"doi","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":"2204.02372","last_updated":"2023-07-07T19:44:54Z","snapshot_observed_at":"2026-08-05T17:56:25.936147Z","submitted_at":"2022-04-05T17:25:22Z","title":"Jump-Start Reinforcement Learning","version":2},"cited_work":{"arxiv_id":"2204.02372","doi":null,"metadata_source":"pith","pith_arxiv_id":"2204.02372","snapshot_observed_at":"2026-08-07T22:22:04.776263Z","title":"Jump-Start Reinforcement Learning","venue":"cs.LG","work_id":"ddab1693-36de-473b-afd2-2d47bb73f3cd","year":2022},"citing_paper":{"arxiv_id":"2502.09208","last_updated":"2025-02-13T11:46:56Z","snapshot_observed_at":"2026-08-07T22:14:59.772894Z","submitted_at":"2025-02-13T11:46:56Z","title":"Autonomous Task Completion Based on Goal-directed Answer Set Programming","version":1},"reference_index":17,"source":"pdf_text","source_observed_at":"2026-08-07T22:22:04.519921Z"},"links":{"cited_paper":"/paper/2204.02372","citing_paper":"/paper/2502.09208"},"observation_digest":"sha256:fbd2fe81b96fae7ce24864c5ea859c81668713bdccc245606cb9338ee07d52c9","observation_id":"a277e0fa-5943-46bb-b9d1-837d9b40cf9f","resolution":{"observed_at":"2026-08-07T22:22:04.782188Z","resolver_source":"local_arxiv","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-08-07T22:22:04.524429Z","title":null,"venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2502.09208","last_updated":"2025-02-13T11:46:56Z","snapshot_observed_at":"2026-08-07T22:14:59.772894Z","submitted_at":"2025-02-13T11:46:56Z","title":"Autonomous Task Completion Based on Goal-directed Answer Set Programming","version":1},"reference_index":18,"source":"pdf_text","source_observed_at":"2026-08-07T22:22:04.524429Z"},"links":{"citing_paper":"/paper/2502.09208"},"observation_digest":"sha256:354ee8c6fadaf8789740d3843be56868f5931e0d0c35acb1fba586df9e87af7c","observation_id":"74419179-c029-4f3a-9f3a-daa6ef5a1994","resolution":{"observed_at":"2026-08-07T22:22:04.524429Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2112.15319","last_updated":"2023-03-03T07:11:25Z","snapshot_observed_at":"2026-08-03T18:52:59.666520Z","submitted_at":"2021-12-31T06:34:32Z","title":"A Critical Review of Inductive Logic Programming Techniques for Explainable AI","version":3},"cited_work":{"arxiv_id":"2112.15319","doi":null,"metadata_source":"pith","pith_arxiv_id":"2112.15319","snapshot_observed_at":"2026-08-07T22:22:04.726839Z","title":"A Critical Review of Inductive Logic Programming Techniques for Explainable AI","venue":"cs.LG","work_id":"96f430ed-daaf-4cda-8e68-955564b70dee","year":2021},"citing_paper":{"arxiv_id":"2502.09208","last_updated":"2025-02-13T11:46:56Z","snapshot_observed_at":"2026-08-07T22:14:59.772894Z","submitted_at":"2025-02-13T11:46:56Z","title":"Autonomous Task Completion Based on Goal-directed Answer Set Programming","version":1},"reference_index":19,"source":"pdf_text","source_observed_at":"2026-08-07T22:22:04.529265Z"},"links":{"cited_paper":"/paper/2112.15319","citing_paper":"/paper/2502.09208"},"observation_digest":"sha256:9020096a8b6e829a61f29de6fe064d1684c2e964631b80740ff44f8b7c66b5b9","observation_id":"3a700413-afdc-452b-b34a-2212c0d73362","resolution":{"observed_at":"2026-08-07T22:22:04.741345Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}}],"paper":{"arxiv_id":"2502.09208","last_updated":"2025-02-13T11:46:56Z","latest_version":1,"primary_category":"cs.LO","snapshot_observed_at":"2026-08-07T22:14:59.772894Z","submitted_at":"2025-02-13T11:46:56Z","title":"Autonomous Task Completion Based on Goal-directed Answer Set Programming"},"reference_resolution":{"displayed":19,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":11,"verified_exact":8,"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:2502.09208."}