{"id":"ef97c438-27b3-46d9-8dca-ca880b50831e","arxiv_id":"2604.22870","paper_version":1,"verdict":"UNVERDICTED","confidence":"LOW","novelty_score":7.0,"correctness_risk":"medium","formal_verification":"none","parameter_count":0,"one_line_summary":"Sum aggregation plus readout in ACR-GNNs captures FO properties outside C2 on directed and undirected graphs, while bounded local aggregation or bounded degree restores exact match to graded modal logic with global counting.","lead":"The paper shows that standard sum aggregation and global readout in message-passing GNNs let them express first-order graph properties beyond what C2 logic can capture. This clarifies the role of unbounded aggregation-readout interaction in pushing GNN expressivity higher than known fragments of counting logic.","discovery_kind":"extension","skeptic_critique":{"model":"grok-4.3","headline":"No significant objection identified","rationale":"The reader's weakest assumption matches the paper's explicit strengthening claim. Because the argument is an existence result rather than a full characterisation and no counter-example to the standard-sum construction is evident, the UNVERDICTED verdict with low confidence remains appropriate pending full proof inspection.","tokens_in":1738,"tokens_out":291,"duration_ms":25373,"concrete_test":"Take the concrete FO property used to witness separation from C2 in the main theorem; instantiate the claimed sum-based ACR-GNN on a pair of small directed (and undirected) graphs that are C2-equivalent but differ on that property; confirm that the GNN outputs differ while using only the unmodified sum operator at every aggregation and readout step.","verdict_should_be":"UNCHANGED","load_bearing_attack":"The central claim—that plain sum aggregation plus global readout lets ACR-GNNs express FO properties outside C2 on both directed and undirected graphs—rests on an existence argument that strengthens the Hauke–Wałęga construction by removing special crafting. The abstract presents this as following directly from the unbounded interaction of local sum and global readout, with the two restoration routes (restricted local aggregation or bounded degree) offered as matching upper bounds via graded modal logic with global counting. No internal contradiction, hidden assumption on initial features, or failure of the sum to remain standard appears in the stated results.","agreement_with_reader":"agree"},"referee_report":null,"author_rebuttal":null,"desk_editor":null,"rs_alignment":null,"lean_confirmation":null,"pith_extraction":null,"created_at":"2026-05-09T22:34:49.747472+00:00","model_set":{"reader":"grok-4.3"},"falsifier":null,"supporting_citations":[],"review_version":1}