Pith. sign in

Paper Citation Record · LEDGER

Sampling Luck Masquerades as Allocation Gain: Auditing Test-Time Budget Allocation for Neural Combinatorial Optimization

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.

A citation records a reference. It does not transfer a finding from one paper to another.

pith.paper-citation-record.v1
2608.13087 v1

Coverage vector

measured 15 of 15 reference resolution

Typed states for the displayed outbound observations.

Source: paper_references, paper_reference_links, observed 2026-08-15T17:07:33.235285Z

measured 15 of 15 standing notices

One-hop event checks from named stored sources.

Source: scholarly_work_events, retraction_status_cache, observed 2026-08-16T06:30:59.297886+00:00

measured 0 of 0 inbound itemization

Pith citing papers itemized under the disclosed page cap.

Source: paper_references, paper_reference_links

measured 0 of 1 external citation measurements

A source-named dated measurement, never combined with another source.

Source: cited_works

Reference resolution

15 of 15 outbound references displayed

  • verified exact3
  • verified fuzzy3
  • unresolved9
  • parse uncertain0
  • malformed identifier0
  • metadata mismatch0

External citation measurements

No source-named external measurement is stored.

Outbound references

Observation 5a8a6f06-73ad-4bf0-9b93-33d0fc00c7f3 · outbound

This paper cites Attention, Learn to Solve Routing Problems!.

Sampling Luck Masquerades as Allocation Gain: Auditing Test-Time Budget Allocation for Neural Combinatorial Optimization Attention, Learn to Solve Routing Problems!

Reference 1

Resolution
unresolved
no resolver link, observed 2026-08-15T17:07:33.178910Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=pdf_text observed=2026-08-15T17:07:33.178910Z digest=sha256:493e17c0eabf336da4a9feb1265eff98e262a1b634320d690b976abc3cf03dff

Observation 57a234b9-76ac-4db1-aa05-0c3b8e6cc859 · outbound

This paper cites POMO: Policy Optimization with Multiple Optima for Reinforcement Learning.

Sampling Luck Masquerades as Allocation Gain: Auditing Test-Time Budget Allocation for Neural Combinatorial Optimization POMO: Policy Optimization with Multiple Optima for Reinforcement Learning

Reference 2

Resolution
verified exact
local_arxiv, observed 2026-08-15T17:07:33.357091Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.

source=pdf_text observed=2026-08-15T17:07:33.183820Z digest=sha256:23a7476bf4af862339b1610bbc61537515a995b44c15068cada24662bf45f6a4

Observation 76f15da4-7892-4802-9aca-2477dff15c56 · outbound

This paper cites The optimizer’s curse: Skepticism and postdecision surprise in decision analysis,.

Sampling Luck Masquerades as Allocation Gain: Auditing Test-Time Budget Allocation for Neural Combinatorial Optimization The optimizer’s curse: Skepticism and postdecision surprise in decision analysis,

Reference 3

Resolution
unresolved
no resolver link, observed 2026-08-15T17:07:33.187514Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=pdf_text observed=2026-08-15T17:07:33.187514Z digest=sha256:bc67c3e271f254f3f580a8d39e04f38b573d4b04484e1679789dbe2f767a9271

Observation 301d56c2-e4a4-4eaa-8ac4-d1101f2cc894 · outbound

This paper cites Inference on winners,.

Sampling Luck Masquerades as Allocation Gain: Auditing Test-Time Budget Allocation for Neural Combinatorial Optimization Inference on winners,

Reference 4

Resolution
verified fuzzy
raw_fallback, observed 2026-08-15T17:07:33.413662Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.

source=pdf_text observed=2026-08-15T17:07:33.191190Z digest=sha256:73a036fbecf087a9d5e3196c76714928f6011cbad9cd20a9ae95e6cfbec38143

Observation 97894c58-b307-472d-bb4b-d8d0a7e59b10 · outbound

This paper cites A reality check for data snooping,.

Sampling Luck Masquerades as Allocation Gain: Auditing Test-Time Budget Allocation for Neural Combinatorial Optimization A reality check for data snooping,

Reference 5

Resolution
unresolved
no resolver link, observed 2026-08-15T17:07:33.194759Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=pdf_text observed=2026-08-15T17:07:33.194759Z digest=sha256:39b2d9ba10a108370c6319ae3d9080ae0dea3547210c71a94748e05e3ca65aa9

Observation fa07f47f-f2cd-4884-909c-8ef2d82f739e · outbound

This paper cites A test for superior predictive ability,.

Sampling Luck Masquerades as Allocation Gain: Auditing Test-Time Budget Allocation for Neural Combinatorial Optimization A test for superior predictive ability,

Reference 6

Resolution
unresolved
no resolver link, observed 2026-08-15T17:07:33.198793Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=pdf_text observed=2026-08-15T17:07:33.198793Z digest=sha256:1d611e092b290c07d7fa51a82791a423a24f3380095e47968cc511201c8ded89

Observation cb1efb69-9c87-4bcd-ae90-ee6b9dff526e · outbound

This paper cites Scaling LLM Test-Time Compute Optimally can be More Effective than Scaling Model Parameters.

Sampling Luck Masquerades as Allocation Gain: Auditing Test-Time Budget Allocation for Neural Combinatorial Optimization Scaling LLM Test-Time Compute Optimally can be More Effective than Scaling Model Parameters

Reference 7

Resolution
unresolved
no resolver link, observed 2026-08-15T17:07:33.203601Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=pdf_text observed=2026-08-15T17:07:33.203601Z digest=sha256:045713210e7e099d83f8f8a87d86f1f58d291226a764353ed6ceafeeb869b262

Observation 30e77e02-c13e-4d39-a806-ddbef2ff2643 · outbound

This paper cites Neural Solver Selection for Combinatorial Optimization.

Sampling Luck Masquerades as Allocation Gain: Auditing Test-Time Budget Allocation for Neural Combinatorial Optimization Neural Solver Selection for Combinatorial Optimization

Reference 8

Resolution
verified exact
local_arxiv, observed 2026-08-15T17:07:33.331893Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.

source=pdf_text observed=2026-08-15T17:07:33.207677Z digest=sha256:36fc04a5102fd22aa3b290e542bccfdddf20ec95b233e37f35465721545d1553

Observation e5f5d7e1-bc74-4a83-b994-9ea56866e587 · outbound

This paper cites The deflated Sharpe ratio: Correcting for selection bias, backtest overfitting, and non-normality,.

Sampling Luck Masquerades as Allocation Gain: Auditing Test-Time Budget Allocation for Neural Combinatorial Optimization The deflated Sharpe ratio: Correcting for selection bias, backtest overfitting, and non-normality,

Reference 9

Resolution
verified fuzzy
raw_fallback, observed 2026-08-15T17:07:33.388567Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.

source=pdf_text observed=2026-08-15T17:07:33.211654Z digest=sha256:3c707c285206228a750a4d14c34ccbf8f9e758f4690c9dae0f5dcec4eecb3b5e

Observation 406723b1-46d9-4a77-84df-767d840e65f8 · outbound

This paper cites Towards Reliable LLM Evaluation: Correcting the Winner's Curse in Adaptive Benchmarking.

Sampling Luck Masquerades as Allocation Gain: Auditing Test-Time Budget Allocation for Neural Combinatorial Optimization Towards Reliable LLM Evaluation: Correcting the Winner's Curse in Adaptive Benchmarking

Reference 10

Resolution
verified exact
local_arxiv, observed 2026-08-15T17:07:33.316165Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.

source=pdf_text observed=2026-08-15T17:07:33.215210Z digest=sha256:1fd92c56e383181906ab1025cf49d872eb4c50fc8a6bfcd4f7496b16133ba49c

Observation 230dbc34-6084-406a-a9c6-4ef50b2bd146 · outbound

This paper cites Learning How Hard to Think: Input-Adaptive Allocation of LM Computation.

Sampling Luck Masquerades as Allocation Gain: Auditing Test-Time Budget Allocation for Neural Combinatorial Optimization Learning How Hard to Think: Input-Adaptive Allocation of LM Computation

Reference 11

Resolution
unresolved
no resolver link, observed 2026-08-15T17:07:33.219320Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=pdf_text observed=2026-08-15T17:07:33.219320Z digest=sha256:381474a25d09da8f4ce4cf4b19467e443cfae746de7db46acf197151bb049e50

Observation e86b35c9-246d-4bad-84de-d59639e93ae5 · outbound

This paper cites Large Language Monkeys: Scaling Inference Compute with Repeated Sampling.

Sampling Luck Masquerades as Allocation Gain: Auditing Test-Time Budget Allocation for Neural Combinatorial Optimization Large Language Monkeys: Scaling Inference Compute with Repeated Sampling

Reference 12

Resolution
unresolved
no resolver link, observed 2026-08-15T17:07:33.223766Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=pdf_text observed=2026-08-15T17:07:33.223766Z digest=sha256:a347b2cc4a5c83ee522f8331c0139e467b05606ebd53b163204599a678ce0431

Observation e851859b-5cc8-47da-b9cf-2472c34436a1 · outbound

This paper cites Sym-NCO: Leveraging Symmetricity for Neural Combinatorial Optimization.

Sampling Luck Masquerades as Allocation Gain: Auditing Test-Time Budget Allocation for Neural Combinatorial Optimization Sym-NCO: Leveraging Symmetricity for Neural Combinatorial Optimization

Reference 13

Resolution
unresolved
no resolver link, observed 2026-08-15T17:07:33.227560Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=pdf_text observed=2026-08-15T17:07:33.227560Z digest=sha256:d9c48ba1cbc3763ed38716eed489f1e62bb5c041e1e5c07c4418cde1af38a7ab

Observation 6ac0eb79-ac29-430a-a709-e68685e43b42 · outbound

This paper cites How good is neural combina- torial optimization? A systematic evaluation on the traveling salesman problem,.

Sampling Luck Masquerades as Allocation Gain: Auditing Test-Time Budget Allocation for Neural Combinatorial Optimization How good is neural combina- torial optimization? A systematic evaluation on the traveling salesman problem,

Reference 14

Resolution
verified fuzzy
raw_fallback, observed 2026-08-15T17:07:33.377888Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.

source=pdf_text observed=2026-08-15T17:07:33.231758Z digest=sha256:5b43fff10e336000140f3d7bcc4dbc439f7f1a9f5deb72e59d51a7baa281b791

Observation 77e5f5b9-0998-427c-bad0-ba248bce81ce · outbound

This paper cites Do ImageNet Classifiers Generalize to ImageNet?.

Sampling Luck Masquerades as Allocation Gain: Auditing Test-Time Budget Allocation for Neural Combinatorial Optimization Do ImageNet Classifiers Generalize to ImageNet?

Reference 15

Resolution
unresolved
no resolver link, observed 2026-08-15T17:07:33.235285Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=pdf_text observed=2026-08-15T17:07:33.235285Z digest=sha256:8e9540de847cb1379da2d4b51fcd602111aec327988cd48dd33c31d22cc8b77d

Pith citing papers

No inbound Pith citation observations are available.