{"id":"f9be0cef-d6ef-4227-8aa7-ce7d3fabecea","arxiv_id":"2605.30490","paper_version":1,"verdict":"UNVERDICTED","confidence":"LOW","novelty_score":7.0,"correctness_risk":"medium","formal_verification":"none","parameter_count":0,"one_line_summary":"In Candidate Interval and Voter Interval domains, Pareto optimal committees admit a simple dominance characterization, satisfy monotonicity, allow direct reconfiguration, and support polynomial algorithms for proportionality and counting.","lead":"The paper characterizes Pareto optimal committees in approval-based multiwinner voting for Candidate Interval and Voter Interval domains via a Single Dominance Only property, proves monotonicity and reconfiguration without auxiliary candidates, and gives algorithms for EJR+ and counting. A smart generalist might read it to see how efficiency axioms can be made tractable in structured voting settings.","discovery_kind":"new_method","skeptic_critique":{"model":"grok-4.3","headline":"Single Dominance Only equivalence to Pareto optimality is the least-secured step for the monotonicity and reconfiguration claims","rationale":"The reader's weakest assumption correctly flags the domain restriction, which the paper itself acknowledges as open in the general case. Within the stated domains, however, the load-bearing step is the claimed equivalence rather than the restriction. Because the provided text contains no counter-example or internal contradiction, the existing UNVERDICTED verdict is left unchanged pending verification of the characterization.","tokens_in":1783,"tokens_out":318,"duration_ms":27078,"concrete_test":"Construct a Voter Interval instance with 5 candidates and 4 voters whose approval sets are contiguous intervals; exhaustively enumerate all 32 committees, compute the true Pareto-optimal ones by checking pairwise dominance (no other committee is weakly preferred by all voters and strictly preferred by at least one), and test whether the set coincides exactly with the committees satisfying Single Dominance Only.","verdict_should_be":"UNCHANGED","load_bearing_attack":"The paper states that Single Dominance Only provides a simple characterization of Pareto optimality on Candidate Interval and Voter Interval domains, then derives committee monotonicity and reconfiguration-without-auxiliaries from that characterization. For these derived claims to hold for every Pareto-optimal committee, the property must be both necessary and sufficient. The abstract presents the equivalence without exhibiting the proof or edge-case verification, making this the point where an undetected mismatch (a PO committee violating the property, or a non-PO committee satisfying it) would invalidate the subsequent results.","agreement_with_reader":"disagree"},"referee_report":{"model":"grok-4.3","summary":"The paper studies the structure of Pareto optimal (PO) committees in approval-based multiwinner voting. For Candidate Interval and Voter Interval domains it introduces the Single Dominance Only property as a characterization of PO, derives committee monotonicity and reconfiguration of any PO committee to any other PO committee without auxiliary candidates, adapts a polynomial-time algorithm to find a PO committee satisfying EJR+, gives a polynomial-time counting algorithm for PO committees under Voter Interval, and outlines challenges plus an example for the unrestricted domain.","tokens_in":1887,"tokens_out":355,"duration_ms":27994,"significance":"If the claimed characterization and derived results hold, the work supplies concrete structural and algorithmic tools for restricted domains that arise in applications. The polynomial algorithms for EJR+ with PO and for counting PO committees, together with the explicit discussion of the reconfiguration graph, constitute reusable contributions to computational social choice.","major_comments":[{"comment":"The section introducing the Single Dominance Only property: the claim that this property is equivalent to Pareto optimality (necessary and sufficient) is load-bearing for the subsequent committee-monotonicity and reconfiguration-without-auxiliaries theorems. The proof must be inspected to confirm both directions hold for all instances satisfying the interval restrictions, including degenerate cases where multiple candidates share identical approval sets or where the interval structure collapses at the boundary.","section":"section introducing Single Dominance Only"}],"minor_comments":[{"comment":"The counting algorithm for Voter Interval is supported only by a proof idea; a complete, self-contained proof would strengthen the result without altering its scope.","section":"section on counting Pareto optimal committees"}],"recommendation":"major_revision","confidential_remarks":null},"author_rebuttal":{"model":"grok-4.3","summary":"We thank the referee for the positive assessment of our contributions on the structure of Pareto optimal committees in approval-based multiwinner voting and for the detailed comment. We address the concern regarding the Single Dominance Only characterization below.","responses":[{"response":"We appreciate the referee's emphasis on verifying both directions of the equivalence in all cases, including degeneracies. The proof of the characterization (Theorem 3.1) relies on the interval representation of approvals and proceeds by contradiction for necessity and by direct construction for sufficiency. When multiple candidates share identical approval sets, they occupy the same position in the interval ordering and are interchangeable; the single-dominance condition applies uniformly without violation. Boundary collapses (degenerate intervals of length zero) are subsumed by the general interval definition used in the domain restrictions, and the logical steps remain valid as no step assumes positive length or distinct sets. We have re-examined the proof and confirm it holds without additional assumptions. If a concrete counterexample is identified, we will address it directly.","revision_made":"no","referee_comment":"[section introducing Single Dominance Only] The section introducing the Single Dominance Only property: the claim that this property is equivalent to Pareto optimality (necessary and sufficient) is load-bearing for the subsequent committee-monotonicity and reconfiguration-without-auxiliaries theorems. The proof must be inspected to confirm both directions hold for all instances satisfying the interval restrictions, including degenerate cases where multiple candidates share identical approval sets or where the interval structure collapses at the boundary."}],"tokens_in":1338,"tokens_out":332,"duration_ms":19621,"standing_objections":[]},"desk_editor":{"model":"grok-4.3","letter":"The core contribution is a new property called Single Dominance Only that characterizes Pareto optimal committees on the two interval domains, plus proofs that those committees are committee-monotone and that any two can be reconfigured into each other by swapping one candidate at a time without auxiliaries. They also adapt an existing EJR+ algorithm to produce a Pareto optimal committee and give a polynomial counting procedure for the Voter Interval case. These are concrete, domain-specific advances that were not direct corollaries of prior work.\n\nThe results look solid for the restricted domains because the paper derives everything from the definitions and supplies explicit algorithms. The general-domain section is appropriately cautious: it gives an example where the reconfiguration distance is larger than in the interval cases and sketches why monotonicity and connectedness are harder, without claiming a resolution.\n\nThe soft spot is the central equivalence. The monotonicity and reconfiguration results rest on Single Dominance Only being necessary and sufficient for Pareto optimality; if that step has an edge-case gap, the downstream claims weaken. The abstract states the property provides a simple characterization, but without the full derivations it is impossible to verify necessity, sufficiency, or handling of ties. The counting algorithm is only sketched, so its correctness argument also needs inspection.\n\nThis is useful reading for people working on structural properties of approval-based multiwinner rules, especially those already studying interval restrictions. It does not settle open questions in the unrestricted setting, so it will not change how most people compute or axiomatize Pareto optimality outside those domains. Still, the algorithmic results are self-contained enough that a serious referee should see it; the paper is narrow but the claims inside that narrow scope are worth checking.","headline":"The paper gives a clean characterization of Pareto optimality via Single Dominance Only on Candidate Interval and Voter Interval domains plus polynomial algorithms for monotonicity, reconfiguration, and counting, but the general-domain claims stay open and the key equivalence needs checking.","tokens_in":2376,"tokens_out":429,"would_cite":false,"duration_ms":13348,"reading_group":"maybe","serious_thinker":"yes","would_accept_peer_review":true},"rs_alignment":null,"lean_confirmation":null,"pith_extraction":{"msc":[],"pacs":[],"model":"grok-4.3","headline":"In Candidate Interval and Voter Interval domains, Pareto optimal committees satisfy monotonicity and can be reconfigured one candidate at a time without auxiliaries.","keywords":["Pareto optimality","approval voting","multiwinner voting","committee monotonicity","reconfiguration","interval domains","proportionality"],"falsifier":"A concrete Candidate Interval or Voter Interval instance containing two Pareto optimal committees that cannot be transformed into each other by single-candidate Pareto-preserving swaps would falsify the reconfiguration claim.","tokens_in":2681,"feed_emoji":"🔄","tokens_out":644,"duration_ms":15739,"temperature":0.7,"pith_summary":"The paper studies the structure of Pareto optimal committees in approval-based multiwinner voting. It restricts attention to Candidate Interval and Voter Interval domains and introduces the Single Dominance Only property as a characterization of Pareto optimality. This property is then used to prove that Pareto optimal committees are committee-monotonic. The same property supports a reconfiguration result: any Pareto optimal committee can be transformed into any other by successive single-candidate swaps that preserve Pareto optimality at every step and use no auxiliary candidates. The work also gives polynomial-time algorithms for finding an EJR+-satisfying Pareto optimal committee and for counting all Pareto optimal committees under Voter Interval preferences, while outlining why the same claims remain open in the unrestricted setting.","feed_headline":"Pareto optimal committees reconfigure one-by-one in interval domains","feed_subtitle":"In Candidate and Voter Interval approval voting, any two such committees transform via single swaps while remaining Pareto optimal at each s","key_machinery":"The Single Dominance Only property, which characterizes Pareto optimality by ensuring that no candidate outside the committee strictly dominates a candidate inside it under the interval structure.","core_discovery":"In the Candidate Interval and Voter Interval domains, the Single Dominance Only property provides a simple characterization of Pareto optimality. Using this property, the paper shows that Pareto optimal committees satisfy committee monotonicity and that any two Pareto optimal committees can be reconfigured into each other by replacing candidates from the symmetric difference one by one while preserving Pareto optimality throughout and without introducing auxiliary candidates.","pith_inferences":["The reconfiguration result implies that the Pareto optimality graph is connected with diameter bounded by the symmetric difference size in these domains.","The same structural property may allow efficient local search or enumeration algorithms for other efficiency-related axioms.","The explicit counter-example distance in the unrestricted domain suggests that any general proof would require a different technique or additional auxiliary candidates."],"forward_implications":["Pareto optimal committees satisfy committee monotonicity in these domains.","Any Pareto optimal committee can be reconfigured to any other Pareto optimal committee by single-candidate swaps without auxiliary candidates.","A polynomial-time algorithm finds a committee that satisfies both EJR+ and Pareto optimality.","The number of Pareto optimal committees can be counted in polynomial time for Voter Interval instances."],"fun_headline_variants":["Single Dominance Only characterizes Pareto optimality in interval domains","Pareto optimal committees reconfigure by single swaps in restricted domains","Committee monotonicity holds for Pareto sets in Candidate and Voter Interval","Polynomial time algorithm counts Pareto optimal committees in Voter Interval","Reconfiguration graph connects Pareto committees without auxiliary candidates"],"cache_read_input_tokens":2112,"weakest_assumption_plain":"The voting instances are restricted to Candidate Interval or Voter Interval domains.","fun_headline_variants_meta":{"raw":{"variants":["Single Dominance Only characterizes Pareto optimality in interval domains","Pareto optimal committees reconfigure by single swaps in restricted domains","Committee monotonicity holds for Pareto sets in Candidate and Voter Interval","Polynomial time algorithm counts Pareto optimal committees in Voter Interval","Reconfiguration graph connects Pareto committees without auxiliary candidates"]},"model":"grok-4.3","cost_usd":0.002576,"raw_usage":{"total_tokens":1488,"prompt_tokens":700,"num_sources_used":0,"completion_tokens":77,"cost_in_usd_ticks":25762000,"prompt_tokens_details":{"text_tokens":700,"audio_tokens":0,"image_tokens":0,"cached_tokens":256},"completion_tokens_details":{"audio_tokens":0,"reasoning_tokens":711,"accepted_prediction_tokens":0,"rejected_prediction_tokens":0}},"tokens_in":700,"tokens_out":77,"duration_ms":5911,"temperature":1.0,"reasoning_tokens":711,"cache_read_input_tokens":256,"cache_creation_input_tokens":0},"cache_creation_input_tokens":0},"created_at":"2026-06-29T00:15:52.303790+00:00","model_set":{"reader":"grok-4.3"},"falsifier":"A concrete Candidate Interval or Voter Interval instance containing two Pareto optimal committees that cannot be transformed into each other by single-candidate Pareto-preserving swaps would falsify the reconfiguration claim.","supporting_citations":[],"review_version":1}