| paper | d4-journals-mss-2016-0056 |
| authors | — |
| venue | ? |
| filed under | unclassified |
| judged by | gpt-6-luna / xhigh (triple__luna__xhigh__c6r1) |
| judge confidence | high |
| authors would recognise it | unclear |
The paper’s named results characterize equilibria and their existence; they make no computational claim. The possible minimum-seed problem is a new optimization extension, and the proponent also concedes it is not anchored to a computational result in this paper.
fails bit a — no named computational result to mirror
No computational result is mirrored; the equilibrium characterizations and simulated trajectories remain analytic results and illustrations.
I can’t make a defensible anchor-based case for a continuous computational mirror here. The paper has no numbered result asserting a computational complexity classification. Its numbered results—Lemma 1 on equilibrium structure, Corollary 2 on equilibrium equations, and Propositions 3 and 4 on when nontrivial equilibria can exist—are analytic results, proved in the paper. The non-monotonic adoption behavior is illustrated by simulations, not established as a complexity result.
A plausible population setting would be a large diffusion process in which types record network degree, inclination, and cost or flexibility class; each type’s mass is its fraction of the population. One might ask whether a given initial state reaches a nontrivial attractor. But that would be an unanchored computational extension. The paper already studies adoption fractions and degree-level inclinations through a mean-field dynamical system, and it asks analytic questions about equilibria and trajectories. Turning that into a computational problem would not supply the required named anchor or establish whether the resulting question is tractable or hard.
The strongest case against a continuous mirror is that this paper gives no named computational result to mirror. Lemma 1, Corollary 2, and Propositions 3 and 4 characterize equilibria and their existence; none studies an algorithmic problem or gives a complexity, approximation, or parameterized result. The paper’s continuous-looking ingredients—degree distributions, adoption fractions, and inclination averages—belong to its mean-field analysis. That makes a continuous population sensible here, but it does not supply the missing computational anchor.
The best stronger candidate is to ask for the minimum mass of initial adopters, allocated across degree or inclination types, that reaches a nonzero attractor. This connects to the paper’s discussion of early mobilization and its simulated basins of attraction. But the paper does not pose that optimization problem: it studies trajectories from specified initial states. With a uniform seed, the proposed task is a one-dimensional basin-boundary calculation; with targeted seeds and intervention costs, it adds a control problem and inputs the paper never specifies. It may be worthwhile research, but it is an extension of the model, not a continuous mirror of one of its named results.
The same distinction defeats the equilibrium propositions as anchors. One could ask an algorithm to decide whether a positive aggregate equilibrium exists for a given degree distribution and parameter set. Yet that recasts an analytic characterization as a decision problem; it does not continue a computational result from the paper. The paper also leaves the general cost distribution \(F\) largely unrestricted, so a complexity question would first need a new finite encoding of the model.
This is a strong reason to reject an *anchor-based mirror of this paper*, and the proponent effectively concedes it. It is not a proof that no useful computational project can grow from the paper. The minimum-seed question is the weak point in the negative case: given the paper’s focus on tipping and mobilization, its authors might well recognize it as their problem. So the universal claim that no worthwhile continuous mirror exists in any scenario goes further than the evidence supports.
The adversarial triple: the proponent anchors on up to three named results; the opponent sees that case and must defeat every anchor; the judge decides which case convinced it. These are the pipeline’s own outputs, generated by tools/triple_run.py — no human edited them. The paper’s own text is not reproduced here beyond the quoted statement above.