Literature and source checks of verification run 2 (2026-10-20 UTC; anonymous requests, generic user agent, logged in
the project's request log with the tag [verification run 2], not part of this package; downloads kept
outside the package).

Sources re-read in this run
- arXiv:0910.5577v1 (PDF, 19 pp.): Sec. 1 (list of the five systems; DFC "found unstable in the present scenario"),
  Sec. 2 (stable = irreducible and positively recurrent; finite-set criterion; large system limit; stability of an
  ODE; "not known to be sufficient nor necessary"), Sec. 3.1 (Fig. 1, Prop. 3.1, Remark on lambda as a scaling
  parameter, Prop. 3.2 with proof), Sec. 3.2 (Fig. 2 rates with denominator X+Y+1, eq. (5), Prop. 3.3 with proof:
  x and b grow, y decreases, a tends to lambda/2; the escaping set needs y(0) > 0 and a(0) > (x(0)+y(0)) lambda/(2x(0));
  Conjecture 3.4), Sec. 3.3 (Fig. 3, Props. 3.5, 3.6). arXiv API: only v1, journal-ref Queueing Systems (2011) 67: 183.
- Oberwolfach Report 48/2010 (open PDF, 68 pp.): Norros (joint with Reittu), pp. 2782-2783, read in full (model with
  "a randomly selected peer (seed included)", DFC conjecture, the consequence, the missing example in the opposite
  direction on p. 2783, reference [3] = arXiv:0910.5577). Hajek, "Peer to Peer Communication in Networks", starts on
  p. 2760; the theorem with condition (1) and the remark on the special case gamma = infinity, empty arrivals, proved
  in Hajek-Zhu arXiv:1002.3493, are on pp. 2762-2763; the reference list of that abstract ends on p. 2764, where the
  next abstract (Hooghiemstra) begins.  So Hajek's abstract occupies pp. 2760-2764, not 2760-2763.
- Springer article page of the published version: this run's request (00:26 UTC on 20 October) returned a 3 kB
  automated-access page; the abstract quoted in the note was read from the copy saved by the earlier run B
  (fetched 22:26 UTC on 19 October), dc.description field.
- zbMATH API, Zbl 1225.60145: review by Oleg K. Zakusilo; DFC "found to be very unsatisfactory in the present
  scenario"; "in the two simplest cases" stochastic proofs.
- Crossref (6 DOIs): 10.1007/s11134-011-9209-2 (Queueing Syst. 67(3) 183-206, 2011), 10.4171/OWR/2010/48 (Oberwolfach
  Rep. 7(4) 2745-2812, issued 2011), 10.1214/10-SSY017 (Stoch. Syst. 1(2) 246-273, 2011), 10.1109/TNET.2014.2331352
  (IEEE/ACM ToN 23(5) 1444-1456, 2015), 10.1016/j.orl.2012.02.002 (Oper. Res. Lett. 40(3) 190-194, 2012),
  10.2307/1427522 (Adv. Appl. Probab. 25(3) 518-548, 1993): all agree with references.bib.
- Fogelklou-Konstantopoulos-Tucker (ORL 2012): no abstract in Crossref, OpenAlex, Semantic Scholar (elided by the
  publisher) or zbMATH (Zbl 1245.90011, "contents unavailable"); only the title has been read by any stage.

Novelty searches of this run
- arXiv API: all:"deterministic first chunk" (0 hits); all:"two-chunk" AND all:recurrent (0); abs:chunk AND
  abs:"positive recurrence" (0); abs:"population process" AND abs:"large system limit" AND abs:stable (0).
- Crossref bibliographic query "deterministic first chunk file sharing stability": only the source itself relevant.
- zbMATH any:"first chunk" (2 hits) and any:"two-chunk" (3 hits): only the source itself relevant.
- OpenAlex search "deterministic first chunk": 0 hits; OpenAlex works citing W2080384304: 31 (status 200); all 31
  titles read in this run (latest: 2024 RFwPMS, 2025 IPFS performance); none is about the stochastic DFC chain.
- WebSearch (1): '"deterministic first chunk" peer-to-peer positive recurrent stochastic stable Lyapunov': arXiv
  1401.5099, 1904.04191, 1110.2753, 1708.09087, 0910.5577, 1002.3493, 0811.1003 -- other protocols or the source;
  no proof or disproof for the stochastic DFC chain.
Conclusion: no printed answer found; not a proof of novelty.  Not read by any stage: the full text of the published
version, the theses of Reittu, Oguz (2012) and Fogelklou (2012), the full texts of the citing works.
