{"as_of":"2026-08-07T12:11:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:0e486e3b7106bc6b8f24d1038175b86e3cf3906ab86c79c7c9aab79ffc5b1379","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-07T05:18:12.734919Z","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-06T20:20:47.957783Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2305.06361","last_updated":"2025-05-25T14:09:07Z","snapshot_observed_at":"2026-07-06T15:25:43.815339Z","submitted_at":"2023-05-10T14:20:34Z","title":"Efficient Training of Multi-task Neural Solver for Combinatorial Optimization","version":5},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2305.06361","snapshot_observed_at":"2026-08-07T05:18:12.734919Z","title":"and Yu, T","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2506.08424","last_updated":"2025-06-11T06:43:18Z","snapshot_observed_at":"2026-08-07T05:09:15.787542Z","submitted_at":"2025-06-10T03:55:14Z","title":"SHIELD: Multi-task Multi-distribution Vehicle Routing Solver with Sparsity and Hierarchy","version":2},"reference_index":2015,"source":"pdf_text","source_observed_at":"2026-08-07T05:18:12.734919Z"},"links":{"cited_paper":"/paper/2305.06361","citing_paper":"/paper/2506.08424"},"observation_digest":"sha256:20827394100d4344705ebec2c7cda3baeedbb84af8fa71bf64a8a4f1234ec872","observation_id":"e1ac4edb-4ad7-478d-bd7c-6566308a62b6","resolution":{"observed_at":"2026-08-07T05:18:12.734919Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2305.06361","last_updated":"2025-05-25T14:09:07Z","snapshot_observed_at":"2026-07-06T15:25:43.815339Z","submitted_at":"2023-05-10T14:20:34Z","title":"Efficient Training of Multi-task Neural Solver for Combinatorial Optimization","version":5},"cited_work":{"arxiv_id":"2305.06361","doi":null,"metadata_source":"pith","pith_arxiv_id":"2305.06361","snapshot_observed_at":"2026-08-06T20:20:47.957783Z","title":"Efficient Training of Multi-task Neural Solver for Combinatorial Optimization","venue":"cs.LG","work_id":"818a23cb-c6f5-44d1-9219-c3689bdc52e0","year":2023},"citing_paper":{"arxiv_id":"2507.03300","last_updated":"2025-07-04T05:10:20Z","snapshot_observed_at":"2026-08-06T20:11:09.923309Z","submitted_at":"2025-07-04T05:10:20Z","title":"LRM-1B: Towards Large Routing Model","version":1},"reference_index":43,"source":"pdf_text","source_observed_at":"2026-08-06T20:20:46.180272Z"},"links":{"cited_paper":"/paper/2305.06361","citing_paper":"/paper/2507.03300"},"observation_digest":"sha256:f2691f63b863c0bcb25a30dd3177d021a84c0c232d1baa48ed16ceb780f7882e","observation_id":"02f62262-5b18-434c-8cb1-083e7c0da726","resolution":{"observed_at":"2026-08-06T20:20:48.039138Z","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"}}],"links":{"evidence":"/evidence","html":"/paper/2305.06361/citation-record","integrity":"/paper/2305.06361/integrity","json":"/paper/2305.06361/citation-record.json","paper":"/paper/2305.06361"},"outbound":[],"paper":{"arxiv_id":"2305.06361","last_updated":"2025-05-25T14:09:07Z","latest_version":5,"primary_category":"cs.LG","snapshot_observed_at":"2026-07-06T15:25:43.815339Z","submitted_at":"2023-05-10T14:20:34Z","title":"Efficient Training of Multi-task Neural Solver 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-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:2305.06361."}