Evidence map›Paper›PMID 41716976›Full record

ArticleCommunications physics2026

The microscale organization of directed hypergraphs.

Quintino Francesco Lotito, Alberto Vendramini, Alberto Montresor, Federico Battiston

Abstract read
In one paragraph

Article in Communications physics, 2026. The graph could read no effect estimate from its abstract, so it casts no vote on the map. Not yet cited in PubMed.

0numbers the graph read from it
0cells of the map it votes in
0citing papers in PubMed
–field-weighted citation impact
1 · What the graph read from it

What it found

Each row is one number read from the abstract, on the scale the paper reported it, with its interval. Left of the dashed line favours the treatment, right favours the comparator. Under each row is the sentence it came from. New to these charts? A ten-minute tutorial.

The abstract states no effect estimate the extractor could read, or names no intervention and outcome on the map, so this paper lights no cell and moves no belief. It is still indexed, cited and linked below.

2 · The registry

The trial behind it

Trials whose registry record cites this paper, or whose number appears in the abstract. A trial that started after this paper was published is citing it as background, not reporting it.

Neither the registry nor the abstract names a trial number. If this is a trial report, that itself is worth knowing.

3 · Its place in the literature

Who cites it

0 citing papers in PubMed.

No citing paper in PubMed yet.

4 · The record

Corrections and comments

PubMed lists nothing against this paper. Absence here is not a guarantee, only a check that was made.

5 · Who and what money

Authors and funding

4 authors.

Quintino Francesco LotitoDepartment of Network and Data Science, Central European University, Vienna, Austria.ORCID 0000-0001-7084-8339
Alberto VendraminiDepartment of Information Engineering and Computer Science, University of Trento, Trento, Italy.
Alberto MontresorDepartment of Information Engineering and Computer Science, University of Trento, Trento, Italy.
Federico BattistonDepartment of Network and Data Science, Central European University, Vienna, Austria.ORCID 0000-0001-9646-6232

Funding

No grant is acknowledged in the PubMed record.

6 · The paper itself

Abstract

Many real-world systems exhibit higher-order interactions beyond pairwise links. Such interactions are modeled by undirected hypergraphs where edges can connect any number of vertices, but without capturing the directional nature of many real-world interactions. Directed hypergraphs overcome this limitation by distinguishing source and target sets within each hyperedge, enabling analysis of directional information flow. Here, we provide a framework to characterize the structural organization of directed higher-order networks at their microscale. We extract the fingerprint of a directed hypergraph, capturing the frequency of hyperedges with a certain source and target sizes, and use this information to compute differences in higher-order connectivity patterns among real-world systems. Then, we investigate the overlap among sources and targets to reveal recurring sets of co-sending and co-receiving nodes. We define reciprocity in hypergraphs using exact, strong, and weak definitions to quantify the extent to which hyperedges are reciprocated. Finally, we extend motif analysis to identify recurring interaction patterns and extract the building blocks of directed hypergraphs. We validate our framework on empirical datasets, including Bitcoin transactions, metabolic networks, and citation data, revealing structural principles behind the organization of real-world systems.

Indexed as

Complex networksComputational science

Identifiers

PMID41716976
PMCPMC12915522

What OpenQuestion holds

Textmetadata
LicenceCC BY-NC-ND
Read underepoch 390

Registered trials

None linked

Read under generation 80e0d062 · epoch 390. Bibliography from PubMed, PubMed Central and OpenAlex; grants from NIH RePORTER; trial links from ClinicalTrials.gov; estimates, votes and beliefs from the OpenQuestion graph.