{"as_of":"2026-08-19T20:42:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:966d45a3874f4691950115cd316903233df1a3ff241346e39f17aab81c450045","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-19T06:32:44.657259+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-15T21:55:40.910796Z","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-06T11:56:09.158088Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2301.03313","last_updated":"2023-09-28T21:06:39Z","snapshot_observed_at":"2026-08-19T12:29:06.020271Z","submitted_at":"2023-01-09T13:08:59Z","title":"BQ-NCO: Bisimulation Quotienting for Efficient Neural Combinatorial Optimization","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2301.03313","snapshot_observed_at":"2026-08-11T12:47:54.904004Z","title":"& Andreoli, J","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2412.13858","last_updated":"2026-06-08T07:38:07Z","snapshot_observed_at":"2026-08-18T21:22:10.338619Z","submitted_at":"2024-12-18T13:52:50Z","title":"IDEQ -- Improving Diffusion Models for the Traveling Salesman Problem (TSP) by Leveraging the Structure of the Solution Space","version":2},"reference_index":3,"source":"pdf_text","source_observed_at":"2026-08-11T12:47:54.904004Z"},"links":{"cited_paper":"/paper/2301.03313","citing_paper":"/paper/2412.13858"},"observation_digest":"sha256:b79361b22f9aefb5a89ff5c600316cbb9bc10e18c3b0876012f76d722a5ef8a6","observation_id":"6030c57d-b642-4ab4-8ec4-4dbf6211b1d0","resolution":{"observed_at":"2026-08-11T12:47:54.904004Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2301.03313","last_updated":"2023-09-28T21:06:39Z","snapshot_observed_at":"2026-08-19T12:29:06.020271Z","submitted_at":"2023-01-09T13:08:59Z","title":"BQ-NCO: Bisimulation Quotienting for Efficient Neural Combinatorial Optimization","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2301.03313","snapshot_observed_at":"2026-08-15T21:55:40.910796Z","title":"Bq-nco: Bisimulation quotienting for efficient neural combinatorial optimization","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2505.08735","last_updated":"2025-05-13T16:47:00Z","snapshot_observed_at":"2026-08-19T12:29:14.935521Z","submitted_at":"2025-05-13T16:47:00Z","title":"Preference Optimization for Combinatorial Optimization Problems","version":1},"reference_index":15,"source":"arxiv_source","source_observed_at":"2026-08-15T21:55:40.910796Z"},"links":{"cited_paper":"/paper/2301.03313","citing_paper":"/paper/2505.08735"},"observation_digest":"sha256:4363f9bc8ae0810ee4ad8497db0c7885b875b0c390005e5e3bae8d305fc0013c","observation_id":"ed9792c2-88e2-43e3-848c-78f5f8ae9c87","resolution":{"observed_at":"2026-08-15T21:55:40.910796Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2301.03313","last_updated":"2023-09-28T21:06:39Z","snapshot_observed_at":"2026-08-19T12:29:06.020271Z","submitted_at":"2023-01-09T13:08:59Z","title":"BQ-NCO: Bisimulation Quotienting for Efficient Neural Combinatorial Optimization","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2301.03313","snapshot_observed_at":"2026-08-15T19:33:23.244720Z","title":"Bq-nco: Bisimulation quotienting for generalizable neural combinatorial optimization","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2506.16428","last_updated":"2025-06-19T16:07:11Z","snapshot_observed_at":"2026-08-18T00:05:58.466351Z","submitted_at":"2025-06-19T16:07:11Z","title":"EFormer: An Effective Edge-based Transformer for Vehicle Routing Problems","version":1},"reference_index":14,"source":"arxiv_source","source_observed_at":"2026-08-15T19:33:23.244720Z"},"links":{"cited_paper":"/paper/2301.03313","citing_paper":"/paper/2506.16428"},"observation_digest":"sha256:363d0d85c5a58df7475550ee5ec08e52cdb8cc756d750d306e59a8a3c6bf9ccd","observation_id":"c43990de-ea50-4575-be33-0d7187ba9fa6","resolution":{"observed_at":"2026-08-15T19:33:23.244720Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2301.03313","last_updated":"2023-09-28T21:06:39Z","snapshot_observed_at":"2026-08-19T12:29:06.020271Z","submitted_at":"2023-01-09T13:08:59Z","title":"BQ-NCO: Bisimulation Quotienting for Efficient Neural Combinatorial Optimization","version":3},"cited_work":{"arxiv_id":"2301.03313","doi":null,"metadata_source":"pith","pith_arxiv_id":"2301.03313","snapshot_observed_at":"2026-08-06T11:56:09.158088Z","title":"BQ-NCO: Bisimulation Quotienting for Efficient Neural Combinatorial Optimization","venue":"cs.LG","work_id":"736b30b4-e01f-4ae7-9278-eb19a4882f74","year":2023},"citing_paper":{"arxiv_id":"2507.22338","last_updated":"2025-07-30T02:46:45Z","snapshot_observed_at":"2026-08-19T12:08:09.301884Z","submitted_at":"2025-07-30T02:46:45Z","title":"Parametrized Multi-Agent Routing via Deep Attention Models","version":1},"reference_index":2020,"source":"pdf_text","source_observed_at":"2026-08-06T11:56:09.080195Z"},"links":{"cited_paper":"/paper/2301.03313","citing_paper":"/paper/2507.22338"},"observation_digest":"sha256:6a64f367d33553783ce29adb53feeccd2af5d61c374330da16b4564e402546a9","observation_id":"e1149fa9-f330-49b3-aeb2-406d9c41d93d","resolution":{"observed_at":"2026-08-06T11:56:09.162352Z","resolver_source":"local_arxiv","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+00:00","source":"retraction_watch"}],"state":"measured"}}],"links":{"evidence":"/evidence","html":"/paper/2301.03313/citation-record","integrity":"/paper/2301.03313/integrity","json":"/paper/2301.03313/citation-record.json","paper":"/paper/2301.03313"},"outbound":[],"paper":{"arxiv_id":"2301.03313","last_updated":"2023-09-28T21:06:39Z","latest_version":3,"primary_category":"cs.LG","snapshot_observed_at":"2026-08-19T12:29:06.020271Z","submitted_at":"2023-01-09T13:08:59Z","title":"BQ-NCO: Bisimulation Quotienting for Efficient Neural 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-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+00:00","source":"retraction_watch"}],"thesis":"As of 19 August 2026, this Paper Citation Record lists 0 of 0 outbound references and 4 inbound Pith citation observations for arXiv:2301.03313."}