{"as_of":"2026-08-08T13:21:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:0ab2aa501a8d5f4304bbc01477b7d0907af7bedb3d60458aa985b7f25bad9259","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":4,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":4,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-08T06:32:00.761636+00:00","state":"measured"},{"denominator":4,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":4,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-07T14:58:26.006959Z","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-02T08:46:48.562854Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2504.04310","last_updated":"2025-08-22T08:00:53Z","snapshot_observed_at":"2026-08-07T16:08:18.774751Z","submitted_at":"2025-04-06T00:47:43Z","title":"CO-Bench: Benchmarking Language Model Agents in Algorithm Search for Combinatorial Optimization","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2504.04310","snapshot_observed_at":"2026-08-07T12:45:47.190532Z","title":null,"venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2505.23881","last_updated":"2025-05-29T17:45:50Z","snapshot_observed_at":"2026-08-07T23:35:50.996640Z","submitted_at":"2025-05-29T17:45:50Z","title":"Using Reasoning Models to Generate Search Heuristics that Solve Open Instances of Combinatorial Design Problems","version":1},"reference_index":45,"source":"pdf_text","source_observed_at":"2026-08-07T12:45:47.190532Z"},"links":{"cited_paper":"/paper/2504.04310","citing_paper":"/paper/2505.23881"},"observation_digest":"sha256:01a0a2f79bdf2898172e9c02082dc7e26b2af5b2b5aa66f76861432c2f88f1be","observation_id":"1796364f-e346-46e6-9fbd-1dab9b64ceb0","resolution":{"observed_at":"2026-08-07T12:45:47.190532Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2504.04310","last_updated":"2025-08-22T08:00:53Z","snapshot_observed_at":"2026-08-07T16:08:18.774751Z","submitted_at":"2025-04-06T00:47:43Z","title":"CO-Bench: Benchmarking Language Model Agents in Algorithm Search for Combinatorial Optimization","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2504.04310","snapshot_observed_at":"2026-08-07T14:58:26.006959Z","title":"Co-bench: Benchmarking lan- guage model agents in algorithm search for combinatorial optimization.arXiv preprint arXiv:2504.04310, 2025","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2506.11057","last_updated":"2025-05-22T15:37:42Z","snapshot_observed_at":"2026-08-07T15:30:16.909528Z","submitted_at":"2025-05-22T15:37:42Z","title":"STRCMP: Integrating Graph Structural Priors with Language Models for Combinatorial Optimization","version":1},"reference_index":17,"source":"pdf_text","source_observed_at":"2026-08-07T14:58:26.006959Z"},"links":{"cited_paper":"/paper/2504.04310","citing_paper":"/paper/2506.11057"},"observation_digest":"sha256:cd4806269d22542be947357a70a028048f4a7aaa84fb8c37cdea64b00827c948","observation_id":"6fde0ca0-e85f-4893-aa23-b711dded1da8","resolution":{"observed_at":"2026-08-07T14:58:26.006959Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2504.04310","last_updated":"2025-08-22T08:00:53Z","snapshot_observed_at":"2026-08-07T16:08:18.774751Z","submitted_at":"2025-04-06T00:47:43Z","title":"CO-Bench: Benchmarking Language Model Agents in Algorithm Search for Combinatorial Optimization","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2504.04310","snapshot_observed_at":"2026-08-05T04:50:32.206664Z","title":"Available: https://arxiv.org/abs/2504.04310","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2509.05946","last_updated":"2025-09-07T06:46:03Z","snapshot_observed_at":"2026-08-07T19:21:09.227690Z","submitted_at":"2025-09-07T06:46:03Z","title":"Large Language Models for Next-Generation Wireless Network Management: A Survey and Tutorial","version":1},"reference_index":185,"source":"pdf_text","source_observed_at":"2026-08-05T04:50:32.206664Z"},"links":{"cited_paper":"/paper/2504.04310","citing_paper":"/paper/2509.05946"},"observation_digest":"sha256:2f440518d719012a37e72248eb649c854e583d1094a49f58cfcb7da32b9116c4","observation_id":"d20acd2b-f85c-46ae-b417-380a330345ab","resolution":{"observed_at":"2026-08-05T04:50:32.206664Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2504.04310","last_updated":"2025-08-22T08:00:53Z","snapshot_observed_at":"2026-08-07T16:08:18.774751Z","submitted_at":"2025-04-06T00:47:43Z","title":"CO-Bench: Benchmarking Language Model Agents in Algorithm Search for Combinatorial Optimization","version":3},"cited_work":{"arxiv_id":"2504.04310","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2504.04310","snapshot_observed_at":"2026-07-02T08:46:48.562854Z","title":"CO-Bench: Benchmarking lan- guage model agents in algorithm search for combinatorial optimization,","venue":null,"work_id":"02872996-ac68-4d6a-a307-89044fbf4432","year":2025},"citing_paper":{"arxiv_id":"2607.00604","last_updated":"2026-07-01T08:30:20Z","snapshot_observed_at":"2026-07-07T00:06:14.968413Z","submitted_at":"2026-07-01T08:30:20Z","title":"Vehicle Routing Problem Meets Large Language Models: An Overview and Perspectives","version":1},"reference_index":97,"source":"pdf_text","source_observed_at":"2026-07-02T08:45:04.024510Z"},"links":{"cited_paper":"/paper/2504.04310","citing_paper":"/paper/2607.00604"},"observation_digest":"sha256:25dd199022e4ce6679a07ffd5366670e66ebd3e05f304ed03ccf60e3c4656bca","observation_id":"6528b958-ba18-4f47-ae54-ada0af19733d","resolution":{"observed_at":"2026-07-02T08:46:48.564353Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}}],"links":{"evidence":"/evidence","html":"/paper/2504.04310/citation-record","integrity":"/paper/2504.04310/integrity","json":"/paper/2504.04310/citation-record.json","paper":"/paper/2504.04310"},"outbound":[],"paper":{"arxiv_id":"2504.04310","last_updated":"2025-08-22T08:00:53Z","latest_version":3,"primary_category":"cs.CL","snapshot_observed_at":"2026-08-07T16:08:18.774751Z","submitted_at":"2025-04-06T00:47:43Z","title":"CO-Bench: Benchmarking Language Model Agents in Algorithm Search for Combinatorial Optimization"},"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-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"thesis":"As of 8 August 2026, this Paper Citation Record lists 0 of 0 outbound references and 4 inbound Pith citation observations for arXiv:2504.04310."}