{"as_of":"2026-08-10T09:46:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:f0fe952ce14e752daedfb5f1a605b1ab63e54aa57583147efb5a419dcbeb87fb","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":6,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":6,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-10T06:31:04.303077+00:00","state":"measured"},{"denominator":6,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":6,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-07T23:30:43.595386Z","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-09T16:48:07.552220Z","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-07T23:30:43.595386Z","title":"PuzzleBench: Can LLMs Solve Challenging First-Order Combinatorial Reasoning Problems? arXiv preprint arXiv:2402.02611, 2024","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2502.08859","last_updated":"2025-02-14T16:40:15Z","snapshot_observed_at":"2026-08-09T16:48:28.493833Z","submitted_at":"2025-02-13T00:18:34Z","title":"EnigmaEval: A Benchmark of Long Multimodal Reasoning Challenges","version":2},"reference_index":20,"source":"pdf_text","source_observed_at":"2026-08-07T23:30:43.595386Z"},"links":{"cited_paper":"/paper/2402.02611","citing_paper":"/paper/2502.08859"},"observation_digest":"sha256:b5e28d4902992b75704635d127ecc96a63982b203b82fe770f0d3333bfa806d6","observation_id":"d18500c4-f372-48a4-a7e0-2d5e38939151","resolution":{"observed_at":"2026-08-07T23:30:43.595386Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2402.02611","last_updated":"2025-03-01T12:46:25Z","snapshot_observed_at":"2026-08-09T16:48:07.552220Z","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-07T15:38:29.719822Z","title":"Theo X Olausson, Alex Gu, Benjamin Lipkin, Cede- gao E Zhang, Armando Solar-Lezama, Joshua B Tenenbaum, and Roger Levy","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2505.14479","last_updated":"2026-05-24T05:34:17Z","snapshot_observed_at":"2026-08-07T22:02:28.676994Z","submitted_at":"2025-05-20T15:13:32Z","title":"A Neuro-Symbolic Approach for Reliable Proof Generation with LLMs: A Case Study in Euclidean Geometry","version":9},"reference_index":5,"source":"pdf_text","source_observed_at":"2026-08-07T15:38:29.719822Z"},"links":{"cited_paper":"/paper/2402.02611","citing_paper":"/paper/2505.14479"},"observation_digest":"sha256:135a55d9a948311453d32ea491b69d7d9684dcaba1a3e5ecfa6127e86871721a","observation_id":"a5ba5abd-d9bb-45b5-b31a-b2af3979aeff","resolution":{"observed_at":"2026-08-07T15:38:29.719822Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2402.02611","last_updated":"2025-03-01T12:46:25Z","snapshot_observed_at":"2026-08-09T16:48:07.552220Z","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-07T14:01:12.762253Z","title":"Puzzlebench: Can llms solve challenging first-order combinatorial reasoning problems?arXiv preprint arXiv:2402.02611, 2024","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2505.20296","last_updated":"2025-05-26T17:59:53Z","snapshot_observed_at":"2026-08-09T09:53:26.313801Z","submitted_at":"2025-05-26T17:59:53Z","title":"Reasoning LLMs are Wandering Solution Explorers","version":1},"reference_index":13,"source":"pdf_text","source_observed_at":"2026-08-07T14:01:12.762253Z"},"links":{"cited_paper":"/paper/2402.02611","citing_paper":"/paper/2505.20296"},"observation_digest":"sha256:cdb427786b741a7eb098cbb4fbf72a996e63f604c33ce7f0d8b003b6c6378dbd","observation_id":"f2d4a53e-8611-431a-a283-7848ebe27d69","resolution":{"observed_at":"2026-08-07T14:01:12.762253Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2402.02611","last_updated":"2025-03-01T12:46:25Z","snapshot_observed_at":"2026-08-09T16:48:07.552220Z","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-07T15:04:34.700548Z","title":"Puzzlebench: Can llms solve challenging first-order combinatorial reasoning problems? arXiv preprint arXiv:2402.02611, 2024","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2506.11052","last_updated":"2025-05-22T09:33:55Z","snapshot_observed_at":"2026-08-09T16:48:02.490392Z","submitted_at":"2025-05-22T09:33:55Z","title":"ACCORD: Autoregressive Constraint-satisfying Generation for COmbinatorial Optimization with Routing and Dynamic attention","version":1},"reference_index":22,"source":"pdf_text","source_observed_at":"2026-08-07T15:04:34.700548Z"},"links":{"cited_paper":"/paper/2402.02611","citing_paper":"/paper/2506.11052"},"observation_digest":"sha256:aba2711fdf50d28b5f3285c271b4ea56e04e4967b3a42648217946c1d81322bf","observation_id":"a7c44ba6-481d-4dbb-ab15-381987856a58","resolution":{"observed_at":"2026-08-07T15:04:34.700548Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2402.02611","last_updated":"2025-03-01T12:46:25Z","snapshot_observed_at":"2026-08-09T16:48:07.552220Z","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:2a40019fbdf87139a152a3e720cce03f0a129e69ddeceba4cb83ec8d4f422c00","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-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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-09T16:48:07.552220Z","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:448b0e29da9601577184ba3dcee17abd4b6f0d514cb8d3ff4c61919f4e44e728","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-09T16:48:07.552220Z","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-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"thesis":"As of 10 August 2026, this Paper Citation Record lists 0 of 0 outbound references and 6 inbound Pith citation observations for arXiv:2402.02611."}