{"id":"f5ec3662-84a7-469b-95a1-d50ba5443442","arxiv_id":"2506.23118","paper_version":1,"verdict":"CONDITIONAL","confidence":"MODERATE","novelty_score":5.0,"correctness_risk":"medium","formal_verification":"none","parameter_count":5,"one_line_summary":"A belief-propagation handover rule lets distributed base stations exchange only selected target beliefs and measurements, matching centralized tracking accuracy in simulation.","lead":"Base stations that both communicate and sense can hand over tracking information between themselves using a belief-propagation message passing scheme. This lets a network track moving targets about as accurately as a centralized system while sending much less data.","discovery_kind":"new_application","skeptic_critique":{"model":"deepseek-v4-flash","headline":"No track-to-track association at BS-Rx can create duplicate PTs in overlapping FoVs, undermining the centralized-comparable accuracy claim.","rationale":"The central claim has two parts: accuracy comparable to centralized processing, and significant reduction of data exchange/processing overhead. The overhead reduction is structurally supported by the protocol itself (only selected priors and measurements are exchanged, rather than all measurements being sent to a central unit), so the accuracy comparison is the load-bearing part. The accuracy comparison rests on the receiving BS being able to incorporate handed-over information without corrupting its local track set. Because Section IV.B.1 adds received priors as independent legacy PTs, and the factor graph has no mechanism to prevent two PTs from representing the same physical target, overlapping FoVs are exactly the regime where the protocol can create duplicates. The simulation's FoVs overlap by design (BSs 150 m apart, radii 120 m), so this regime is in scope. The paper's GOSPA curves do not report track cardinality or error bars, so they cannot rule out a duplicate-track penalty that is masked by the missed-detection component. This is a concrete, testable gap rather than a disagreement with consensus. The appropriate disposition is unchanged from the reader's CONDITIONAL verdict: the algorithm may be correct in the tested handover timing, but the paper should either add an association/merge step, or demonstrate (e.g., via a scenario with established overlapping tracks) that duplicates do not harm performance.","tokens_in":15289,"tokens_out":6537,"duration_ms":72082,"concrete_test":"Run the released code with a scenario where a target is well inside the overlapping FoV of BS1 and BS2 for several time steps before the handover criterion triggers (e.g., lower the handover threshold Γ or let the target loiter in the overlap). At BS-Rx, record the number of PTs with posterior existence > Pth per true target and the GOSPA decomposition. Then compare against an oracle version that suppresses any handover prior whose predicted state is within a Mahalanobis distance (e.g., 3σ of the local track covariance) of an existing local PT. If the oracle lowers the GOSPA false-alarm or localization error, or reduces the track count, the duplicate-track concern is confirmed and the paper needs a track-to-track association or merging step; if GOSPA is unchanged, the concern is benign in practice.","verdict_should_be":"UNCHANGED","load_bearing_attack":"Section IV.B.1 states that received handover priors are appended to local priors, effectively increasing the number of legacy PTs in the factor graph. There is no track-to-track association or merging step at BS-Rx: a received prior representing a target already tracked locally becomes a second PT for the same target. In the BP factorization (4), the compatibility function Ψ(a_k,b_k) only enforces that each measurement is associated with at most one PT within a time step; it does not enforce that two PTs cannot represent the same physical target. In overlapping FoVs, both BSs can have established tracks for the same target. When BS-Tx's handover criterion (5) is met (with Γ=0.5 and p_d=0.9 inside the FoV, the integral exceeds Γ whenever the predicted state lies inside BS-Rx's FoV), BS-Rx receives a prior for a target it already tracks. The two PTs can then be associated with different measurements (one local, one handed over), both can pass the existence threshold Pth=0.5, and both are declared as targets. This double-counts information and produces duplicate tracks, which GOSPA penalizes as false tracks. The label lists T and R prevent repeated handovers from the same BS-Tx, but they do not prevent duplication against existing local tracks. The paper reports only BS1 GOSPA with no error bars and no track-cardinality analysis (Section V.C), so the claim that handover matches centralized accuracy in overlapping-FoV scenarios is not established in exactly the regime where the duplicate problem is active.","agreement_with_reader":"agree"},"referee_report":{"model":"deepseek-v4-flash","summary":"The paper proposes a belief-propagation-based target handover mechanism for distributed integrated sensing and communication (DISAC) networks. A transmitting base station (BS-Tx) evaluates a handover criterion based on the predicted target state and the receiving BS's field of view, then sends the target prior and, optionally, the associated measurement to the receiving BS (BS-Rx). BS-Rx appends the received priors to its local set of legacy potential targets and runs sequential BP with its local measurements followed by the handed-over measurements. The authors compare four architectures (centralized, distributed, handover with measurements, and handover without measurements) in a two-BS, two-target urban scenario, reporting GOSPA curves for BS1. The main claim is that the handover-with-measurements variant tracks centralized accuracy while reducing communication and processing overhead.","tokens_in":15635,"tokens_out":7191,"duration_ms":79672,"significance":"If the central claim holds, the paper offers a practical, low-complexity alternative to centralized multisensor multi-target tracking in 6G DISAC systems. The authors explicitly release open-source simulation code, which is a clear strength for reproducibility. The factor-graph formulation builds on a well-established BP-MTT framework, and the handover criterion is a simple, concrete rule that could be useful for further study. However, the headline claim of centralized-comparable accuracy is currently supported by a single simulated scenario, with only BS1 results shown and no uncertainty quantification. The absence of track-to-track association at BS-Rx creates a risk of duplicate tracks in overlapping fields of view, which is exactly the regime the paper targets. The claimed communication-overhead reduction is also not quantified in the paper.","major_comments":[{"comment":"Section IV.B.1 states that received handover priors are appended to the local priors, effectively increasing the number of legacy potential targets. There is no track-to-track association or merging step at BS-Rx. In overlapping fields of view, BS-Rx may already have a legacy PT for the same physical target, and the received prior becomes a second PT. The compatibility function Ψ(a_k,b_k) in Eq. (4) only ensures that each measurement is associated with at most one PT; it does not prevent two PTs from representing the same target. Both PTs can therefore be associated with different measurements (one local, one handed over), both can exceed the existence threshold P_th=0.5, and both are declared as targets. GOSPA penalizes the extra declaration as a false track. In the simulated scenario, BS separation is 150 m, FoV radius is 120 m, and the tracker uses p_d=0.9 inside the FoV with Γ=0.5, so the handover criterion in Eq. (5) will typically trigger whenever the predicted state is well inside BS-Rx's FoV, including when BS-Rx already has a track. This directly threatens the Section V.C claim that handover with measurements matches centralized performance. Please add an explicit merge or association step before appending received priors, gate the handover on the target not already being tracked locally, or provide track-cardinality evidence showing that no duplicate tracks occur in the overlapping-FoV regime.","section":"Section IV.B.1 and Eq. (4)"},{"comment":"The quantitative evidence for the central claim consists of one scenario with two BSs and two targets, and the paper plots only BS1 results. No error bars, confidence intervals, or per-run variability are reported for the 100 Monte Carlo trials, so the difference between handover with measurements and centralized processing could be within Monte Carlo noise. Since the abstract claims 'performance comparable to centralized processing,' the authors should report both BS1 and BS2 results (or a principled aggregation), and should quantify uncertainty on the main GOSPA curves. Additional variation of target density or FoV overlap would also substantiate the word 'extensive simulations' used in the abstract.","section":"Section V.C"},{"comment":"The abstract and the introduction claim that the proposed procedure 'significantly reduces data exchange and processing overhead,' but the numerical section contains no communication-cost or runtime metric. The only support is the qualitative design argument that a prior and one associated measurement are exchanged rather than all raw measurements. Please quantify the overhead, for example by reporting bits exchanged per time step, number of messages, or wall-clock time, for centralized, distributed, and handover architectures. Without such a metric, the overhead-reduction claim is not established.","section":"Abstract and Section V"}],"minor_comments":[{"comment":"The pseudo-likelihood for a new PT v(x^m_k, r^m_k, b^m_k; z^m_k) uses the index j on r in its case conditions (r^j_k = 1 and r^j_k = 0); this should be r^m_k for consistency with the variable names.","section":"Eq. (3)"},{"comment":"There is a typo in the sentence extending MTT to n_s > 1: 'BPs' should be 'BSs.'","section":"Section III.C"},{"comment":"The measurement-noise parameters are listed as 'σ_r = 1 m and σ_θ = 1°' and later repeated as 'σ_r, σ_θ, σ_r, μ_c'; the duplicated σ_r is confusing and should be corrected.","section":"Section V.A"},{"comment":"The generative model uses p_d(x) = 1 inside the FoV, whereas the tracker sets p_d(x) = 0.9 inside the FoV. This model mismatch is not discussed; a sentence explaining this choice (e.g., as a robustness consideration) would help the reader interpret the results.","section":"Section V.B"},{"comment":"The GOSPA implementation parameters are only provided in the code. Since GOSPA parameters (e.g., cut-off c and order p) affect the decomposition into localization, missed-detection, and false-alarm errors, the main text should state the values used.","section":"Section V.C"},{"comment":"Equation (5) is called a 'principled' criterion, but it is a heuristic threshold on the predicted detection probability integrated over BS-Rx's FoV. The paper does not derive it from a tracking-error or communication-cost objective. This is acceptable as a design choice, but the language should be softened or a brief justification should be added.","section":"Section IV.A.2"}],"recommendation":"major_revision","confidential_remarks":null},"author_rebuttal":null,"desk_editor":{"model":"deepseek-v4-flash","letter":"Read it. The paper is a decent incremental contribution: it takes Meyer et al.'s BP-MTT and adds a belief-based handover criterion (existence above threshold and expected detection probability at the receiving BS) plus a label-list to avoid repeatedly sending the same prior. That is genuinely new, and the released code is a real plus.\n\nWhat surprised me is that the headline claim—centralized-comparable accuracy at lower communication cost—is only half supported. The GOSPA plots for BS1 do show handover-with-measurements closely tracking the centralized curve, and the missed-detection reduction is clear. But communication cost is never measured; it is asserted. And only BS1 results are shown, with no error bars, even though they ran 100 MC trials.\n\nThe bigger soft spot is the receiving-BS logic. Section IV.B.1 simply appends received priors to local priors. There is no track-to-track association or merge. If the receiving BS already tracks the same target (which is exactly what happens in overlapping FoVs), the received prior becomes a second potential target for the same physical object. The BP compatibility function only ensures each measurement goes to at most one PT; it doesn't stop two PTs from representing one target. Both can survive and be declared for a few steps. The elevated false-alarm error at the FoV boundary in Fig. 7 is consistent with this, even though the paper attributes it to the threshold. It's not fatal—the tested scenario still looks good—but the claim that handover matches centralized accuracy in overlapping-FoV regimes is precisely the regime where the duplicate problem is active, so the paper should at least discuss it or add a simple merge/association step at BS-Rx.\n\nBottom line: for a reader working on distributed ISAC tracking or BP-MTT handover, this is a useful and honest piece of work that deserves serious reviewing. The issues are addressable: measure the communication overhead, show BS2 and error bars, and address duplicate handling or explain why it doesn't hurt in practice. I'd send it to review, with a request for revision rather than a desk reject.","headline":"A clean, incremental BP-based handover scheme with released code; the accuracy claim is supported only for the tested scenario, and the unaddressed duplicate-track risk at the receiving BS plus unmeasured communication costs leave the headline under-supported.","tokens_in":16150,"tokens_out":3261,"would_cite":true,"duration_ms":37157,"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":"Distributed base stations can hand target tracks between overlapping fields of view using belief propagation, matching centralized tracking accuracy in simulation at lower communication cost.","keywords":["6G","DISAC","target handover","belief propagation","multi-target tracking","factor graph","distributed sensing","GOSPA"],"falsifier":"In a two-base-station simulation with a long overlap region, let the receiving station track a target for several time steps before the handover prior arrives, then compare the GOSPA false-alarm and localization components against the centralized baseline; if duplicate tracks appear, for example two potential targets with posterior existence above the detection threshold near the same location, or the GOSPA divergence exceeds centralized, the no-duplicate assumption fails.","tokens_in":15095,"feed_emoji":"📡","tokens_out":6555,"duration_ms":64929,"temperature":0.7,"pith_summary":"This paper addresses a practical bottleneck in distributed integrated sensing and communication (DISAC) networks: when a target moves out of one base station's field of view into another's, the track must be transferred without breaking continuity or flooding the network with raw data. The authors propose a handover procedure built on belief propagation (BP), the same message-passing machinery used for multi-target tracking, and define a handover criterion based on each target's predicted existence and the receiving station's detection probability. In simulations with two overlapping base stations and two closely spaced targets, the procedure with measurement exchange matches the tracking accuracy of a centralized processor that fuses all measurements, as measured by the generalized optimal subpattern assignment (GOSPA) metric, while sending only selected priors and associated measurements between stations. The paper argues this makes seamless tracking feasible in dense urban DISAC settings at a fraction of the communication and processing cost of centralized fusion.","feed_headline":"Distributed 6G sensing hands off targets at centralized accuracy","feed_subtitle":"Belief-propagation handover matches centralized tracking while exchanging far less data between base stations.","key_machinery":"The machinery is a factor-graph representation of the multi-target posterior, a graphical model of how the joint probability factors into local terms, in which each potential target is an augmented state (kinematic state plus an existence variable) and data association is encoded by compatible track-oriented and measurement-oriented association variables. Belief propagation computes approximate marginal beliefs for existence and kinematic state with complexity that scales linearly in the number of targets and measurements. The handover-specific piece is the criterion in Eq. (5): for each potential target, the transmitting station checks whether the prior existence probability exceeds $P_{\\mathrm{th}}$ and whether the integral of the receiving station's detection probability over the predicted kinematic state exceeds a threshold $\\Gamma$. If both hold, the prior is handed over once, tracked by label lists, and the associated measurement is additionally handed over when one is likely; the receiving station appends these priors to its factor graph and runs BP sequentially over its own then handed-over measurements.","core_discovery":"The central claim is that target handover in a distributed multi-base-station tracking system can be folded directly into a belief-propagation factor graph without a fusion center. Each base station runs BP multi-target tracking locally; when a potential target's prior existence probability exceeds a threshold and its predicted state is likely detectable by a neighbouring base station, the first base station sends that target's prior, and optionally the associated measurement, to the neighbour. The receiving station appends the received prior to its own set of legacy potential targets and processes handed-over measurements sequentially after its local measurements. A per-target label list prevents repeated transmission of the same prior, so information is shared once. In the paper's two-station urban simulation, this handover-with-measurements scheme yields GOSPA curves for BS1 comparable to centralized processing, with missed-detection and false-alarm components close to centralized, while requiring far less data exchange; handover without measurement exchange performs only slightly better than fully distributed processing.","pith_inferences":["Editorial inference: the same pairwise handover rule could be applied to more than two base stations by treating each ordered pair independently, but the paper only demonstrates a two-station case; multi-station behavior with a target crossing several fields of view in sequence remains untested.","Editorial inference: because received priors are appended without a track-to-track association or merging step, performance in scenarios where the receiving base station already tracks the same target, such as a long overlap region, may degrade through double-counting; a labelled merge or track-confirmation step would be a natural extension.","Editorial inference: the handover threshold $\\Gamma$ effectively controls the false-alarm versus missed-detection trade-off at field-of-view boundaries, so adapting $\\Gamma$ to local clutter density or target speed could reduce boundary false alarms."],"forward_implications":["A DISAC network can maintain track continuity across field-of-view boundaries without a central fusion unit, because handed-over priors let the receiving base station keep the target's track alive from the first time step it enters the field of view.","Communication load scales with the number of handed-over targets and their associated measurements, not with raw measurement streams, so the protocol is a candidate for bandwidth-constrained dense urban deployments.","Exchanging measurements during handover is what buys the accuracy gain: in the simulations, handover without measurements converges to fully distributed performance, while handover with measurements tracks centralized GOSPA.","Because the handover machinery is built on the same factor graph as existing BP-based multi-target tracking, it can be added to an installed BP tracker without changing the local tracking core."],"supporting_citations":[{"why":"Supplies the BP-based multi-target tracking factor graph, pseudo-likelihoods, and message equations that the handover procedure extends.","marker":"[17]"},{"why":"Presents the RFS-based target handover method for DISAC whose scalability problems motivate the BP-based alternative.","marker":"[15]"},{"why":"Defines the GOSPA metric used to compare handover, distributed, and centralized tracking in the simulations.","marker":"[22]"},{"why":"Provides the constant-velocity and stochastic acceleration motion model and process-noise parameterization used to generate target trajectories.","marker":"[18]"},{"why":"Supplies the centralized multi-sensor tracking reference that the handover method is compared against.","marker":"[8]"},{"why":"Introduces factor graphs and the sum-product algorithm underpinning the belief-propagation inference used in the proposed method.","marker":"[21]"}],"fun_headline_variants":["BP handover matches centralized 6G tracking with less data","6G target handover via belief propagation cuts inter-BS exchange","Distributed 6G sensing mains accuracy without fusion center","Belief propagation enables lean handover for multi-BS 6G tracking","Handover scheme reduces data exchange in distributed 6G sensing"],"cache_read_input_tokens":3200,"weakest_assumption_plain":"The load-bearing premise is that the receiving base station does not already have its own track of the handed-over target, because received priors are inserted as additional potential targets with no track-to-track association or merging step, so overlapping fields of view could lead to duplicate tracks and double-counted information.","fun_headline_variants_meta":{"raw":{"variants":["BP handover matches centralized 6G tracking with less data","6G target handover via belief propagation cuts inter-BS exchange","Distributed 6G sensing mains accuracy without fusion center","Belief propagation enables lean handover for multi-BS 6G tracking","Handover scheme reduces data exchange in distributed 6G sensing"]},"model":"deepseek-v4-flash","effort":"low","cost_usd":0.000194,"raw_usage":{"total_tokens":1329,"prompt_tokens":899,"completion_tokens":430,"prompt_tokens_details":{"cached_tokens":384},"prompt_cache_hit_tokens":384,"prompt_cache_miss_tokens":515,"completion_tokens_details":{"reasoning_tokens":341}},"tokens_in":515,"tokens_out":430,"duration_ms":5310,"temperature":1.0,"reasoning_tokens":341,"cache_read_input_tokens":384,"cache_creation_input_tokens":0},"cache_creation_input_tokens":0},"created_at":"2026-08-06T21:48:49.142227+00:00","model_set":{"reader":"deepseek-v4-flash"},"falsifier":"In a two-base-station simulation with a long overlap region, let the receiving station track a target for several time steps before the handover prior arrives, then compare the GOSPA false-alarm and localization components against the centralized baseline; if duplicate tracks appear, for example two potential targets with posterior existence above the detection threshold near the same location, or the GOSPA divergence exceeds centralized, the no-duplicate assumption fails.","supporting_citations":[{"cited_title":"Message passing algorithms for scalable multitarget tracking,","cited_arxiv_id":null,"evidence_quote":"Supplies the BP-based multi-target tracking factor graph, pseudo-likelihoods, and message equations that the handover procedure extends."},{"cited_title":"Target Handover in Distributed Integrated Sensing and Communication","cited_arxiv_id":"2411.01871","evidence_quote":"Presents the RFS-based target handover method for DISAC whose scalability problems motivate the BP-based alternative."},{"cited_title":"Generalized optimal sub-pattern assignment metric,","cited_arxiv_id":null,"evidence_quote":"Defines the GOSPA metric used to compare handover, distributed, and centralized tracking in the simulations."},{"cited_title":"Bar-Shalom,et al.,Estimation with applications to tracking and navigation: theory algorithms and software","cited_arxiv_id":null,"evidence_quote":"Provides the constant-velocity and stochastic acceleration motion model and process-noise parameterization used to generate target trajectories."},{"cited_title":"Bar-Shalomet al.,Multitarget-multisensor tracking: principles and techniques","cited_arxiv_id":null,"evidence_quote":"Supplies the centralized multi-sensor tracking reference that the handover method is compared against."},{"cited_title":"Factor graphs and the sum-product algorithm,","cited_arxiv_id":null,"evidence_quote":"Introduces factor graphs and the sum-product algorithm underpinning the belief-propagation inference used in the proposed method."}],"review_version":1}