🚨🚨 New paper out! With @colltoaction.bsky.social, @fralotito.bsky.social, and a bunch of offline co-authors 🙂 we published "HIF: The hypergraph interchange format for higher-order networks" doi.org/10.1017/nws....
HIF: The hypergraph interchange format for higher-order networks | Network Science | Cambridge Core
HIF: The hypergraph interchange format for higher-order networks - Volume 13
doi.org
December 22, 2025 at 4:04 PM
🚨🚨 New paper out! With @colltoaction.bsky.social, @fralotito.bsky.social, and a bunch of offline co-authors 🙂 we published "HIF: The hypergraph interchange format for higher-order networks" doi.org/10.1017/nws....
Laevatain - Arknights: endfield
#arknights #arknightsendfield #arknightsfanart #digitalart #procreate #hypergraph
#gachagames #endfield #laevatain
#arknights #arknightsendfield #arknightsfanart #digitalart #procreate #hypergraph
#gachagames #endfield #laevatain
February 5, 2026 at 11:07 AM
Laevatain - Arknights: endfield
#arknights #arknightsendfield #arknightsfanart #digitalart #procreate #hypergraph
#gachagames #endfield #laevatain
#arknights #arknightsendfield #arknightsfanart #digitalart #procreate #hypergraph
#gachagames #endfield #laevatain
Information theory for hypergraph similarity | Science Advances www.science.org/doi/10.1126/...
Information theory for hypergraph similarity
Information theoretic principles are used to derive a hierarchy of hypergraph similarity measures.
www.science.org
June 3, 2026 at 7:59 PM
Information theory for hypergraph similarity | Science Advances www.science.org/doi/10.1126/...
Reaction-aware hypergraph learning of chemical representations with LARK https://www.biorxiv.org/content/10.64898/2026.09.15.751932v1
September 22, 2026 at 5:46 AM
Reaction-aware hypergraph learning of chemical representations with LARK https://www.biorxiv.org/content/10.64898/2026.09.15.751932v1
Network (and hypergraph) of the day.
From: Yu. A. Schreider, "Equality, Resemblance, and Order" (1975)
From: Yu. A. Schreider, "Equality, Resemblance, and Order" (1975)
January 8, 2025 at 6:04 AM
Network (and hypergraph) of the day.
From: Yu. A. Schreider, "Equality, Resemblance, and Order" (1975)
From: Yu. A. Schreider, "Equality, Resemblance, and Order" (1975)
and they say models can't joke
August 30, 2026 at 6:01 PM
and they say models can't joke
Indeed a hypergraph model requires mutual, symmetric interactions, in a manner coherently experienced by every member of a hyperedge. Graphs relax this requirement and achieve greater flexibility.
Hence, every hypergraph model is a special case of a graph-based one, which is easy to show.
7/N
Hence, every hypergraph model is a special case of a graph-based one, which is easy to show.
7/N
February 20, 2026 at 8:04 AM
Indeed a hypergraph model requires mutual, symmetric interactions, in a manner coherently experienced by every member of a hyperedge. Graphs relax this requirement and achieve greater flexibility.
Hence, every hypergraph model is a special case of a graph-based one, which is easy to show.
7/N
Hence, every hypergraph model is a special case of a graph-based one, which is easy to show.
7/N
How have I been working with applying network theory to astrobiology for the last ten years and only *now* learned what a hypergraph is?
November 21, 2024 at 12:29 AM
How have I been working with applying network theory to astrobiology for the last ten years and only *now* learned what a hypergraph is?
Sample from the Swizzle Fun HyperGraph 1 material library that has a large collection (400) seamless textures with several trim sheets and fictional ui / computer interface & computer console panels.
December 10, 2024 at 6:46 AM
Sample from the Swizzle Fun HyperGraph 1 material library that has a large collection (400) seamless textures with several trim sheets and fictional ui / computer interface & computer console panels.
Quantum code surgery: fast, addressable, parallel, (almost) constant space overhead, all at once on your favorite hypergraph product codes.
arxiv.org/abs/2603.021...
arxiv.org/abs/2603.021...
Constant-Time Surgery on 2D Hypergraph Product Codes with Near-Constant Space Overhead
Generalized code surgery is a versatile and low-overhead technique for performing fault-tolerant computation on quantum low-density parity-check (qLDPC) codes. In many settings, surgery exhibits pract...
arxiv.org
March 3, 2026 at 5:04 AM
Quantum code surgery: fast, addressable, parallel, (almost) constant space overhead, all at once on your favorite hypergraph product codes.
arxiv.org/abs/2603.021...
arxiv.org/abs/2603.021...
unfortunately I have found a situation in my own work where a hypergraph representation is the most appropriate
December 30, 2024 at 10:43 PM
unfortunately I have found a situation in my own work where a hypergraph representation is the most appropriate
Complete the hypergraph arithmetically
September 23, 2026 at 1:00 AM
Complete the hypergraph arithmetically
New preprint w/ @tiago.skewed.de, @manlius.bsky.social & @thilogross.bsky.social!
Graph edges define the interaction domain — functional form is free
Hyperedges constrain by grouping nodes into subsets: special case, not a generalisation
Multilayer graphs represent any hypergraph — not vice versa
Graph edges define the interaction domain — functional form is free
Hyperedges constrain by grouping nodes into subsets: special case, not a generalisation
Multilayer graphs represent any hypergraph — not vice versa
New on the arxiv:
“Graphs are maximally expressive for higher-order interactions”
arxiv.org/abs/2602.16937
We clarify central misconceptions in the recent literature on "higher-order networks".
w/ @piratepeel.bsky.social , @manlius.bsky.social, and @thilogross.bsky.social
Explainer 🧵: 1/N
“Graphs are maximally expressive for higher-order interactions”
arxiv.org/abs/2602.16937
We clarify central misconceptions in the recent literature on "higher-order networks".
w/ @piratepeel.bsky.social , @manlius.bsky.social, and @thilogross.bsky.social
Explainer 🧵: 1/N
Graphs are maximally expressive for higher-order interactions
We demonstrate that graph-based models are fully capable of representing higher-order interactions, and have a long history of being used for precisely this purpose. This stands in contrast to a commo...
arxiv.org
February 20, 2026 at 9:11 AM
New preprint w/ @tiago.skewed.de, @manlius.bsky.social & @thilogross.bsky.social!
Graph edges define the interaction domain — functional form is free
Hyperedges constrain by grouping nodes into subsets: special case, not a generalisation
Multilayer graphs represent any hypergraph — not vice versa
Graph edges define the interaction domain — functional form is free
Hyperedges constrain by grouping nodes into subsets: special case, not a generalisation
Multilayer graphs represent any hypergraph — not vice versa
“ Eternal Flame”
Fiammetta From Arknights
#arknights #arknightsfanart #sketch #hypergraph #drawing #fiammetta #gachagames #rhodeisland
Fiammetta From Arknights
#arknights #arknightsfanart #sketch #hypergraph #drawing #fiammetta #gachagames #rhodeisland
May 9, 2026 at 12:50 PM
“ Eternal Flame”
Fiammetta From Arknights
#arknights #arknightsfanart #sketch #hypergraph #drawing #fiammetta #gachagames #rhodeisland
Fiammetta From Arknights
#arknights #arknightsfanart #sketch #hypergraph #drawing #fiammetta #gachagames #rhodeisland
HIF: The hypergraph interchange format for higher-order networks arxiv.org/abs/2507.11520
HIF: The hypergraph interchange format for higher-order networks
Many empirical systems contain complex interactions of arbitrary size, representing, for example, chemical reactions, social groups, co-authorship relationships, and ecological dependencies. These int...
arxiv.org
July 17, 2025 at 7:51 AM
HIF: The hypergraph interchange format for higher-order networks arxiv.org/abs/2507.11520
US military partner Constellation opens Hypergraph network to app developers
July 15, 2024 at 9:25 PM
US military partner Constellation opens Hypergraph network to app developers
Hypergraphs naturally parametrize higher-order relations.Yet GNNs on hypergraph expansions often outperform specialized topological models. We show that adding hypergraph-level encodings yields significant performance and expressivity gains.w/ Raphael Pellegrin, Lukas Fesser arxiv.org/pdf/2502.09570
February 21, 2025 at 5:50 PM
Hypergraphs naturally parametrize higher-order relations.Yet GNNs on hypergraph expansions often outperform specialized topological models. We show that adding hypergraph-level encodings yields significant performance and expressivity gains.w/ Raphael Pellegrin, Lukas Fesser arxiv.org/pdf/2502.09570
Todays the day, my friends! 2pm, come listen to me break down how infrastructure as model works, and how we implement it with a hypergraph of functions. It’s the most technical talk I’ve given in a long time, and I’m hyped for it. See you at @cfgmgmtcamp.bsky.social !
February 3, 2025 at 5:59 AM
Todays the day, my friends! 2pm, come listen to me break down how infrastructure as model works, and how we implement it with a hypergraph of functions. It’s the most technical talk I’ve given in a long time, and I’m hyped for it. See you at @cfgmgmtcamp.bsky.social !
It's wild how those `agents.md` files (or similar other prompt extensions) look like. Written as if you were talking to a person with punctuation and appeals to cognition and honesty.
You are seeding values to a stochastic system pushing it into desirable areas in a hypergraph, not teaching a human
You are seeding values to a stochastic system pushing it into desirable areas in a hypergraph, not teaching a human
February 22, 2026 at 4:18 PM
It's wild how those `agents.md` files (or similar other prompt extensions) look like. Written as if you were talking to a person with punctuation and appeals to cognition and honesty.
You are seeding values to a stochastic system pushing it into desirable areas in a hypergraph, not teaching a human
You are seeding values to a stochastic system pushing it into desirable areas in a hypergraph, not teaching a human
Manuel Serna-Aguilera, Raegan Anderes, Page Dobbs, Khoa Luu: PRISM-RAG: Multimodal Hypergraph Retrieval-Augmented Generation for Tobacco Product and Legislative Policy Reasoning https://arxiv.org/abs/2609.23769 https://arxiv.org/pdf/2609.23769 https://arxiv.org/html/2609.23769
September 23, 2026 at 6:41 AM
Manuel Serna-Aguilera, Raegan Anderes, Page Dobbs, Khoa Luu: PRISM-RAG: Multimodal Hypergraph Retrieval-Augmented Generation for Tobacco Product and Legislative Policy Reasoning https://arxiv.org/abs/2609.23769 https://arxiv.org/pdf/2609.23769 https://arxiv.org/html/2609.23769
Since graphs *constrain* rather than define the interactions, it follows that graph-based models *generalize* those based on hypergraphs! For a simple reason: Hypergraphs impose structure on the interactions that graph-based models leave open, making hypergraph models the more restrictive class. 6/N
February 20, 2026 at 8:04 AM
Since graphs *constrain* rather than define the interactions, it follows that graph-based models *generalize* those based on hypergraphs! For a simple reason: Hypergraphs impose structure on the interactions that graph-based models leave open, making hypergraph models the more restrictive class. 6/N
HR-FRGS: A Novel Biomarker Discovery Protocol using Dual Layer Hypergraph Learning for NGS RNA Sequence Data https://www.biorxiv.org/content/10.64898/2026.09.21.753079v1
September 25, 2026 at 11:45 PM
HR-FRGS: A Novel Biomarker Discovery Protocol using Dual Layer Hypergraph Learning for NGS RNA Sequence Data https://www.biorxiv.org/content/10.64898/2026.09.21.753079v1
Structural Reducibility of Hypergraphs link.aps.org/doi/10.1103/...
Structural Reducibility of Hypergraphs
An information-theoretic framework finds and removes redundancies in a hypergraph representation of a network, allowing for more efficient analysis of higher-order elements.
link.aps.org
December 14, 2025 at 9:29 AM
Structural Reducibility of Hypergraphs link.aps.org/doi/10.1103/...
Modular core network constructed from Escherichia coli transcriptome datasets using a hypergraph-based pan-network approach https://www.biorxiv.org/content/10.64898/2026.09.16.752242v1
September 24, 2026 at 2:45 PM
Modular core network constructed from Escherichia coli transcriptome datasets using a hypergraph-based pan-network approach https://www.biorxiv.org/content/10.64898/2026.09.16.752242v1
HR-FRGS: A Novel Biomarker Discovery Protocol using Dual Layer Hypergraph Learning for NGS RNA Sequence Data https://www.biorxiv.org/content/10.64898/2026.09.21.753079v1
September 25, 2026 at 11:45 PM
HR-FRGS: A Novel Biomarker Discovery Protocol using Dual Layer Hypergraph Learning for NGS RNA Sequence Data https://www.biorxiv.org/content/10.64898/2026.09.21.753079v1