Papers › Graph-based clustering of gamma-ray bursts
Graph-based clustering of gamma-ray bursts
Mariusz Tarnopolski
The archive published only this paper's code-link row. Authors, date and abstract are from arXiv's metadata (CC0), read from the Kaggle arXiv metadata snapshot of 2026-09-12 where its title matched the archive's; the title is the archive's.
Aims. An attempt to classify gamma-ray bursts (GRBs) with a low level of supervision using the state-of-the-start approaches stemming from graph theory was undertaken. Methods. Graph-based classification methods, relying on different variants of the k-nearest neighbour graph, were applied to various GRB samples in the duration-hardness ratio parameter space to infer the optimal partitioning. Results. In most cases it is found that both two and three groups are feasible, with the outcome being more ambiguous with an increasing sample size. Conclusions. There is no clear indication of the presence of a third GRB class; however, such a possibility cannot be ruled out with the employed methodology. There are no hints at more than three classes though.
Code
Repository list and official/mentioned flags are the archive's, frozen 2025-07-28. Reachability, where shown, is from one Syntology probe window (2026-09-16 to 2026-09-18); repositories not probed show nothing. GitHub stars are not tracked.
Code Syntology ran Syntology
Not run by Syntology. Nothing on this page verifies that the listed code works.
Results from the paper archive 2025-07-28
No leaderboard rows for this paper in the archive.
Report a problem or propose a change · a person checks every report against the paper or source before anything changes; decisions are listed on /corrections