{"as_of":"2026-08-07T18:52:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:ce8ca0592f3c76e946040b6587b7f2025178cb8c8481740724b47a7bea7d658e","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-07T15:26:24.239110Z","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-07-02T18:47:17.150367Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2502.20868","last_updated":"2025-02-28T09:12:42Z","snapshot_observed_at":"2026-08-07T17:40:24.597797Z","submitted_at":"2025-02-28T09:12:42Z","title":"ProBench: Benchmarking Large Language Models in Competitive Programming","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2502.20868","snapshot_observed_at":"2026-08-07T15:26:24.239110Z","title":"Probench: Benchmarking large language models in competitive programming","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2505.21514","last_updated":"2025-05-21T04:59:44Z","snapshot_observed_at":"2026-08-07T15:21:40.598997Z","submitted_at":"2025-05-21T04:59:44Z","title":"SIMCOPILOT: Evaluating Large Language Models for Copilot-Style Code Generation","version":1},"reference_index":23,"source":"arxiv_source","source_observed_at":"2026-08-07T15:26:24.239110Z"},"links":{"cited_paper":"/paper/2502.20868","citing_paper":"/paper/2505.21514"},"observation_digest":"sha256:b65101db754b567e5f5406168368b52471966ec665127267a1a416e9b5cf5d95","observation_id":"26a851d1-438b-4508-b7e4-9317aeee407b","resolution":{"observed_at":"2026-08-07T15:26:24.239110Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2502.20868","last_updated":"2025-02-28T09:12:42Z","snapshot_observed_at":"2026-08-07T17:40:24.597797Z","submitted_at":"2025-02-28T09:12:42Z","title":"ProBench: Benchmarking Large Language Models in Competitive Programming","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2502.20868","snapshot_observed_at":"2026-08-06T22:03:31.682090Z","title":null,"venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2506.22954","last_updated":"2025-06-28T17:18:23Z","snapshot_observed_at":"2026-08-07T05:17:48.616344Z","submitted_at":"2025-06-28T17:18:23Z","title":"Evaluating and Improving Large Language Models for Competitive Program Generation","version":1},"reference_index":36,"source":"pdf_text","source_observed_at":"2026-08-06T22:03:31.682090Z"},"links":{"cited_paper":"/paper/2502.20868","citing_paper":"/paper/2506.22954"},"observation_digest":"sha256:346f50ba30abf38960475cd06a3c8842d34fbf275641470883c890711736707f","observation_id":"427a19f3-d228-419f-9323-740974b83fa5","resolution":{"observed_at":"2026-08-06T22:03:31.682090Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2502.20868","last_updated":"2025-02-28T09:12:42Z","snapshot_observed_at":"2026-08-07T17:40:24.597797Z","submitted_at":"2025-02-28T09:12:42Z","title":"ProBench: Benchmarking Large Language Models in Competitive Programming","version":1},"cited_work":{"arxiv_id":"2502.20868","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2502.20868","snapshot_observed_at":"2026-07-02T18:47:17.150367Z","title":"In The Twelfth International Conference on Learning Representations","venue":null,"work_id":"730c2da3-7d90-4a9d-84a0-ab4a3fc19769","year":2024},"citing_paper":{"arxiv_id":"2602.02188","last_updated":"2026-04-09T18:30:49Z","snapshot_observed_at":"2026-08-07T12:42:41.670147Z","submitted_at":"2026-02-02T14:55:48Z","title":"Reasoning in a Combinatorial and Constrained World: Benchmarking LLMs on Natural-Language Combinatorial Optimization","version":2},"reference_index":12,"source":"pdf_text","source_observed_at":"2026-05-16T08:18:52.540487Z"},"links":{"cited_paper":"/paper/2502.20868","citing_paper":"/paper/2602.02188"},"observation_digest":"sha256:d98e2e0526f32c0f7734cc682904cf2bccfde64319cf920fd9e3177f90742fac","observation_id":"72edc84c-a6b1-46de-a8e0-41b3081fe2eb","resolution":{"observed_at":"2026-05-16T08:20:46.022614Z","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":"2502.20868","last_updated":"2025-02-28T09:12:42Z","snapshot_observed_at":"2026-08-07T17:40:24.597797Z","submitted_at":"2025-02-28T09:12:42Z","title":"ProBench: Benchmarking Large Language Models in Competitive Programming","version":1},"cited_work":{"arxiv_id":"2502.20868","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2502.20868","snapshot_observed_at":"2026-07-02T18:47:17.150367Z","title":"In The Twelfth International Conference on Learning Representations","venue":null,"work_id":"730c2da3-7d90-4a9d-84a0-ab4a3fc19769","year":2024},"citing_paper":{"arxiv_id":"2604.02721","last_updated":"2026-04-03T04:26:56Z","snapshot_observed_at":"2026-08-01T01:27:54.176469Z","submitted_at":"2026-04-03T04:26:56Z","title":"GrandCode: Achieving Grandmaster Level in Competitive Programming via Agentic Reinforcement Learning","version":1},"reference_index":36,"source":"pdf_text","source_observed_at":"2026-05-13T20:30:17.791973Z"},"links":{"cited_paper":"/paper/2502.20868","citing_paper":"/paper/2604.02721"},"observation_digest":"sha256:153ee7470d4b789435fd5b78afda3f5f632de44a1f9d05abab844da72f364c02","observation_id":"89bf09dc-5846-4083-aff6-635875be5000","resolution":{"observed_at":"2026-05-13T20:33:16.612337Z","resolver_source":"arxiv_id","status":"metadata_mismatch"},"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":"2502.20868","last_updated":"2025-02-28T09:12:42Z","snapshot_observed_at":"2026-08-07T17:40:24.597797Z","submitted_at":"2025-02-28T09:12:42Z","title":"ProBench: Benchmarking Large Language Models in Competitive Programming","version":1},"cited_work":{"arxiv_id":"2502.20868","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2502.20868","snapshot_observed_at":"2026-07-02T18:47:17.150367Z","title":"In The Twelfth International Conference on Learning Representations","venue":null,"work_id":"730c2da3-7d90-4a9d-84a0-ab4a3fc19769","year":2024},"citing_paper":{"arxiv_id":"2605.02431","last_updated":"2026-05-04T10:30:33Z","snapshot_observed_at":"2026-07-06T23:15:32.349713Z","submitted_at":"2026-05-04T10:30:33Z","title":"ARIADNE: Agentic Reward-Informed Adaptive Decision Exploration via Blackboard-Driven MCTS for Competitive Program Generation","version":1},"reference_index":21,"source":"pdf_text","source_observed_at":"2026-05-08T17:58:54.689999Z"},"links":{"cited_paper":"/paper/2502.20868","citing_paper":"/paper/2605.02431"},"observation_digest":"sha256:22488be2ca8bc2cfa9a072a0cbd1eb9932c8093cced455863b54743dccaee0ad","observation_id":"68678faa-388a-446d-babc-7b37464b7f5f","resolution":{"observed_at":"2026-05-09T06:55:42.794123Z","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":"2502.20868","last_updated":"2025-02-28T09:12:42Z","snapshot_observed_at":"2026-08-07T17:40:24.597797Z","submitted_at":"2025-02-28T09:12:42Z","title":"ProBench: Benchmarking Large Language Models in Competitive Programming","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2502.20868","snapshot_observed_at":"2026-07-14T18:50:02.070125Z","title":"����� �������� ����������������","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2605.24017","last_updated":"2026-07-11T11:45:39Z","snapshot_observed_at":"2026-08-04T11:37:16.318922Z","submitted_at":"2026-05-20T04:46:18Z","title":"CMAX-CAMEL: A Coarse-to-Fine Adaptive, Memory-Efficient, and Low-Power Edge Processor for Contrast Maximization","version":2},"reference_index":5,"source":"pdf_text","source_observed_at":"2026-07-14T18:50:02.070125Z"},"links":{"cited_paper":"/paper/2502.20868","citing_paper":"/paper/2605.24017"},"observation_digest":"sha256:55fbea38a60427a648b9278fd91c95057c0674f41e4b90237eb400b524a41efc","observation_id":"01d2dc28-86ca-42fc-b9d0-db5f3b4fc4df","resolution":{"observed_at":"2026-07-14T18:50:02.070125Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2502.20868","last_updated":"2025-02-28T09:12:42Z","snapshot_observed_at":"2026-08-07T17:40:24.597797Z","submitted_at":"2025-02-28T09:12:42Z","title":"ProBench: Benchmarking Large Language Models in Competitive Programming","version":1},"cited_work":{"arxiv_id":"2502.20868","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2502.20868","snapshot_observed_at":"2026-07-02T18:47:17.150367Z","title":"In The Twelfth International Conference on Learning Representations","venue":null,"work_id":"730c2da3-7d90-4a9d-84a0-ab4a3fc19769","year":2024},"citing_paper":{"arxiv_id":"2607.00062","last_updated":"2026-06-30T10:13:12Z","snapshot_observed_at":"2026-08-07T06:20:09.714519Z","submitted_at":"2026-06-30T10:13:12Z","title":"AlgoBench: Benchmarking Algorithmic Adaptation in Code Generation","version":1},"reference_index":22,"source":"pdf_text","source_observed_at":"2026-07-02T18:09:02.049387Z"},"links":{"cited_paper":"/paper/2502.20868","citing_paper":"/paper/2607.00062"},"observation_digest":"sha256:7d8d364a5c1d775719b18fd5906bcc3f4dae87edf9cc5f0aecdeb87237a28f7e","observation_id":"5171926c-7e4f-4347-9df8-52751d823c78","resolution":{"observed_at":"2026-07-02T18:47:17.151766Z","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/2502.20868/citation-record","integrity":"/paper/2502.20868/integrity","json":"/paper/2502.20868/citation-record.json","paper":"/paper/2502.20868"},"outbound":[],"paper":{"arxiv_id":"2502.20868","last_updated":"2025-02-28T09:12:42Z","latest_version":1,"primary_category":"cs.CL","snapshot_observed_at":"2026-08-07T17:40:24.597797Z","submitted_at":"2025-02-28T09:12:42Z","title":"ProBench: Benchmarking Large Language Models in Competitive Programming"},"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:2502.20868."}