{"as_of":"2026-08-17T23:01:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:58efa69f9b4474f8c5779d73fb7c67a638c8aa9657b2d3e3985793957c6c795a","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":1,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":1,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-17T06:30:58.91139+00:00","state":"measured"},{"denominator":1,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":1,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-12T18:13:49.216598Z","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-12T18:13:50.107362Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"1909.13121","last_updated":"2019-09-28T16:35:38Z","snapshot_observed_at":"2026-08-17T15:37:48.091901Z","submitted_at":"2019-09-28T16:35:38Z","title":"How to Evaluate Machine Learning Approaches for Combinatorial Optimization: Application to the Travelling Salesman Problem","version":1},"cited_work":{"arxiv_id":"1909.13121","doi":null,"metadata_source":"pith","pith_arxiv_id":"1909.13121","snapshot_observed_at":"2026-08-12T18:13:50.107362Z","title":"How to Evaluate Machine Learning Approaches for Combinatorial Optimization: Application to the Travelling Salesman Problem","venue":"cs.AI","work_id":"cadfb14a-aa74-46b8-840b-bbe707d2fba3","year":2019},"citing_paper":{"arxiv_id":"2411.11778","last_updated":"2024-11-18T17:55:02Z","snapshot_observed_at":"2026-08-17T11:03:30.920043Z","submitted_at":"2024-11-18T17:55:02Z","title":"Design And Optimization Of Multi-rendezvous Manoeuvres Based On Reinforcement Learning And Convex Optimization","version":1},"reference_index":16,"source":"pdf_text","source_observed_at":"2026-08-12T18:13:49.216598Z"},"links":{"cited_paper":"/paper/1909.13121","citing_paper":"/paper/2411.11778"},"observation_digest":"sha256:9a4e7b1a6b4666babe0ebc9af56f5185dd9ab0ce67f0d64949e6d96188838494","observation_id":"76dd1d52-3cf1-4fbb-85a9-aa26e2e7964a","resolution":{"observed_at":"2026-08-12T18:13:50.114672Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+00:00","source":"retraction_watch"}],"state":"measured"}}],"links":{"evidence":"/evidence","html":"/paper/1909.13121/citation-record","integrity":"/paper/1909.13121/integrity","json":"/paper/1909.13121/citation-record.json","paper":"/paper/1909.13121"},"outbound":[],"paper":{"arxiv_id":"1909.13121","last_updated":"2019-09-28T16:35:38Z","latest_version":1,"primary_category":"cs.AI","snapshot_observed_at":"2026-08-17T15:37:48.091901Z","submitted_at":"2019-09-28T16:35:38Z","title":"How to Evaluate Machine Learning Approaches for Combinatorial Optimization: Application to the Travelling Salesman 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-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+00:00","source":"retraction_watch"}],"thesis":"As of 17 August 2026, this Paper Citation Record lists 0 of 0 outbound references and 1 inbound Pith citation observation for arXiv:1909.13121."}