{"id":"b9744992-d132-40b0-9a04-4d85904ee738","arxiv_id":"1908.01441","paper_version":5,"verdict":"CONDITIONAL","confidence":"HIGH","novelty_score":6.0,"correctness_risk":"medium","formal_verification":"none","parameter_count":3,"one_line_summary":"Morphing partial edge drawings, an animated variant of partial edge drawing, shortened response time for adjacency checks compared with static partial edge drawing in a small user study.","lead":"This paper proposes morphing partial edge drawings, in which graph edges animate from short stubs to full lines, and tests whether the animation helps people read graphs faster than static partial edges. A 12-person user study found a significant speedup for checking whether two nodes are adjacent, but not for selecting all neighbors of a node.","discovery_kind":"new_method","skeptic_critique":{"model":"deepseek-v4-flash","headline":"The central H1 result may be specific to the single 10 deg/s morphing speed, which participants in Section 6.9 already reported as too fast; without a speed sweep, the claim that MED generally counteracts PED reading time is not established.","rationale":"I agree with the reader's weakest assumption. The strongest claim is empirical H1, and its only support is one speed setting. The paper itself contains contradictory qualitative evidence in Section 6.9. Also note the same experiment found no significant T2 difference, and H2 is unsupported, so the general claim rests on T1 alone. The scheduling algorithm is not the main risk for the headline claim; even if the algorithm is correct, the empirical effect is fragile. A speed sweep is feasible and decisive. Since the reader already made the same concern and conditioned acceptance, I recommend keeping the conditional verdict unchanged.","tokens_in":8632,"tokens_out":3174,"duration_ms":34350,"concrete_test":"Conduct a within-subject follow-up of T1 with the same graph corpus, comparing 1/4-SHPED with 1/4-SHMED at three morphing speeds (e.g., 5, 10, and 20 deg/s, keeping the 300 ms floor) and collecting per-condition subjective speed ratings. If the SHMED-vs-SHPED response-time advantage is significant only at 10 deg/s, or is non-monotone and absent at the speed participants rate comfortable, then H1 is speed-specific and the Section 7 generalization should be weakened; if the advantage persists robustly across speeds, the concern is resolved.","verdict_should_be":"UNCHANGED","load_bearing_attack":"The paper's central empirical claim is Table 1: 1/4-SHMED significantly reduces T1 response time relative to 1/4-SHPED (p=0.0011, Holm-adjusted). The experiment fixes the morphing speed at 10 deg/s with a 300 ms minimum one-way travel time (Section 6.4), justified by Robinson's smooth-pursuit data. Participant feedback in Section 6.9 directly contradicts the assumption that this speed is comfortably trackable: 'The stubs change too fast. The time for stubs to connect is too short.' If the display is near the usability limit, the measured speedup may be a speed-specific artifact rather than a property of MED. In particular, 1/4-SHMED with eta=1/2 periodically reaches a full-edge drawing, so at the chosen speed participants may be getting transient CED-like glimpses; at slower speeds these glimpses would be rarer per unit reading time, and at faster speeds they would be untrackable. The paper reports no variation of this parameter, so H1 is a single-point measurement on the very axis that its own participants flagged as too fast. The conclusion in Section 7 extrapolates from this one setting to 'MED can function as a countermeasure,' which is broader than the evidence supports. This is a load-bearing concern because if the effect reverses or disappears at a comfortable speed, the central contribution reduces to a narrow parameter choice rather than a general phenomenon.","agreement_with_reader":"agree"},"referee_report":{"model":"deepseek-v4-flash","summary":"The paper introduces morphing edge drawing (MED), a time-varying variant of partial edge drawing (PED), with a formalization of PED/MED, two scheduling requirements (R1: avoid new crossings in blank areas; R2: shorten total morphing time), a greedy scheduling algorithm (Algorithm 1), and a user study comparing CED, 1/4-SHPED, and 1/4-SHMED on two tasks. The main empirical claim is that 1/4-SHMED significantly shortens response time for adjacency verification (T1) compared with 1/4-SHPED (p=0.0011 after Holm correction), although no significant advantage is found for neighbor enumeration (T2) or accuracy. The paper concludes that MED can function as a countermeasure against the reading time incurred by PED.","tokens_in":8900,"tokens_out":7472,"duration_ms":74615,"significance":"The formalization in Sections 2 and 4 is a clean extension of Bruckdorfer et al.'s PED model and is a useful conceptual contribution. The scheduling requirements R1/R2 are sensible, and the experiment uses an appropriate nonparametric framework (Friedman test with Holm correction). If the T1 result is robust across morphing speeds, the paper would demonstrate a practical way to recover reading speed lost by PED. The main limitations—unproven schedule correctness, a single morphing speed, and a small n with only one significant task—currently prevent the broader conclusion from being fully supported.","major_comments":[{"comment":"The algorithm has no correctness proof. The manuscript asserts that the schedule satisfies R1 and R2, but it does not prove that respecting the pairwise prohibited intervals from Expressions (3)-(4) prevents stub crossings throughout an entire morphing cycle, nor does it account for periodic repetition of morphing. It also does not define a measure for R2 or prove any optimality or approximation property. Because the scheduling algorithm is part of the contribution and is used in the experiment, this gap is load-bearing.","section":"Section 5.5, Algorithm 1"},{"comment":"The experiment fixes morphing speed at 10 deg/s with a 300 ms minimum one-way travel time. Participant feedback in Section 6.9 explicitly states \"The stubs change too fast. The time for stubs to connect is too short,\" and the authors acknowledge that \"the morphing speed is too fast.\" Thus H1 is supported at a single speed that is at the usability boundary, and the conclusion in Section 7 extrapolates to MED in general. A speed sweep (for example, 5 and 15 deg/s or different minimum travel times) is needed to establish that the T1 advantage is a property of MED rather than an artifact of this speed.","section":"Sections 6.4 and 6.9"},{"comment":"With 12 participants, only the T1 response-time comparison shows a significant effect; T2 response time and accuracy show no significant differences. The concluding sentence in Section 7, \"MED can function as a countermeasure against the time to read a graph by PED,\" is broader than the evidence, which supports only a speed advantage for the adjacency-verification task at one morphing speed. The conclusion should be restricted accordingly or supported by additional tasks and speeds.","section":"Sections 6.5 and 7, Tables 1-3"}],"minor_comments":[{"comment":"'asymmetric PED (SPED)' should be 'symmetric PED (SPED)'; the condition alpha_e = 1 - beta_e gives equal-length stubs, and the same abbreviation is used in Section 4.1.","section":"Section 2"},{"comment":"'morphing of two stabs works simultaneously' should read 'two stubs'.","section":"Section 6.9"},{"comment":"State explicitly whether the reported p-values are raw or Holm-adjusted, and provide the Friedman test statistics.","section":"Tables 1-3"},{"comment":"Define 'blank area' formally at the point where R1 is introduced, since the algorithm and morphing groups rely on it.","section":"Section 5"}],"recommendation":"major_revision","confidential_remarks":"The paper fits the journal's scope, but the external-validity concerns (single speed, one significant task) and the missing correctness proof for Algorithm 1 are the main reasons for major revision. I would ask for either a new experiment varying speed or a clearly scoped claim, and a formal theorem and proof for the scheduler."},"author_rebuttal":null,"desk_editor":{"model":"deepseek-v4-flash","letter":"First, know this: this is a small but honest contribution to graph drawing. The idea of making partial edge drawings time-dependent (MED) is a natural union of PED and animation, and the authors formalize it cleanly with ratio functions and morphing groups. They also ran a real user study with a Holm-corrected significance test, and the main positive result—1/4-SHMED cuts response time on the T1 adjacency task relative to 1/4-SHPED—looks credible. The scheduler heuristic is plausible for avoiding crossings, and the authors report participant complaints honestly.\n\nThe soft spots are real but not fatal. The stress-test hit the main one: everything hangs on a single morphing speed (10 degrees/s with a 300 ms floor), chosen from smooth-pursuit data, and participants already said 'the stubs change too fast.' Without a speed sweep, H1 is one point on the curve, not a general property of MED. The conclusion in Section 7 overreaches when it says MED 'can function as a countermeasure' against PED reading time, given only one of two tasks was significant and H2 (accuracy) was not supported. Also, the morphing-group scheduler has no proof of correctness; for a visualization paper that's acceptable if the heuristic is shown to work, but there's no analysis of how often it finds a feasible schedule. Minor points: n=12, no code/data released, and the response-time distributions are shown only as boxplots without individual data.\n\nWho is this for? People who work on partial edge drawing, readability of node-link diagrams, or animated edge encodings. It won't change the field, but it's a legitimate variation with a testable hypothesis and an honest experiment. It deserves peer review—not desk rejection. I'd ask for a speed sweep or a heavily softened conclusion, plus release of the materials, but the core idea is clear and worth engaging.","headline":"A small, honest paper that adds time-dependence to partial edge drawing; the main speedup is credible on one task but the general conclusion outruns the single-speed experiment.","tokens_in":9422,"tokens_out":1902,"would_cite":false,"duration_ms":20104,"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":"This paper proposes that animating the stubs of partial edge drawings—morphing them between partial and complete—can shorten the time readers need to confirm adjacency in a graph, and presents a scheduling algorithm plus a user study…","keywords":["graph drawing","partial edge drawing","morphing edge drawing","stub-edge ratio","symmetric homogeneous MED","scheduling morphing","graph reading time","user study"],"falsifier":"Run the same T1 adjacency task with morphing speed varied below and above 10 degrees per second (for example 5, 7, and 13 degrees per second) and with the 300 ms minimum removed; if the response-time advantage of 1/4-SHMED over 1/4-SHPED disappears or reverses at slower settings, the claim that morphing itself shortens reading time would be refuted. A second check is to record eye-tracking fixations on stub tips while two highlighted nodes are connected: if viewers do not track the moving tips, the proposed mechanism is not the cause of the measured benefit.","tokens_in":8385,"feed_emoji":"🕸️","tokens_out":5221,"duration_ms":48665,"temperature":0.7,"pith_summary":"This paper proposes a time-varying version of partial edge drawing, called morphing edge drawing (MED), in which the stubs of each edge expand to a full line and shrink back on a schedule. Static partial edge drawings reduce visual clutter by omitting middle segments, but they force readers to infer the missing parts and therefore take longer to read. The paper formalizes MED as a morphing function on stub parameters, specifies scheduling requirements that prevent new crossings and shorten total morphing time, and gives an algorithm that assigns start times to edges. A user study with 12 participants finds that a symmetric homogeneous MED with stub ratio 1/4 significantly shortens the time to confirm whether two nodes are adjacent compared to the corresponding static PED, while accuracy differences did not reach significance. The paper concludes that morphing can act as a countermeasure to the extra reading time caused by partial edge drawing.","feed_headline":"Morphing edges recover reading speed lost by partial drawings","feed_subtitle":"User study: 1/4-SHMED is significantly faster than static PED for adjacency checks, with no accuracy loss.","key_machinery":"The central object is the morphing function: for each edge $e$, a map $\\mu_e$ from time to a partial drawing of $e$, written $\\mu_e(t) = \\gamma_e(\\rho_e(t))$, where $\\gamma_e$ is the stub-drawing function and $\\rho_e$ is a ratio function selecting the two stub parameters $\\alpha, \\beta$ at time $t$. In a symmetric homogeneous MED with parameters $(\\delta, \\eta)$, every edge uses the same ratio function that moves the stub ratio from $\\delta$ to $\\eta$ and back; when $\\eta = 1/2$ the stubs meet and the edge momentarily becomes complete. The scheduling mechanism is a morphing group: a connected component in the intersection graph of edges whose blank areas overlap. Start times are assigned in descending edge length; for each edge, forbidden start intervals are computed from the first and second times its stubs would pass crossing points of already scheduled intersecting edges, and the earliest allowed time is chosen. This packing of one-way travel times prevents dynamic stubs from crossing in the blank areas while shortening the total morphing cycle.","core_discovery":"The central claim is that animating partial edges—letting each stub grow to the full edge and shrink back—recovers some of the reading speed lost when a graph is drawn as a partial edge drawing, without sacrificing accuracy. More exactly, in an experiment with three displays (complete edges, 1/4-SHPED, and 1/4-SHMED) on a 50-node, 144-edge graph, the morphing version had a significantly shorter mean response time than the static partial version for the adjacency-confirmation task T1, placing it between the complete drawing and the static partial drawing. For the node-selection task T2 no significant response-time differences appeared, and no significant accuracy differences appeared in either task, so the hypothesis that MED is more accurate than CED was not supported. The paper interprets the result as evidence that morphing helps viewers connect stubs without requiring them to estimate the hidden middle.","pith_inferences":["An implication the authors leave implicit: because the speed choice came from smooth-pursuit limits, the time benefit is likely tied to the 10 degrees per second setting; at slower speeds the advantage may shrink, and several participants already reported the stubs moved too fast.","The study used one graph with 50 nodes and 144 edges and 12 participants, so the point estimate is thin; a replication across densities, stub ratios, and participant pools would show whether the adjacency-time advantage is stable.","A practical extension, not examined here, is selective morphing: animate only edges near the viewer's attention or only edges whose blank areas contain crossings, which could keep most of the benefit while reducing the visual clutter that participants complained about."],"forward_implications":["For the adjacency-check task T1, 1/4-SHMED achieved significantly shorter response times than 1/4-SHPED, with CED still fastest.","For the larger neighborhood-selection task T2, no significant response-time differences were found, so the morphing benefit did not generalize to all reading tasks in this experiment.","No significant accuracy differences appeared across CED, 1/4-SHPED, and 1/4-SHMED, so the paper's hypothesis H2 (MED more accurate than CED) is not supported.","The scheduling algorithm assigns start times so that dynamic stubs do not enter a blank area while another stub is there, avoiding new crossings, and packs the morphing intervals of non-intersecting edges to shorten total morphing time.","Taken together, the results support the paper's conclusion that MED can serve as a countermeasure to the extra time required to read a graph drawn with PED."],"supporting_citations":[{"why":"The Barabási–Albert model is the guideline for generating the 50-node, 144-edge graph used in the user study.","marker":"[1]"},{"why":"Binucci et al. evaluated SHPED accuracy and support the paper's choice of SHPED as a baseline for reading performance.","marker":"[3]"},{"why":"Bruckdorfer and Kaufmann formalized PED; the paper's stub-parameter formalization is a modified version of theirs.","marker":"[5]"},{"why":"The earlier PED user study showed PED is accurate but slower than complete drawings; this is the reading-time problem MED targets.","marker":"[6]"},{"why":"The Fruchterman–Reingold force-directed layout determines the positions of nodes in all experimental graphs.","marker":"[10]"},{"why":"Robinson's smooth-pursuit eye movement data is the basis for setting the morphing speed at 10 degrees per second.","marker":"[12]"}],"fun_headline_variants":["Morphing stubs speed up graph adjacency reading","Animated edges cut adjacency check time","Morphing partials: faster adjacency reading, same accuracy","For adjacency checks, morphing stubs beat static drawing"],"cache_read_input_tokens":3200,"weakest_assumption_plain":"The experiment's chosen stub speed—10 degrees per second of visual angle, with a 300 ms minimum one-way travel time—is assumed to be fast enough to make morphing useful but slow enough for human smooth-pursuit eye movements to track the moving stub tips; participant comments that the stubs 'change too fast' suggest this assumption is near its limit.","fun_headline_variants_meta":{"raw":{"variants":["Morphing stubs speed up graph adjacency reading","Animated edges cut adjacency check time","Morphing partials: faster adjacency reading, same accuracy","For adjacency checks, morphing stubs beat static drawing"]},"model":"deepseek-v4-flash","effort":"low","cost_usd":0.001718,"raw_usage":{"total_tokens":6770,"prompt_tokens":890,"completion_tokens":5880,"prompt_tokens_details":{"cached_tokens":384},"prompt_cache_hit_tokens":384,"prompt_cache_miss_tokens":506,"completion_tokens_details":{"reasoning_tokens":5817}},"tokens_in":506,"tokens_out":5880,"duration_ms":45199,"temperature":1.0,"reasoning_tokens":5817,"cache_read_input_tokens":384,"cache_creation_input_tokens":0},"cache_creation_input_tokens":0},"created_at":"2026-08-14T15:12:59.399684+00:00","model_set":{"reader":"deepseek-v4-flash"},"falsifier":"Run the same T1 adjacency task with morphing speed varied below and above 10 degrees per second (for example 5, 7, and 13 degrees per second) and with the 300 ms minimum removed; if the response-time advantage of 1/4-SHMED over 1/4-SHPED disappears or reverses at slower settings, the claim that morphing itself shortens reading time would be refuted. A second check is to record eye-tracking fixations on stub tips while two highlighted nodes are connected: if viewers do not track the moving tips, the proposed mechanism is not the cause of the measured benefit.","supporting_citations":[{"cited_title":"(eds.) Fun with Algorithms","cited_arxiv_id":null,"evidence_quote":"Bruckdorfer and Kaufmann formalized PED; the paper's stub-parameter formalization is a modified version of theirs."},{"cited_title":"In: Di Giacomo, E., Lubiw, A","cited_arxiv_id":null,"evidence_quote":"The earlier PED user study showed PED is accurate but slower than complete drawings; this is the reading-time problem MED targets."},{"cited_title":"The Journal of Physiology 180(3), 569–591 (1965)","cited_arxiv_id":null,"evidence_quote":"Robinson's smooth-pursuit eye movement data is the basis for setting the morphing speed at 10 degrees per second."}],"review_version":1}