一句话：证明 parity-exists 查询无法用量词无关一阶更新规则动态维护，并揭示辅助关系元数层级与度数受限可维护性。
论文研究 Patnaik-Immerman 动态复杂性框架 DynFO 中，一阶逻辑加 parity 量词所定义查询的动态可维护性。红节点数奇偶性可由一阶更新规则轻松维护，但能否推广到更一般的 parity 查询尚不清楚。作者聚焦 quantifier structure 为 parity-exists 的查询：判断与红节点相邻的节点数是否为奇数。该查询是动态刻画一阶逻辑扩展的主要障碍。结果表明，它无法用量词无关的一阶更新规则维护；其变体还按所维护辅助关系的元数形成层级。作为向完整一阶更新规则迈进的进展，论文证明度数受限的变体可以维护。
Given a graph whose nodes may be coloured red, the parity of the number of red nodes can easily be maintained with first-order update rules in the dynamic complexity framework DynFO of Patnaik and Immerman. Can this be generalised to other or even all queries that are definable in first-order logic extended by parity quantifiers? We consider the query that asks whether the number of nodes that have an edge to a red node is odd. Already this simple query of quantifier structure parity-exists is a major roadblock for dynamically capturing extensions of first-order logic. We show that this query cannot be maintained with quantifier-free first-order update rules, and that variants induce a hierarchy for such update rules with respect to the arity of the maintained auxiliary relations. Towards maintaining the query with full first-order update rules, it is shown that degree-restricted variants can be maintained.