{"as_of":"2026-08-09T00:21:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:af9c38bc4b5e6e1202b389ad6eadb9ee223971a4f505eec004c20bb47e5a0432","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-07T15:04:34.673466Z","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-21T03:59:32.548779Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2405.01997","last_updated":"2024-05-03T10:54:14Z","snapshot_observed_at":"2026-07-06T18:09:17.538646Z","submitted_at":"2024-05-03T10:54:14Z","title":"Exploring Combinatorial Problem Solving with Large Language Models: A Case Study on the Travelling Salesman Problem Using GPT-3.5 Turbo","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2405.01997","snapshot_observed_at":"2026-08-07T15:04:34.673466Z","title":"Exploring combinatorial problem solving with large language models: A case study on the traveling salesman problem using gpt-3.5 turbo","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-07T14:58:39.817296Z","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":21,"source":"pdf_text","source_observed_at":"2026-08-07T15:04:34.673466Z"},"links":{"cited_paper":"/paper/2405.01997","citing_paper":"/paper/2506.11052"},"observation_digest":"sha256:f7d640539280d78737a50d687c0fa3e05051155054c6aaf7fb09660923107e12","observation_id":"dba18f8b-5585-4920-9f28-9ececfd58dc2","resolution":{"observed_at":"2026-08-07T15:04:34.673466Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2405.01997","last_updated":"2024-05-03T10:54:14Z","snapshot_observed_at":"2026-07-06T18:09:17.538646Z","submitted_at":"2024-05-03T10:54:14Z","title":"Exploring Combinatorial Problem Solving with Large Language Models: A Case Study on the Travelling Salesman Problem Using GPT-3.5 Turbo","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2405.01997","snapshot_observed_at":"2026-08-04T16:14:54.916846Z","title":"Exploring combinatorial problem solving with large language models: A case study on the trav- elling salesman problem using gpt-3.5 turbo,","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2509.14860","last_updated":"2026-06-10T05:27:35Z","snapshot_observed_at":"2026-08-04T16:14:53.069376Z","submitted_at":"2025-09-18T11:27:00Z","title":"MARIC: Multi-Agent Reasoning for Image Classification","version":2},"reference_index":12,"source":"pdf_text","source_observed_at":"2026-08-04T16:14:54.916846Z"},"links":{"cited_paper":"/paper/2405.01997","citing_paper":"/paper/2509.14860"},"observation_digest":"sha256:a10d1adb421bb6e69c4d825582528d6a3a73c00f0a5af5b0f870cc029cc939b8","observation_id":"917a5e99-014d-4b9a-b2a1-45df19acd836","resolution":{"observed_at":"2026-08-04T16:14:54.916846Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2405.01997","last_updated":"2024-05-03T10:54:14Z","snapshot_observed_at":"2026-07-06T18:09:17.538646Z","submitted_at":"2024-05-03T10:54:14Z","title":"Exploring Combinatorial Problem Solving with Large Language Models: A Case Study on the Travelling Salesman Problem Using GPT-3.5 Turbo","version":1},"cited_work":{"arxiv_id":"2405.01997","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2405.01997","snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"arXiv preprint arXiv:2405.01997 (2024)","venue":null,"work_id":"8d2f70d7-ad38-442e-b93c-33a7198d0026","year":2024},"citing_paper":{"arxiv_id":"2605.10598","last_updated":"2026-05-11T14:01:52Z","snapshot_observed_at":"2026-08-02T11:54:02.966349Z","submitted_at":"2026-05-11T14:01:52Z","title":"Budget-Efficient Automatic Algorithm Design via Code Graph","version":1},"reference_index":24,"source":"pdf_text","source_observed_at":"2026-05-12T03:46:09.715264Z"},"links":{"cited_paper":"/paper/2405.01997","citing_paper":"/paper/2605.10598"},"observation_digest":"sha256:ccff3de77623f7bcfae0e831dab1f78651f0fd4c47c3c04bce91f869e7121725","observation_id":"ddb7deaf-c1e6-4d57-bff8-fc52185b7e1b","resolution":{"observed_at":"2026-05-12T06:56:32.251863Z","resolver_source":"arxiv_id","status":"metadata_mismatch"},"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"}},{"citation":{"cited_paper":{"arxiv_id":"2405.01997","last_updated":"2024-05-03T10:54:14Z","snapshot_observed_at":"2026-07-06T18:09:17.538646Z","submitted_at":"2024-05-03T10:54:14Z","title":"Exploring Combinatorial Problem Solving with Large Language Models: A Case Study on the Travelling Salesman Problem Using GPT-3.5 Turbo","version":1},"cited_work":{"arxiv_id":"2405.01997","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2405.01997","snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"arXiv preprint arXiv:2405.01997 (2024)","venue":null,"work_id":"8d2f70d7-ad38-442e-b93c-33a7198d0026","year":2024},"citing_paper":{"arxiv_id":"2605.20849","last_updated":"2026-05-20T07:40:05Z","snapshot_observed_at":"2026-08-05T14:32:21.145968Z","submitted_at":"2026-05-20T07:40:05Z","title":"Large Language Models for Operations Research: A Comprehensive Survey","version":1},"reference_index":55,"source":"pdf_text","source_observed_at":"2026-05-21T03:56:29.983335Z"},"links":{"cited_paper":"/paper/2405.01997","citing_paper":"/paper/2605.20849"},"observation_digest":"sha256:edf563304d4863a74b799b19b819debd09702d43ee42bc5878a32b8e7b4bc5be","observation_id":"6075abfa-94f8-4f78-9200-c9b718fff956","resolution":{"observed_at":"2026-05-21T03:59:32.550205Z","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/2405.01997/citation-record","integrity":"/paper/2405.01997/integrity","json":"/paper/2405.01997/citation-record.json","paper":"/paper/2405.01997"},"outbound":[],"paper":{"arxiv_id":"2405.01997","last_updated":"2024-05-03T10:54:14Z","latest_version":1,"primary_category":"cs.CL","snapshot_observed_at":"2026-07-06T18:09:17.538646Z","submitted_at":"2024-05-03T10:54:14Z","title":"Exploring Combinatorial Problem Solving with Large Language Models: A Case Study on the Travelling Salesman Problem Using GPT-3.5 Turbo"},"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 9 August 2026, this Paper Citation Record lists 0 of 0 outbound references and 4 inbound Pith citation observations for arXiv:2405.01997."}