{"as_of":"2026-08-14T08:42:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:690886eeffb8a2c7d143d81835628044bca4eea56fb20aea4c1e0fedf9fcbb59","coverage":[{"denominator":0,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":0,"source":"paper_references, paper_reference_links","source_observed_at":null,"state":"measured"},{"denominator":3,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":3,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-14T06:32:32.682623+00:00","state":"measured"},{"denominator":3,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":3,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-06T23:09:54.880216Z","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-05-12T07:11:25.984797Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2406.03367","last_updated":"2026-06-28T13:52:50Z","snapshot_observed_at":"2026-08-14T06:37:54.676811Z","submitted_at":"2024-06-05T15:21:44Z","title":"CLMASP: Coupling Large Language Models with Answer Set Programming for Robotic Task Planning","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2406.03367","snapshot_observed_at":"2026-08-06T23:09:54.880216Z","title":"Clmasp: Coupling large language models with answer set programming for robotic task planning,","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2506.19592","last_updated":"2025-06-30T14:40:24Z","snapshot_observed_at":"2026-08-14T04:46:16.065423Z","submitted_at":"2025-06-24T13:02:06Z","title":"Adaptive Domain Modeling with Language Models: A Multi-Agent Approach to Task Planning","version":2},"reference_index":21,"source":"pdf_text","source_observed_at":"2026-08-06T23:09:54.880216Z"},"links":{"cited_paper":"/paper/2406.03367","citing_paper":"/paper/2506.19592"},"observation_digest":"sha256:19424926faeaa365aeccc8c7a75c037a9094c5a705564dde13dcaa715578f1fb","observation_id":"47918340-568f-448a-b2c7-2107b6932b49","resolution":{"observed_at":"2026-08-06T23:09:54.880216Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2406.03367","last_updated":"2026-06-28T13:52:50Z","snapshot_observed_at":"2026-08-14T06:37:54.676811Z","submitted_at":"2024-06-05T15:21:44Z","title":"CLMASP: Coupling Large Language Models with Answer Set Programming for Robotic Task Planning","version":2},"cited_work":{"arxiv_id":"2406.03367","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2406.03367","snapshot_observed_at":"2026-06-30T02:16:06.069125Z","title":"arXiv preprint arXiv:2406.03367 , year=","venue":null,"work_id":"147e5e64-0ad8-4d4c-b26b-07f08bba35ab","year":null},"citing_paper":{"arxiv_id":"2605.09519","last_updated":"2026-05-10T13:05:44Z","snapshot_observed_at":"2026-08-13T06:50:52.846081Z","submitted_at":"2026-05-10T13:05:44Z","title":"Weighted Rules under the Stable Model Semantics","version":1},"reference_index":49,"source":"arxiv_source","source_observed_at":"2026-05-12T03:38:04.965252Z"},"links":{"cited_paper":"/paper/2406.03367","citing_paper":"/paper/2605.09519"},"observation_digest":"sha256:6be5ebe9763f6001e78896071fad06317138e233073034fed33a6abf411c3e94","observation_id":"e88468da-d30c-4837-84b1-222962da8119","resolution":{"observed_at":"2026-06-30T02:16:06.069125Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2406.03367","last_updated":"2026-06-28T13:52:50Z","snapshot_observed_at":"2026-08-14T06:37:54.676811Z","submitted_at":"2024-06-05T15:21:44Z","title":"CLMASP: Coupling Large Language Models with Answer Set Programming for Robotic Task Planning","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2406.03367","snapshot_observed_at":"2026-07-31T09:30:13.605232Z","title":null,"venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2607.28370","last_updated":"2026-07-30T15:30:56Z","snapshot_observed_at":"2026-08-10T00:35:16.137235Z","submitted_at":"2026-07-30T15:30:56Z","title":"Fast optics-based modeling enabling large-scale optimization of the H4 and M2 beamlines in the CERN SPS North Area","version":1},"reference_index":18,"source":"pdf_text","source_observed_at":"2026-07-31T09:30:13.605232Z"},"links":{"cited_paper":"/paper/2406.03367","citing_paper":"/paper/2607.28370"},"observation_digest":"sha256:623e10a17818e57ce7ca120bcd79e9fb006f14d7e40639d511da6ad69116ecc3","observation_id":"fd598d5b-6e41-4ed0-a4be-572a81be1b51","resolution":{"observed_at":"2026-07-31T09:30:13.605232Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"links":{"evidence":"/evidence","html":"/paper/2406.03367/citation-record","integrity":"/paper/2406.03367/integrity","json":"/paper/2406.03367/citation-record.json","paper":"/paper/2406.03367"},"outbound":[],"paper":{"arxiv_id":"2406.03367","last_updated":"2026-06-28T13:52:50Z","latest_version":2,"primary_category":"cs.AI","snapshot_observed_at":"2026-08-14T06:37:54.676811Z","submitted_at":"2024-06-05T15:21:44Z","title":"CLMASP: Coupling Large Language Models with Answer Set Programming for Robotic Task Planning"},"reference_resolution":{"displayed":0,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":0,"verified_exact":0,"verified_fuzzy":0},"total_outbound_references":0},"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-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+00:00","source":"retraction_watch"}],"thesis":"As of 14 August 2026, this Paper Citation Record lists 0 of 0 outbound references and 3 inbound Pith citation observations for arXiv:2406.03367."}