{"id":"e32ac276-a908-49d4-a58d-0f96d036e777","arxiv_id":"2412.13632","paper_version":1,"verdict":"CONDITIONAL","confidence":"MODERATE","novelty_score":6.0,"correctness_risk":"medium","formal_verification":"none","parameter_count":0,"one_line_summary":"Applying lexicographic excellence social rankings to extension rankings yields argument-ranking semantics that refine skeptical, credulous, and rejected acceptance classes.","lead":"The paper combines social ranking functions with extension rankings from abstract argumentation to build argument rankings that separate skeptically accepted, credulously accepted, and rejected arguments. The main example is the lexicographic excellence operator, with new axioms and conditions for when such rankings exist.","discovery_kind":"new_application","skeptic_critique":{"model":"deepseek-v4-flash","headline":"The proofs of Theorems 2 and 3 apply preorder-defined axioms to a non-reflexive auxiliary relation; the gap is local and repairable by taking its reflexive closure.","rationale":"The reader's weakest_assumption is precisely the non-reflexivity of the auxiliary relation in Theorems 2 and 3, and I agree this is the most load-bearing technical gap: it sits at the point where the paper's central theorems transition from a constructed two-level relation to the actual extension ranking. A category error here would invalidate both theorems' proofs, not just a side lemma. However, the gap is cosmetic in the sense that the reflexive closure of ⊒σ is a preorder with identical rank information, so the intended argument is recoverable without changing the statement of the theorems. I also noted that the proof's claim that τ is a refinement of τ′ is inaccurate (σ-extensions are maximal, not necessarily above every non-σ set), but the IWS transfer does not actually require subrelation containment; it only requires the rank hypotheses of Definition 12, which are satisfied. The abstract's 'necessary and sufficient conditions' phrasing overstates the technical content (the necessary side is only established for cf-C and ad-C, not for the full refinement property), but this is a presentation issue rather than a correctness threat to the main construction. Given the proof gap is localized and repairable, the reader's CONDITIONAL verdict is appropriate; no stronger action is needed.","tokens_in":16304,"tokens_out":18908,"duration_ms":168677,"concrete_test":"Re-derive the proofs of Theorems 2 and 3 using the reflexive closure of ⊒σ (i.e., X ⊒σ Y iff X∈σ(F) and Y∉σ(F), or X=Y). Check that (i) rank_{⊒σ}(X)=1 for X∈σ(F) and 2 for X∉σ(F); (ii) the Pareto-efficiency argument in Theorem 2 and the skeptical-argument argument in Theorem 3 require only this two-level ranking; (iii) the hypotheses of Definition 12 hold with original preorder = reflexive closure of ⊒σ and new preorder = τ, so IWS transfers strict preference. If all three checks pass, the central claim is established; if any fails, the theorems as stated need revision.","verdict_should_be":"UNCHANGED","load_bearing_attack":"The central theorems (Theorems 2 and 3) are proven by introducing the auxiliary relation ⊒σ with X ⊒σ_F Y iff X∈σ(F) and Y∉σ(F). However, Definition 10 (rank), Definition 12 (Independence from the worst set), and Definition 13 (Pareto-efficiency) are all stated only for preorders on P(S). The relation ⊒σ is not reflexive: if X∈σ(F), then X ⊒σ_F X does not hold. Consequently, as written, rank_{⊒σ}, IWS, and Pareto-efficiency cannot legitimately be applied to it. The proof additionally says that τ can be viewed as a refinement of τ′, which is false in general: σ-extensions are maximal and may be incomparable to non-σ sets, not necessarily ordered above them. Both issues are repairable: take the reflexive closure of ⊒σ. This yields a two-level total preorder with top level exactly σ(F), and rank values and strict preferences are unchanged. The IWS transfer then works by verifying that rank_{⊒σ}(X)=1 iff X∈σ(F) iff rank_τ(X)=1, and that rank_τ(X)≥2 for all X∉σ(F). Thus the theorems are sound, but the submitted proofs are technically incomplete at this point.","agreement_with_reader":"agree"},"referee_report":{"model":"deepseek-v4-flash","summary":"The paper proposes a new family of argument-ranking semantics for abstract argumentation, obtained by applying social ranking functions to extension-ranking semantics. It introduces a rank-based generalization of social ranking functions to partial orders, defines the lexicographic excellence operator (lex-cel), and studies when the induced argument-ranking semantics refines the classical skeptical/credulous/rejected classification. The main results (Theorems 2 and 3) show that if the extension-ranking semantics satisfies sigma-generalisation and the social ranking function satisfies Independence from the Worst Set and Pareto-efficiency, then the induced semantics satisfies sigma-Compatibility and sigma-skeptical-Compatibility, hence sigma-Refinement. The paper also provides necessary conditions for related compatibility properties in terms of a Dominating Set axiom, and shows that lex-cel satisfies Pareto-efficiency, making lex-cel_tau a concrete instance satisfying sigma-Refinement. The proofs are given in an appendix; the paper reports no experiments and no fitted parameters.","tokens_in":16529,"tokens_out":13623,"duration_ms":110324,"significance":"If the central results are correct, the paper offers a principled and modular bridge between extension-based argumentation semantics and ranking-based semantics, with a clear axiomatic decomposition: the refinement property is traced to Independence from the Worst Set and Pareto-efficiency of the social ranking function, rather than to ad-hoc constructions. The use of existing published definitions, the absence of free parameters, and the explicit statement of proofs are strengths. The paper's main claims are, however, presented more strongly than what is proven: the body gives sufficient conditions for the refinement property and necessary conditions for a closely related property, not a necessary-and-sufficient characterization, and the proofs of the central theorems contain a technical gap concerning the use of a non-preorder auxiliary relation. These issues are repairable, but they currently affect the validity of the paper as written.","major_comments":[{"comment":"The proofs of Theorems 2 and 3 introduce the auxiliary relation ⊒σ defined by X ⊒σF Y iff X ∈ σ(F) and Y ∉ σ(F). This relation is not reflexive and therefore not a preorder; however, Definition 10 (rank), Definition 12 (Independence from the Worst Set), and Definition 13 (Pareto-efficiency) are all stated only for preorders on P(S). Consequently, the applications of rank⊒σ, IWS, and Pareto-efficiency to ⊒σ are not legitimate as written. Additionally, the proof of Theorem 3 asserts that τ can be viewed as a refinement of τ′, which is false in general: σ-generalisation only identifies the maximal elements of τ with σ(F), and a non-maximal set can be incomparable to a maximal set in a preorder. These gaps are repairable by taking the reflexive closure of ⊒σ, which is a two-level total preorder with top level exactly σ(F), and by verifying that the rank-1 sets and strict preferences are preserved so that IWS applies; with this repair the theorems' conclusions follow. As submitted, however, the proof of the central result is technically incomplete.","section":"Section 4, Theorems 2 and 3"},{"comment":"The abstract claims that the paper provides 'necessary and sufficient conditions for a social ranking function to give rise to an argument-ranking semantics satisfying the desired refinement property,' and Section 1 repeats that the axiomatic properties shown are 'sufficient and necessary.' The body, however, proves sufficient conditions for σ-Compatibility and σ-skeptical-Compatibility (Theorems 2 and 3) and separate necessary conditions for the weaker property cf-C/ad-C in terms of the Dominating Set axiom (Theorems 5 and 6). No theorem in Section 4 establishes a single condition (or conjunction) that is both necessary and sufficient for the full σ-Refinement property. The claim should be weakened to 'sufficient conditions' plus 'necessary conditions for related principles,' or a genuine characterization of σ-Refinement must be supplied.","section":"Abstract and Section 1"}],"minor_comments":[{"comment":"In the proof of Theorem 5, the sentence 'As X contains x, its set of conflicts must be a strict super-set of the conflicts in {x}' is false; a superset X of {x} can have the same conflict set as {x}, e.g., when both are conflict-free. The desired conclusion {x} ⊉ Y actually follows from CFF({x}) ⊆ CFF(X) ⊂ CFF(Y), which is obtained from the assumption X ⊒ Y, so the proof is fixable but the written argument is inaccurate.","section":"Section 4, Theorem 5 proof"},{"comment":"In the proof of Proposition 4, the displayed set expression '{Z ∈ P | x, y ⁄∈Z ∧ rankr-cf(Z ∪ {a})} < rankr-cf(Z ∪ {b}) = {∅}' is malformed; it should read {Z ∈ P | x, y ∉ Z ∧ rankr-cf(Z ∪ {a}) < rankr-cf(Z ∪ {b})} = {∅}.","section":"Appendix, Proposition 4 proof"},{"comment":"The phrase 'the final admissible sets ∅ and {d}' is unclear; 'final' should be replaced by 'only remaining' or a similar expression, since these are the admissible sets that are not complete extensions.","section":"Example 3"},{"comment":"The definition of rank relies on the existence of a longest strict chain, which is guaranteed only if the underlying set S is finite (or the preorder has no infinite descending chains); the paper should state explicitly that S is assumed finite, which is consistent with the finite AFs considered later.","section":"Definition 10"},{"comment":"The claim that lex-cel_tau is 'the only known argument-ranking semantics' satisfying σ-C and σ-sk-C is a statement about the literature and should be phrased more cautiously (e.g., 'to the best of our knowledge') or supported by a more systematic comparison.","section":"Section 5"}],"recommendation":"major_revision","confidential_remarks":"The manuscript fits the scope of the journal. The central idea is promising, and the identified gaps are local and repairable. The overstatement in the abstract is the main concern; the authors should either add a result that truly characterizes σ-Refinement or explicitly separate sufficient and necessary parts. No further issues."},"author_rebuttal":null,"desk_editor":{"model":"deepseek-v4-flash","letter":"The paper delivers what it promises in its title: a way to turn extension rankings into argument rankings via social ranking functions, so that skeptically accepted arguments come out above credulously accepted ones, which come out above rejected ones. The star example, lex-cel applied to the complete extension-ranking semantics, actually works and gives a strictly finer ranking than the classical three-tier classification. That is a real contribution to the argumentation literature.\n\nThe genuinely new part is generalizing social ranking functions from total preorders to partial orders via the rank of a set. Theorems 2 and 3 then give sufficient conditions — Independence from the worst set plus Pareto-efficiency — for the induced argument-ranking semantics to satisfy σ-Compatibility and σ-skeptical-Compatibility. Theorem 7 shows lex-cel satisfies Pareto-efficiency, so the construction is not vacuous. The necessary-condition results for cf-C and ad-C in terms of Dominating set are also a nice step.\n\nThe main soft spot is in the proofs of Theorems 2 and 3. The auxiliary relation defined by X ⊒σ Y iff X is a σ-extension and Y is not is not reflexive, so it is not a preorder. But Definitions 10, 12, and 13 are all stated for preorders. So as written, rank, Independence from the worst set, and Pareto-efficiency cannot be applied to that relation. The stress-test note is right that this is local and repairable: take the reflexive closure, turning it into a two-level total preorder whose top level is exactly σ(F). The rank values and strict preferences are unchanged, and the transfer argument goes through. The companion claim that τ can be viewed as a refinement of τ′ is also sloppy for the same reason, but it is not load-bearing once the reflexive closure is taken.\n\nTwo smaller issues. The abstract claims necessary and sufficient conditions, but the body only proves sufficient conditions for the refinement property; the necessary conditions are for Dominating set with respect to cf-C/ad-C, not for the headline refinement. That overstates the result and should be fixed. Also, the Related Work section says lex-celτ is the only known semantics satisfying σ-Refinement and that only one existing semantics satisfies ad-Compatibility. Those are literature claims, not theorems, and they are not fully supported by the paper. They should be softened.\n\nThis is a paper for people working on abstract argumentation semantics, especially ranking-based and extension-ranking approaches. The central idea is sound, the construction is interesting, and the proof gaps are technical and fixable. It deserves a serious referee, not a desk reject. I would send it to review, with a request to repair the preorder gap and align the abstract with what is actually proved.","headline":"A solid bridge between extension-based and ranking-based argumentation, with a local proof gap in the main theorems that is repairable and does not threaten the core construction.","tokens_in":17043,"tokens_out":2158,"would_cite":true,"duration_ms":21777,"reading_group":"maybe","serious_thinker":"yes","would_accept_peer_review":true},"rs_alignment":null,"lean_confirmation":null,"pith_extraction":{"msc":[],"pacs":[],"model":"deepseek-v4-flash","headline":"By applying social ranking functions to extension rankings, an argument-ranking semantics can refine the classical skeptical/credulous/rejected acceptance classification, and the paper pins down the exact axioms on the social ranking that…","keywords":["abstract argumentation","argument-ranking semantics","extension-ranking semantics","social ranking functions","lexicographic excellence","acceptance refinement","axiomatic properties"],"falsifier":"Take any argumentation framework with at least one skeptically accepted argument and at least one credulously but not skeptically accepted argument, apply lex-cel with the complete extension ranking, and check whether the skeptically accepted argument is ranked strictly above the credulously accepted one; a single framework where this fails would refute the claim that this semantics satisfies skeptical-Compatibility. Alternatively, re-run the proof of Theorem 2 after adding reflexivity to the auxiliary relation and verify that the Pareto-efficiency step still yields the strict preference; if it does not, the transfer argument fails.","tokens_in":16103,"feed_emoji":"⚖️","tokens_out":10460,"duration_ms":82008,"temperature":0.7,"pith_summary":"The paper proposes a new family of argument-ranking semantics built by feeding an extension-ranking semantics into a social ranking function. Its central result is a pair of sufficient conditions: if the extension ranking generalises a classical semantics and the social ranking satisfies Independence from the worst set and Pareto-efficiency, then the resulting argument ranking places every skeptically accepted argument above every credulously accepted argument, and every credulously accepted argument above every rejected one. The paper also proves necessary conditions in terms of a Dominating set axiom and shows that the lexicographic excellence operator (lex-cel) satisfies the sufficient conditions, making it a concrete instance of the construction. The upshot is a principled way to order arguments within the acceptance classes, not just across them.","feed_headline":"Social rankings refine skeptical, credulous, rejected arguments","feed_subtitle":"A social-choice operator orders arguments inside each acceptance class, not just across them.","key_machinery":"The central machinery is the rank of a set with respect to a preorder over the powerset, defined as the length of a longest strict descending chain ending at that set, together with the lexicographic excellence (lex-cel) social ranking function, which compares two elements by the number of sets of each rank they belong to, moving lexicographically from the best rank downward. The transfer theorems work by constructing an auxiliary two-level preorder that separates extensions from non-extensions, using Pareto-efficiency to establish a strict preference inside that auxiliary ranking, and then invoking Independence from the worst set to carry the strict preference over to the actual extension ranking. The Dominating set axiom, implied by the two sufficient axioms, captures the intuition that an element contained in a set that dominates every set containing a rival element must be ranked above that rival.","core_discovery":"The paper's central claim is that any social ranking function can be turned into an argument-ranking semantics by applying it to an extension-ranking semantics, and that the right choice of axioms on the social ranking makes the resulting semantics a true refinement of the classical acceptance classification. In Theorems 2 and 3 it proves that if the extension-ranking semantics satisfies generalisation and the social ranking satisfies Independence from the worst set and Pareto-efficiency, then the induced semantics satisfies Compatibility and skeptical-Compatibility; hence skeptically accepted arguments are ranked above credulously accepted ones, which are ranked above rejected ones. The paper then shows that lex-cel satisfies Pareto-efficiency and, together with the complete extension ranking, yields the concrete ranking of the running example a > d > c > b. It also establishes necessary conditions: Dominating set is implied by the two sufficient axioms and is itself necessary for a social ranking to yield conflict-free Compatibility and admissible Compatibility.","pith_inferences":["The same two-level auxiliary-preorder transfer technique should generalise beyond argumentation: any domain where the top level of a preorder is the set of 'winning' coalitions can use Independence from the worst set to lift a Pareto-derived strict preference over individuals to the full ranking.","The written proof of the transfer theorems uses a non-reflexive relation as a preorder; adding equality repairs the gap, so the theorems survive but the appendix should be read with that patch in mind.","The necessity results suggest a design principle for future social-ranking-based semantics: check the Dominating set axiom first, since it is exactly what buys the coarse acceptance refinement, and then add axioms to shape the fine-grained ordering within the acceptance classes.","A testable extension would be to apply other social ranking functions satisfying the two sufficient axioms to the same extension rankings and compare the fine-grained orders they induce within the credulous and skeptical classes on benchmark frameworks."],"forward_implications":["Under the sufficient conditions, the induced semantics orders every skeptically accepted argument strictly above every credulously accepted argument, and every credulously accepted argument strictly above every rejected one.","The lexicographic excellence operator applied to the complete extension ranking satisfies the refinement property and is strictly more informative than the earlier extension-ranking-based argument-ranking semantics, because a lex-cel preference implies a preference in that earlier semantics.","The Dominating set axiom is necessary as well as sufficient on realisable preorders: any social ranking that, combined with the conflict-free or admissible extension rankings, yields the corresponding compatibility principle must satisfy Dominating set.","The serialisability-based ranking semantics, the only previously known semantics satisfying admissible Compatibility, violates complete skeptical-Compatibility, so the lex-cel construction is the only known argument-ranking semantics satisfying the refinement property.","The singleton approach, which ranks arguments by comparing only their singleton sets, does not refine the acceptance classification and therefore cannot deliver the refinement property."],"supporting_citations":[{"why":"Supplies the extension-ranking semantics and the generalisation principle that the construction relies on.","marker":"(Skiba et al. 2021)"},{"why":"Introduces the lexicographic excellence operator and the Independence from the worst set axiom, from which the main sufficient conditions are built.","marker":"(Bernardi, Lucchetti, and Moretti 2019)"},{"why":"Introduces social ranking functions as maps from a preorder over subsets to an order over elements, the framework the paper adapts.","marker":"(Moretti and Öztürk 2017)"},{"why":"Provides abstract argumentation frameworks and the extension-based semantics whose acceptance classes are being refined.","marker":"(Dung 1995)"},{"why":"Introduces argument-ranking semantics and the principle-based approach that defines Compatibility.","marker":"(Amgoud and Ben-Naim 2013)"},{"why":"Defines the serialisability-based ranking semantics whose failure to satisfy skeptical-Compatibility isolates the new semantics as the only known one with the refinement property.","marker":"(Blümel and Thimm 2022)"},{"why":"Defines the ordinal Banzhaf social ranking whose induced semantics violates Self-Contradiction, supporting the choice of lex-cel as suitable.","marker":"(Khani, Moretti, and Öztürk 2019)"}],"fun_headline_variants":["Social choice meets argument ranking: refine acceptance classes","From group rankings to finer argument tiers","Ranking arguments inside skeptical, credulous, rejected","Social-ranking axioms sharpen argument acceptance","New semantics: order within acceptance classes"],"cache_read_input_tokens":3200,"weakest_assumption_plain":"The transfer arguments in Theorems 2 and 3 require the auxiliary two-level relation separating extensions from non-extensions to be a preorder, but as written it is not reflexive, and without adding equality the Independence from the worst set step does not go through.","fun_headline_variants_meta":{"raw":{"variants":["Social choice meets argument ranking: refine acceptance classes","From group rankings to finer argument tiers","Ranking arguments inside skeptical, credulous, rejected","Social-ranking axioms sharpen argument acceptance","New semantics: order within acceptance classes"]},"model":"deepseek-v4-flash","effort":"low","cost_usd":0.000149,"raw_usage":{"total_tokens":1111,"prompt_tokens":783,"completion_tokens":328,"prompt_tokens_details":{"cached_tokens":384},"prompt_cache_hit_tokens":384,"prompt_cache_miss_tokens":399,"completion_tokens_details":{"reasoning_tokens":263}},"tokens_in":399,"tokens_out":328,"duration_ms":3145,"temperature":1.0,"reasoning_tokens":263,"cache_read_input_tokens":384,"cache_creation_input_tokens":0},"cache_creation_input_tokens":0},"created_at":"2026-08-11T12:59:27.617350+00:00","model_set":{"reader":"deepseek-v4-flash"},"falsifier":"Take any argumentation framework with at least one skeptically accepted argument and at least one credulously but not skeptically accepted argument, apply lex-cel with the complete extension ranking, and check whether the skeptically accepted argument is ranked strictly above the credulously accepted one; a single framework where this fails would refute the claim that this semantics satisfies skeptical-Compatibility. Alternatively, re-run the proof of Theorem 2 after adding reflexivity to the auxiliary relation and verify that the Pareto-efficiency step still yields the strict preference; if it does not, the transfer argument fails.","supporting_citations":[{"cited_title":null,"cited_arxiv_id":null,"evidence_quote":"Supplies the extension-ranking semantics and the generalisation principle that the construction relies on."},{"cited_title":null,"cited_arxiv_id":null,"evidence_quote":"Introduces the lexicographic excellence operator and the Independence from the worst set axiom, from which the main sufficient conditions are built."},{"cited_title":null,"cited_arxiv_id":null,"evidence_quote":"Introduces social ranking functions as maps from a preorder over subsets to an order over elements, the framework the paper adapts."},{"cited_title":null,"cited_arxiv_id":null,"evidence_quote":"Provides abstract argumentation frameworks and the extension-based semantics whose acceptance classes are being refined."},{"cited_title":null,"cited_arxiv_id":null,"evidence_quote":"Introduces argument-ranking semantics and the principle-based approach that defines Compatibility."},{"cited_title":null,"cited_arxiv_id":null,"evidence_quote":"Defines the ordinal Banzhaf social ranking whose induced semantics violates Self-Contradiction, supporting the choice of lex-cel as suitable."}],"review_version":1}