{"id":"d567032c-7e3f-424d-8d8b-dd41e0395ae1","arxiv_id":"2412.03463","paper_version":2,"verdict":"CONDITIONAL","confidence":"MODERATE","novelty_score":7.0,"correctness_risk":"medium","formal_verification":"none","parameter_count":0,"one_line_summary":"Every claw-free graph has equal standard and positive semidefinite zero forcing numbers, and this hereditary equality characterizes claw-free graphs.","lead":"The paper proves that two well-studied zero forcing numbers, standard and positive semidefinite, are equal on every claw-free graph, confirming a conjecture generated by the computer program TxGraffiti. It also shows that this equality, checked on every induced subgraph, exactly characterizes claw-free graphs.","discovery_kind":"unification","skeptic_critique":{"model":"deepseek-v4-flash","headline":"The central proof rests on Lemma 2, imported without proof from in-press [5]; moreover Lemma 3 uses it to conclude the terminus is a minimum PSD forcing set, a cardinality statement that Lemma 2 as stated does not contain.","rationale":"The reader's weakest assumption (Lemma 2) is exactly the load-bearing point. I agree that the main proof is otherwise coherent: the induction in Theorem 5 correctly preserves connectivity of the white subgraph and converts PSD forces to standard forces using claw-freeness; the reverse direction of Corollary 6 is immediate from Z(K1,3)=2 and Z+(K1,3)=1. The main soft spot is that Lemma 2 is imported from [5] and the manuscript does not make its proof available. Additionally, Lemma 3's phrase 'By Lemma 2, S' is minimum' overstates the stated Lemma, which only guarantees a PSD forcing set; the missing cardinality argument is short but essential. Because this is a proof-support gap rather than a demonstrated counterexample, the correct verdict remains CONDITIONAL: accept only after Lemma 2 (with the minimum/cardinality property) is either proved in the paper or verified in an accessible version of [5]. I would not change the reader's verdict; I would make the condition more specific.","tokens_in":7604,"tokens_out":20906,"duration_ms":227947,"concrete_test":"Enumerate all connected graphs on at most 8 vertices; for each, compute all minimum PSD forcing sets S and all components C of G-S, and test the conclusion of Lemma 3 by searching for a minimum PSD forcing set S' such that G-S' has a component properly containing C. Independently, obtain the proof of Lemma 2 from [5] and verify the additional claim |Term(F|Q)|=|B|; if either check produces a counterexample, Lemmas 3-4 and hence Theorem 5 fail. The brute-force check alone cannot prove the theorem, but it would falsify the lemmas if they are false.","verdict_should_be":"UNCHANGED","load_bearing_attack":"Theorem 5 relies on Lemma 4, which relies on Lemma 3, which relies on Lemma 2. Lemma 2 is stated only as a citation to [5] and has no proof in this manuscript. In the proof of Lemma 3, after constructing S' = Term(F'|Q(F';w*)), the authors write 'By Lemma 2, S' is a minimum positive semidefinite forcing set of G.' This does not follow from the stated Lemma 2, which asserts only that the terminus is a positive semidefinite forcing set, not that it has minimum size. The minimum claim would follow if one also proves that the path bundle has exactly one terminal vertex per initial blue vertex, so |S'|=|S|; this is plausible (paths in a bundle are disjoint and each has one terminus) but it is not stated or proved. If Lemma 2 is false, or if it does not preserve cardinality, then Lemma 3 cannot produce a minimum forcing set, and Lemma 4, together with Theorem 5, is unsupported. This is a genuine correctness risk, not merely a presentation issue, because the result is imported from a paper by overlapping authors that is not yet publicly available.","agreement_with_reader":"partial"},"referee_report":{"model":"deepseek-v4-flash","summary":"The paper proves that for every connected claw-free graph G, the standard zero forcing number Z(G) equals the positive semidefinite zero forcing number Z_+(G), confirming a conjecture attributed to the program TxGraffiti. The proof strategy is to first establish, via a sequence of lemmas, that every connected graph admits a minimum positive semidefinite forcing set whose complement is connected (Lemma 4), and then to show that any positive semidefinite forcing process starting from such a set can be replayed as a standard forcing process, using claw-freeness to prevent the white subgraph from disconnecting. As a corollary, the authors characterize (Z_+,Z)-perfect graphs as exactly the claw-free graphs.","tokens_in":7872,"tokens_out":5725,"duration_ms":52799,"significance":"If the main theorem is correct, it resolves a natural conjecture and provides a clean structural characterization of graphs for which two important zero forcing parameters coincide on every induced subgraph. The inductive argument in Theorem 5 is elegant and self-contained once Lemma 4 is granted, and the corollary is immediate. The paper also contributes an auxiliary structural result of independent interest (Lemma 4) about the existence of minimum positive semidefinite forcing sets with connected complement. However, the proof of Lemma 4 depends critically on Lemma 2, which is imported without proof from an in-press paper by overlapping authors, and the use made of Lemma 2 in the proof of Lemma 3 is stronger than the statement as written. This is a genuine correctness risk that must be addressed before the result can be considered fully established.","major_comments":[{"comment":"The sentence 'By Lemma 2, S' is a minimum positive semidefinite forcing set of G' does not follow from Lemma 2 as stated. Lemma 2 asserts only that Term(F|Q(F;x)) is a positive semidefinite forcing set; it says nothing about minimal cardinality. To justify that S' is minimum, one needs to prove that |Term(F'|Q(F';w*))| = |S|, for example by showing that the path bundle contains exactly one terminal vertex per initial blue vertex and that these terminals are distinct. This cardinality statement is plausible but is neither stated nor proved. Since Lemma 4 and hence Theorem 5 rely on S' being a minimum forcing set, this is a load-bearing gap. The authors should either prove the needed cardinality property, or state and prove a stronger version of Lemma 2 that includes minimality, or provide a fully accessible proof of Lemma 2 itself.","section":"Section 3, Lemma 3 proof"},{"comment":"The claim that 'S'∩ V(C) = ∅' is justified only by the phrase 'as S' is the terminus of the restricted forces in G[V(C^0_w*)∪S].' This is not a complete argument. A precise proof should show that the path bundle Q(F';w*) is contained in V(C^0_w*)∪S, and hence its terminus is also contained in that set, which is disjoint from V(C). Without this, the conclusion that V(C) is properly contained in a component of G−S' is not fully established. This issue is secondary to the cardinality gap but still needs to be addressed for a rigorous proof.","section":"Section 3, Lemma 3 proof, final containment"},{"comment":"Lemma 2 is the engine of the paper's main structural result, yet it is stated as a citation to an in-press paper [5] that includes two of the present authors and is not publicly available. The present manuscript does not provide a proof, nor does it give a preprint link. For a referee to verify the main theorem, the statement of Lemma 2 must be either proved in this paper or made available with enough detail to check the stronger version needed in Lemma 3. I recommend that the authors include a proof or an explicit derivation, at least in an appendix, to make the paper self-contained.","section":"Section 3, Lemma 2 citation"}],"minor_comments":[{"comment":"The proof of Theorem 5 is well structured and the claw-free argument in the inductive step is convincing. The paper would benefit from a short discussion of why the path bundle has exactly one terminal per initial blue vertex, which would also help clarify the use of Lemma 2.","section":"General"},{"comment":"In the abstract and introduction, 'claw-free graphs offer a complete characterization of (Z_+,Z)–perfect graphs' is stated before the corollary; consider moving this interpretation to the conclusion to avoid overclaiming before the result is proved.","section":"Section 1"},{"comment":"The phrase 'way of contraposition' should be 'by way of contraposition'.","section":"Section 4, Corollary 6 proof"},{"comment":"The email address of Houston Schuerger is typeset incorrectly as 'schuerger h@utpb.edu' with an extra space.","section":"Title page"}],"recommendation":"major_revision","confidential_remarks":"The main concern is the reliance on Lemma 2 from [5], an in-press paper with overlapping authorship. If the authors can supply a proof of Lemma 2 or of the stronger cardinality version used in Lemma 3, the paper's main theorem appears sound and would be a nice contribution. Given that the gap is local and fixable, I do not recommend rejection at this stage."},"author_rebuttal":null,"desk_editor":{"model":"deepseek-v4-flash","letter":"Short version: this paper looks like it settles the TxGraffiti conjecture that Z and Z+ coincide on claw-free graphs, and the corollary (claw-free iff every induced subgraph has Z=Z+) is a nice bonus. I think the result is true and the proof strategy is good, but there is a real gap in Section 3 that needs to be closed before I'd trust the argument as written.\n\nWhat's new: the theorem itself. Previous work had equality for line graphs and general bounds for claw-free graphs. Here they prove full equality and, as a consequence, a hereditary characterization. The induction in Theorem 5 is clean: once you have a minimum PSD forcing set whose complement is connected, claw-freeness forces every PSD force to be a standard force, so the set is also a standard forcing set. The idea behind Lemma 4—iteratively enlarge a component of the complement of a min forcing set until it's connected—is neat, and the component-enlargement argument in Lemma 3 is intricate but credible.\n\nThe soft spot is Lemma 2 and its use in Lemma 3. Lemma 2 is stated as a citation to [5], an in-press paper by overlapping authors, and it is not proved here. In the proof of Lemma 3, after constructing S' as the terminus of the path bundle, the text says 'By Lemma 2, S' is a minimum positive semidefinite forcing set.' But the Lemma 2 stated in this manuscript only says the terminus is a positive semidefinite forcing set, not that it has minimum size. That is a genuine gap. It is plausible that the path bundle has one terminus per initial blue vertex, so |S'|=|S|, but that is not stated or proved. If that cardinality fact is true, the proof goes through; if not, Lemma 4 and Theorem 5 are unsupported. This is not just a presentation gripe—it's a load-bearing missing argument.\n\nI'd suggest the authors prove Lemma 2 in the paper, or at least state and prove the cardinality preservation explicitly. Relying on an in-press paper for this step is uncomfortable, even if the cited paper is legitimate.\n\nWho this is for: people working on zero forcing invariants and structural graph theory. It deserves a serious referee. I'd recommend sending it out, with a request to fix the Lemma 2/minimality issue before acceptance.","headline":"A clean conjecture-resolution with an elegant forcing-set argument, but the main proof leans on a lemma it states, cites, and then overclaims.","tokens_in":8336,"tokens_out":2795,"would_cite":true,"duration_ms":23562,"reading_group":"yes","serious_thinker":"yes","would_accept_peer_review":true},"rs_alignment":null,"lean_confirmation":null,"pith_extraction":{"msc":["68R10"],"pacs":[],"model":"deepseek-v4-flash","headline":"The paper proves that every connected claw-free graph has equal standard and positive semidefinite zero forcing numbers, and that this equality on all induced subgraphs characterizes claw-free graphs.","keywords":["claw-free graphs","positive semidefinite zero forcing","standard zero forcing","zero forcing","path bundles","(Z+,Z)-perfect graphs","graph characterization"],"falsifier":"Exhaustively compute $Z$ and $Z_+$ for all connected claw-free graphs on at most ten vertices; a single graph with $Z_+(G) < Z(G)$ would disprove the theorem.","tokens_in":7449,"feed_emoji":"🕸️","tokens_out":13107,"duration_ms":110175,"temperature":0.7,"pith_summary":"Zero forcing is a graph coloring game: start with a set of blue vertices and spread the blue color under a precise rule, and the zero forcing number is the smallest starting set that eventually colors every vertex. This paper proves that for every connected claw-free graph, the standard rule and the more flexible positive semidefinite rule need the same number of starting vertices. The result confirms a conjecture put forward by a computer conjecturing program, and it completes a characterization: a graph has the two numbers equal in every induced subgraph exactly when it contains no induced claw $K_{1,3}$. Equality matters because the two numbers bound different nullity parameters for matrices whose zero pattern follows the graph, so the theorem identifies a structural class where those linear-algebra bounds coincide.","feed_headline":"Claw-free graphs equalize two zero forcing numbers","feed_subtitle":"The proof settles a computer-generated conjecture and pins down when the two invariants agree on every subgraph.","key_machinery":"The engine is the path bundle of a relaxed chronology, where a relaxed chronology is a schedule of the simultaneous forces applied at each time step: for a fixed vertex $x$, follow the component containing $x$ at each step and record the chain of forces that eventually color $x$; the terminus of the restricted forcing sequence inside that bundle is again a positive semidefinite forcing set. Lemma 3 and Lemma 4 use this fact to show that any connected graph has a minimum positive semidefinite forcing set $S$ whose complement $G-S$ is connected. The main proof then runs an induction: from such an $S$, the set of remaining white vertices stays connected after every force, because a disconnection would produce an induced claw centered at the vertex just forced. That connectedness is the mechanism that upgrades each positive semidefinite force to a standard force, transferring the minimum set from one rule to the other.","core_discovery":"The central claim is that the inequality $Z_+(G)\\le Z(G)$, true for every graph, becomes an equality on claw-free graphs, where a claw $K_{1,3}$ is a vertex joined to three pairwise nonadjacent vertices. The paper proves the stronger structural fact that every connected graph has a minimum positive semidefinite forcing set whose complement is connected. Starting from such a set, claw-freeness forces the white vertices to stay connected throughout the forcing process; if a forced vertex ever separated its remaining white neighbors, those neighbors and the forcing vertex would form an induced claw. Connected white vertices turn every legal positive semidefinite force into a legal standard force, so the same minimum set works for both rules. Consequently a graph is $(Z_+,Z)$-perfect, meaning $Z_+(H)=Z(H)$ for every induced subgraph $H$, if and only if it is claw-free.","pith_inferences":["Beyond the paper, the connected-complement lemma is likely reusable: any forcing rule whose legal moves depend only on the component of the uncolored subgraph should admit the same minimum-set-with-connected-complement construction, opening the same equality proof for other invariants.","Beyond the paper, the equality of the two numbers suggests the full forcing processes coincide on claw-free graphs, so propagation time and other timing parameters under the two rules are natural objects to compare.","Beyond the paper, the characterization has a computational flavor: a constructive version of the cited path-bundle terminus result would turn a minimum positive semidefinite forcing set on a claw-free graph into a minimum standard forcing set, giving an algorithm for $Z$ on this class."],"forward_implications":["For any connected claw-free graph, the minimum sizes of the two forcing sets coincide, so computing either invariant gives the other.","A graph has $Z_+(H)=Z(H)$ for every induced subgraph $H$ if and only if it is claw-free; any graph containing an induced $K_{1,3}$ is witnessed by that subgraph, which has $Z_+=1$ and $Z=2$.","The equality extends to disconnected claw-free graphs by additivity over components, and it sharpens the previously known two-sided bounds to an exact value on this class.","The structural lemmas guarantee that every connected graph has a minimum positive semidefinite forcing set whose complement is connected; on claw-free graphs this set is automatically a standard forcing set."],"supporting_citations":[{"why":"It defines standard zero forcing and links it to the maximum nullity bound that motivates the invariant.","marker":"[1]"},{"why":"It introduces positive semidefinite zero forcing and its bound on positive semidefinite maximum nullity.","marker":"[2]"},{"why":"It describes the conjecturing program that produced the conjecture the paper confirms.","marker":"[3]"},{"why":"It establishes the equality of the two forcing numbers for line graphs, the prior result the theorem generalizes.","marker":"[4]"},{"why":"It supplies Lemma 2, the path-bundle terminus result that the proof of Lemma 3 depends on.","marker":"[5]"},{"why":"It provides terminology and examples such as paths and diamond-necklaces where the equality was already known.","marker":"[6]"},{"why":"It gives the two-sided bounds between the invariants that the claw-free theorem sharpens to equality.","marker":"[7]"},{"why":"It supplies graph theory background, including induced subgraphs and the perfect graph theme that motivates (Z+,Z)-perfectness.","marker":"[8]"}],"fun_headline_variants":["Zero forcing numbers equal on claw-free graphs","Claw-free graphs: Z and Z+ always match","No claws means equal zero forcing","Claw-free characterization via zero forcing equality","Proof settles TxGraffiti conjecture for claw-free graphs"],"cache_read_input_tokens":3200,"weakest_assumption_plain":"The whole proof depends on the already-proved fact that the terminus of a path-bundle restriction is itself a positive semidefinite forcing set; if that fact failed, the construction of a minimum forcing set with connected complement would break, and the main equivalence would be unsupported.","fun_headline_variants_meta":{"raw":{"variants":["Zero forcing numbers equal on claw-free graphs","Claw-free graphs: Z and Z+ always match","No claws means equal zero forcing","Claw-free characterization via zero forcing equality","Proof settles TxGraffiti conjecture for claw-free graphs"]},"model":"deepseek-v4-flash","effort":"low","cost_usd":0.00069,"raw_usage":{"total_tokens":3063,"prompt_tokens":819,"completion_tokens":2244,"prompt_tokens_details":{"cached_tokens":384},"prompt_cache_hit_tokens":384,"prompt_cache_miss_tokens":435,"completion_tokens_details":{"reasoning_tokens":2175}},"tokens_in":435,"tokens_out":2244,"duration_ms":16546,"temperature":1.0,"reasoning_tokens":2175,"cache_read_input_tokens":384,"cache_creation_input_tokens":0},"cache_creation_input_tokens":0},"created_at":"2026-08-11T22:23:27.337925+00:00","model_set":{"reader":"deepseek-v4-flash"},"falsifier":"Exhaustively compute $Z$ and $Z_+$ for all connected claw-free graphs on at most ten vertices; a single graph with $Z_+(G) < Z(G)$ would disprove the theorem.","supporting_citations":[{"cited_title":"428 (2008), no","cited_arxiv_id":null,"evidence_quote":"It defines standard zero forcing and links it to the maximum nullity bound that motivates the invariant."},{"cited_title":"Barioli, W","cited_arxiv_id":null,"evidence_quote":"It introduces positive semidefinite zero forcing and its bound on positive semidefinite maximum nullity."},{"cited_title":"Davila, Automated conjecturing in mathematics with TxGraffiti, Discov","cited_arxiv_id":null,"evidence_quote":"It describes the conjecturing program that produced the conjecture the paper confirms."},{"cited_title":"Fallat and A","cited_arxiv_id":null,"evidence_quote":"It establishes the equality of the two forcing numbers for line graphs, the prior result the theorem generalizes."},{"cited_title":"Hogben, M","cited_arxiv_id":null,"evidence_quote":"It supplies Lemma 2, the path-bundle terminus result that the proof of Lemma 3 depends on."},{"cited_title":"Hogben, J","cited_arxiv_id":null,"evidence_quote":"It provides terminology and examples such as paths and diamond-necklaces where the equality was already known."},{"cited_title":"Wang and B","cited_arxiv_id":null,"evidence_quote":"It gives the two-sided bounds between the invariants that the claw-free theorem sharpens to equality."},{"cited_title":null,"cited_arxiv_id":null,"evidence_quote":"It supplies graph theory background, including induced subgraphs and the perfect graph theme that motivates (Z+,Z)-perfectness."}],"review_version":1}