{"as_of":"2026-08-10T10:30:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:73fef6aa1f9f13fcbe077d10a6bc625080a869d1f2d64951fb2d39b1c59e7b0e","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":6,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":6,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-10T06:31:04.303077+00:00","state":"measured"},{"denominator":6,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":6,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-09T10:38:06.152498Z","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-07-01T20:46:13.596511Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2106.05126","last_updated":"2022-03-15T13:44:23Z","snapshot_observed_at":"2026-07-06T11:17:34.454271Z","submitted_at":"2021-06-09T15:08:03Z","title":"Efficient Active Search for Combinatorial Optimization Problems","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2106.05126","snapshot_observed_at":"2026-08-09T10:38:06.152498Z","title":"Efficient active search for combinatorial optimization problems,","venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2502.02941","last_updated":"2025-02-05T07:13:43Z","snapshot_observed_at":"2026-08-09T19:53:15.394836Z","submitted_at":"2025-02-05T07:13:43Z","title":"Fast T2T: Optimization Consistency Speeds Up Diffusion-Based Training-to-Testing Solving for Combinatorial Optimization","version":1},"reference_index":15,"source":"pdf_text","source_observed_at":"2026-08-09T10:38:06.152498Z"},"links":{"cited_paper":"/paper/2106.05126","citing_paper":"/paper/2502.02941"},"observation_digest":"sha256:1d1e862ec7498058d8666cf00f7ab5a0ccd763f01130f2d80dd1ee12cddd2b6b","observation_id":"98f3efb6-f734-4974-bbaf-d1adefcb8502","resolution":{"observed_at":"2026-08-09T10:38:06.152498Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2106.05126","last_updated":"2022-03-15T13:44:23Z","snapshot_observed_at":"2026-07-06T11:17:34.454271Z","submitted_at":"2021-06-09T15:08:03Z","title":"Efficient Active Search for Combinatorial Optimization Problems","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2106.05126","snapshot_observed_at":"2026-08-07T04:58:19.072722Z","title":"Efficient active search for combinatorial optimization problems.arXiv preprint arXiv:2106.05126, 2021","venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2506.09404","last_updated":"2025-06-11T05:17:30Z","snapshot_observed_at":"2026-08-10T01:30:25.846964Z","submitted_at":"2025-06-11T05:17:30Z","title":"Synergizing Reinforcement Learning and Genetic Algorithms for Neural Combinatorial Optimization","version":1},"reference_index":21,"source":"pdf_text","source_observed_at":"2026-08-07T04:58:19.072722Z"},"links":{"cited_paper":"/paper/2106.05126","citing_paper":"/paper/2506.09404"},"observation_digest":"sha256:594450c4a163fc978b0a60857ab834df4db5d663d42dc74e2bd18fc9256a812c","observation_id":"1fbe2f60-5c4f-4189-9126-a367a9934733","resolution":{"observed_at":"2026-08-07T04:58:19.072722Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2106.05126","last_updated":"2022-03-15T13:44:23Z","snapshot_observed_at":"2026-07-06T11:17:34.454271Z","submitted_at":"2021-06-09T15:08:03Z","title":"Efficient Active Search for Combinatorial Optimization Problems","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2106.05126","snapshot_observed_at":"2026-08-03T07:51:26.640526Z","title":"Huang, J., Chen, Z.-G., Jiang, Y ., and Zhan, Z.-H","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2601.19041","last_updated":"2026-07-28T02:49:25Z","snapshot_observed_at":"2026-08-08T14:03:36.386048Z","submitted_at":"2026-01-26T23:51:19Z","title":"HeatACO: A Heatmap-Guided Max--Min Ant System for Large-Scale Travelling Salesman Problems","version":2},"reference_index":2022,"source":"pdf_text","source_observed_at":"2026-08-03T07:51:26.640526Z"},"links":{"cited_paper":"/paper/2106.05126","citing_paper":"/paper/2601.19041"},"observation_digest":"sha256:43ebb3c7d455409d665cbe66404bd619d7e5e2b26a83ad23a049e9a5594a6c45","observation_id":"108b342c-6f12-4a12-8754-096450ee6e25","resolution":{"observed_at":"2026-08-03T07:51:26.640526Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2106.05126","last_updated":"2022-03-15T13:44:23Z","snapshot_observed_at":"2026-07-06T11:17:34.454271Z","submitted_at":"2021-06-09T15:08:03Z","title":"Efficient Active Search for Combinatorial Optimization Problems","version":3},"cited_work":{"arxiv_id":"2106.05126","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2106.05126","snapshot_observed_at":"2026-07-01T20:46:13.596511Z","title":"arXiv preprint arXiv:2106.05126 , year=","venue":null,"work_id":"f87fbda8-de65-4716-941c-6f577d8842f8","year":2021},"citing_paper":{"arxiv_id":"2604.06940","last_updated":"2026-05-01T16:56:33Z","snapshot_observed_at":"2026-08-02T09:45:03.108944Z","submitted_at":"2026-04-08T11:04:45Z","title":"A First Guess is Rarely the Final Answer: Learning to Search in the Traveling Salesperson Problem","version":2},"reference_index":2,"source":"pdf_text","source_observed_at":"2026-05-10T17:59:33.189911Z"},"links":{"cited_paper":"/paper/2106.05126","citing_paper":"/paper/2604.06940"},"observation_digest":"sha256:6ce1e33c3b8b615e3a40375e36c1ed3b8bd74112fbd678c2643176ddf63bb693","observation_id":"e1931d87-0908-4934-9720-7de3606f31de","resolution":{"observed_at":"2026-05-11T05:41:01.255088Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2106.05126","last_updated":"2022-03-15T13:44:23Z","snapshot_observed_at":"2026-07-06T11:17:34.454271Z","submitted_at":"2021-06-09T15:08:03Z","title":"Efficient Active Search for Combinatorial Optimization Problems","version":3},"cited_work":{"arxiv_id":"2106.05126","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2106.05126","snapshot_observed_at":"2026-07-01T20:46:13.596511Z","title":"arXiv preprint arXiv:2106.05126 , year=","venue":null,"work_id":"f87fbda8-de65-4716-941c-6f577d8842f8","year":2021},"citing_paper":{"arxiv_id":"2604.18907","last_updated":"2026-04-20T23:14:48Z","snapshot_observed_at":"2026-08-02T07:41:12.503888Z","submitted_at":"2026-04-20T23:14:48Z","title":"Gradient-Based Program Synthesis with Neurally Interpreted Languages","version":1},"reference_index":58,"source":"arxiv_source","source_observed_at":"2026-05-10T04:29:33.858344Z"},"links":{"cited_paper":"/paper/2106.05126","citing_paper":"/paper/2604.18907"},"observation_digest":"sha256:105e2fce55d647a3cf8130e0dd1b85365e82cd300158f7083a5a4aac688e52e0","observation_id":"ed05cfee-f6ce-42c8-9733-45a64067b8c6","resolution":{"observed_at":"2026-05-11T11:56:08.713842Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2106.05126","last_updated":"2022-03-15T13:44:23Z","snapshot_observed_at":"2026-07-06T11:17:34.454271Z","submitted_at":"2021-06-09T15:08:03Z","title":"Efficient Active Search for Combinatorial Optimization Problems","version":3},"cited_work":{"arxiv_id":"2106.05126","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2106.05126","snapshot_observed_at":"2026-07-01T20:46:13.596511Z","title":"arXiv preprint arXiv:2106.05126 , year=","venue":null,"work_id":"f87fbda8-de65-4716-941c-6f577d8842f8","year":2021},"citing_paper":{"arxiv_id":"2606.01084","last_updated":"2026-05-31T08:09:02Z","snapshot_observed_at":"2026-08-09T08:53:38.522773Z","submitted_at":"2026-05-31T08:09:02Z","title":"MViewRouter: Internalizing Geometric Equivariance via Multi-view Alternating Attention for Combinatorial Routing","version":1},"reference_index":13,"source":"pdf_text","source_observed_at":"2026-06-28T17:47:15.466344Z"},"links":{"cited_paper":"/paper/2106.05126","citing_paper":"/paper/2606.01084"},"observation_digest":"sha256:5464ecb2c18227aa9f915509dd31985fa88a0488f29bba892f9cda4ca145d411","observation_id":"5dd6d8c6-a35b-4be1-9387-c208d3741906","resolution":{"observed_at":"2026-07-01T20:46:13.598094Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}}],"links":{"evidence":"/evidence","html":"/paper/2106.05126/citation-record","integrity":"/paper/2106.05126/integrity","json":"/paper/2106.05126/citation-record.json","paper":"/paper/2106.05126"},"outbound":[],"paper":{"arxiv_id":"2106.05126","last_updated":"2022-03-15T13:44:23Z","latest_version":3,"primary_category":"cs.LG","snapshot_observed_at":"2026-07-06T11:17:34.454271Z","submitted_at":"2021-06-09T15:08:03Z","title":"Efficient Active Search for Combinatorial Optimization Problems"},"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-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"thesis":"As of 10 August 2026, this Paper Citation Record lists 0 of 0 outbound references and 6 inbound Pith citation observations for arXiv:2106.05126."}