Pith. sign in

REVIEW 5 major objections 7 minor 28 references

FRTP: Federating Route Search Records to Enhance Long-term Traffic Prediction

T0 review · 5 major / 7 minor · reviewed 2026-08-11 · deepseek-v4-flash

Challenge this review Re-run · record.json Download PDF Read on arXiv ↗ Review JSON

Pith's one-line read Search logs take next-day expressway speed error to 3.35 km/h.

desk verdict A rare and valuable dataset, but the paper never actually tests whether search logs beat traffic data alone. read the letter →

arxiv 2412.17373 v1 pith:OBJEAOFA submitted 2024-12-23 cs.AI

Hangli Ge , Xiaojie Yang , Itsuki Matsunaga , Dizhi Huang , Noboru Koshizuka This is my paper · ORCID
classification cs.AI
keywords trafficpredictionlong-termforecastingroutesearchrecordsonlinelogsconvolutionalLSTMdatafederationexpressway
verification ladder T0 review T1 audit T2 compute T3 formal

The pith

A machine-rendered reading of the paper's core claim, the machinery that carries it, and where it could break.

The reading

Long-term traffic speed prediction, forecasting tomorrow or the same weekday next week, is harder than short-term prediction because the connection between past road conditions and far-future outcomes is weak. This paper claims that online route-search records, which capture drivers' plans before they enter the road network, carry predictive signal that helps close that gap, and that fusing them with traffic data improves accuracy. The authors test a convolutional-LSTM model that ingests raw search and traffic features at different time granularities, reporting that using all features together beats any subset, with a best next-day mean absolute error of 3.354 km/h on road E4. If the claim holds, traffic operators and travelers gain a practical way to anticipate congestion several days in advance.

What carries the argument

The load-bearing mechanism is a convolutional-LSTM model with a data-federation stage folded into the learning process. A convolution layer operates on the feature dimension, compressing heterogeneous inputs (traffic counters, time-specified search counts, non-time-specified search counts, and road features) into a fixed number of output features; a max-pooling layer with ratio R aligns input and output time granularities; and an LSTM captures long temporal dependencies. Before feeding the model, raw search records are converted to counts: shortest routes between interchange pairs are computed with Dijkstra's method, time-specified searches are assigned to road segments assuming an average travel speed of 80 km/h, and non-time-specified searches are resampled at 1, 3, 7, and 10-day offsets. This preprocessing-plus-network design is what lets the model handle features with different time lengths and granularities without manual downsampling.

What would settle it

On road segments whose observed average speed is well below 80 km/h, retrain the model with and without time-specified search counts and compare the ablation gap; if the gap disappears or reverses on those segments, the 80 km/h alignment assumption is the reason search features helped. A second check would replace the fixed 1/3/7/10-day lookback windows with other lags and see whether the claimed improvement persists.

Watch

Extended reading notes

Core claim

The paper's central claim is that route-search logs are useful for long-term traffic prediction, and that a federated architecture learning directly from raw heterogeneous features can exploit them. On its own terms: time-specified searches, where the user gives a departure or arrival time, show a strong correlation with future traffic volume, while non-time-specified searches, where no datetime is given, add complementary signal when resampled at 1, 3, 7, and 10 days before the target. An ablation on road E14 shows the full feature set yields the lowest MAE, at 2.415 for next-day prediction, and on the larger E4/E17 evaluation one day of input predicting the next day reaches MAE of 3.354 and 3.596 km/h respectively. The paper concludes that incorporating both types of search records significantly improves long-term traffic prediction.

Load-bearing premise

The load-bearing premise is that online search counts, once projected onto road segments using a flat 80 km/h travel speed and fixed 1/3/7/10-day lookback windows, represent future traffic demand accurately enough to improve prediction; if that projection misplaces the searches, the reported gains would not generalize.

Editorial extensions

If this is right

  • Using all four feature groups (traffic, time, time-specified search, and non-time-specified search) beats every subset in the ablation, with full-feature MAE of 2.415 versus 2.586 for next-day E14 prediction with only non-time-specified search added.
  • One day of 5-minute input with a next-day output is the best configuration tested on both large roads, reaching MAE 3.354 km/h on E4 and 3.596 km/h on E17.
  • Removing the time feature hurts the most, giving MAE 3.040 for next-day and 3.408 for next-week prediction on E14, so calendar context is essential alongside search data.
  • Search counts are higher on weekends and holidays, and the correlation analysis ties search activity to occupancy and vehicle counts, implying search logs are most informative when demand is unusual.
  • The federation design is parameter-light: only road count, input-time length, input-to-output ratio, and feature counts must be set, making it straightforward to retarget to other feature types and time scales.

Reading between the lines

Editorial extensions of the paper, not claims the author makes directly.

  • If the flat 80 km/h assignment speed were replaced by segment-specific or time-of-day speeds, the alignment of time-specified searches to road segments could shift; the paper does not test this, so the size of the current gain that depends on that approximation is unknown.
  • The same federation pattern could transfer to other pre-trip digital traces, such as transit-app trip planning or ride-hailing search queries, whenever a query encodes travel intent ahead of departure.
  • The 1/3/7/10-day lookback windows for non-time-specified searches are a fixed grid; learning these offsets with an attention mechanism or a flexible lag module is a testable extension that the paper leaves open.
  • The evaluation covers two expressway corridors in Japan, so the claim that search logs improve long-term prediction has not yet been shown for urban surface streets or other countries with different search and driving cultures.
Share X Bluesky LinkedIn Reddit HN

Signed reviews

No signed human review yet.

Editorial analysis

A structured set of objections, weighed in public.

Desk editor's note, referee report, and a circularity audit.

Referee Report

5 major / 7 minor

Summary. The paper proposes FRTP, a CNN+LSTM architecture that fuses three input groups—traffic counter data, time-specified route-search records, and non-time-specified route-search records—for long-term expressway speed prediction on NEXCO East roads. The claimed contributions are a 'federation' design that accepts heterogeneous features with different time granularities, and empirical evidence that online route-search logs improve next-day and same-weekday-next-week predictions. Experiments include an ablation on road E14, a larger fine-grained evaluation on roads E4 and E17, and a comparison of input sizes/day intervals. The best reported result is MAE 3.354 km/h for E4 next-day prediction with one day of input.

Significance. The proprietary NEXCO East route-search data is a genuinely novel asset, and the problem of predicting traffic several days ahead is practically important. If the incremental value of search records over traffic-only inputs were demonstrated rigorously, the paper would be a useful empirical contribution. The architecture's ability to consume features of different lengths and granularities is also attractive. However, the present evaluation does not yet establish the central claim: the ablation lacks a traffic-only baseline, results are single-seed point estimates, hyperparameters are selected on the test set, and no existing predictor is used for comparison. The significance therefore depends on completing the evaluation rather than on the current evidence.

major comments (5)
  1. [Section VI.B, Tables III-IV] The central claim that incorporating both types of search records significantly improves traffic prediction is not supported by the reported ablation. Every row in Tables III and IV removes exactly one feature from the full feature set, and no experiment uses only X_traffic or X_traffic plus X_time. The comparison that the paper's abstract and conclusion require—using traffic data without search records—is therefore absent. Please add the missing ablation rows (X_traffic only, X_traffic+X_time, and each search feature added separately) and report them alongside the full model.
  2. [Section VI.A and Table VII] The hyperparameter evaluation is performed directly on test MAE: the text states that 'the goal was to determine the best combination of these parameters,' and Table VII reports the selected configurations. This makes the headline value of 3.354 km/h an optimistically chosen test statistic. Use the held-out validation split (112 days, Table V) for configuration selection, and report MAE for all combinations in Table VII rather than only the best ones.
  3. [Section VI.A] No persistence, statistical, or existing deep-learning baselines are reported. The claims of 'best results' and 'significantly improve' need at least a seasonal-naive/weekly persistence baseline, an ARIMA-like model, and a traffic-only deep model (e.g., LSTM or STGNN) trained on the same data. Without such comparisons, the absolute MAEs of 2.4–3.9 km/h cannot be interpreted.
  4. [Section VI.A] All experiments use a single fixed random seed (1100) and report one MAE per configuration. The ablation differences in Table IV are 0.038–0.056 km/h, which may be within run-to-run variation for a CNN+LSTM. Report mean and standard deviation over several seeds, and include significance tests where appropriate.
  5. [Section IV.B, step 2] The assignment of time-specified search records to road segments assumes a uniform average speed of 80 km/h for all segments and times. Because the target variable is speed, misalignment under congestion or speed-limit variation could systematically distort the search-count features and inflate or attenuate their correlation with future traffic. Please justify this assumption for E4/E14/E17 or provide a sensitivity analysis with speeds from the traffic counter data.
minor comments (7)
  1. [Section II.C] The proposal is called FLTP in the last paragraph of Section II.C but the paper title and abstract use FRTP; harmonize the acronym.
  2. [Section VI.B] The text states that 'the MAE value of using merely specified time ... dropped to 2.790,' but no such value appears in Table III (which lists 2.415, 2.586, 2.979, and 3.040); correct the text or the table.
  3. [Section III.A] Equation (1) uses X_t for historical traffic features while P is defined as the traffic time series; clarify the relationship between P and X_t.
  4. [Equation (2)] The summation uses \hat y and y without indices; write \hat y_i and y_i for consistency with the definition of n.
  5. [Tables II and V] The formatting under 'Items' is inconsistent, with 'Items Values' repeated and rows split across lines; align the entries for readability.
  6. [Section V.A and Fig. 7] The text says the convolution operates on feature dimensions, but it is not clear what the input tensor dimensions are or why this captures spatial dependencies; add a formal tensor-shape description.
  7. [Section VI.C and Table VII] The meaning of 'day interval 6' is ambiguous; specify whether it is measured from the end of the input window or from its start, because the phrase 'same weekday of the next week' depends on that convention.

Circularity Check

0 steps flagged · score 0.0 of 10

No significant circularity: the search-record features are external covariates evaluated against held-out ground truth, not constructions of the target or fitted parameters.

full rationale

This is an empirical machine-learning paper, not a derivation. The load-bearing claim is that adding time-specified and non-time-specified route search counts to traffic data improves long-term speed prediction. These search counts are external covariates; they are not functions of the speed labels, the trained model, or the predicted output. The model is a standard CNN+LSTM trained with a fixed seed and evaluated with held-out MAE. No fitted parameter is renamed as a prediction, and no uniqueness theorem or ansatz is imported from the authors' prior work to force the conclusion. The ablation study compares the full feature set against sets with one feature removed; the absence of a traffic-only baseline weakens the attribution of the improvement to search data, but that is an experimental-design/validity concern, not circularity. Similarly, tuning input length and interval by comparing test-set MAE and assuming an 80 km/h travel speed are statistical or modeling assumptions, not circular steps. The self-citations [26] and [27] appear only in the related-work discussion and are not load-bearing for the paper's central empirical result. Therefore, no load-bearing step reduces by the paper's own equations or by self-citation to its own inputs.

Assumptions & free parameters 4 free parameters · 5 assumptions · 0 invented entities

The paper introduces no new physical or mathematical entities. Its central claim rests on hand-chosen preprocessing constants (80 km/h, resampling windows), a fixed convolution output count, and standard deep learning assumptions. None of these are validated against independent data, and all are load-bearing for the claimed correlation between search activity and future traffic.

free parameters (4)
  • Convolution output feature count = 1
    Section V.A fixes the number of output features after convolution to 1, described as achieving strong performance while maintaining simplicity. This is a hand-chosen hyperparameter.
  • Assumed average expressway speed = 80 km/h
    Section IV.B.2 assigns expected passage times using a constant 80 km/h. This choice is not fitted to data and may bias the temporal alignment of search counts.
  • Non-time-specified search resampling windows = 1, 3, 7, 10 days
    Section IV.B and Fig. 2 test four manually selected lookback windows for non-time-specified searches; the choice is not derived from data.
  • Input length and day interval = 24*12 or 168*12; 0 or 6 days
    Table VI lists these as evaluation parameters. They are selected via comparison on test results, without an explicit statement that the choices were frozen on validation data.
assumptions (5)
  • standard math Dijkstra's shortest route extraction correctly identifies the road segments a searcher would traverse.
    Used in Section IV.B.1 to convert departure/arrival IC pairs into segment lists. It ignores route choice behavior and real-time diversions.
  • domain assumption A constant average speed of 80 km/h maps search times to passage times on all segments.
    Invoked in Section IV.B.2; does not account for congestion, time of day, or segment-specific speed limits.
  • domain assumption The number of searches, after adding 1 per 5-minute bin to each segment along the route, is a valid indicator of future traffic demand.
    Section IV.B.4 adds 1 for each search to all IC pairs along the route; equal weight for every search and no decay or saturation is assumed.
  • ad hoc to paper The chosen lookback windows of 1, 3, 7, and 10 days for non-time-specified searches capture the relevant lead time of travel planning.
    Section IV.B and Fig. 2 introduce these windows without evidence; the correlation analysis in Fig. 5 does not establish causality.
  • ad hoc to paper The CNN+LSTM architecture with a fixed compressed feature count can fuse heterogeneous feature types without loss.
    Section V.A asserts the convolution compresses all feature types to one output feature and that this is effective; no theoretical or empirical comparison justifies this design.

how reviews work

0 comments
Cite this review

Pith. "Pith review of FRTP: Federating Route Search Records to Enhance Long-term Traffic Prediction." pith.science (2026). https://pith.science/paper/OBJEAOFA

@misc{pith2026241217373,
  author       = {Pith},
  title        = {Pith review of: FRTP: Federating Route Search Records to Enhance Long-term Traffic Prediction},
  year         = {2026},
  howpublished = {\url{https://pith.science/paper/OBJEAOFA}},
  note         = {Machine review of arXiv:2412.17373}
}
read the original abstract

Accurate traffic prediction, especially predicting traffic conditions several days in advance is essential for intelligent transportation systems (ITS). Such predictions enable mid- and long-term traffic optimization, which is crucial for efficient transportation planning. However, the inclusion of diverse external features, alongside the complexities of spatial relationships and temporal uncertainties, significantly increases the complexity of forecasting models. Additionally, traditional approaches have handled data preprocessing separately from the learning model, leading to inefficiencies caused by repeated trials of preprocessing and training. In this study, we propose a federated architecture capable of learning directly from raw data with varying features and time granularities or lengths. The model adopts a unified design that accommodates different feature types, time scales, and temporal periods. Our experiments focus on federating route search records and begin by processing raw data within the model framework. Unlike traditional models, this approach integrates the data federation phase into the learning process, enabling compatibility with various time frequencies and input/output configurations. The accuracy of the proposed model is demonstrated through evaluations using diverse learning patterns and parameter settings. The results show that online search log data is useful for forecasting long-term traffic, highlighting the model's adaptability and efficiency.

Figures

Figures reproduced from arXiv: 2412.17373 by the authors.

Figure 1
Figure 1. Data federation architecture of our proposal [PITH_FULL_IMAGE:figures/full_fig_p001_1.png] view at source ↗
Figure 2
Figure 2. Various resample patterns on the non-time-specified search records [PITH_FULL_IMAGE:figures/full_fig_p003_2.png] view at source ↗
Figure 3
Figure 3. Traffic volume and online search log data at 1-hour intervals. Online [PITH_FULL_IMAGE:figures/full_fig_p003_3.png] view at source ↗
Figures from the paper (4 more)
Figure 4
Figure 4. Figure 4: The comparison of the distributions of two types of search counts [PITH_FULL_IMAGE:figures/full_fig_p004_4.png]
Figure 5
Figure 5. Figure 5: The correlation of various features conducted on holidays and weekends compared to weekdays. This is likely because weekday travel is often work-related, whereas on holidays, people are more likely to travel for leisure to unfamiliar destinations, prompting them to sea…
Figure 6
Figure 6. Figure 6: Traffic Volume (upper left), time-specified search count (lower left), speed (upper right) and non-time-specified search count (lower right) for the [PITH_FULL_IMAGE:figures/full_fig_p005_6.png]
Figure 7
Figure 7. Figure 7: The proposed model TABLE I DESCRIPTION OF PARAMETERS Parameter Description K The number of road segments L The time length of the training data R The ratio of input data length and output data length Fs un The number of features of non-time specified search records Fs …

Discussion (0). Continue with ORCID to comment.

Reference graph

Works this paper leans on

28 extracted references · 24 canonical work pages

  1. [1]

    Predicting short-term traffic flow by long short- term memory recurrent neural network,

    Y . Tian and L. Pan, “Predicting short-term traffic flow by long short- term memory recurrent neural network,” in 2015 IEEE international conference on smart city/SocialCom/SustainCom (SmartCity) . IEEE, 2015, pp. 153–158

    work page 2015

  2. [2]

    Long short-term memory neural network for traffic speed prediction using remote microwave sensor data,

    X. Ma, Z. Tao, Y . Wang, H. Yu, and Y . Wang, “Long short-term memory neural network for traffic speed prediction using remote microwave sensor data,” Transportation Research Part C: Emerging Technologies , vol. 54, pp. 187–197, 2015

    2015

  3. [3]

    Mf-cnn: Traffic flow prediction using convolutional neural network and multi- features fusion,

    D. Yang, S. Li, Z. Peng, P. Wang, J. Wang, and H. Yang, “Mf-cnn: Traffic flow prediction using convolutional neural network and multi- features fusion,” IEICE TRANSACTIONS on Information and Systems , vol. 102, no. 8, pp. 1526–1536, 2019

    work page 2019

  4. [4]

    Learning traffic as images: A deep convolutional neural network for large-scale transportation network speed prediction,

    X. Ma, Z. Dai, Z. He, J. Ma, Y . Wang, and Y . Wang, “Learning traffic as images: A deep convolutional neural network for large-scale transportation network speed prediction,” Sensors, vol. 17, no. 4, p. 818, 2017

    work page 2017

  5. [5]

    How to build a graph-based deep learning architecture in traffic domain: A survey,

    J. Ye, J. Zhao, K. Ye, and C. Xu, “How to build a graph-based deep learning architecture in traffic domain: A survey,” IEEE Transactions on Intelligent Transportation Systems, 2020

    work page 2020

  6. [6]

    Deep learning on traffic prediction: Methods, analysis, and future directions,

    X. Yin, G. Wu, J. Wei, Y . Shen, H. Qi, and B. Yin, “Deep learning on traffic prediction: Methods, analysis, and future directions,” IEEE Transactions on Intelligent Transportation Systems , vol. 23, no. 6, pp. 4927–4943, 2021

    work page 2021

  7. [7]

    Predicting citywide crowd flows using deep spatio-temporal residual networks,

    J. Zhang, Y . Zheng, D. Qi, R. Li, X. Yi, and T. Li, “Predicting citywide crowd flows using deep spatio-temporal residual networks,” Artificial Intelligence, vol. 259, pp. 147–166, 2018

    2018

  8. [8]

    Intelligent highway traffic forecast based on deep learning and restructured road models,

    S. Ryu and D. Kim, “Intelligent highway traffic forecast based on deep learning and restructured road models,” in 2019 IEEE 43rd Annual Computer Software and Applications Conference (COMPSAC) , vol. 2. IEEE, 2019, pp. 110–114

    work page 2019

Show all 28 references
  1. [9]

    Deep spatio-temporal residual networks for citywide crowd flows prediction,

    J. Zhang, Y . Zheng, and D. Qi, “Deep spatio-temporal residual networks for citywide crowd flows prediction,” in Proceedings of the AAAI conference on artificial intelligence , vol. 31, no. 1, 2017

    2017

  2. [10]

    Nexco east,

    “Nexco east,” https://www.e-nexco.co.jp/en/, accessed Oct-2024

    2024

  3. [11]

    Dynamic prediction of traffic vol- ume through kalman filtering theory,

    I. Okutani and Y . J. Stephanedes, “Dynamic prediction of traffic vol- ume through kalman filtering theory,” Transportation Research Part B: Methodological, vol. 18, no. 1, pp. 1–11, 1984

    1984

  4. [12]

    Modeling and forecasting vehicular traffic flow as a seasonal arima process: Theoretical basis and empirical results,

    B. M. Williams and L. A. Hoel, “Modeling and forecasting vehicular traffic flow as a seasonal arima process: Theoretical basis and empirical results,” Journal of transportation engineering, vol. 129, no. 6, pp. 664– 672, 2003

    2003

  5. [13]

    Predictions of freeway traffic speeds and volumes using vector autoregressive models,

    S. R. Chandra and H. Al-Deek, “Predictions of freeway traffic speeds and volumes using vector autoregressive models,” Journal of Intelligent Transportation Systems, vol. 13, no. 2, pp. 53–72, 2009

    2009

  6. [14]

    Traffic flow prediction using adaboost algorithm with random forests as a weak learner,

    G. Leshem and Y . Ritov, “Traffic flow prediction using adaboost algorithm with random forests as a weak learner,” International Journal of Mathematical and Computational Sciences , vol. 1, no. 1, pp. 1–6, 2007

    2007

  7. [15]

    A vector- geometry based spatial knn-algorithm for traffic frequency predictions,

    M. May, D. Hecker, C. K ¨orner, S. Scheider, and D. Schulz, “A vector- geometry based spatial knn-algorithm for traffic frequency predictions,” in 2008 IEEE International Conference on Data Mining Workshops . IEEE, 2008, pp. 442–447

    2008

  8. [16]

    A vehicle classification system based on hierarchical multi-svms in crowded traffic scenes,

    H. Fu, H. Ma, Y . Liu, and D. Lu, “A vehicle classification system based on hierarchical multi-svms in crowded traffic scenes,” Neurocomputing, vol. 211, pp. 182–190, 2016

    2016

  9. [17]

    Lstm network: a deep learning approach for short-term traffic forecast,

    Z. Zhao, W. Chen, X. Wu, P. C. Chen, and J. Liu, “Lstm network: a deep learning approach for short-term traffic forecast,” IET Intelligent Transport Systems, vol. 11, no. 2, pp. 68–75, 2017

    2017

  10. [18]

    Short-term traffic flow forecasting with spatial- temporal correlation in a hybrid deep learning framework,

    Y . Wu and H. Tan, “Short-term traffic flow forecasting with spatial- temporal correlation in a hybrid deep learning framework,” arXiv preprint arXiv:1612.01022, 2016

    2016 arXiv

  11. [19]

    Diffusion convolutional re- current neural network: Data-driven traffic forecasting,

    Y . Li, R. Yu, C. Shahabi, and Y . Liu, “Diffusion convolutional re- current neural network: Data-driven traffic forecasting,” arXiv preprint arXiv:1707.01926, 2017

    2017 arXiv

  12. [20]

    Deeptransport: Learning spatial-temporal dependency for traffic condition forecasting,

    X. Cheng, R. Zhang, J. Zhou, and W. Xu, “Deeptransport: Learning spatial-temporal dependency for traffic condition forecasting,” in 2018 International Joint Conference on Neural Networks (IJCNN) . IEEE, 2018, pp. 1–8

    2018

  13. [21]

    K-neighboring on multi- weighted graphs for passenger count prediction on railway networks,

    H. Ge, T. Michikata, and N. Koshizuka, “K-neighboring on multi- weighted graphs for passenger count prediction on railway networks,” Journal of Information Processing , vol. 32, pp. 575–585, 2024

    2024

  14. [22]

    Multi- weighted graphs learning for passenger count prediction on railway network,

    G. Hangli, L. Lin, R. Jiang, T. Michikata, and N. Koshizuka, “Multi- weighted graphs learning for passenger count prediction on railway network,” in 2022 IEEE 46th Annual Computers, Software, and Ap- plications Conference (COMPSAC) . IEEE, 2022, pp. 374–382

    2022

  15. [23]

    Performance measurement system (pems),

    PeMS, “Performance measurement system (pems),” https://dot.ca.gov/ programs/traffic-operations/mpr/pems-source, accessed Oct-2024

    2024

  16. [24]

    Q-traffic,

    Q-traffic, “Q-traffic,” https://github.com/JingqingZ/BaiduTraffic, ac- cessed Oct-2024

    2024

  17. [25]

    Loop dataset,

    “Loop dataset,” https://github.com/zhiyongc/Seattle-Loop-Data, 2023, accessed Oct-2024

    2023

  18. [26]

    Traffic congestion prediction using toll and route search log data,

    Y . Kosugi, I. Matsunaga, H. Ge, T. Michikata, and N. Koshizuka, “Traffic congestion prediction using toll and route search log data,” in 2022 IEEE International Conference on Big Data (Big Data) . IEEE, 2022, pp. 5971–5978

    2022

  19. [27]

    Improving long-term traffic prediction with online search log data,

    I. Matsunaga, Y . Kosugi, G. Hangli, T. Michikata, and N. Koshizuka, “Improving long-term traffic prediction with online search log data,” in 2023 IEEE 47th Annual Computers, Software, and Applications Conference (COMPSAC). IEEE, 2023, pp. 1750–1755

    2023

  20. [28]

    Dorapura service,

    NEXCO-East-Japan, “Dorapura service,” https://en.driveplaza.com/, 2023, accessed Oct-2024

    2023

Pith tools

Reviewed August 11, 2026 · model on record in the stance chip above.