| paper | d4-journals-jair-2020-0003 |
| 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 contributes source-identification and monitor-placement heuristics, MILP formulations, and experiments, but has no numbered Theorem, Lemma, Corollary, or Proposition asserting a computational result. The cited hardness results belong to prior work, and the paper’s unnumbered hardness-extension statement cannot anchor the proposed continuous mirror.
fails bit a — no named computational result to mirror
The candidate mirror covers monitor placement only; it leaves source identification and the paper’s graph-specific branching and cut results aside. No qualifying named result anchors that coverage.
I can’t give a qualifying anchor-based case for this paper: it contains no numbered Theorem, Lemma, Corollary, or Proposition asserting a computational result. The source-identification hardness claim is attributed to Lappas et al.; the \(\#\mathrm{P}\)-completeness claim for \(\tau\)-Monitor Placement is attributed to Zhang et al. The paper says that hardness extends to its Monitor Placement problem, but gives that as an unnumbered statement. Its \([\mathrm{SI}]\), \([\mathrm{MP1}]\), and \([\mathrm{MP2}]\) formulations are computed with, but are not numbered theorem results. Treating any of these as a required anchor would overstate what the paper establishes.
The strongest plausible mirror to explore would be Monitor Placement in a large, type-structured social network. A type would specify a user’s cascade-relevant role: source or target status, monitor eligibility, and contact rates with every other type. The instance would give rational type masses \(\mu_t\), source masses \(s_t\), target types, and rational contact rates \(\lambda_{tu}\). Choose monitor masses \(x_t\), minimizing \(\sum_t x_t\), and evolve infection by a mean-field independent-cascade rule: each unmonitored susceptible of type \(u\) is infected in a round with probability \(1-\exp(-\sum_t \lambda_{tu}i_t)\), where \(i_t\) is the infected mass of type \(t\) in the preceding round; monitors block onward transmission. Require zero infected target mass and at most \(k\) total exposed mass. This is a recognizable population-scale version of the paper’s monitor objective and cascade setting, in a plausible regime where a large platform has many users but relatively few repeated network roles.
That is a research question, not a mirror supported by a qualifying anchor. Its main weakness is that replacing a particular graph with type-level mixing removes topology that the paper’s algorithms use directly; whether the authors would accept that as their problem’s continuous analogue is uncertain. I would not assign it a tractability or hardness verdict based on this paper’s results.
There is no named computational result in this paper to anchor a continuous mirror to. The source-identification hardness is attributed to Lappas et al.; the \(\#\mathrm{P}\)-completeness result for \(\tau\)-Monitor Placement is attributed to Zhang et al. The paper says that hardness extends to its Monitor Placement problem, but gives no numbered result establishing that claim. Its own contributions are formulations, heuristics, and experimental comparisons. So the proponent was right not to present a paper theorem as an anchor; there is no named anchor here to defeat.
Source Identification is especially resistant to a population mirror. Its output is a set of particular users. With a fixed number \(k\) of sources in a population of size \(n\), their normalized mass tends to zero as \(n\) grows. Making source mass positive instead asks which *types* contributed what share of the cascade, a different inverse problem that no longer identifies the users this paper seeks.
Monitor Placement is the strongest candidate, but the proposed mean-field version changes what drives the problem. The paper takes a realized graph as input and uses its paths and cuts to decide where monitors go. If types preserve each user’s full contact pattern and edge probabilities, most users will have distinct types, so the support size grows with the network and the high-multiplicity compression disappears. If types record only average contact rates, the model replaces the paper’s graph-specific cascade and path guarantees with a mixing model. That may be a sensible problem, but it is not the same computational question. Protecting a cohort rather than the paper’s single target can repair the zero-mass issue; it does not resolve this change in network structure.
The best repair is a block-structured network with repeated roles, positive-mass source and target cohorts, and monitor fractions chosen by type. That is coherent and could be worth studying. But it assumes a new network regime and a new cascade representation; the paper supplies no result showing that its graph-based question carries over, and the proponent’s case itself concedes that the authors’ acceptance is uncertain. My negative case is therefore strongest as a case against a *paper-anchored* mirror. It does not justify the universal claim that no worthwhile mirror exists in any scenario; a well-chosen repeated-role regime could survive.
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.