Pith. sign in

REVIEW 3 major objections 5 minor 1 cited by

Centrality Change Proneness: an Early Indicator of Microservice Architectural Degradation

T0 review · 3 major / 5 minor · reviewed 2026-08-07 · deepseek-v4-flash

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

Pith's one-line read This paper claims that a microservice's centrality-change rank, computed from early releases, acts as an early indicator of architectural degradation.

desk verdict Solid exploratory correlation study whose central claim about an early degradation indicator is not supported by the evidence; the paper is worth a revision but not acceptance as-is. read the letter →

arxiv 2506.07690 v2 pith:ULYWDTPN submitted 2025-06-09 cs.SE cs.DMcs.NAmath.NA

Alexander Bakhtin , Matteo Esposito , Valentina Lenarduzzi , Davide Taibi This is my paper
classification cs.SEcs.DMcs.NAmath.NA
keywords microservicearchitecturearchitecturaldegradationtemporalnetworkscentralitymetricsChangePronenesssoftwaresmellstrain-ticketbenchmark
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

This paper argues that a microservice's tendency to change its network centrality across software releases—quantified by a new ordinal score called Centrality Change Proneness (CCP)—can serve as an early warning sign of architectural degradation. The authors reconstruct seven releases of the train-ticket microservice benchmark as a temporal network, compute temporal centrality metrics, and derive CCP from the First-Order Mover score. They find that temporal centrality correlates only weakly and inconsistently with code size, complexity, and quality, and that CCP does not drive those code metrics. Because CCP is computable from early releases and is independent of code metrics, the authors claim it offers a lightweight way to spot services whose dependency structure is volatile before code-level problems appear.

What carries the argument

The load-bearing object is the Centrality Change Proneness (CCP) rank, derived from the First-Order Mover (FOM) score introduced in [29]. FOM measures how much a node's eigenvector centrality changes across snapshots of a temporal network; CCP maps FOM values into an ordinal quartile scale (LOW, MEDIUM-LOW, MEDIUM-HIGH, HIGH) so services can be ranked without a fixed threshold. The rank is computed incrementally by accumulating releases, making it available from the earliest versions. The paper uses it to test whether a service's tendency to change centrality affects code metrics, and finds it does not—which is exactly why it is argued to be an independent early indicator.

What would settle it

Compute CCP ranks for the early releases of several microservice projects with known later architectural changes, such as services that were later refactored, split, or identified as exhibiting Hub-like or Mega smells. If low-CCP services turn out to undergo such degradation as often as high-CCP services, the claimed early-indicator property fails. A simpler check is to rerun the same analysis on a system with more releases: if FOM values flip drastically when one snapshot is added, the score is numerically unstable and the ranking carries no predictive information.

Watch

Extended reading notes

Core claim

The paper's central claim is that CCP rank can act as an early degradation indicator in microservice systems. A microservice whose centrality changes substantially across releases is likely undergoing shifts in its dependency structure, which may stem from flawed architectural decisions or improper division of responsibilities. The authors show empirically that temporal centrality becomes increasingly decoupled from software metrics as the architecture matures, which is why centrality-based signals are not redundant with code metrics. They conclude that services with persistently HIGH or MEDIUM-HIGH CCP ranks are the ones most likely to be involved in architectural decay, and that this signal is available earlier than code-metric deterioration.

Load-bearing premise

The whole argument rests on the assumption that the First-Order Mover score, computed from a sparse, self-implemented temporal centrality analysis of seven snapshots of a single benchmark app, is numerically stable and actually captures real architectural volatility—and the paper does not compare CCP against any external ground truth of degradation.

Editorial extensions

If this is right

  • Practitioners can monitor CCP ranks across releases to flag services that repeatedly sit in the top quartile of centrality change, before code smells or metric degradation appear.
  • The observed decoupling of centrality from size, complexity, and quality suggests that architecture quality and implementation quality must be assessed separately in microservice systems.
  • Researchers can use CCP trajectories to locate candidate services for architectural anti-patterns such as Nano, Hub-like, and Mega services.
  • Because FOM and CCP are computable from the first releases, the indicator fits the 'early bird' predictive heuristic already known to work for project quality.
  • The method transfers to any microservice system whose architecture can be reconstructed across releases, not just the studied benchmark.

Reading between the lines

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

  • A natural testable extension is to validate CCP against an external ground truth of degradation, such as developer-identified refactorings or architectural smells appearing in later releases; the paper itself does not provide such validation.
  • The rationale suggests a concrete prediction: services with high CCP in the first few releases should accumulate more architectural smells or dependency changes later than low-CCP services, which could be checked on a larger multi-project dataset.
  • The sparsity of the studied network (seven snapshots, mostly zero centralities) means the numerical behavior of FOM on small networks is a hidden variable; applying the same pipeline to a large industrial system with tens of releases would test whether the signal survives.
  • One implication the authors leave implicit is that CCP could be combined with change-proneness metrics at the code level, since CCP captures architectural volatility while classic change proneness captures code volatility; together they might give a two-dimensional early-warning screen.
Share X Bluesky LinkedIn Reddit HN

Editorial analysis

A structured set of objections, weighed in public.

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

Referee Report

3 major / 5 minor

Summary. The manuscript studies temporal centrality in seven releases of the train-ticket microservice benchmark. After reconstructing architectural networks with Code2DFD, the authors compute temporal centrality metrics (Taylor, Liu, Yin; Huang excluded) and software size/complexity/quality metrics, define a Centrality Change Proneness (CCP) rank by quartiling the First-Order Mover score, and test two research questions: RQ1 whether temporal centrality correlates with software metrics via Spearman's rho, and RQ2 whether CCP 'affects' software metrics via Wilcoxon signed-rank tests. The reported findings are that 7 size and 5 complexity metrics correlate consistently with centrality in all releases, quality metrics do not, and CCP does not affect software metrics, which the authors interpret as evidence that CCP is an early indicator of microservice architectural degradation.

Significance. The paper has clear strengths: it ships a replication package, applies temporal centrality measures to statically reconstructed microservice architectures, and is candid about threats such as the small sparse network, the single benchmark system, and self-implemented algorithms. If the early-indicator claim were supported, the CCP metric would be a useful addition to microservice degradation research. However, the central claim is not supported by the evidence as presented. The RQ2 analysis uses an invalid statistical test for the stated hypotheses, and no predictive validation connects CCP to any independent measure of architectural degradation. The contribution is therefore currently an exploratory metric proposal rather than an empirically established early-warning indicator.

major comments (3)
  1. [Section 3.3 / Section 4.2] The Wilcoxon signed-rank test is misapplied. The paper states that 'the paired data are the CCP rank and the SMs' and uses the test to assess hypotheses H14-H16 that 'CCP affects' size, complexity, and quality metrics. Wilcoxon's test requires paired observations of the same variable under two conditions (e.g., before/after), where each pair has a meaningful signed difference. Pairing a four-level ordinal CCP rank with a continuous software metric does not yield such signed differences. Consequently, the 71 rejections out of 1022 in Table 3 and the conclusion that 'CCP rank does not affect the variance of size, complexity, or quality metrics' are not established. Testing whether CCP is associated with software metrics requires a group comparison or regression-style analysis with CCP as the independent variable, not a paired signed-rank test.
  2. [Section 5] The headline claim that 'the CCP rank can act as an early degradation indicator' is not validated predictively. No ground-truth labels of architectural degradation are used anywhere in the study: there is no measure of later dependency restructuring, architectural smell occurrence, fault-proneness, or any other outcome that could confirm whether high early CCP precedes degradation. The manuscript itself notes in Section 3.3 that time-series methods 'failed to converge or converged to null values', so no temporal predictive analysis was actually run. Even if RQ2 were re-analyzed correctly, a null contemporaneous relationship between CCP and software metrics would not demonstrate predictive utility; it could equally mean that CCP is irrelevant to the metrics studied.
  3. [Sections 3.2 and 5] There is a circularity concern in the interpretation of CCP. CCP is defined from the First-Order Mover (FOM) score, which by construction measures how much a node's centrality changes over time. The paper argues in Section 5 that services with high CCP 'are continuously changing their centrality along a U-shaped curve' and cites Figure 1 as corroboration, but Figure 1 plots the same temporal centrality data from which FOM/CCP is derived. Thus the observation that high-CCP services change centrality is a restatement of the metric's definition, not an independent empirical finding. What is missing is any evidence linking centrality-change proneness to architectural degradation, which is the substantive claim the paper wants to make.
minor comments (5)
  1. [Section 4.1] The metric inclusion criterion ('only those metrics that show a statistically significant correlation with at least one centrality metric across all releases') is a post-hoc filter. This is transparent, but it inflates the apparent consistency of the RQ1 results; the paper should report the full set of correlations or clearly frame the selected metrics as illustrative rather than as a systematic finding.
  2. [Section 6] The Conclusion Validity paragraph states that 'we correlated the JC and CC values computed for the temporal network at the latest release, while FOM values were computed incrementally by release.' This inconsistency should be resolved or explicitly justified, because RQ1 appears to mix latest-release centrality with incremental FOM values.
  3. [Section 4.2] Figure 5 shows CCP ranks for release v0.0.1 even though the text says FOM and CCP are undefined for the first release because the temporal network has only one snapshot. Either exclude v0.0.1 from the CCP analysis or explicitly state how the undefined values were handled.
  4. [Section 4.1] The sentence 'The variations in statistical significance across releases are certainly spurious' is too strong; the variation could reflect real changes in the underlying relationship, and a softer formulation would be more appropriate.
  5. [References] Reference [10] is formatted inconsistently ('C., S.N., Menzies, T.'); the author name should be rendered in the same style as the other references.

Circularity Check

1 steps flagged · score 6.0 of 10

CCP is FOM binned into quartiles, so the claim that high-CCP services are most likely to undergo centrality changes is true by construction, not an empirically validated early-degradation indicator.

  1. self definitional [Section 3.1 (CCP definition) and Sections 5/7 (early-indicator interpretation)]
    "We propose the Centrality Change Proneness (CCP) rank, which is obtained from the FOM score by assigning to each quartile of the FOM score a value on the ordinal scale LOW, MEDIUM-LOW, MEDIUM-HIGH, HIGH. ... Services that repetitively have high CCP rankings are most likely to undergo centrality changes, uncovering underlying responsibility misalignments or changing dependencies, i.e., a warning sign of architectural anti-patterns at an early point in time."

    CCP is not an independent predictor; it is the FOM score binned into quartiles, and FOM is described by the paper as 'a score that indicates how likely a node is to vary its centrality in the temporal network based on historical observations.' Therefore, asserting that services with HIGH or MEDIUM-HIGH CCP 'are most likely to undergo centrality changes' is true by definition: the FOM score used to assign the CCP rank is computed from observed centrality variation. The paper even presents Figure 5 (CCP ranks) as 'corroborated' by Figure 1 (centrality trajectories), but Figure 1 supplies the same temporal centrality changes from which FOM/CCP are derived.

full rationale

The single genuine circular step is the self-definitional relationship between CCP and centrality change. The paper's RQ1 correlation analysis and the reconstruction of the temporal network are empirical and not circular; the inconsistent application of the Wilcoxon signed-rank test to paired CCP-rank and software-metric values in RQ2 is a statistical-validity threat, not a circularity. The self-citations to Bakhtin et al. [5] support data collection and prior negative correlation results, but they do not themselves force the early-indicator conclusion. However, the practitioner-facing prediction that services with high CCP 'are most likely to undergo centrality changes' is true by construction because CCP is an ordinal encoding of FOM, which is literally a measure of how much a node's centrality varies. Since no external ground truth of architectural degradation is used to validate the link between centrality change and actual degradation, the strongest claim in the paper is only partially supported by independent evidence; the core 'prediction' reduces to the metric's definition.

Assumptions & free parameters 1 free parameters · 4 assumptions · 1 invented entities

The analysis depends on the accuracy of the reconstructed network, the correctness of the self-implemented temporal centrality algorithms, and the validity of the statistical tests. CCP is a data-derived ordinal transform of an existing metric without independent validation, so it carries no external evidence.

free parameters (1)
  • CCP quartile thresholds = 0.054365, 0.098269, 0.156734
    Ordinal binning boundaries for FOM scores; derived from the data, not externally specified.
assumptions (4)
  • domain assumption Code2DFD reconstruction and largest-component/database filtering produce a network that accurately represents microservice architecture
    Section 3.2 preprocessing steps; if reconstruction is inaccurate, all centrality metrics are invalid.
  • domain assumption Temporal centrality algorithms (Taylor, Liu, Yin) are correctly implemented and applicable to this small sparse network
    Section 3.2; authors note potential human error and numerical instability; Huang excluded.
  • domain assumption Package-to-service mapping and metric aggregation are correct
    Section 3.2; manual mapping repeated per release; errors would bias SMs.
  • domain assumption Release snapshots form a valid temporal network for FOM computation
    Section 3.2; FOM undefined for first release and uses accumulated snapshots.
invented entities (1)
  • Centrality Change Proneness (CCP) rank
    purpose: Early indicator of architectural degradation; ordinal ranking of services by centrality volatility
    CCP is a quartile binning of FOM; no external validation against actual degradation or anti-patterns; predictive power is claimed but not demonstrated.

how reviews work

0 comments
Cite this review

Pith. "Pith review of Centrality Change Proneness: an Early Indicator of Microservice Architectural Degradation." pith.science (2026). https://pith.science/paper/ULYWDTPN

@misc{pith2026250607690,
  author       = {Pith},
  title        = {Pith review of: Centrality Change Proneness: an Early Indicator of Microservice Architectural Degradation},
  year         = {2026},
  howpublished = {\url{https://pith.science/paper/ULYWDTPN}},
  note         = {Machine review of arXiv:2506.07690}
}
read the original abstract

Over the past decade, the wide adoption of Microservice Architecture has required the identification of various patterns and anti-patterns to prevent Microservice Architectural Degradation. Frequently, the systems are modelled as a network of connected services. Recently, the study of temporal networks has emerged as a way to describe and analyze evolving networks. Previous research has explored how software metrics such as size, complexity, and quality are related to microservice centrality in the architectural network. This study investigates whether temporal centrality metrics can provide insight into the early detection of architectural degradation by correlating or affecting software metrics. We reconstructed the architecture of 7 releases of an OSS microservice project with 42 services. For every service in every release, we computed the software and centrality metrics. From one of the latter, we derived a new metric, Centrality Change Proneness. We then explored the correlation between the metrics. We identified 7 size and 5 complexity metrics that have a consistent correlation with centrality, while Centrality Change Proneness did not affect the software metrics, thus providing yet another perspective and an early indicator of microservice architectural degradation.

Figures

Figures reproduced from arXiv: 2506.07690 by the authors.

Figure 1
Figure 1. Microservice Joint and Conditional centrality [29] trajectories as given by the three considered methods [20, 29, 33] across the releases v0.0.1 v0.0.2 v0.0.3 v0.0.4 v0.1.0 v0.2.0 v1.0.0 0 0,5 1,0 1,5 Liu MLC Taylor MLC Yin MLC [PITH_FULL_IMAGE:figures/full_fig_p007_1.png] view at source ↗
Figure 2
Figure 2. Sum of the centralities of all microservices (MLC, [29]) for each release of train￾ticket were introduced or removed partway through development, affecting their pres￾ence in the centrality analysis. Regarding MLC, all three algorithms resulted in a peak at release v0.0.4 ( [PITH_FULL_IMAGE:figures/full_fig_p007_2.png] view at source ↗
Figure 3
Figure 3. Heat-map of correlation of microservice temporal centrality with size metrics across the releases Max(SIX) metric. SIX is the specialization index of the class from JaSoMe tool6 , defined as DIT∗NORM NOM , where DIT is Depth of the Inheritance Tree, NORM is Number of Overridden Methods, and NOM is the total Number of Methods. The average of Cognitive Complexity (Avg(CC)) seems to be consistently positively correlate… view at source ↗
Figures from the paper (2 more)
Figure 4
Figure 4. Figure 4: Heat-map of correlation of microservice temporal centrality with complexity metrics across the releases 6 https://github.com/rodhilton/jasome/blob/master/README.md [PITH_FULL_IMAGE:figures/full_fig_p010_4.png]
Figure 5
Figure 5. Figure 5: Trajectories of CCP rank across the releases We observe that most of the rejected hypotheses correspond to the first re￾lease. Notably, there is not a single SM that would be consistently affected by CCP across all releases. There seems to be a spurious result for one …

Discussion (0). Sign in to comment.

Forward citations

Cited by 1 Pith paper

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score. Full citation record

  1. Leveraging Network Methods for Hub-like Microservice Detection

    cs.SE 2025-06 conditional novelty 5.0 of 10

    On 25 microservice dependency graphs, the Erdos-Renyi compression-based hub detector found hub-like services with the highest precision, while degree-based and centrality-based methods mostly disagreed with each other.

Reference graph

Works this paper leans on

34 extracted references · 31 canonical work pages · cited by 1 Pith paper

  1. [1]

    International Journal of Data Mining & Knowledge Management Process (IJDKP)7(5/6), 17– 34 (November 2017)

    Abufouda, M., Abukwaik, H.: On using network science in mining developers col- laboration in software engineering: A systematic literature review. International Journal of Data Mining & Knowledge Management Process (IJDKP)7(5/6), 17– 34 (November 2017)

    work page 2017

  2. [2]

    In: 2022 IEEE International Conference on Service- Oriented System Engineering (SOSE)

    Al Maruf, A., Bakhtin, A., Cerny, T., Taibi, D.: Using microservice telemetry data for system dynamic analysis. In: 2022 IEEE International Conference on Service- Oriented System Engineering (SOSE). pp. 29–38. IEEE (2022)

    work page 2022

  3. [3]

    goodness of fit

    Anderson, T.W., Darling, D.A.: Asymptotic theory of certain" goodness of fit" criteria based on stochastic processes. The annals of mathematical statistics pp. 193–212 (1952)

    work page 1952

  4. [4]

    In: 2022 IEEE International Conference on Services Computing (SCC)

    Bakhtin, A., Al Maruf, A., Cerny, T., Taibi, D.: Survey on tools and techniques detecting microservice api patterns. In: 2022 IEEE International Conference on Services Computing (SCC). pp. 31–38. IEEE (2022)

    work page 2022

  5. [5]

    In: 2025 IEEE 22nd International Con- ference on Software Architecture (ICSA)

    Bakhtin, A., Esposito, M., Lenarduzzi, V., Taibi, D.: Network centrality as a new perspective on microservice architecture. In: 2025 IEEE 22nd International Con- ference on Software Architecture (ICSA). pp. 72–83 (2025)

    work page 2025

  6. [6]

    centrality change proneness: an early indicator of microservice architectural degradation

    Bakhtin, A., Esposito, M., Lenarduzzi, V., Taibi, D.: Replication package and online appendix for "centrality change proneness: an early indicator of microservice architectural degradation" (Mar 2025). https://doi.org/10.5281/zenodo.15100706

    work page doi:10.5281/zenodo.15100706 2025

  7. [7]

    Arctic AI 2024 (2024)

    Bakhtin, A., Esposito, M., Taibi, D.: Challenges in constructing temporal archi- tecture networks for microservice systems. Arctic AI 2024 (2024)

    work page 2024

  8. [8]

    In: European Conference on Software Architecture

    Bakhtin, A., Li, X., Taibi, D.: Temporal community detection in developer collab- oration networks of microservice projects. In: European Conference on Software Architecture. pp. 174–182. Springer (2024)

    2024

Show all 34 references
  1. [9]

    Journal of Systems and Software159, 110432 (2020)

    Álvaro Brandón, Solé, M., Huélamo, A., Solans, D., Pérez, M.S., Muntés-Mulero, V.: Graph-based root cause analysis for service-oriented and microservice architec- tures. Journal of Systems and Software159, 110432 (2020)

    2020

  2. [10]

    ACM Trans

    C., S.N., Menzies, T.: Assessing the early bird heuristic (for predicting project quality). ACM Trans. Softw. Eng. Methodol.32(5) (jul 2023)

    2023

  3. [11]

    Journal of Systems and Software206, 111829 (2023)

    Cerny, T., Abdelfattah, A.S., Al Maruf, A., Janes, A., Taibi, D.: Catalog and detection techniques of microservice anti-patterns and bad smells: A tertiary study. Journal of Systems and Software206, 111829 (2023)

    2023

  4. [12]

    Chakraborty, S., Garg, S., Agarwal, S., Chauhan, A., Saini, S.K.: Causil: Causal graph for instance level microservice data. p. 2905–2915. WWW ’23, Association for Computing Machinery, New York, NY, USA (2023)

    2023

  5. [13]

    Computer Communications204, 109–117 (2023)

    Chen, J., Liu, F., Jiang, J., Zhong, G., Xu, D., Tan, Z., Shi, S.: Tracegra: A trace- based anomaly detection for microservice using graph deep learning. Computer Communications204, 109–117 (2023)

    2023

  6. [14]

    Prentice Hall (2007)

    Dancey, C.: Statistics without maths for psychology. Prentice Hall (2007)

    2007

  7. [15]

    Falessi, D., Laureani, S.M., Çarka, J., Esposito, M., Costa, D.A.d.: Enhancing the defectiveness prediction of methods and classes via JIT. Empir. Softw. Eng.28(2), 37 (2023) 16 Bakhtin et al

    2023

  8. [16]

    Biometrika69(1), 81–94 (1982)

    Hannan, E.J., Rissanen, J.: Recursive estimation of mixed autoregressive-moving average order. Biometrika69(1), 81–94 (1982)

    1982

  9. [17]

    EPL (Europhysics Letters)118(3), 36001 (may 2017)

    Huang, Q., Zhao, C., Zhang, X., Wang, X., Yi, D.: Centrality measures in temporal networks with time series analysis. EPL (Europhysics Letters)118(3), 36001 (may 2017)

    2017

  10. [18]

    Abacus57(1), 27–71 (2021)

    Kim, J.H., Choi, I.: Choosing the level of significance: A decision-theoretic ap- proach. Abacus57(1), 27–71 (2021)

    2021

  11. [19]

    Journal of the Indian Institute of Science99(2), 237–246 (jun 2019)

    Kumar, T., Narayanan, M., Ravindran, B.: Effect of inter-layer coupling on multi- layer network centrality measures. Journal of the Indian Institute of Science99(2), 237–246 (jun 2019)

    2019

  12. [20]

    Entropy 24(10), 1391 (sep 2022)

    Liu, R., Zhang, S., Zhang, D., Zhang, X., Bao, X.: Node importance identifica- tion for temporal networks based on optimized supra-adjacency matrix. Entropy 24(10), 1391 (sep 2022)

    2022

  13. [21]

    In: van Steen, M., Fergu- son, D., Pahl, C

    Marchese, A., Tomarchio, O.: Evaluating microservices communication relation- ships for scheduling containers on kubernetes clusters. In: van Steen, M., Fergu- son, D., Pahl, C. (eds.) Cloud Computing and Services Science. pp. 45–65. Springer Nature Switzerland, Cham (2024)

    2024

  14. [22]

    Empirical Software Engineering23(3), 1188–1221 (Jun 2018)

    Palomba, F., Bavota, G., Penta, M.D., Fasano, F., Oliveto, R., Lucia, A.D.: On the diffuseness and the impact on maintainability of code smells: a large scale empirical investigation. Empirical Software Engineering23(3), 1188–1221 (Jun 2018)

    2018

  15. [23]

    note on regression and inheritance in the case of two parents

    Pearson, K.: Vii. note on regression and inheritance in the case of two parents. proceedings of the royal society of London58(347-352), 240–242 (1895)

  16. [24]

    In: Proceedings of the 3rd International Conference on Technical Debt

    Pigazzini, I., Fontana, F.A., Lenarduzzi, V., Taibi, D.: Towards microservice smells detection. In: Proceedings of the 3rd International Conference on Technical Debt. pp. 92–97 (2020)

    2020

  17. [25]

    In: 2022 SANER

    Saarimäki, N., Moreschini, S., Lomio, F., Penaloza, R., Lenarduzzi, V.: Towards a robust approach to analyze time-dependent data in software engineering. In: 2022 SANER. pp. 36–40. IEEE (2022)

    2022

  18. [26]

    JSS (2023)

    Schneider, S., Scandariato, R.: Automatic extraction of security-rich dataflow dia- grams for microservice applications written in java. JSS (2023)

    2023

  19. [27]

    The American Journal of Psychology15(1), 72–101 (1904)

    Spearman, C.: The proof and measurement of association between two things. The American Journal of Psychology15(1), 72–101 (1904)

    1904

  20. [28]

    ACM Trans

    Sun, Y., Lin, Z., Shi, B., Zhang, S., Ma, S., Jin, P., Zhong, Z., Pan, L., Guo, Y., Pei, D.: Interpretable failure localization for microservice systems based on graph autoencoder. ACM Trans. Softw. Eng. Methodol.34(2) (jan 2025)

    2025

  21. [29]

    Multiscale Modeling & Simu- lation15(1), 537–574 (2017)

    Taylor, D., Myers, S.A., Clauset, A., Porter, M.A., Mucha, P.J.: Eigenvector- based centrality measures for temporal networks. Multiscale Modeling & Simu- lation15(1), 537–574 (2017)

    2017

  22. [30]

    Biometrics Bulletin 1(6), 80 (dec 1945)

    Wilcoxon, F.: Individual comparisons by ranking methods. Biometrics Bulletin 1(6), 80 (dec 1945)

    1945

  23. [31]

    Springer (2012)

    Wohlin,C.,Runeson,P.,Höst,M.,etal.:ExperimentationinSoftwareEngineering. Springer (2012)

    2012

  24. [32]

    Xu, Y., Ge, J., Tang, H., Ding, S., Li, T., Li, H.: System states forecasting of microservices with dynamic spatio-temporal data (arXiv:2408.07894) (aug 2024)

    2024 arXiv

  25. [33]

    Physica A: Statistical Mechanics and its Applications512, 165–173 (2018)

    Yin, R.R., Guo, Q., Yang, J.N., Liu, J.G.: Inter-layer similarity-based eigenvector centrality measures for temporal networks. Physica A: Statistical Mechanics and its Applications512, 165–173 (2018)

    2018

  26. [34]

    In: Proceedings of the 40th International Conference on Software Engineering: Companion Proceeedings

    Zhou, X., Peng, X., Xie, T., Sun, J., Xu, C., Ji, C., Zhao, W.: Benchmarking microservice systems for software engineering research. In: Proceedings of the 40th International Conference on Software Engineering: Companion Proceeedings. pp. 323–324 (2018)

    2018

Pith tools

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