{"as_of":"2026-08-09T22:36:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:663712954902cb31b60a7c2a6b475806cc3d69a2dc50265f218f5f5a8588a605","coverage":[{"denominator":6,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":6,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-04T00:49:55.058885Z","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-09T06:31:02.800959+00:00","state":"measured"},{"denominator":0,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":0,"source":"paper_references, paper_reference_links","source_observed_at":null,"state":"measured"},{"denominator":1,"lane":"external_citation_measurements","note":"A source-named dated measurement, never combined with another source.","records_observed":0,"source":"cited_works","source_observed_at":null,"state":"measured"}],"external_citation_measurements":[],"inbound":[],"links":{"evidence":"/evidence","html":"/paper/2608.00296/citation-record","integrity":"/paper/2608.00296/integrity","json":"/paper/2608.00296/citation-record.json","paper":"/paper/2608.00296"},"outbound":[{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-04T00:49:54.637867Z","title":"2020 , eprint =","venue":null,"work_id":null,"year":2020},"citing_paper":{"arxiv_id":"2608.00296","last_updated":"2026-07-31T21:11:48Z","snapshot_observed_at":"2026-08-08T23:55:30.721954Z","submitted_at":"2026-07-31T21:11:48Z","title":"Stabilized Best-of-$K$ Training for Neural Combinatorial Optimization","version":1},"reference_index":1,"source":"arxiv_source","source_observed_at":"2026-08-04T00:49:54.637867Z"},"links":{"citing_paper":"/paper/2608.00296"},"observation_digest":"sha256:b92bb651fd0beecbb9e01507f70888376b669a34d623bfd82bbd4a171d129b37","observation_id":"e756a73b-31a5-4491-b22d-00e0f686a065","resolution":{"observed_at":"2026-08-04T00:49:54.637867Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-04T00:49:54.685712Z","title":"Winner Takes It All: Training Performant","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2608.00296","last_updated":"2026-07-31T21:11:48Z","snapshot_observed_at":"2026-08-08T23:55:30.721954Z","submitted_at":"2026-07-31T21:11:48Z","title":"Stabilized Best-of-$K$ Training for Neural Combinatorial Optimization","version":1},"reference_index":2,"source":"arxiv_source","source_observed_at":"2026-08-04T00:49:54.685712Z"},"links":{"citing_paper":"/paper/2608.00296"},"observation_digest":"sha256:9facf465a9a28b0ec030a522a53f8dc86726e8a59da855be0d1d740ee8ce7a35","observation_id":"d4c827ae-409e-4e16-a647-6c8960841a67","resolution":{"observed_at":"2026-08-04T00:49:54.685712Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-04T00:49:54.722456Z","title":"Leader Reward for","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2608.00296","last_updated":"2026-07-31T21:11:48Z","snapshot_observed_at":"2026-08-08T23:55:30.721954Z","submitted_at":"2026-07-31T21:11:48Z","title":"Stabilized Best-of-$K$ Training for Neural Combinatorial Optimization","version":1},"reference_index":3,"source":"arxiv_source","source_observed_at":"2026-08-04T00:49:54.722456Z"},"links":{"citing_paper":"/paper/2608.00296"},"observation_digest":"sha256:5c25d5fa2c8ca1b77c429ce666e1b9ff6e7cda51eadfce5a984f5206d3c59a33","observation_id":"3cf052a6-a3e8-499e-bf48-cd60dc73ef02","resolution":{"observed_at":"2026-08-04T00:49:54.722456Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-04T00:49:54.767551Z","title":"2025 , eprint =","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2608.00296","last_updated":"2026-07-31T21:11:48Z","snapshot_observed_at":"2026-08-08T23:55:30.721954Z","submitted_at":"2026-07-31T21:11:48Z","title":"Stabilized Best-of-$K$ Training for Neural Combinatorial Optimization","version":1},"reference_index":4,"source":"arxiv_source","source_observed_at":"2026-08-04T00:49:54.767551Z"},"links":{"citing_paper":"/paper/2608.00296"},"observation_digest":"sha256:996e23741410a4668b47ce42e5b82b78c5f8baa566c67aa5d50582aea3f96b30","observation_id":"8abf02ee-ced8-4cd6-b11e-0bc74bdc121a","resolution":{"observed_at":"2026-08-04T00:49:54.767551Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2606.06080","last_updated":"2026-06-04T12:16:39Z","snapshot_observed_at":"2026-07-06T23:45:56.266116Z","submitted_at":"2026-06-04T12:16:39Z","title":"On Advantage Estimates for Max@K Policy Gradients","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2606.06080","snapshot_observed_at":"2026-08-04T00:49:54.921367Z","title":"2606.06080 , archivePrefix =","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2608.00296","last_updated":"2026-07-31T21:11:48Z","snapshot_observed_at":"2026-08-08T23:55:30.721954Z","submitted_at":"2026-07-31T21:11:48Z","title":"Stabilized Best-of-$K$ Training for Neural Combinatorial Optimization","version":1},"reference_index":5,"source":"arxiv_source","source_observed_at":"2026-08-04T00:49:54.921367Z"},"links":{"cited_paper":"/paper/2606.06080","citing_paper":"/paper/2608.00296"},"observation_digest":"sha256:39c69361f1114e109052893286a59364f35eb703edb89a7908c418ee52db3e9a","observation_id":"006768af-557e-43b9-92c8-62ce1a4519a5","resolution":{"observed_at":"2026-08-04T00:49:54.921367Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2606.06096","last_updated":"2026-06-04T12:34:15Z","snapshot_observed_at":"2026-07-06T23:46:01.165261Z","submitted_at":"2026-06-04T12:34:15Z","title":"OrderGrad: Optimizing Beyond the Mean with Order-Statistic Policy Gradient Estimation","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2606.06096","snapshot_observed_at":"2026-08-04T00:49:55.058885Z","title":"2606.06096 , archivePrefix =","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2608.00296","last_updated":"2026-07-31T21:11:48Z","snapshot_observed_at":"2026-08-08T23:55:30.721954Z","submitted_at":"2026-07-31T21:11:48Z","title":"Stabilized Best-of-$K$ Training for Neural Combinatorial Optimization","version":1},"reference_index":6,"source":"arxiv_source","source_observed_at":"2026-08-04T00:49:55.058885Z"},"links":{"cited_paper":"/paper/2606.06096","citing_paper":"/paper/2608.00296"},"observation_digest":"sha256:fd2bd311913d28195a826f43cfbb32f0646146177cf46bb50c770696ef7ce2bf","observation_id":"f65710a9-e0cd-46d2-9e9c-bdffc8fa8711","resolution":{"observed_at":"2026-08-04T00:49:55.058885Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"paper":{"arxiv_id":"2608.00296","last_updated":"2026-07-31T21:11:48Z","latest_version":1,"primary_category":"cs.LG","snapshot_observed_at":"2026-08-08T23:55:30.721954Z","submitted_at":"2026-07-31T21:11:48Z","title":"Stabilized Best-of-$K$ Training for Neural Combinatorial Optimization"},"reference_resolution":{"displayed":6,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":6,"verified_exact":0,"verified_fuzzy":0},"total_outbound_references":6},"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-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"thesis":"As of 9 August 2026, this Paper Citation Record lists 6 of 6 outbound references and 0 inbound Pith citation observations for arXiv:2608.00296."}