{"as_of":"2026-08-23T19:05:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:14884450c934464ac94f8ca5024a680a0af9fa26e67514b2c5622e0d1223b40c","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-23T06:30:58.430688+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-10T20:32:55.493793Z","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-12T11:01:30.207450Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2201.05393","last_updated":"2022-01-14T11:16:17Z","snapshot_observed_at":"2026-08-23T16:28:45.877998Z","submitted_at":"2022-01-14T11:16:17Z","title":"Reinforcement Learning to Solve NP-hard Problems: an Application to the CVRP","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2201.05393","snapshot_observed_at":"2026-08-10T20:32:55.493793Z","title":null,"venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2501.08220","last_updated":"2025-09-01T07:30:03Z","snapshot_observed_at":"2026-08-14T16:10:48.024748Z","submitted_at":"2025-01-14T16:04:46Z","title":"Optimization of Link Configuration for Satellite Communication Using Reinforcement Learning","version":2},"reference_index":2,"source":"arxiv_source","source_observed_at":"2026-08-10T20:32:55.493793Z"},"links":{"cited_paper":"/paper/2201.05393","citing_paper":"/paper/2501.08220"},"observation_digest":"sha256:a5570b058f495f05b784691612611a271ec09c67b7f86c690ea6f4303aa386c8","observation_id":"f51d5b1f-170d-4ea0-b1f7-750cdc339417","resolution":{"observed_at":"2026-08-10T20:32:55.493793Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2201.05393","last_updated":"2022-01-14T11:16:17Z","snapshot_observed_at":"2026-08-23T16:28:45.877998Z","submitted_at":"2022-01-14T11:16:17Z","title":"Reinforcement Learning to Solve NP-hard Problems: an Application to the CVRP","version":1},"cited_work":{"arxiv_id":"2201.05393","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2201.05393","snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Reinforcement learning to solve np-hard problems: an application to the cvrp","venue":null,"work_id":"6f2fb512-7e51-46fa-941d-17f20da7cd4b","year":2022},"citing_paper":{"arxiv_id":"2605.03565","last_updated":"2026-05-05T09:39:14Z","snapshot_observed_at":"2026-08-14T07:20:39.712524Z","submitted_at":"2026-05-05T09:39:14Z","title":"Neural optimization for quantum architectures: graph embedding problems with Distance Encoder Networks","version":1},"reference_index":34,"source":"pdf_text","source_observed_at":"2026-05-07T17:21:56.801163Z"},"links":{"cited_paper":"/paper/2201.05393","citing_paper":"/paper/2605.03565"},"observation_digest":"sha256:735bda005bbd3c6a1bd4ff758bd1b5dc126e4f3b0c8af7d27a32b78bb2b9f44b","observation_id":"fc70e7a6-d362-473f-a786-6da3c1d3d1f4","resolution":{"observed_at":"2026-05-12T11:01:30.209931Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-23T06:30:58.430688+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-23T06:30:58.430688+00:00","source":"crossref"},{"observed_at":"2026-08-23T06:30:53.778098+00:00","source":"retraction_watch"}],"state":"measured"}}],"links":{"evidence":"/evidence","html":"/paper/2201.05393/citation-record","integrity":"/paper/2201.05393/integrity","json":"/paper/2201.05393/citation-record.json","paper":"/paper/2201.05393"},"outbound":[],"paper":{"arxiv_id":"2201.05393","last_updated":"2022-01-14T11:16:17Z","latest_version":1,"primary_category":"cs.AI","snapshot_observed_at":"2026-08-23T16:28:45.877998Z","submitted_at":"2022-01-14T11:16:17Z","title":"Reinforcement Learning to Solve NP-hard Problems: an Application to the CVRP"},"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-23T06:30:58.430688+00:00","source":"crossref"},{"observed_at":"2026-08-23T06:30:53.778098+00:00","source":"retraction_watch"}],"thesis":"As of 23 August 2026, this Paper Citation Record lists 0 of 0 outbound references and 2 inbound Pith citation observations for arXiv:2201.05393."}