Papers › Representing Edge Flows on Graphs via Sparse Cell Complexes

Representing Edge Flows on Graphs via Sparse Cell Complexes

4 Sep 2023arXiv:2309.01632archive 2025-07-28

Josef Hoppe, Michael T. Schaub

Obtaining sparse, interpretable representations of observable data is crucial in many machine learning and signal processing tasks. For data representing flows along the edges of a graph, an intuitively interpretable way to obtain such representations is to lift the graph structure to a simplicial complex: The eigenvectors of the associated Hodge-Laplacian, respectively the incidence matrices of the corresponding simplicial complex then induce a Hodge decomposition, which can be used to represent the observed data in terms of gradient, curl, and harmonic flows. In this paper, we generalize this approach to cellular complexes and introduce the flow representation learning problem, i.e., the problem of augmenting the observed graph by a set of cells, such that the eigenvectors of the associated Hodge Laplacian provide a sparse, interpretable representation of the observed edge flows on the graph. We show that this problem is NP-hard and introduce an efficient approximation algorithm for its solution. Experiments on real-world and synthetic data demonstrate that our algorithm outperforms state-of-the-art methods with respect to approximation error, while being computationally efficient.

PaperPDFCodeCode Syntology ran

In Syntology View this paper on Syntology, its page in Syntology's graph. That page adds which of its functions are also present in other papers' code Syntology holds, with dates, and its dated run record as JSON and a README badge. It also lists the repositories linked to the paper, the abstract and the calls for agents.

Open this paper in Syntology's Atlas, the map of the papers in Syntology's graph and their citations.

For agents, on Syntology's MCP service (how to connect):

Code

Syntology 10 code samples harvested from 2 repositories linked to this paper: 9 ran (of which 0 constructed an object rather than computing a result; 9 with no instrument failure: 0 honoured, 0 violated, 9 with no contract checked; 0 where Syntology's instrument failed) · 1 unverified. “Where Syntology's instrument failed” counts failures of Syntology's instrument, not of the code; here there are none.

By repository: official repository: 10 samples from 2 repositories, 9 ran (9 with no instrument failure; 0 where Syntology's instrument failed). The run record, sample by sample. “Ran” means executed on a synthesized input, not that the code is correct or reproduces the paper.

Levels written between 2026-09-24 and 2026-09-25 (UTC): the dates Syntology's graph wrote each sample's verification level, not when the code executed.

josefhoppe/cell-flower officialmentioned in papermentioned on GitHubMITSyntology: 9 samples, 8 ran (0 instrument-failed) · 1 unverified report
josefhoppe/edge-flow-cell-complexes officialmentioned on GitHubMITSyntology: 1 sample, 1 ran (0 instrument-failed) · 0 unverified report

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

10 samples harvested: 9 ran (of which 0 constructed an object rather than computing a result; 9 with no instrument failure: 0 honoured, 0 violated, 9 with no contract checked; 0 where Syntology's instrument failed) · 1 unverified. “Where Syntology's instrument failed” counts failures of Syntology's instrument, not of the code. Syntology's record for this page has not changed since , the first build that kept a record date for it; when this build read Syntology's graph is in the build record. That date is not when the samples ran.

9ran
1unverified

Licence: 0 of the 10 samples are pointer only, meaning Syntology does not serve that copy's text. This page shows no code text for any sample; each one links to its file in the repository.

Harvested from 2 repositories linked to this paper, official or community; the list below is grouped by repository, each group headed by its name and what it is to the paper. “Ran” means the sample executed on a synthesized input. It does not mean the output is correct, and nothing here reproduces the paper's results. A line beginning “fixture:” under a sample that ran gives the arguments Syntology's fixture called the sample with, each as name:type/rank/element kind (? where none was recorded), and the type of what the fixture's run returned, exactly as the harness recorded them; the arguments and the returned type were recorded by two separate runs of the same fixture. No output value is shown, and a returned type says nothing about whether the output was right. “Level recorded” gives the UTC date when Syntology's graph wrote the sample's verification level, not when the code executed; where the level was written before Syntology's graph kept that date, the row says “level recorded, date not recorded”. “Honoured” and “violated” refer to a contract Syntology drafted from the code itself. “Our draft was wrong” and “the contract check could not run” are failures of Syntology's instrument, not of the code: the sample ran on Syntology's synthesized input, and then the drafted contract did not describe it, or the check itself raised an error (RAISES), lacked a dependency (DEP_MISSING) or ran out of time (TIMEOUT); hover the label for which. A metamorphic tier, where shown, is evidence of the output's shape, not that the sample implements the method.

Each sample ends with its code_sha256. A sample's code_sha256 is Syntology's identity for that exact code. It is printed in full (16 hexadecimal characters for every sample in this build), and get_code(code_sha256="…") takes it exactly as printed. An agent calls it on Syntology's MCP service (how to connect); click an identity to copy that call.

Repository labels, per sample. official repository: The archive marks this repository official for the paper. named in the paper: The archive records that the paper mentions this repository; it is not marked official. community (archive-listed): In the archive's code links for this paper, not marked official and not recorded as mentioned in the paper. found in paper text by Syntology: Syntology found this repository in the paper's own text; whether it is the authors' implementation is not asserted. community: Not in the archive's code links for this paper; a community repository Syntology harvested. Samples are grouped by repository: a repository marked official first, then by how directly the repository is tied to the paper, then in the archive's order; never by how many ran. Licence labels name the repository's licence as recorded at harvest. “Pointer only” means Syntology does not serve that copy's text, for one of six reasons: no licence file was found; the licence was not identified; the licence is recorded as permissive but that copy's record is not marked cleared; the licence is outside the permissive list Syntology serves text under (MIT, Apache-2.0, BSD and similar); this paper's copy was not located, so its licence is not recorded; or this paper's copy is cleared, but the stored copy of the same code that Syntology serves is not. Some licences outside that list permit redistribution, such as WTFPL, and GPL-3.0 under its conditions; they are simply not on the list. Hover a licence label for the reason. File links open the file on GitHub at the default branch, which may have changed since the harvest.

A function or class name links to its page when the name occurs in the harvested code of at least 5 papers; the name is a string, not an identity. A census tag appears when Syntology's census ran implementations with that name on one shared input per bucket: it gives how many were compared, from how many papers, and how many distinct outputs they produced, and names this sample's bucket when this sample was one of them.

josefhoppe/cell-flower official repository 9 samples, 8 ran (0 instrument-failed) · 1 unverified
bfs_spanning_tree src/cell_flower/spanning_trees.py ran MIT (permissive) · aa9039661fa8dfa7 · report fixture: signature rnd:Generator/0/?, node_incidences:dict/0/?, edge_count:int/0/int, root_node:int/0/int, flows:ndarray/2/float, st_id:int/0/int · returned tuple · level recorded 2026-09-24
calc_edges src/cell_flower/cell_complex.py ran MIT (permissive) · c26eb6d88946a405 · report fixture: signature cell:tuple/1/int · returned list · level recorded 2026-09-24
cell_to_index src/cell_flower/cell_complex.py ran MIT (permissive) · 9ca9d9501b9cd410 · report fixture: signature cell:tuple/1/str, node_index_map:dict/0/? · returned tuple · level recorded 2026-09-25
neg_part src/cell_flower/matrix_utils.py ran fingerprinted MIT (permissive) · 5a15bff5b376d77d · report fixture: signature matrix:ndarray/2/float · returned ndarray · level recorded 2026-09-24
normalize in 638 papers
census: 70 implementations from 82 papers, 51 distinct outputs across 11 buckets, one shared input per bucket
src/cell_flower/matrix_utils.py ran fingerprinted MIT (permissive) · 6aadfa53b07d83e9 · report fixture: signature matrix:ndarray/2/float · returned ndarray · level recorded 2026-09-24
normalize_cell src/cell_flower/cell_complex.py ran fingerprinted MIT (permissive) · bd7f79ec3f8cdcd2 · report fixture: signature cell:tuple/1/int · returned tuple · level recorded 2026-09-24
pos_part src/cell_flower/matrix_utils.py ran fingerprinted MIT (permissive) · d877469132df0819 · report fixture: signature matrix:ndarray/2/float · returned ndarray · level recorded 2026-09-24
project_flow src/cell_flower/detection.py ran fingerprinted MIT (permissive) · 80da60b0ee33aa1c · report fixture: signature A:ndarray/2/float, flow:ndarray/1/float · returned ndarray · level recorded 2026-09-24
dfs_spanning_tree src/cell_flower/spanning_trees.py unverified MIT (permissive) · 78007ef0b136d662 · report
josefhoppe/edge-flow-cell-complexes official repository 1 sample, 1 ran (0 instrument-failed) · 0 unverified
coinsizes workflow/helper.py ran fingerprinted MIT (permissive) · b37b7450d2c17669 · report fixture: signature lower:int/0/int, upper:int/0/int · returned list · level recorded 2026-09-24

Tasks

Inference OptimizationRepresentation Learning

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