| paper | d4-journals-jet-2023-0117 |
| authors | — |
| venue | ? |
| filed under | unclassified |
| judged by | gpt-6-luna / xhigh (triple__luna__xhigh__c6r1) |
| judge confidence | high |
| authors would recognise it | no |
The numbered results establish equilibrium existence, link structure, asymptotic influence behavior, and stability, but none asserts that a computational problem can be solved or is hard. A stability decision or bridge-design problem could be built from these results, but it would be a new computational problem rather than a mirror of a computational result in the paper.
fails bit a — no named computational result to mirror
No result is covered by a computational mirror; Propositions 6 and 7 and Corollary 2 are analytic population and stability results, and the paper's other results are likewise outside the computational-result gate.
The strongest honest positive foothold is that the paper studies a plausible high-multiplicity regime. Proposition 6 (proved here) considers two groups whose population shares stay positive as \(n\) grows, with bounded observation degrees and one learning round. It shows that, for a specified cross-group link, the probability that it carries positive equilibrium influence tends to zero. Corollary 2 (also proved here) shows that with complete within-group observation, fixed \(K\), positive limiting group shares, and maximum cross-group degree \(o(n)\), the segmented equilibrium is asymptotically stable for all sufficiently large populations. Those results support a scenario with many members in a few community or exposure roles. They are evidence that a large-population regime makes sense for this model.
But neither result is a computational-complexity result. Proposition 7, the closest candidate, gives a sufficient analytic condition for local stability of a segmented equilibrium. It does not classify a named decision or optimization problem as tractable or hard. The paper contains no numbered result asserting that a computational problem is in P, NP-hard, or in another complexity class. So there is no eligible anchor, and I can’t honestly supply a continuous problem *per anchor* or classify its expected complexity.
A plausible future question would be to represent two communities and a fixed number of exposure roles by type masses, then ask whether a given cross-community observation pattern makes the segregated influence equilibrium locally stable. That would continue the paper’s bridge analysis while making population mass the object of study. But it would be a new computational question derived from the paper’s analytic results, not a mirror of a named computational result in it. The weak point is decisive for this assignment: the paper already gives large-population analytic results, but it does not formulate the computational problem the programme needs to mirror.
The strongest case against is at the programme’s first gate: this paper gives no named computational result to mirror. Proposition 1 proves equilibrium existence; Proposition 4 characterizes link strength; Proposition 6 gives an asymptotic probability result; Proposition 7 gives a sufficient condition for local stability; and Corollary 2 gives an asymptotic stability result. None classifies the complexity of a computational problem or gives an algorithm for one. The proponent is right to treat that as decisive for a *mirror* of the paper. The paper also studies social learning and network equilibrium, not a choice rule, outcome, or intervention problem.
The population limits in Proposition 6 and Corollary 2 do make a large-population regime plausible. But they do not supply computational anchors. Proposition 6 asks whether a specified cross-group link carries positive equilibrium influence in a random sparse network. A distribution over the two group types does not retain which agents share neighbors—the structure that determines whether a link is supported. A richer continuum model with local network roles or an interaction kernel could preserve that information. Then one could ask for a limiting bridge probability, but that would extend the paper’s asymptotic analysis; asking for an algorithm to optimize bridge placement would add a new network-design problem.
The strongest computational proposal from Proposition 7 is to decide whether a segregated equilibrium is locally stable from group masses and bridge-role masses. In a finite-role model, the natural version largely evaluates the paper’s explicit inequality (17), or its limit. To retain arbitrary bridge patterns, the model must encode the network interaction structure as well as the population distribution; a type-mass distribution alone is insufficient. One could instead optimize the mass or arrangement of bridges needed to destabilize segregation. That may be a worthwhile new problem, but the paper neither poses nor establishes it.
So the positive case establishes that some large-population regimes are sensible, not that this paper contains a computational result with a continuous mirror. I cannot make the universal claim airtight: a useful computational extension may emerge from equilibrium selection or bridge design. But that possibility does not rescue the proposed anchors. It would be a new computational research question built from the paper’s analytic results, rather than a continuization of a computational result already in the paper.
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.