{"id":"eaaa3bcc-ba1a-4e28-9523-da19e6b4dd5e","arxiv_id":"2607.18495","paper_version":1,"verdict":"CONDITIONAL","confidence":"MODERATE","novelty_score":5.0,"correctness_risk":"medium","formal_verification":"none","parameter_count":5,"one_line_summary":"An adaptive Value-of-Information cutoff for Collective Perception Messages beats the ETSI quantity-based selector on transmitted value in a synthetic V2X simulation.","lead":"A connected-vehicle paper proposes a radio congestion control rule that drops low-value sensor objects first when channels get busy. In a synthetic V2X simulation it transmits more of the most useful perception data than the current ETSI selector while keeping channel load near target.","discovery_kind":"extension","skeptic_critique":{"model":"deepseek-v4-flash","headline":"Quality selector may overrun the FCL byte budget: Eq. 7 selects all content above the adaptive VoI threshold without truncation to B(t), so the Table II VoI gain could be an artifact of transmitting more bytes rather than smarter selection.","rationale":"The reader's stated weakest assumption is the absence of a real VoI pipeline. While that is a practical limitation, the bit-budget compliance issue is more fundamental because it questions whether the proposed selector actually satisfies the resource limits that define DCC. Even with perfect VoI scores, the mechanism as described does not guarantee that the selected content set is within the FCL bit budget. The reader did mention in the rationale that the paper 'does not explicitly check the selected content set against the FCL bit budget,' so this is a partial agreement, but the reader did not elevate it to the weakest assumption. The concern is concrete and testable: adding a truncation step to enforce B(t) would remove the ambiguity. If the VoI gains persist after enforcing the budget, the central claim survives; if they vanish or shrink, the paper's headline result is an artifact. This reinforces the existing CONDITIONAL verdict rather than moving it, since the reader already conditioned acceptance on resolving exactly this kind of resource-enforcement issue.","tokens_in":12087,"tokens_out":7226,"duration_ms":72631,"concrete_test":"Instrument the simulator to record, for every CPM generation and every ITS-S under the proposed selector, S_j(t) = sum_{i in C_j(t)} s_i^B and compare it with B(t). Then rerun the evaluation with a compliance step that keeps only the highest-VoI objects in C_j(t) that fit within B(t), exactly as the ETSI quantity selector does. Recompute Table II and the CBR plots for all 5/10/15 ITS-S cases. If the quality selector's transmitted-VoI advantage over the quantity selector disappears or drops substantially, the central claim is an artifact of budget overshoot.","verdict_should_be":"UNCHANGED","load_bearing_attack":"The proposed quality selector in Eq. 7 admits every object with VoI >= theta_j(t), but the paper provides no post-selection check that the resulting content set fits within the Facilities-layer bit budget B(t) from Eq. 2. The load ratio rho_j(t) used to update theta (Eqs. 4-6) is computed from L_j(t), the total size of all sensed content, not from the size of the selected set. With finite beta_theta and clipping, a single update cannot guarantee that selected bytes sum to <= B(t); if many objects exceed the threshold, the CPM can exceed the allocated budget. The ETSI quantity selector explicitly ranks content and truncates at B, so the comparison in Table II is not 'under a common allocated Facilities layer bit budget' unless the quality selector also enforces the cap. The paper's own Sec. V-C concedes 'occasional over-utilisation of the channel can occur' and attributes it to the BME, but the unresolved budget compliance of Eq. 7 is a more direct cause. If over-budget CPMs are transmitted, the network-transmitted-VoI gain may simply reflect increased channel usage, undermining the claim of maintaining constrained radio resources.","agreement_with_reader":"partial"},"referee_report":{"model":"deepseek-v4-flash","summary":"The paper proposes a Facilities-layer congestion-control content selector for the Collective Perception Service (CPS) that filters perceived objects/regions by an adaptive Value of Information (VoI) threshold. The threshold is updated per CPM generation event using the ratio of total sensed content size to the allocated Facilities-layer bit budget (Eqs. 4-6), and all content above the threshold is included in the CPM (Eq. 7). The method is evaluated against the ETSI DCC FAC quantity selector in a custom simulation with synthetic VoI distributions, under homogeneous and heterogeneous network knowledge and with 5, 10, and 15 ITS-S. The headline claim is that the proposed quality selector achieves higher “network transmitted VoI” (Eq. 11) while keeping CBR near the target, with gains of 6.5-21.3 percentage points (Table II).","tokens_in":12403,"tokens_out":4340,"duration_ms":46111,"significance":"If the claims hold, the paper makes a useful, standards-aligned contribution: it introduces a simple, distributed, content-value-aware mechanism that can be implemented at the Facilities layer without modifying the ETSI DCC FAC reference architecture. The focus on heterogeneous network knowledge and on moving beyond quantity-based selection addresses a real limitation of the current ETSI approach. The paper is clearly written and the simulation design is transparent about its synthetic nature. However, the central evaluation currently rests on two assumptions that the authors explicitly flag: the VoI function is “yet to be defined” (Sec. II-C) and is instead sampled from arbitrary distributions (Table I), and the resource-limit enforcement of Eq. (7) is not demonstrated. The main quantitative claim therefore needs additional support before the results can be considered established.","major_comments":[{"comment":"The selector C_j(t) = {i in O_j(t) : VoI_i >= theta_j(t)} includes every object above the threshold without any post-selection check that the resulting CPM fits the Facilities-layer bit budget B(t) from Eq. (2). The load ratio rho_j(t) in Eq. (4) is computed from L_j(t), the total size of all sensed content, not from the size of the selected set. A single adaptive-threshold update cannot guarantee that the sum of the sizes of the selected objects is <= B(t); in dense scenes with many high-VoI objects, the CPM can exceed the allocated budget. The ETSI quantity selector explicitly ranks content and truncates at B(t), so the comparison in Table II is not “under a common allocated Facilities layer bit budget” unless the quality selector also enforces the cap. The paper’s own admission in Sec. V-C that “occasional over-utilisation of the channel can occur” and the attribution of this to the B","section":"Sec. III-C, Eq. (7)"},{"comment":"The VoI function is explicitly “yet to be defined” (Sec. II-C), and the simulation replaces it with synthetic samples drawn from the distributions in Table I. This means the whole evaluation is carried out under a hypothetical VoI scoring pipeline. The proposed threshold dynamics may behave very differently when VoI scores are correlated with object properties, spatial relationships, or prior awareness, as in the real VoI models cited in [15] and [17]. The paper acknowledges this in the future-work section, but the central claim — that the adaptive threshold “consistently retains higher network transmitted VoI” — is not yet supported for any concrete VoI model. At minimum, the evaluation should be repeated with at least one published VoI function, or a sensitivity analysis over plausible VoI distributions should be provided.","section":"Sec. II-C / Sec. IV, Table I"},{"comment":"The metric P in Eq. (11) is exactly the objective that the proposed selector is designed to maximize: raising the VoI threshold and transmitting only high-VoI objects mechanically increases the numerator (transmitted VoI) when the total generated VoI is held fixed. Consequently, the gains in Table II are partly true by construction. The non-tautological part of the claim is whether the quality selector achieves this under equal resource consumption and whether the CBR remains near the target. Because the budget-compliance issue above is unresolved, the reported advantage may simply reflect that the quality selector transmits more bytes. The authors should report the total transmitted bytes (or the average CPM size) for both selectors and, ideally, normalize P by the transmitted bytes to demonstrate that the gain is due to better selection rather than higher channel usage.","section":"Sec. V-A, Eq. (11)"},{"comment":"The main quantitative results in Table II are reported as single point estimates with no confidence intervals, no number of simulation runs, and no statistical tests. Figs. 4 and 5 likewise show distributions but without error bars or run counts. Given that the VoI values and content-set sizes are drawn stochastically, the differences between the two selectors could be within run-to-run variability, particularly for the small 5-ITS-S cases (e.g., homogeneous gain of 6.53 percentage points). The claim that the proposed method “consistently retains” higher network transmitted VoI needs at least standard errors or box plots over repeated independent runs.","section":"Table II / Figs. 4-5"}],"minor_comments":[{"comment":"The abstract and introduction state that the method is benchmarked against “state of the art approaches”, but the evaluation (Sec. V) compares only against the ETSI DCC FAC quantity selector. The recent value-based methods by Wolff et al. [15] and Sepulcre et al. [16] are discussed but not included in the benchmark. Either implement those baselines or rephrase the claim as a comparison against the ETSI quantity selector.","section":"Abstract and Sec. I"},{"comment":"Eq. (10) is typeset with stray “&” characters and is difficult to parse. The relationship between the CPM overhead H in Eq. (2) and the size model in Eq. (10) should be made explicit. Also, the term “(68±20)” is described as a truncated Gaussian with standard deviation 10 clipped to [48,88], but “±20” suggests a different range; please clarify.","section":"Sec. III-C, Eq. (10)"},{"comment":"There are several minor language issues: “it’s Value of Information” in the abstract, “This is largely depends” in Sec. III-B, and inconsistent spelling of “homogeneous”/homogenous”. These do not affect the technical content but should be corrected.","section":"Various"},{"comment":"The simulation assumes that object VoI values are sampled independently at each CPM generation event. This ignores temporal correlation and spatial correlation across objects and ITS-S. While this is acceptable for a first controlled study, the authors should state this as a limitation more prominently, since it may bias the results toward favoring a threshold-based selector.","section":"Sec. IV"},{"comment":"The “?” symbols in the figure captions (likely intended as the value of P) are not defined in the caption text. Also, the captions report percentages and numbers in parentheses (e.g., “69.23% (7.65)”) without explaining what the parenthetical value represents. Please clarify.","section":"Fig. 2 and Fig. 3"}],"recommendation":"major_revision","confidential_remarks":"This manuscript addresses a timely problem and the proposed mechanism is simple and plausible. The main risk is that the headline result may be an artifact of the synthetic VoI assumption and the missing budget cap in Eq. (7). I believe the authors can address these concerns within the scope of the paper by enforcing the budget, adding a real VoI model or sensitivity analysis, and reporting run-to-run variability. If they do so, the paper would be a solid contribution to the CPS congestion-control literature."},"author_rebuttal":null,"desk_editor":{"model":"deepseek-v4-flash","letter":"Quick take: this is a genuine extension of ETSI's quantity-based DCC FAC selector. The adaptive VoI threshold (Eqs. 5-7) coupled to the local load ratio is new, and the paper does a fair job of explaining why the quantity selector struggles under heterogeneous perception knowledge. The Fig. 2/3 example is helpful. The paper is also honest about its limitations: it says the VoI function is yet to be defined, uses synthetic distributions, and lists real-world validation as future work. That is more than many papers in this area do.\n\nThe big issue is in the evaluation. Eq. 7 admits every object above the threshold, with no check against the per-message budget B(t). The ETSI quantity selector ranks and truncates at B(t); the quality selector does not. So the comparison in Table II is not necessarily under a common budget. If the quality selector transmits more bytes per CPM, the higher transmitted VoI is an artifact of extra channel usage, not smarter selection. The paper's Sec. V-C mentions occasional over-utilisation and blames the BME, but the more direct cause is that the selector itself doesn't enforce the cap. This needs a fix: either truncate after thresholding or feed the selected size back into the controller.\n\nThere are also standard robustness concerns: single simulator, single runs, no confidence intervals, no code or parameter values. And the metric P is the same objective the selector optimizes, so part of the gain is definitional. The independent evidence—CBR staying near target—is only shown qualitatively.\n\nNone of this kills the idea. The controller is simple, standards-adjacent, and could be made compliant with a post-selection truncation rule. But the paper as written overclaims what the simulation supports. I'd send it to peer review—it's relevant to the ETSI DCC FAC discussion and the idea is worth fixing—but I'd push for a major revision on the budget enforcement and experimental reporting.","headline":"Adaptive VoI thresholding is a real idea, but the evaluation doesn't enforce the FCL byte budget for the quality selector, so the headline gains may just be extra bytes.","tokens_in":12951,"tokens_out":3435,"would_cite":true,"duration_ms":32956,"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":"An adaptive Value-of-Information threshold at the facilities layer transmits a greater share of high-value sensed objects than the incumbent quantity-based selector, under both homogeneous and heterogeneous network conditions, while holding","keywords":["Collective Perception Service","Distributed Congestion Control","Value of Information","V2X","Sensor Data Sharing","Adaptive thresholding","Content selection","Channel Busy Ratio"],"falsifier":"Run the same comparison with a concrete, field-calibrated VoI function and temporally correlated object values. If the adaptive threshold no longer retains a higher share of network transmitted VoI at matched CBR, or if it causes channel-load oscillations, the central claim fails. A minimal check: if all objects have nearly equal VoI, the threshold cannot discriminate and the reported gains should collapse.","tokens_in":11978,"feed_emoji":"🚗","tokens_out":5892,"duration_ms":51677,"temperature":0.7,"pith_summary":"The paper is trying to show that congestion control for the collective perception service in vehicle-to-everything networks should select which sensed objects to transmit based on their value, not just fill each message up to a bit budget. It proposes an adaptive VoI threshold that rises when the local object set exceeds the allocated budget and falls when there is spare capacity, so low-value objects are dropped first as congestion worsens. The paper compares this 'quality' selector to the standard 'quantity' selector under simulated homogeneous and heterogeneous conditions, and reports that it transmits a larger share of the total generated VoI while keeping channel load close to target. If true, this is a practical improvement: it would deliver more perception-critical information to nearby vehicles under the same radio constraints.","feed_headline":"Value-aware congestion control sends more useful V2X sensor data","feed_subtitle":"Dropping low-value objects first raises the share of high-value perception data transmitted without raising channel load.","key_machinery":"The adaptive VoI threshold, updated via Equations 5–6 as a proportional controller on the ratio of total sensed content bytes to the allocated Facilities-layer byte budget, then applied in Equation 7 to filter objects before CPM assembly. This threshold does the work of converting a fixed bit budget into a variable selectivity that responds to local content load and value distribution, rather than simply filling messages with the highest-ranked objects.","core_discovery":"On its own terms, the central claim is that an adaptive Value-of-Information threshold at the facilities layer of the ITS protocol stack, operating on top of an A-DCC-like rate controller, retains a higher network-transmitted VoI (the fraction of generated object value that actually gets transmitted across all stations) than the incumbent quantity-based selector, particularly when stations differ in how many objects they see and in the spread of object values. Equations 5–7 implement this: compute the load ratio ρ = total content size / allocated byte budget; if ρ > 1 raise the threshold by a clipped proportional step, if ρ < 1 lower it; then transmit all objects with VoI ≥ θ. The simulation","pith_inferences":["If validated with a real VoI pipeline, the same thresholding idea could be extended upward to the bandwidth management entity: instead of equal per-station budgets, the budget itself could be made VoI-dependent, something the paper explicitly leaves for future work.","The adaptive threshold is a control loop that could be analyzed for stability and convergence with real VoI distributions; the simulation only samples independent scores per event, so temporal correlation of object values (e.g., a newly seen obstacle staying valuable for several hundred ms) might change how the threshold oscillates.","A testable extension: apply the same quality selector to non-CPM services or mixed service classes where the bit budget is shared, since the threshold mechanism only requires a per-object value and a byte budget.","The 'boundary vs threshold' distinction suggests a metric: if a quantity selector's effective boundary is often lower than a quality selector's threshold at the same load, the quality selector is discarding low-value objects that the quantity selector would transmit; this could be measured directly in field trials."],"forward_implications":["Under the same channel-load target, a higher fraction of the total generated object value is received by the network, so vehicles get more of the perception-critical information without increasing channel occupancy.","The benefit grows with heterogeneity: stations in sparse, medium and dense perception profiles get different effective thresholds, as seen in the three-peaked threshold distribution under heterogeneous conditions.","The quantity selector admits low-VoI objects when higher-value content is present in other stations; the quality selector avoids this, so scarce budget is directed to high-VoI content.","CBR remains near the target under both selectors, so the VoI gain is not bought by sacrificing congestion control.","The approach is compatible with the reference DCC-FAC architecture and only changes how the CPS uses the allocated budget."],"fun_headline_variants":["Value-aware congestion control boosts useful V2X data share","Drop low-value objects first, keep high-value V2X data","Adaptive value threshold prioritizes valuable V2X data","Value-driven congestion control for CPS keeps channel clear"],"cache_read_input_tokens":2304,"weakest_assumption_plain":"The paper assumes every station can compute a trustworthy Value-of-Information score for every sensed object in real time; the paper itself notes the VoI function is 'yet to be defined', so the simulation samples scores from synthetic distributions rather than a real perception pipeline.","fun_headline_variants_meta":{"raw":{"variants":["Value-aware congestion control boosts useful V2X data share","Drop low-value objects first, keep high-value V2X data","Adaptive value threshold prioritizes valuable V2X data","Value-driven congestion control for CPS keeps channel clear"]},"model":"deepseek-v4-flash","effort":"low","cost_usd":0.000765,"raw_usage":{"total_tokens":3225,"prompt_tokens":734,"completion_tokens":2491,"prompt_tokens_details":{"cached_tokens":256},"prompt_cache_hit_tokens":256,"prompt_cache_miss_tokens":478,"completion_tokens_details":{"reasoning_tokens":2424}},"tokens_in":478,"tokens_out":2491,"duration_ms":19218,"temperature":1.0,"reasoning_tokens":2424,"cache_read_input_tokens":256,"cache_creation_input_tokens":0},"cache_creation_input_tokens":0},"created_at":"2026-08-01T15:14:22.262233+00:00","model_set":{"reader":"deepseek-v4-flash"},"falsifier":"Run the same comparison with a concrete, field-calibrated VoI function and temporally correlated object values. If the adaptive threshold no longer retains a higher share of network transmitted VoI at matched CBR, or if it causes channel-load oscillations, the central claim fails. A minimal check: if all objects have nearly equal VoI, the threshold cannot discriminate and the reported gains should collapse.","supporting_citations":[],"review_version":1}