{"as_of":"2026-08-16T19:27:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:39e4337fc79a5dfab56a1d8622d5ae30c65ffeca861bca626553d8dd37607bb9","coverage":[{"denominator":15,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":15,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-15T17:07:33.235285Z","state":"measured"},{"denominator":15,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":15,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-16T06:30:59.297886+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.13087/citation-record","integrity":"/paper/2608.13087/integrity","json":"/paper/2608.13087/citation-record.json","paper":"/paper/2608.13087"},"outbound":[{"citation":{"cited_paper":{"arxiv_id":"1803.08475","last_updated":"2019-02-07T09:10:08Z","snapshot_observed_at":"2026-08-16T10:05:54.113196Z","submitted_at":"2018-03-22T17:22:24Z","title":"Attention, Learn to Solve Routing Problems!","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1803.08475","snapshot_observed_at":"2026-08-15T17:07:33.178910Z","title":"Attention, learn to solve routing problems!","venue":null,"work_id":null,"year":2019},"citing_paper":{"arxiv_id":"2608.13087","last_updated":"2026-08-13T10:53:48Z","snapshot_observed_at":"2026-08-16T19:11:38.699259Z","submitted_at":"2026-08-13T10:53:48Z","title":"Sampling Luck Masquerades as Allocation Gain: Auditing Test-Time Budget Allocation for Neural Combinatorial Optimization","version":1},"reference_index":1,"source":"pdf_text","source_observed_at":"2026-08-15T17:07:33.178910Z"},"links":{"cited_paper":"/paper/1803.08475","citing_paper":"/paper/2608.13087"},"observation_digest":"sha256:f1f42b8e7d1bfede90b2b67b81c65a8f3fb16694120ab3cc0ce6a98c2fcca4fd","observation_id":"5a8a6f06-73ad-4bf0-9b93-33d0fc00c7f3","resolution":{"observed_at":"2026-08-15T17:07:33.178910Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2010.16011","last_updated":"2021-07-13T05:20:17Z","snapshot_observed_at":"2026-08-16T19:09:25.141367Z","submitted_at":"2020-10-30T00:57:50Z","title":"POMO: Policy Optimization with Multiple Optima for Reinforcement Learning","version":3},"cited_work":{"arxiv_id":"2010.16011","doi":null,"metadata_source":"pith","pith_arxiv_id":"2010.16011","snapshot_observed_at":"2026-08-15T17:07:33.353100Z","title":"POMO: Policy Optimization with Multiple Optima for Reinforcement Learning","venue":"cs.LG","work_id":"4a865f7e-e6e1-428d-90f1-83ef2dade352","year":2020},"citing_paper":{"arxiv_id":"2608.13087","last_updated":"2026-08-13T10:53:48Z","snapshot_observed_at":"2026-08-16T19:11:38.699259Z","submitted_at":"2026-08-13T10:53:48Z","title":"Sampling Luck Masquerades as Allocation Gain: Auditing Test-Time Budget Allocation for Neural Combinatorial Optimization","version":1},"reference_index":2,"source":"pdf_text","source_observed_at":"2026-08-15T17:07:33.183820Z"},"links":{"cited_paper":"/paper/2010.16011","citing_paper":"/paper/2608.13087"},"observation_digest":"sha256:5788922d1e0430e0eedb785902bfeea4236c6f0d174469ccf17190b59185dc9e","observation_id":"57a234b9-76ac-4db1-aa05-0c3b8e6cc859","resolution":{"observed_at":"2026-08-15T17:07:33.357091Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T17:07:33.187514Z","title":"The optimizer’s curse: Skepticism and postdecision surprise in decision analysis,","venue":null,"work_id":null,"year":2006},"citing_paper":{"arxiv_id":"2608.13087","last_updated":"2026-08-13T10:53:48Z","snapshot_observed_at":"2026-08-16T19:11:38.699259Z","submitted_at":"2026-08-13T10:53:48Z","title":"Sampling Luck Masquerades as Allocation Gain: Auditing Test-Time Budget Allocation for Neural Combinatorial Optimization","version":1},"reference_index":3,"source":"pdf_text","source_observed_at":"2026-08-15T17:07:33.187514Z"},"links":{"citing_paper":"/paper/2608.13087"},"observation_digest":"sha256:170301435d476bc13a12034a84e8a993c9920ad74a863811033f2ef4188c3aaa","observation_id":"76f15da4-7892-4802-9aca-2477dff15c56","resolution":{"observed_at":"2026-08-15T17:07:33.187514Z","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":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T17:07:33.409963Z","title":"Inference on winners,","venue":null,"work_id":"f80ccbdf-34c7-45de-b694-c3cb6afaa572","year":2024},"citing_paper":{"arxiv_id":"2608.13087","last_updated":"2026-08-13T10:53:48Z","snapshot_observed_at":"2026-08-16T19:11:38.699259Z","submitted_at":"2026-08-13T10:53:48Z","title":"Sampling Luck Masquerades as Allocation Gain: Auditing Test-Time Budget Allocation for Neural Combinatorial Optimization","version":1},"reference_index":4,"source":"pdf_text","source_observed_at":"2026-08-15T17:07:33.191190Z"},"links":{"citing_paper":"/paper/2608.13087"},"observation_digest":"sha256:ffa519185d28cbac934534f30387a08b06aa20676f67b0e2bdc18ed942b00024","observation_id":"301d56c2-e4a4-4eaa-8ac4-d1101f2cc894","resolution":{"observed_at":"2026-08-15T17:07:33.413662Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T17:07:33.194759Z","title":"A reality check for data snooping,","venue":null,"work_id":null,"year":2000},"citing_paper":{"arxiv_id":"2608.13087","last_updated":"2026-08-13T10:53:48Z","snapshot_observed_at":"2026-08-16T19:11:38.699259Z","submitted_at":"2026-08-13T10:53:48Z","title":"Sampling Luck Masquerades as Allocation Gain: Auditing Test-Time Budget Allocation for Neural Combinatorial Optimization","version":1},"reference_index":5,"source":"pdf_text","source_observed_at":"2026-08-15T17:07:33.194759Z"},"links":{"citing_paper":"/paper/2608.13087"},"observation_digest":"sha256:6d653c7404f25aa7e68bcf67d0ba6fa9e98dcbfeea571604b3b966ff35c33f26","observation_id":"97894c58-b307-472d-bb4b-d8d0a7e59b10","resolution":{"observed_at":"2026-08-15T17:07:33.194759Z","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-15T17:07:33.198793Z","title":"A test for superior predictive ability,","venue":null,"work_id":null,"year":2005},"citing_paper":{"arxiv_id":"2608.13087","last_updated":"2026-08-13T10:53:48Z","snapshot_observed_at":"2026-08-16T19:11:38.699259Z","submitted_at":"2026-08-13T10:53:48Z","title":"Sampling Luck Masquerades as Allocation Gain: Auditing Test-Time Budget Allocation for Neural Combinatorial Optimization","version":1},"reference_index":6,"source":"pdf_text","source_observed_at":"2026-08-15T17:07:33.198793Z"},"links":{"citing_paper":"/paper/2608.13087"},"observation_digest":"sha256:857a03a4d9fec7ff217df5db0e22a1cd8431d8fd037294b673f2be4bec748674","observation_id":"fa07f47f-f2cd-4884-909c-8ef2d82f739e","resolution":{"observed_at":"2026-08-15T17:07:33.198793Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2408.03314","last_updated":"2024-08-06T17:35:05Z","snapshot_observed_at":"2026-07-06T02:11:23.670680Z","submitted_at":"2024-08-06T17:35:05Z","title":"Scaling LLM Test-Time Compute Optimally can be More Effective than Scaling Model Parameters","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2408.03314","snapshot_observed_at":"2026-08-15T17:07:33.203601Z","title":"Scaling test-time compute optimally can be more effective than scaling LLM parameters,","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2608.13087","last_updated":"2026-08-13T10:53:48Z","snapshot_observed_at":"2026-08-16T19:11:38.699259Z","submitted_at":"2026-08-13T10:53:48Z","title":"Sampling Luck Masquerades as Allocation Gain: Auditing Test-Time Budget Allocation for Neural Combinatorial Optimization","version":1},"reference_index":7,"source":"pdf_text","source_observed_at":"2026-08-15T17:07:33.203601Z"},"links":{"cited_paper":"/paper/2408.03314","citing_paper":"/paper/2608.13087"},"observation_digest":"sha256:7eb13299e5a34d9aa6fa569d8f1c494361137454e1334f11822fc7047178e8e2","observation_id":"cb1efb69-9c87-4bcd-ae90-ee6b9dff526e","resolution":{"observed_at":"2026-08-15T17:07:33.203601Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2410.09693","last_updated":"2025-05-24T09:56:40Z","snapshot_observed_at":"2026-08-16T13:09:58.819274Z","submitted_at":"2024-10-13T02:05:41Z","title":"Neural Solver Selection for Combinatorial Optimization","version":2},"cited_work":{"arxiv_id":"2410.09693","doi":null,"metadata_source":"pith","pith_arxiv_id":"2410.09693","snapshot_observed_at":"2026-08-15T17:07:33.327684Z","title":"Neural Solver Selection for Combinatorial Optimization","venue":"math.OC","work_id":"bc2fde68-c652-45a5-b2aa-ca852778d7fb","year":2024},"citing_paper":{"arxiv_id":"2608.13087","last_updated":"2026-08-13T10:53:48Z","snapshot_observed_at":"2026-08-16T19:11:38.699259Z","submitted_at":"2026-08-13T10:53:48Z","title":"Sampling Luck Masquerades as Allocation Gain: Auditing Test-Time Budget Allocation for Neural Combinatorial Optimization","version":1},"reference_index":8,"source":"pdf_text","source_observed_at":"2026-08-15T17:07:33.207677Z"},"links":{"cited_paper":"/paper/2410.09693","citing_paper":"/paper/2608.13087"},"observation_digest":"sha256:fb1f24e57e32a9f1b4679a7b183300e4bb103112cb118f5a0026148f25a3657f","observation_id":"30e77e02-c13e-4d39-a806-ddbef2ff2643","resolution":{"observed_at":"2026-08-15T17:07:33.331893Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T17:07:33.384845Z","title":"The deflated Sharpe ratio: Correcting for selection bias, backtest overfitting, and non-normality,","venue":null,"work_id":"e5476fb4-637d-469b-a3ab-da603952fed0","year":2014},"citing_paper":{"arxiv_id":"2608.13087","last_updated":"2026-08-13T10:53:48Z","snapshot_observed_at":"2026-08-16T19:11:38.699259Z","submitted_at":"2026-08-13T10:53:48Z","title":"Sampling Luck Masquerades as Allocation Gain: Auditing Test-Time Budget Allocation for Neural Combinatorial Optimization","version":1},"reference_index":9,"source":"pdf_text","source_observed_at":"2026-08-15T17:07:33.211654Z"},"links":{"citing_paper":"/paper/2608.13087"},"observation_digest":"sha256:6f380870fcab5c9481157fd5b04ebc1c18b8ceb8b481f5b36f3e4f7b76660796","observation_id":"e5f5d7e1-bc74-4a83-b994-9ea56866e587","resolution":{"observed_at":"2026-08-15T17:07:33.388567Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2605.05973","last_updated":"2026-05-07T10:18:56Z","snapshot_observed_at":"2026-08-13T17:01:55.814171Z","submitted_at":"2026-05-07T10:18:56Z","title":"Towards Reliable LLM Evaluation: Correcting the Winner's Curse in Adaptive Benchmarking","version":1},"cited_work":{"arxiv_id":"2605.05973","doi":null,"metadata_source":"pith","pith_arxiv_id":"2605.05973","snapshot_observed_at":"2026-08-15T17:07:33.310001Z","title":"Towards Reliable LLM Evaluation: Correcting the Winner's Curse in Adaptive Benchmarking","venue":"stat.ML","work_id":"9b830431-603e-4e63-8cc4-6bc418f79ea4","year":2026},"citing_paper":{"arxiv_id":"2608.13087","last_updated":"2026-08-13T10:53:48Z","snapshot_observed_at":"2026-08-16T19:11:38.699259Z","submitted_at":"2026-08-13T10:53:48Z","title":"Sampling Luck Masquerades as Allocation Gain: Auditing Test-Time Budget Allocation for Neural Combinatorial Optimization","version":1},"reference_index":10,"source":"pdf_text","source_observed_at":"2026-08-15T17:07:33.215210Z"},"links":{"cited_paper":"/paper/2605.05973","citing_paper":"/paper/2608.13087"},"observation_digest":"sha256:db035ab34f1c8042198341520dc09f06e9ad0042f71aa4b60e5df32d09ee656c","observation_id":"406723b1-46d9-4a77-84df-767d840e65f8","resolution":{"observed_at":"2026-08-15T17:07:33.316165Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2410.04707","last_updated":"2024-10-07T02:52:30Z","snapshot_observed_at":"2026-08-16T13:12:04.336691Z","submitted_at":"2024-10-07T02:52:30Z","title":"Learning How Hard to Think: Input-Adaptive Allocation of LM Computation","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2410.04707","snapshot_observed_at":"2026-08-15T17:07:33.219320Z","title":"Learn- ing how hard to think: Input-adaptive allocation of LM computa- tion,","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2608.13087","last_updated":"2026-08-13T10:53:48Z","snapshot_observed_at":"2026-08-16T19:11:38.699259Z","submitted_at":"2026-08-13T10:53:48Z","title":"Sampling Luck Masquerades as Allocation Gain: Auditing Test-Time Budget Allocation for Neural Combinatorial Optimization","version":1},"reference_index":11,"source":"pdf_text","source_observed_at":"2026-08-15T17:07:33.219320Z"},"links":{"cited_paper":"/paper/2410.04707","citing_paper":"/paper/2608.13087"},"observation_digest":"sha256:c9236334793dbcb78b2147368fb1e8c6d9297366bd8f5e26c5e503ef447ee587","observation_id":"230dbc34-6084-406a-a9c6-4ef50b2bd146","resolution":{"observed_at":"2026-08-15T17:07:33.219320Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2407.21787","last_updated":"2024-12-30T19:03:24Z","snapshot_observed_at":"2026-08-14T10:00:52.343929Z","submitted_at":"2024-07-31T17:57:25Z","title":"Large Language Monkeys: Scaling Inference Compute with Repeated Sampling","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2407.21787","snapshot_observed_at":"2026-08-15T17:07:33.223766Z","title":"Large language monkeys: Scaling inference compute with repeated sampling,","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2608.13087","last_updated":"2026-08-13T10:53:48Z","snapshot_observed_at":"2026-08-16T19:11:38.699259Z","submitted_at":"2026-08-13T10:53:48Z","title":"Sampling Luck Masquerades as Allocation Gain: Auditing Test-Time Budget Allocation for Neural Combinatorial Optimization","version":1},"reference_index":12,"source":"pdf_text","source_observed_at":"2026-08-15T17:07:33.223766Z"},"links":{"cited_paper":"/paper/2407.21787","citing_paper":"/paper/2608.13087"},"observation_digest":"sha256:94c829358bc4899aba207b240e9679eaae6545a000dc6db921628a1272d1d8ab","observation_id":"e86b35c9-246d-4bad-84de-d59639e93ae5","resolution":{"observed_at":"2026-08-15T17:07:33.223766Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2205.13209","last_updated":"2023-01-04T01:35:20Z","snapshot_observed_at":"2026-08-16T16:57:32.631153Z","submitted_at":"2022-05-26T07:55:43Z","title":"Sym-NCO: Leveraging Symmetricity for Neural Combinatorial Optimization","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2205.13209","snapshot_observed_at":"2026-08-15T17:07:33.227560Z","title":"Sym-NCO: Leveraging symmetricity for neural combinatorial optimization,","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2608.13087","last_updated":"2026-08-13T10:53:48Z","snapshot_observed_at":"2026-08-16T19:11:38.699259Z","submitted_at":"2026-08-13T10:53:48Z","title":"Sampling Luck Masquerades as Allocation Gain: Auditing Test-Time Budget Allocation for Neural Combinatorial Optimization","version":1},"reference_index":13,"source":"pdf_text","source_observed_at":"2026-08-15T17:07:33.227560Z"},"links":{"cited_paper":"/paper/2205.13209","citing_paper":"/paper/2608.13087"},"observation_digest":"sha256:aee8c8bf7a46cd72c03433e35c14864b7a03c2d008c1a93cdd06aaac9df90ae5","observation_id":"e851859b-5cc8-47da-b9cf-2472c34436a1","resolution":{"observed_at":"2026-08-15T17:07:33.227560Z","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":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T17:07:33.374203Z","title":"How good is neural combina- torial optimization? A systematic evaluation on the traveling salesman problem,","venue":null,"work_id":"14f258a7-9bac-4e03-b5d5-c8b0f5b9a7e2","year":2023},"citing_paper":{"arxiv_id":"2608.13087","last_updated":"2026-08-13T10:53:48Z","snapshot_observed_at":"2026-08-16T19:11:38.699259Z","submitted_at":"2026-08-13T10:53:48Z","title":"Sampling Luck Masquerades as Allocation Gain: Auditing Test-Time Budget Allocation for Neural Combinatorial Optimization","version":1},"reference_index":14,"source":"pdf_text","source_observed_at":"2026-08-15T17:07:33.231758Z"},"links":{"citing_paper":"/paper/2608.13087"},"observation_digest":"sha256:f3b84be4a71142e3d2807d3a1d470616a6d198a47d6a0e17681932dda6948f1a","observation_id":"6ac0eb79-ac29-430a-a709-e68685e43b42","resolution":{"observed_at":"2026-08-15T17:07:33.377888Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1902.10811","last_updated":"2019-06-12T17:42:33Z","snapshot_observed_at":"2026-08-14T17:16:40.613707Z","submitted_at":"2019-02-13T20:35:44Z","title":"Do ImageNet Classifiers Generalize to ImageNet?","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1902.10811","snapshot_observed_at":"2026-08-15T17:07:33.235285Z","title":"Do ImageNet clas- sifiers generalize to ImageNet?","venue":null,"work_id":null,"year":2019},"citing_paper":{"arxiv_id":"2608.13087","last_updated":"2026-08-13T10:53:48Z","snapshot_observed_at":"2026-08-16T19:11:38.699259Z","submitted_at":"2026-08-13T10:53:48Z","title":"Sampling Luck Masquerades as Allocation Gain: Auditing Test-Time Budget Allocation for Neural Combinatorial Optimization","version":1},"reference_index":15,"source":"pdf_text","source_observed_at":"2026-08-15T17:07:33.235285Z"},"links":{"cited_paper":"/paper/1902.10811","citing_paper":"/paper/2608.13087"},"observation_digest":"sha256:6fdb6fc6cebbd30125b7158a1e2d49162883b0678828b12250b69bebdb743640","observation_id":"77e5f5b9-0998-427c-bad0-ba248bce81ce","resolution":{"observed_at":"2026-08-15T17:07:33.235285Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"paper":{"arxiv_id":"2608.13087","last_updated":"2026-08-13T10:53:48Z","latest_version":1,"primary_category":"cs.LG","snapshot_observed_at":"2026-08-16T19:11:38.699259Z","submitted_at":"2026-08-13T10:53:48Z","title":"Sampling Luck Masquerades as Allocation Gain: Auditing Test-Time Budget Allocation for Neural Combinatorial Optimization"},"reference_resolution":{"displayed":15,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":9,"verified_exact":3,"verified_fuzzy":3},"total_outbound_references":15},"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-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"thesis":"As of 16 August 2026, this Paper Citation Record lists 15 of 15 outbound references and 0 inbound Pith citation observations for arXiv:2608.13087."}