{"as_of":"2026-08-07T15:26:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:0ff35a936caacb53e5650e813c3f66fab4ece0d1932243e784d5d32638c380ce","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":7,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":7,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-07T06:34:17.273281+00:00","state":"measured"},{"denominator":7,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":7,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-07T05:43:39.255176Z","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-22T23:10:40.938077Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2312.14890","last_updated":"2024-02-12T17:30:25Z","snapshot_observed_at":"2026-07-06T17:07:19.721701Z","submitted_at":"2023-12-22T18:07:44Z","title":"NPHardEval: Dynamic Benchmark on Reasoning Ability of Large Language Models via Complexity Classes","version":4},"cited_work":{"arxiv_id":"2312.14890","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2312.14890","snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"arXiv preprint arXiv:2312.14890 , year=","venue":null,"work_id":"a5db2275-c382-4765-8b23-1cae26b72431","year":2024},"citing_paper":{"arxiv_id":"2406.04244","last_updated":"2024-06-06T16:41:39Z","snapshot_observed_at":"2026-07-30T15:43:06.151242Z","submitted_at":"2024-06-06T16:41:39Z","title":"Benchmark Data Contamination of Large Language Models: A Survey","version":1},"reference_index":44,"source":"pdf_text","source_observed_at":"2026-05-22T23:10:40.420241Z"},"links":{"cited_paper":"/paper/2312.14890","citing_paper":"/paper/2406.04244"},"observation_digest":"sha256:53134208994ce483c26b58e502afbd955383621634a44c47d2e94b9f898ebd39","observation_id":"b40b5125-ae74-438d-832d-2b808802dce9","resolution":{"observed_at":"2026-05-22T23:10:40.940622Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2312.14890","last_updated":"2024-02-12T17:30:25Z","snapshot_observed_at":"2026-07-06T17:07:19.721701Z","submitted_at":"2023-12-22T18:07:44Z","title":"NPHardEval: Dynamic Benchmark on Reasoning Ability of Large Language Models via Complexity Classes","version":4},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2312.14890","snapshot_observed_at":"2026-08-07T05:43:39.255176Z","title":"Nphardeval: Dynamic benchmark on reasoning ability of large language models via complexity classes","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2506.07202","last_updated":"2025-06-08T15:52:38Z","snapshot_observed_at":"2026-08-07T05:37:12.085602Z","submitted_at":"2025-06-08T15:52:38Z","title":"Reasoning Multimodal Large Language Model: Data Contamination and Dynamic Evaluation","version":1},"reference_index":8,"source":"pdf_text","source_observed_at":"2026-08-07T05:43:39.255176Z"},"links":{"cited_paper":"/paper/2312.14890","citing_paper":"/paper/2506.07202"},"observation_digest":"sha256:dc417cb8cc260f23c2092e54a4b64df9ef9430955f4acf2ab96588102210f0b7","observation_id":"145fe6b8-60a8-4bd3-a933-6aa0a5eaad46","resolution":{"observed_at":"2026-08-07T05:43:39.255176Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2312.14890","last_updated":"2024-02-12T17:30:25Z","snapshot_observed_at":"2026-07-06T17:07:19.721701Z","submitted_at":"2023-12-22T18:07:44Z","title":"NPHardEval: Dynamic Benchmark on Reasoning Ability of Large Language Models via Complexity Classes","version":4},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2312.14890","snapshot_observed_at":"2026-08-07T04:28:40.881171Z","title":"Nphardeval: Dynamic benchmark on reasoning ability of large language models via complexity classes","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2506.10527","last_updated":"2025-06-12T09:47:02Z","snapshot_observed_at":"2026-08-07T04:21:30.224722Z","submitted_at":"2025-06-12T09:47:02Z","title":"LogiPlan: A Structured Benchmark for Logical Planning and Relational Reasoning in LLMs","version":1},"reference_index":6,"source":"arxiv_source","source_observed_at":"2026-08-07T04:28:40.881171Z"},"links":{"cited_paper":"/paper/2312.14890","citing_paper":"/paper/2506.10527"},"observation_digest":"sha256:63e44a169737a352a8af9373b8198bf1ce3e8f256f2d3817de9bfc225937091d","observation_id":"ab83d070-3c04-44dc-b9e6-6c70cba195da","resolution":{"observed_at":"2026-08-07T04:28:40.881171Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2312.14890","last_updated":"2024-02-12T17:30:25Z","snapshot_observed_at":"2026-07-06T17:07:19.721701Z","submitted_at":"2023-12-22T18:07:44Z","title":"NPHardEval: Dynamic Benchmark on Reasoning Ability of Large Language Models via Complexity Classes","version":4},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2312.14890","snapshot_observed_at":"2026-08-07T04:23:50.574907Z","title":"Nphardeval: Dynamic benchmark on reasoning ability of large language models via complexity classes.arXiv preprint arXiv:2312.14890, 2023","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2506.10764","last_updated":"2025-06-12T14:46:41Z","snapshot_observed_at":"2026-08-07T11:34:37.934949Z","submitted_at":"2025-06-12T14:46:41Z","title":"OPT-BENCH: Evaluating LLM Agent on Large-Scale Search Spaces Optimization Problems","version":1},"reference_index":10,"source":"pdf_text","source_observed_at":"2026-08-07T04:23:50.574907Z"},"links":{"cited_paper":"/paper/2312.14890","citing_paper":"/paper/2506.10764"},"observation_digest":"sha256:7d2c96da162de5a72af036745dba84982797e6f03e1ec0f6be26a5848f6012cb","observation_id":"54c5a251-52c7-496e-97db-ec3ed7ebaf2d","resolution":{"observed_at":"2026-08-07T04:23:50.574907Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2312.14890","last_updated":"2024-02-12T17:30:25Z","snapshot_observed_at":"2026-07-06T17:07:19.721701Z","submitted_at":"2023-12-22T18:07:44Z","title":"NPHardEval: Dynamic Benchmark on Reasoning Ability of Large Language Models via Complexity Classes","version":4},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2312.14890","snapshot_observed_at":"2026-08-06T23:27:54.627307Z","title":"Nphardeval: Dynamic benchmark on reasoning ability of large language models via complexity classes,","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2506.18178","last_updated":"2025-06-22T21:22:07Z","snapshot_observed_at":"2026-08-06T23:20:38.358369Z","submitted_at":"2025-06-22T21:22:07Z","title":"Integrating LLMs and Digital Twins for Adaptive Multi-Robot Task Allocation in Construction","version":1},"reference_index":56,"source":"pdf_text","source_observed_at":"2026-08-06T23:27:54.627307Z"},"links":{"cited_paper":"/paper/2312.14890","citing_paper":"/paper/2506.18178"},"observation_digest":"sha256:78309759f4d771a3829e43ec1040062a6af82e715db4750738c0a8b5a25f8dfc","observation_id":"e246aa72-431c-45c7-9abf-971d75dd7ba9","resolution":{"observed_at":"2026-08-06T23:27:54.627307Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2312.14890","last_updated":"2024-02-12T17:30:25Z","snapshot_observed_at":"2026-07-06T17:07:19.721701Z","submitted_at":"2023-12-22T18:07:44Z","title":"NPHardEval: Dynamic Benchmark on Reasoning Ability of Large Language Models via Complexity Classes","version":4},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2312.14890","snapshot_observed_at":"2026-08-05T00:03:58.509677Z","title":"Nphardeval: Dynamic benchmark on reasoning ability of large language models via complexity classes","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2509.06174","last_updated":"2025-09-07T19:00:44Z","snapshot_observed_at":"2026-08-07T08:58:49.156790Z","submitted_at":"2025-09-07T19:00:44Z","title":"From Long to Short: LLMs Excel at Trimming Own Reasoning Chains","version":1},"reference_index":10,"source":"pdf_text","source_observed_at":"2026-08-05T00:03:58.509677Z"},"links":{"cited_paper":"/paper/2312.14890","citing_paper":"/paper/2509.06174"},"observation_digest":"sha256:757d961046cad0aeb7b560adce9a3fc1ff05973bcb8dc3ee16a229db29d4e4e3","observation_id":"853e4453-753f-4fbd-8832-3fb5fb32b6d8","resolution":{"observed_at":"2026-08-05T00:03:58.509677Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2312.14890","last_updated":"2024-02-12T17:30:25Z","snapshot_observed_at":"2026-07-06T17:07:19.721701Z","submitted_at":"2023-12-22T18:07:44Z","title":"NPHardEval: Dynamic Benchmark on Reasoning Ability of Large Language Models via Complexity Classes","version":4},"cited_work":{"arxiv_id":"2312.14890","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2312.14890","snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"arXiv preprint arXiv:2312.14890 , year=","venue":null,"work_id":"a5db2275-c382-4765-8b23-1cae26b72431","year":2024},"citing_paper":{"arxiv_id":"2605.08904","last_updated":"2026-05-09T11:51:34Z","snapshot_observed_at":"2026-07-06T23:21:02.177557Z","submitted_at":"2026-05-09T11:51:34Z","title":"OPT-BENCH: Evaluating the Iterative Self-Optimization of LLM Agents in Large-Scale Search Spaces","version":1},"reference_index":132,"source":"arxiv_source","source_observed_at":"2026-05-12T02:57:15.521594Z"},"links":{"cited_paper":"/paper/2312.14890","citing_paper":"/paper/2605.08904"},"observation_digest":"sha256:09bf1d6fecd90718d949b4c3b37488fbad9c7c21849941e5e9761627da7ffd33","observation_id":"2a023073-a666-49df-bd67-f5a2d60efaf8","resolution":{"observed_at":"2026-05-12T03:01:18.635644Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"state":"measured"}}],"links":{"evidence":"/evidence","html":"/paper/2312.14890/citation-record","integrity":"/paper/2312.14890/integrity","json":"/paper/2312.14890/citation-record.json","paper":"/paper/2312.14890"},"outbound":[],"paper":{"arxiv_id":"2312.14890","last_updated":"2024-02-12T17:30:25Z","latest_version":4,"primary_category":"cs.AI","snapshot_observed_at":"2026-07-06T17:07:19.721701Z","submitted_at":"2023-12-22T18:07:44Z","title":"NPHardEval: Dynamic Benchmark on Reasoning Ability of Large Language Models via Complexity Classes"},"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-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"thesis":"As of 7 August 2026, this Paper Citation Record lists 0 of 0 outbound references and 7 inbound Pith citation observations for arXiv:2312.14890."}