{"as_of":"2026-08-13T08:17:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:e949c8e9547d11492afb25a4ad178f06d058f2e170bd2d39bfebb2188b0ec86e","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":1,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":1,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-13T06:32:02.005865+00:00","state":"measured"},{"denominator":1,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":1,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-10T22:29:00.454401Z","state":"measured"},{"denominator":1,"lane":"external_citation_measurements","note":"A source-named dated measurement, never combined with another source.","records_observed":0,"source":"pith","source_observed_at":"2026-08-10T22:29:01.504891Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2310.15511","last_updated":"2023-10-24T04:40:38Z","snapshot_observed_at":"2026-08-13T05:42:32.495438Z","submitted_at":"2023-10-24T04:40:38Z","title":"KITAB: Evaluating LLMs on Constraint Satisfaction for Information Retrieval","version":1},"cited_work":{"arxiv_id":"2310.15511","doi":null,"metadata_source":"pith","pith_arxiv_id":"2310.15511","snapshot_observed_at":"2026-08-10T22:29:01.504891Z","title":"KITAB: Evaluating LLMs on Constraint Satisfaction for Information Retrieval","venue":"cs.LG","work_id":"6653c622-3d51-4342-ba19-45431c09d568","year":2023},"citing_paper":{"arxiv_id":"2501.02026","last_updated":"2025-01-03T02:55:44Z","snapshot_observed_at":"2026-08-11T17:00:23.758802Z","submitted_at":"2025-01-03T02:55:44Z","title":"Recursive Decomposition of Logical Thoughts: Framework for Superior Reasoning and Knowledge Propagation in Large Language Models","version":1},"reference_index":64,"source":"arxiv_source","source_observed_at":"2026-08-10T22:29:00.454401Z"},"links":{"cited_paper":"/paper/2310.15511","citing_paper":"/paper/2501.02026"},"observation_digest":"sha256:46504babf8376cd714122c17f5525a06760cdb28824458b7468fce5e5e049971","observation_id":"5bde36fd-5e5e-459b-85c8-159d54e25f56","resolution":{"observed_at":"2026-08-10T22:29:01.509259Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+00:00","source":"retraction_watch"}],"state":"measured"}}],"links":{"evidence":"/evidence","html":"/paper/2310.15511/citation-record","integrity":"/paper/2310.15511/integrity","json":"/paper/2310.15511/citation-record.json","paper":"/paper/2310.15511"},"outbound":[],"paper":{"arxiv_id":"2310.15511","last_updated":"2023-10-24T04:40:38Z","latest_version":1,"primary_category":"cs.LG","snapshot_observed_at":"2026-08-13T05:42:32.495438Z","submitted_at":"2023-10-24T04:40:38Z","title":"KITAB: Evaluating LLMs on Constraint Satisfaction for Information Retrieval"},"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-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+00:00","source":"retraction_watch"}],"thesis":"As of 13 August 2026, this Paper Citation Record lists 0 of 0 outbound references and 1 inbound Pith citation observation for arXiv:2310.15511."}