{"as_of":"2026-08-13T22:06:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:ea8a3757598ad3d376ef4ca9084c768a0a7a220cc5979f2f6d825a24b177a01b","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-13T06:32:02.005865+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-12T20:08:10.136772Z","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:26dd426ee540aaefa525c0f2c20f2a1331aeaf1957c24f15a7916d5f5c8533e7","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-12T20:08:10.136772Z","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:b37e562c543d9f62648063bf739e3b8b880f78dc11abf129a6714d9743f8c3a7","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-12T20:08:10.136772Z","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:90384b67b98bb16dbf55a1b46c45298b5bc96404a439f8606b81c10bd60ff5c6","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-12T20:08:10.136772Z","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:0d20ae17c995391055aa56dee210c90520d7417b8ee82c20495ed0dd2ef93029","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-08-12T12:04:08.657900Z","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-12T20:08:10.136772Z","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:c423fd4ad4c743173fa1626784ae6b1c8420815f3c1cf29fa92d4c50a6534611","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-08-13T00:39:41.357427Z","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-12T20:08:10.136772Z","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:d44859ee3a5bada8c6396cb8b05adf9bdaff0389c70bdd849dfcbfb414d1b42c","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-12T20:08:10.136772Z","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-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+00:00","source":"retraction_watch"}],"thesis":"As of 13 August 2026, this Paper Citation Record lists 6 of 6 outbound references and 0 inbound Pith citation observations for arXiv:2608.00296."}