{"as_of":"2026-08-06T20:19:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:7debd74d510b89e75bc99fa7f9840b841d3af71000bd8ce50bf2dd2b94818133","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":2,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":2,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-06T06:34:29.942622+00:00","state":"measured"},{"denominator":2,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":2,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-05T18:08:42.697524Z","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-21T22:34:23.958381Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2402.02611","last_updated":"2025-03-01T12:46:25Z","snapshot_observed_at":"2026-08-06T18:34:26.106835Z","submitted_at":"2024-02-04T20:56:09Z","title":"FCoReBench: Can Large Language Models Solve Challenging First-Order Combinatorial Reasoning Problems?","version":3},"cited_work":{"arxiv_id":"2402.02611","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2402.02611","snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Puzzlebench: Can llms solve challenging first-order combinatorial reasoning problems","venue":null,"work_id":"66294756-b9b2-4b07-8180-e850773eb418","year":2024},"citing_paper":{"arxiv_id":"2508.08636","last_updated":"2026-05-20T08:06:05Z","snapshot_observed_at":"2026-08-04T03:35:42.053775Z","submitted_at":"2025-08-12T05:00:00Z","title":"InternBootcamp Technical Report: Boosting LLM Reasoning with Verifiable Task Scaling","version":2},"reference_index":31,"source":"pdf_text","source_observed_at":"2026-05-21T22:33:09.674822Z"},"links":{"cited_paper":"/paper/2402.02611","citing_paper":"/paper/2508.08636"},"observation_digest":"sha256:4928d012185657a0637aa8b17e19e0081756c26fbf02e3e84fab6a646ff16567","observation_id":"a6a708bf-3284-4716-8d12-5081e73cb232","resolution":{"observed_at":"2026-05-21T22:34:23.960679Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-06T06:34:29.942622+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-06T06:34:29.942622+00:00","source":"crossref"},{"observed_at":"2026-08-06T06:34:23.284952+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2402.02611","last_updated":"2025-03-01T12:46:25Z","snapshot_observed_at":"2026-08-06T18:34:26.106835Z","submitted_at":"2024-02-04T20:56:09Z","title":"FCoReBench: Can Large Language Models Solve Challenging First-Order Combinatorial Reasoning Problems?","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2402.02611","snapshot_observed_at":"2026-08-05T18:08:42.697524Z","title":null,"venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2508.15180","last_updated":"2026-05-28T16:12:56Z","snapshot_observed_at":"2026-08-05T18:08:30.380618Z","submitted_at":"2025-08-21T02:36:16Z","title":"PuzzleClone: A DSL-Powered Framework for Synthesizing Verifiable Data","version":3},"reference_index":38,"source":"arxiv_source","source_observed_at":"2026-08-05T18:08:42.697524Z"},"links":{"cited_paper":"/paper/2402.02611","citing_paper":"/paper/2508.15180"},"observation_digest":"sha256:aa6045fe21f93156201d2c922b1fd475e91cedd495bd5f93d8c2d8ea2af8fc8c","observation_id":"044de025-daf2-46f3-99d2-bf13c184a109","resolution":{"observed_at":"2026-08-05T18:08:42.697524Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"links":{"evidence":"/evidence","html":"/paper/2402.02611/citation-record","integrity":"/paper/2402.02611/integrity","json":"/paper/2402.02611/citation-record.json","paper":"/paper/2402.02611"},"outbound":[],"paper":{"arxiv_id":"2402.02611","last_updated":"2025-03-01T12:46:25Z","latest_version":3,"primary_category":"cs.AI","snapshot_observed_at":"2026-08-06T18:34:26.106835Z","submitted_at":"2024-02-04T20:56:09Z","title":"FCoReBench: Can Large Language Models Solve Challenging First-Order Combinatorial Reasoning Problems?"},"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-06T06:34:29.942622+00:00","source":"crossref"},{"observed_at":"2026-08-06T06:34:23.284952+00:00","source":"retraction_watch"}],"thesis":"As of 6 August 2026, this Paper Citation Record lists 0 of 0 outbound references and 2 inbound Pith citation observations for arXiv:2402.02611."}