{"id":"ad04e186-4d80-4cbe-98e6-0634e8153dce","arxiv_id":"1908.07184","paper_version":1,"verdict":"CONDITIONAL","confidence":"HIGH","novelty_score":2.0,"correctness_risk":"low","formal_verification":"none","parameter_count":0,"one_line_summary":"The paper gives closed-form formulas for urn transfer probabilities that follow directly from linearity of expectation and are not new.","lead":"This math note derives simple formulas for the probability of drawing a white ball after randomly transferring balls between two or more urns. The results are correct, but they are elementary restatements of standard probability calculations and contain little new content.","discovery_kind":"extension","skeptic_critique":{"model":"deepseek-v4-flash","headline":"No significant objection identified: formula (4)/(6) and the multi-urn recurrences are correct under standard uniform sampling; only minor unstated linearity steps and an a=0 edge case.","rationale":"The paper's central mathematical claim, formula (4), equivalently (6), is an elementary consequence of the hypergeometric mean and linearity of expectation. I checked the direct proof of Theorem 1, the extension to multiple source urns in Theorem 3, and the sequential recurrence in Theorem 4; all are mathematically sound under the standard uniform-without-replacement sampling rule. The reader's weakest assumption (uniform random sampling) is indeed where formulas could fail if violated, but it is standard and effectively stated. I found no internal inconsistency or false derivation. The only caveats are that the lemma's proof assumes a>0 and that Exercise 2 and Theorem 4 rely on an unstated linearity-of-expectation step when the source urn's composition is random. These are minor and do not undermine the central claim. The reader's CONDITIONAL verdict is based on novelty overclaim, which is a reasonable editorial concern but not a correctness defect. Since my stress-test finds no load-bearing correctness concern, the appropriate verdict adjustment is UNCHANGED.","tokens_in":5279,"tokens_out":13875,"duration_ms":142415,"concrete_test":"Run an exhaustive enumeration for a small two-stage recurrence instance: urn Π0 with (2W,3B), urn Π1 with (1W,4B), k0=2; urn Π2 with (0W,5B), k1=2. Enumerate all equally likely transfer outcomes and compute the final white-draw probability from Π2 directly; compare with recurrence (10). If they agree, the recurrence and its implicit linearity justification hold.","verdict_should_be":"UNCHANGED","load_bearing_attack":"Formula (4)/(6) is correct: after transferring k balls, the expected white count in urn Π is c + k·a/(a+b), so by linearity of expectation the probability of drawing white is (c + k·a/(a+b))/(c+d+k). Theorems 3 and 4 are also valid: the final draw probability is affine in the source urn's white proportion, so conditioning on the source composition and then taking expectation gives the stated recurrences. The only genuinely assumed condition is uniform random sampling without replacement, which is the standard reading of 'randomly taken out' and is consistent with the schemes described. Two minor caveats do not affect the central claim: the proof of the lemma divides by a and so needs a separate trivial argument for a=0, and Exercise 2 implicitly replaces a random remaining white count by its expectation (justified by linearity, but not stated). The reader's novelty concern is legitimate as a contribution-level issue, but it is not a correctness objection to formula (4).","agreement_with_reader":"partial"},"referee_report":{"model":"deepseek-v4-flash","summary":"The paper considers urn schemes with transfers between urns and proposes simplified formulas for the probability of drawing a white ball from a receiving urn after a random sample of k balls is transferred from one or more source urns. The main result, Theorem 1 (formula (4), equivalently (6)), states that this probability is the affine expression alpha + (beta - alpha) theta, where alpha = c/(c+d+k), beta = (c+k)/(c+d+k), and theta = a/(a+b) is the white proportion in the source urn. Theorem 2 rewrites this in terms of total ball counts, Theorem 3 generalizes to n source urns, and Theorem 4 supplies a recurrence for a chain of urns. The proofs use binomial coefficient identities and linearity of expectation, and three worked exercises illustrate the formulas.","tokens_in":5422,"tokens_out":3897,"duration_ms":34152,"significance":"If the results hold, they give a direct, combinatorial-sum-free way to compute probabilities in these urn schemes, which is useful for teaching and for quick calculations. The central formula is parameter-free, explicitly falsifiable, and is derived from elementary binomial identities and linearity of expectation. The paper includes correct worked exercises. The main limitation is that the formulas are straightforward consequences of linearity of expectation and are consistent with standard urn theory, so the novelty is mainly pedagogical rather than an advance in research-level probability.","major_comments":[],"minor_comments":[{"comment":"The proof of Theorem 3 is omitted with the note that it repeats the proof of Theorem 2; since this is a key generalization, a brief proof (or a reference to a linearity-of-expectation argument) should be included.","section":"Section 1, Theorem 3"},{"comment":"In the sentence 'This relation immediately implies formula (2)', the reference is incorrect: the geometric construction leads to formula (4), not the lemma numbered (2).","section":"Section 1, geometric interpretation"},{"comment":"The sentence 'For arbitrary ξ = k, according to standard reasoning PΠ(A|ξ = 2) = ...' should state ξ = k, not ξ = 2; the displayed formula is for general k.","section":"Section 1, proof of Theorem 1"},{"comment":"In equation (10), the notation αs1 and βs1 is reused for the m-th step after being introduced for the first step in equation (9); using α_sm and β_sm would remove the ambiguity.","section":"Section 1, Theorem 4"},{"comment":"The assumption that balls are sampled uniformly without replacement from each urn is not stated explicitly; this is standard for urn models but should be spelled out as a defining condition of the schemes.","section":"Introduction and Scheme [A(k)]"},{"comment":"The lemma and its proof divide by a; a separate trivial argument is needed for the case a = 0, although formula (6) remains valid in that case.","section":"Lemma"},{"comment":"The displayed solution is ambiguous: it should be written as ((11850/15000)·10000 + 15800)/27000 = 79/90 rather than as a chain of quotients.","section":"Exercise 1"},{"comment":"There are minor grammatical errors, e.g., 'The urn schemes is one of the simplest models' should be 'The urn schemes are one of the simplest models', and 'that be generalization' should be 'that are generalizations'.","section":"Throughout"}],"recommendation":"minor_revision","confidential_remarks":"The manuscript is mathematically correct and the formulas are elementary, but the contribution is modest; the results are immediate from linearity of expectation and are not new to the urn-model literature. The paper would be better positioned as a pedagogical note or an expository article. No concerns about citation patterns or novelty disclosure; the exercises and derivations are reproducible."},"author_rebuttal":null,"desk_editor":{"model":"deepseek-v4-flash","letter":"Short version: the math checks out, but the main result is textbook material. Formula (4)/(6) is the mean of a hypergeometric distribution written as a weighted average; Theorems 2 and 3 are linearity of expectation; Theorem 4 iterates the same idea. None of this is new, but it is not wrong either.\n\nWhat it does well: the derivations are clear, the worked examples are all correct, and the geometric picture is a nice way to visualize the interpolation. The recurrence in Theorem 4 is a clean way to propagate probabilities through a chain of urns and would be genuinely useful in a classroom setting. The assumptions are standard uniform random sampling without replacement; the stress-test note is right that there is no correctness objection to the central claim.\n\nWhere it falls short: the novelty overclaim is real. The paper presents formula (6) as a simplified direct calculation without citing the hypergeometric mean or the standard conditional-expectation argument. That is a citation-pattern problem, not a math problem. The proof of Theorem 3 is simply omitted ('the proof may be omitted'), which is acceptable for a note but should be labeled as an exercise. There are minor typos: 'formula (2)' in the geometric interpretation should read 'formula (4)', and the proof for xi=2 is mislabeled. The proof of the lemma divides by a, so a=0 needs a separate trivial argument. Exercise 2 implicitly replaces a random remaining white count by its expectation without saying so. None of these are load-bearing; they are the usual small blemishes of an elementary note.\n\nBottom line: this is a pedagogical note, not a research contribution. A teacher looking for compact formulas for multi-urn examples might get some value; a researcher gets nothing new. I would not cite it in my own work. As a research paper it should be desk-rejected or sent back for reframing; if the venue publishes expository notes, it could be peer-reviewed after the novelty claims are stripped and the typos fixed.","headline":"Correct but standard: the paper repackages the hypergeometric mean as a new urn formula and overclaims novelty.","tokens_in":5954,"tokens_out":2258,"would_cite":false,"duration_ms":23596,"reading_group":"no","serious_thinker":"yes","would_accept_peer_review":false},"rs_alignment":null,"lean_confirmation":null,"pith_extraction":{"msc":["60A99","60D99"],"pacs":[],"model":"deepseek-v4-flash","headline":"This paper proves that after transferring $k$ balls between two urns, the next draw's white probability equals $\\frac{c}{c+d+k}+\\frac{a}{a+b}\\frac{k}{c+d+k}$, removing the need to sum over binomial coefficients.","keywords":["urn schemes","binomial coefficients","probability calculation","multi-urn transfer","conditional probability","Pólya urn","Ehrenfest urn"],"falsifier":"Take $a=1, b=1, c=1, d=1, k=1$: Formula (6) gives $1/3+(1/2)(1/3)=1/2$. Enumerating the two equally likely transfers gives the same value: if the white ball moves, the target has 2 white and 1 black, so the next draw is white with probability $2/3$; if the black ball moves, that probability is $1/3$; the average is $1/2$. Repeat the enumeration with one source ball weighted twice as heavily as the other, for example black chosen with probability $2/3$; the average becomes $(1/3)(2/3)+(2/3)(1/3)=4/9$, not $1/2$, which would show the formula's uniform-sampling premise is load-bearing.","tokens_in":5067,"feed_emoji":"🏺","tokens_out":13057,"duration_ms":114094,"temperature":0.7,"pith_summary":"Urn problems usually ask: if $k$ balls are moved from one urn to another, what is the chance that a later draw is white? This paper answers with a closed formula: the probability is $\\frac{c}{c+d+k}+\\frac{a}{a+b}\\frac{k}{c+d+k}$, where $c,d$ are the white and black counts in the receiving urn and $a/(a+b)$ is the white fraction of the source urn. Equivalently, with $N=c+d$, it is $(\\theta k+c)/(N+k)$. The same formula extends to several source urns, to chains of urns, and to several ball colours, so a single arithmetic expression replaces the usual combinatorial sum. That makes large hand computations, such as the paper's warehouse example with 15,000 transferred parts, direct and easy to check.","feed_headline":"One fraction gives white-ball odds after a k-ball transfer","feed_subtitle":"Skip case-by-case combinatorial enumeration: one weighted average gives the answer for any transfer size.","key_machinery":"The load-bearing identity is the binomial convolution $$\\sum_{i=0}^k i\\binom{a}{i}\\binom{b}{k-i}=\\frac{ak}{a+b}\\binom{a+b}{k},$$ which follows from the standard convolution $\\sum_i \\binom{a}{i}\\binom{b}{k-i}=\\binom{a+b}{k}$. It replaces the combinatorial sum in Formula (5) by one term, so the post-transfer draw probability becomes a weighted average of the source urn's white fraction and the receiving urn's starting composition. In the multi-urn and multitype extensions, applying the same identity to each source urn or each colour produces linear recurrences such as (10).","core_discovery":"The central claim is Formula (6): in Scheme [A(k)], with a source urn containing $a$ white and $b$ black balls and a receiving urn containing $c$ white and $d$ black balls, if $k$ balls are transferred uniformly without replacement, the probability that a ball drawn afterward from the receiving urn is white is $$P_\\Pi(A\\mid \\xi=k)=\\frac{c}{c+d+k}+\\frac{a}{a+b}\\frac{k}{c+d+k}.$$ Equivalently, when the receiving urn holds $N=c+d$ balls and the source's white fraction is $\\theta=a/(a+b)$, this is $(\\theta k+c)/(N+k)$. The paper writes this as $\\alpha+(\\beta-\\alpha)\\theta$, where $\\alpha=c/(c+d+k)$ and $\\beta=(c+k)/(c+d+k)$, and proves it by collapsing the sum over the number of white balls actually transferred. Theorems 2--4 extend the same arithmetic to multiple source urns, to chains of urns, and to several ball colours.","pith_inferences":["The combinatorial lemma is equivalent to $\\mathbb{E}[i\\mid k]=k\\theta$, where $i$ is the number of white balls transferred, so the formula is a disguised linearity-of-expectation statement; any transfer rule with that conditional expectation would give the same final probability without uniform sampling.","Formula (10) is an affine recurrence in $P_{m-1}$, and iterating it would yield an explicit closed form for the probability after $m$ transfers, a step the paper leaves implicit.","Because the answer depends on the source urn only through its white fraction $\\theta$, scaling the source urn's contents proportionally leaves the transfer probability unchanged; that invariance is a quick check any implementation of formula (6) should satisfy."],"forward_implications":["For a single transfer from one source urn, the probability reduces to $(\\theta k+c)/(N+k)$, so no case-by-case sum over how many white balls were transferred is needed.","Because the formula is written as $\\alpha+(\\beta-\\alpha)\\theta$, the final probability lies between $\\alpha$ and $\\beta$, giving immediate upper and lower bounds.","With $n$ source urns, the numerator becomes $\\theta_1 k_1+\\cdots+\\theta_n k_n+c$ over $N+k_1+\\cdots+k_n$, so the sources' contributions add linearly through their transferred counts.","In a chain of urns, the one-step formula becomes the recurrence $P_m=\\alpha+(\\beta-\\alpha)P_{m-1}$, so probabilities can be propagated step by step with arithmetic alone.","For several ball colours, the same calculation applies to each colour separately, and the resulting probabilities sum to 1."],"supporting_citations":[],"fun_headline_variants":["One weighted average beats combinatorial counting","White-ball odds after k-transfer: just a weighted mean","k-ball transfer odds: one fraction instead of enumeration","Direct urn odds: skip combinatorial enumeration"],"cache_read_input_tokens":3200,"weakest_assumption_plain":"The formulas assume that every ball in any urn is equally likely to be selected, both when the balls to be transferred are chosen and when the final draw is made; if sampling is biased or with unequal weights, equations (6)--(8) no longer follow.","fun_headline_variants_meta":{"raw":{"variants":["One weighted average beats combinatorial counting","White-ball odds after k-transfer: just a weighted mean","k-ball transfer odds: one fraction instead of enumeration","Direct urn odds: skip combinatorial enumeration"]},"model":"deepseek-v4-flash","effort":"low","cost_usd":0.000652,"raw_usage":{"total_tokens":2895,"prompt_tokens":759,"completion_tokens":2136,"prompt_tokens_details":{"cached_tokens":384},"prompt_cache_hit_tokens":384,"prompt_cache_miss_tokens":375,"completion_tokens_details":{"reasoning_tokens":2079}},"tokens_in":375,"tokens_out":2136,"duration_ms":15873,"temperature":1.0,"reasoning_tokens":2079,"cache_read_input_tokens":384,"cache_creation_input_tokens":0},"cache_creation_input_tokens":0},"created_at":"2026-08-14T12:23:38.539345+00:00","model_set":{"reader":"deepseek-v4-flash"},"falsifier":"Take $a=1, b=1, c=1, d=1, k=1$: Formula (6) gives $1/3+(1/2)(1/3)=1/2$. Enumerating the two equally likely transfers gives the same value: if the white ball moves, the target has 2 white and 1 black, so the next draw is white with probability $2/3$; if the black ball moves, that probability is $1/3$; the average is $1/2$. Repeat the enumeration with one source ball weighted twice as heavily as the other, for example black chosen with probability $2/3$; the average becomes $(1/3)(2/3)+(2/3)(1/3)=4/9$, not $1/2$, which would show the formula's uniform-sampling premise is load-bearing.","supporting_citations":[],"review_version":1}