{"id":"78de5ca8-b44a-462b-a0e6-73882194f3a7","arxiv_id":"2508.03445","paper_version":2,"verdict":"UNVERDICTED","confidence":"LOW","novelty_score":5.0,"correctness_risk":"unknown","formal_verification":"none","parameter_count":0,"one_line_summary":"A Voronoi treemap method that uses similarity matching and greedy swapping to keep similar data items as neighbors while adjusting cell areas to show hierarchy.","lead":"This paper introduces a Voronoi treemap algorithm that arranges cells according to data similarity, so similar items sit next to each other while the hierarchy is still shown. A smart generalist might read it because it offers a way to visualize both tree structure and similarity in the same static image, which is useful for infographics and text analysis.","discovery_kind":"new_method","skeptic_critique":{"model":"deepseek-v4-flash","headline":"Planarity of 2D Voronoi adjacency graphs may make 'neighborhood-preserving' impossible for non-planar similarity data; the abstract does not qualify this.","rationale":"The reader's weakest assumption overlaps with my planarity concern. The reader identified representability of similarity as adjacency and greedy convergence; I focus specifically on the mathematical impossibility of representing arbitrary similarity structures as planar adjacencies. This is a load-bearing condition: if the input similarity graph is not planar, perfect neighborhood preservation is impossible, so the algorithm must be evaluated as an approximation or restricted to planarity-embeddable data. The paper's real-world examples (shared borders, word embeddings) may be approximately planar, but the abstract's unqualified claim is broader. The proposed K5 test would reveal whether the method and its metric respect this constraint. I do not move the verdict because the full text was not available; the concern may already be addressed in the paper's evaluation or discussion.","tokens_in":667,"tokens_out":4700,"duration_ms":56870,"concrete_test":"Run the algorithm on a synthetic dataset whose similarity graph is K5 (five items, all pairwise similar). In any planar Voronoi layout, at least one of the ten pairs cannot be adjacent. Check whether the algorithm's output contains a K5 adjacency graph and report its neighborhood-preservation score. If the score is near-perfect, the metric is insensitive to missing adjacencies; if it is low, the paper must explicitly state that neighborhood preservation is limited by planarity.","verdict_should_be":"UNCHANGED","load_bearing_attack":"The central claim requires that pairwise data similarity can be mapped to cell adjacency in a 2D Voronoi treemap. However, the adjacency graph of a planar Voronoi diagram is planar, so it cannot represent non-planar similarity structures such as K5 or K3,3. If the input similarity graph contains such a minor, at least some high-similarity pairs must be non-adjacent. The abstract presents the method without stating this representational limit, so the claim 'neighborhood-preserving' is either approximate or restricted to planar/embeddable similarity data. The full text must specify the metric used for neighborhood preservation and demonstrate how it behaves on non-planar similarity graphs. Without such qualification, the central claim overreaches.","agreement_with_reader":"partial"},"referee_report":{"model":"deepseek-v4-flash","summary":"The manuscript introduces a Voronoi treemap algorithm that uses data similarity to produce neighborhood-preserving treemaps. It proposes extending the treemap layout pipeline with similarity-aware preprocessing, using Kuhn-Munkres matching to initialize equal-size Voronoi cells, applying greedy swapping to improve cell neighborhoods, and then iteratively adjusting cell areas while preserving neighborhoods. The authors demonstrate the approach on real-world infographic and linguistic examples and state that they quantitatively measure neighborhood preservation. This report is based solely on the abstract, as the full text was not available for review.","tokens_in":809,"tokens_out":1762,"duration_ms":22736,"significance":"If the method works as described, it addresses a real need in information visualization: conveying similarity structure in treemaps alongside hierarchy. The pipeline of matching, swapping, and area rebalancing is plausible and could be practically useful. The paper also appears to include some quantitative evaluation, which is a strength if properly reported. However, because no full text, pseudocode, or evaluation data are available, the central claims cannot yet be verified; the contribution's significance remains contingent on a detailed and reproducible presentation.","major_comments":[{"comment":"The abstract does not formally define 'neighborhood-preserving' or specify the metric used to measure it. Since the entire contribution rests on this notion, the reader cannot evaluate whether the claimed preservation is meaningful or whether it is a weak or approximate outcome. The full text must state the exact metric, the threshold or comparison used, and how violations are counted.","section":"Abstract (central claim)"},{"comment":"The adjacency graph of a 2D Voronoi diagram is planar, so it cannot represent arbitrary non-planar similarity structures such as K5 or K3,3. If the input similarity graph contains such a minor, at least some high-similarity pairs must be non-adjacent in any Voronoi treemap. The abstract presents 'neighborhood-preserving' without this qualification, which overreaches. The authors must either restrict the claim to planar or embeddable similarity graphs or describe how the algorithm approximates neighborhoods for non-planar inputs and evaluate the resulting loss.","section":"Abstract (planarity limitation)"},{"comment":"The abstract states that the authors 'quantitatively assess' the results but reports no metric values, no comparison to existing treemap methods, and no description of datasets or error bars. Without concrete numbers and a baseline, the claim of practicality is unsupported. The full paper must include at least summary statistics of neighborhood preservation and area errors, together with a discussion of failure cases.","section":"Abstract (quantitative evidence)"}],"minor_comments":[{"comment":"The phrase 'Kuhn-Munkres matching of similarities to CVT cells' is ambiguous: it is unclear what the two matched sets are and how the cost matrix is defined. Clarifying the matching inputs would improve readability.","section":"Abstract (method description)"},{"comment":"The abstract mentions 'extend the treemap layout pipeline' but does not state whether the method operates on a single hierarchy level, recursively on all levels, or only on leaves. A precise scope statement would help the reader.","section":"Abstract (scope)"}],"recommendation":"uncertain","confidential_remarks":"This review is severely limited by the absence of the full manuscript; only the abstract was available. The planarity concern raised in the major comments is a genuine theoretical issue that the author should address explicitly, but it is not necessarily fatal if the method is framed as an approximation. I would recommend inviting a full submission for review, with the expectation that the authors provide pseudocode, formal definitions, and quantitative evaluation."},"author_rebuttal":null,"desk_editor":{"model":"deepseek-v4-flash","letter":"Abstract-only review, so this is provisional. The paper lines up a sensible algorithmic pipeline: similarity-based grouping at preprocessing, Kuhn-Munkres matching of cells, greedy swapping for neighborhood improvement, then area rebalancing. That combination appears new to me and is worth a look. The real-world examples from infographics and linguistics suggest the authors are trying to solve an actual problem.\n\nThe soft spot is the planarity constraint. A 2D Voronoi diagram's adjacency graph is planar, so any similarity structure containing K5 or K3,3 can't be represented as cell adjacencies. The abstract says 'neighborhood-preserving' without caveat. The full text needs to define the metric (adjacency recall? preservation rate?) and report behavior on non-planar similarity data. This is a fundamental representational limit, not an implementation detail, so the referee should check that the paper doesn't overclaim. It's possible the full text already handles this by only claiming approximation, but the abstract doesn't say so.\n\nOther missing details: no pseudocode, no convergence analysis for the greedy swap, no comparison to other treemap algorithms. Again, these may be in the full paper; I can't tell from the abstract. The evaluation metrics are named but not defined.\n\nOverall, the idea is sensible and potentially useful for visualization practice. The abstract doesn't have enough detail to verify the claims, and the planarity issue is the key thing to probe. I'd send it to peer review: a serious referee can check whether the method actually delivers what the title promises and whether the evaluation is honest. I wouldn't cite it myself until I see the full paper, but it's the kind of work I'd read in the next round.","headline":"Plausible, potentially useful Voronoi treemap method, but the abstract alone cannot support the central claim and the planarity limit of Voronoi adjacency needs explicit treatment.","tokens_in":1260,"tokens_out":1988,"would_cite":false,"duration_ms":24525,"reading_group":"maybe","serious_thinker":"unclear","would_accept_peer_review":true},"rs_alignment":null,"lean_confirmation":null,"pith_extraction":{"msc":[],"pacs":[],"model":"deepseek-v4-flash","headline":"A new Voronoi treemap algorithm places similar data items in adjacent cells, preserving both hierarchy and neighborhood structure.","keywords":["Voronoi treemap","neighborhood preservation","similarity layout","Kuhn-Munkres matching","centroidal Voronoi tessellation","greedy swapping","hierarchical data visualization","area-balanced layout"],"falsifier":"Construct a synthetic dataset whose similarity graph is highly non-planar, such as many items all mutually similar, and measure whether the final treemap's neighborhood preservation falls well below the similarity graph's planarity bound; if it does not improve on random adjacency, the method's core assumption fails on that class of data.","tokens_in":523,"feed_emoji":"🗺️","tokens_out":2888,"duration_ms":33160,"temperature":0.7,"pith_summary":"Voronoi treemaps normally encode only hierarchy and cell size, ignoring the fact that data items often carry similarities, such as shared borders between countries or matching semantic vectors. This paper argues that similarity should influence cell placement and presents a pipeline that does so: match data items to equal-size Voronoi cells with a Kuhn-Munkres assignment, repair neighborhood mistakes by greedy swaps, then rebalance cell areas while keeping neighbors in place. If the method holds, the resulting treemap can be read for both the tree structure and the similarity structure at a glance.","feed_headline":"Similar data items get adjacent cells in new Voronoi treemaps","feed_subtitle":"A matching-plus-swapping pipeline places related items side by side while keeping cell areas true to the data.","key_machinery":"The core object is the pairing between data items and Voronoi cells, computed by Kuhn-Munkres matching of a similarity matrix against the centroidal Voronoi tessellation cells of an equal-size layout. Greedy swapping then acts as a local refinement on that pairing, and the final area-rebalancing step uses iterative adjustment of cell areas while preserving the existing neighborhoods as a constraint.","core_discovery":"The central claim is that a Voronoi treemap can be generated so that cells of similar data items are adjacent, without sacrificing hierarchical containment or final cell-area fidelity. The algorithm works in three stages: preprocessing builds a similarity-aware representation; a Kuhn-Munkres (Hungarian) matching seeds an initial equal-area Voronoi diagram with the most similar items already near each other; and an optimization step greedily swaps cell positions to increase neighborhood matches, followed by iterative area adjustment that restores target sizes while holding the improved neighborhoods. The paper demonstrates the pipeline on infographic and linguistic examples and quantifies both standard treemap quality and neighborhood preservation.","pith_inferences":["The same pipeline could be adapted to dynamic data by re-running the matching step only on changed items, though the paper does not discuss incremental updates.","Because the method treats similarity as a matrix, it should extend naturally to any similarity measure, including geographic borders, cosine distance, or graph shortest paths, provided the matching step can be computed.","A stress-test for the method is high-dimensional similarity that is not planar: the greedy swaps may fight the 2D adjacency constraint, and for such data the neighborhood preservation may cap below the similarity graph's own planarity limit."],"forward_implications":["Treemaps can show a second relationship dimension, similarity, alongside hierarchy, so a single static graphic can answer both 'what is near what' and 'what contains what'.","For geographic data, cells representing countries that share borders will tend to be placed next to each other, making the treemap resemble a stylized adjacency map.","For text or embedding data, clusters of related items appear as contiguous regions inside the treemap, which helps readers spot groupings that a size-only layout hides.","The approach provides quantitative neighborhood-preservation scores, making it comparable against ordinary Voronoi treemaps and other layout algorithms."],"supporting_citations":[],"fun_headline_variants":["Voronoi treemaps keep similar data neighbors","Putting similar data side by side in Voronoi treemaps","Similarity-aware Voronoi treemaps group like items","Matching and swapping create neighbor-preserving treemaps","Treemaps that place similar data items adjacent"],"cache_read_input_tokens":3200,"weakest_assumption_plain":"The load-bearing premise is that pairwise similarity among data items can be captured well by which cells are adjacent in a planar Voronoi diagram, and that the greedy-swap plus area-rebalance cycle reaches a layout where both neighborhood and area goals hold.","fun_headline_variants_meta":{"raw":{"variants":["Voronoi treemaps keep similar data neighbors","Putting similar data side by side in Voronoi treemaps","Similarity-aware Voronoi treemaps group like items","Matching and swapping create neighbor-preserving treemaps","Treemaps that place similar data items adjacent"]},"model":"deepseek-v4-flash","effort":"low","cost_usd":0.000175,"raw_usage":{"total_tokens":1247,"prompt_tokens":868,"completion_tokens":379,"prompt_tokens_details":{"cached_tokens":384},"prompt_cache_hit_tokens":384,"prompt_cache_miss_tokens":484,"completion_tokens_details":{"reasoning_tokens":297}},"tokens_in":484,"tokens_out":379,"duration_ms":4160,"temperature":1.0,"reasoning_tokens":297,"cache_read_input_tokens":384,"cache_creation_input_tokens":0},"cache_creation_input_tokens":0},"created_at":"2026-08-06T04:24:58.662005+00:00","model_set":{"reader":"deepseek-v4-flash"},"falsifier":"Construct a synthetic dataset whose similarity graph is highly non-planar, such as many items all mutually similar, and measure whether the final treemap's neighborhood preservation falls well below the similarity graph's planarity bound; if it does not improve on random adjacency, the method's core assumption fails on that class of data.","supporting_citations":[],"review_version":1}