{"as_of":"2026-08-07T15:21:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:de8c53433d8a05bdfd95885602549a231aaacd70b4284743f30c086485df737e","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-07T06:34:17.273281+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-05T16:40:22.922968Z","state":"measured"},{"denominator":1,"lane":"external_citation_measurements","note":"A source-named dated measurement, never combined with another source.","records_observed":0,"source":"pith","source_observed_at":"2026-08-05T16:40:23.017001Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"1806.09285","last_updated":"2018-06-25T04:48:34Z","snapshot_observed_at":"2026-07-06T06:46:32.717122Z","submitted_at":"2018-06-25T04:48:34Z","title":"A new benchmark set for Traveling salesman problem and Hamiltonian cycle problem","version":1},"cited_work":{"arxiv_id":"1806.09285","doi":null,"metadata_source":"pith","pith_arxiv_id":"1806.09285","snapshot_observed_at":"2026-08-05T16:40:23.017001Z","title":"A new benchmark set for Traveling salesman problem and Hamiltonian cycle problem","venue":"cs.DS","work_id":"040d1ab4-f568-42e2-b31b-824b89a3d405","year":2018},"citing_paper":{"arxiv_id":"2508.18375","last_updated":"2025-08-25T18:06:53Z","snapshot_observed_at":"2026-08-05T16:40:21.506715Z","submitted_at":"2025-08-25T18:06:53Z","title":"Finding trail covers: near-optimal decompositions of graph states as linear fusion networks","version":1},"reference_index":43,"source":"pdf_text","source_observed_at":"2026-08-05T16:40:22.922968Z"},"links":{"cited_paper":"/paper/1806.09285","citing_paper":"/paper/2508.18375"},"observation_digest":"sha256:86a3b16a9812e3ee0fe09f81dc55706847dc28e2a54802a9883835a70843f439","observation_id":"ccb3a749-7429-43f9-a8d0-fa586b2182e2","resolution":{"observed_at":"2026-08-05T16:40:23.020207Z","resolver_source":"local_arxiv","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":"1806.09285","last_updated":"2018-06-25T04:48:34Z","snapshot_observed_at":"2026-07-06T06:46:32.717122Z","submitted_at":"2018-06-25T04:48:34Z","title":"A new benchmark set for Traveling salesman problem and Hamiltonian cycle problem","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1806.09285","snapshot_observed_at":"2026-08-01T14:53:42.670857Z","title":"arXiv preprint arXiv:1806.09285 , year=","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.18632","last_updated":"2026-07-21T02:01:01Z","snapshot_observed_at":"2026-08-05T07:30:41.277507Z","submitted_at":"2026-07-21T02:01:01Z","title":"Graph Neural Network-based Algorithm Selection for the Traveling Salesman Problem: A Systematic Study of Cost and Rank Losses under Distinct Budget Regimes","version":1},"reference_index":13,"source":"arxiv_source","source_observed_at":"2026-08-01T14:53:42.670857Z"},"links":{"cited_paper":"/paper/1806.09285","citing_paper":"/paper/2607.18632"},"observation_digest":"sha256:95125e7b4c6bb7e87ee9158b3ec732475636b1954c99d107b7ee3ec44462466e","observation_id":"ebb3fb43-1f25-416b-b23b-64b876225988","resolution":{"observed_at":"2026-08-01T14:53:42.670857Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"links":{"evidence":"/evidence","html":"/paper/1806.09285/citation-record","integrity":"/paper/1806.09285/integrity","json":"/paper/1806.09285/citation-record.json","paper":"/paper/1806.09285"},"outbound":[],"paper":{"arxiv_id":"1806.09285","last_updated":"2018-06-25T04:48:34Z","latest_version":1,"primary_category":"cs.DS","snapshot_observed_at":"2026-07-06T06:46:32.717122Z","submitted_at":"2018-06-25T04:48:34Z","title":"A new benchmark set for Traveling salesman problem and Hamiltonian cycle problem"},"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 2 inbound Pith citation observations for arXiv:1806.09285."}