pith. sign in

arxiv: 2606.27987 · v1 · pith:VSWWCMWFnew · submitted 2026-06-26 · 🧮 math.CO

Maniplexes as a Foundation for Cross-Linked Databases of Symmetric Objects

Katja Ber\v{c}i\v{c} , Gabe Cunningham , Andr\'es David Santamar\'ia-Galvis , Jano\v{s} Vidali This is my paper

Pith reviewed 2026-06-29 03:55 UTC · model grok-4.3

classification 🧮 math.CO
keywords maniplexesabstract polytopesmaps on surfacesgraphsdatabase interoperabilityedge-labeled graphscanonical formsregular structures
0
0 comments X

The pith

Maniplexes provide a unifying framework for graphs, maps on surfaces, and abstract polytopes that enables a single interoperable database.

A machine-rendered reading of the paper's core claim, the machinery that carries it, and where it could break.

The paper argues that maniplexes can serve as a common structure capturing graphs, maps, and polytopes studied by separate communities. It introduces a compact format for storing maniplexes as edge-labeled graphs to support cross-linking of databases. This approach connects two datasets of regular 4-maniplexes to existing graph databases using canonical forms. A shared database would let researchers spot common structures and move results between fields without re-deriving them. The format is designed to be interoperable from the start.

Core claim

Maniplexes unify graphs, maps on surfaces, and abstract polytopes. The authors present an edge-labeled graph format for storing them that is compact and interoperable, and demonstrate it by linking two existing datasets of regular 4-maniplexes to the House of Graphs and to tetravalent graph censuses through canonical forms of their flag graphs, 1-skeleton graphs, and 1-coskeleton graphs.

What carries the argument

The edge-labeled graph representation of maniplexes, which encodes the combinatorial structure in a way that supports canonical forms and database interoperability.

If this is right

  • Existing datasets from different communities can be cross-referenced using canonical representations.
  • Results about regular structures in one domain become directly applicable to equivalent objects in another.
  • A single database can store and query all these symmetric objects without duplication.
  • Researchers gain tools to recognize when a graph, map, or polytope is the same object under different names.

Where Pith is reading between the lines

These are editorial extensions of the paper, not claims the author makes directly.

  • Adoption of this format could lead to automated tools that scan multiple databases for isomorphisms.
  • This unification might extend naturally to higher-dimensional or irregular cases beyond the regular 4-maniplexes shown.
  • Cross-linking could reveal previously unnoticed dualities or symmetries across the fields.

Load-bearing premise

That the edge-labeled graph format will be adopted by the different research communities studying these objects.

What would settle it

If attempts to connect additional datasets using the proposed format fail to produce consistent canonical forms that match known equivalences between structures.

Figures

Figures reproduced from arXiv: 2606.27987 by Andr\'es David Santamar\'ia-Galvis, Gabe Cunningham, Jano\v{s} Vidali, Katja Ber\v{c}i\v{c}.

Figure 1
Figure 1. Figure 1: The cycle graph C5 with its arcs represented as arrows pointing away from the source vertex. The dihedral group generated by the rotation by one vertex and a reflection acts transitively on vertices and arcs. generating set S = S −1 not containing the identity: its vertex set is Γ, with an edge {g, gs} for each g ∈ Γ and s ∈ S. Since Γ acts on itself by left multiplication, every Cayley graph is vertex-tra… view at source ↗
Figure 2
Figure 2. Figure 2: The cube graph and its embedding on a sphere. The highlighted triangle shows the flag (1, 12, 1234). graph on a closed surface such that each face is homeomorphic to an open disk. Equivalently, a map can be described combinatorially by its set of flags—triples (v, e, f) of a mutually incident vertex v, edge e, and face f—together with three fixed-point-free involutions r0, r1, r2 acting on flags, where ri … view at source ↗
Figure 3
Figure 3. Figure 3: The cube as an abstract polytope. The blue (solid) flag, (∅, 1, 12, 1234, P), is adjacent to the red (dashed) flag (∅, 1, 14, 1234, P). The ranks of facets are shown on the right for convenience [PITH_FULL_IMAGE:figures/full_fig_p004_3.png] view at source ↗
Figure 4
Figure 4. Figure 4: The cube with faces of the flag (∅, 1, 12, 1234, P) highlighted [PITH_FULL_IMAGE:figures/full_fig_p004_4.png] view at source ↗
Figure 5
Figure 5. Figure 5: The flag graph of the cube. The edges of colors 0, 1, and 2 are shown in red (dashed), blue (dotted), and green (solid), respectively. The edges of colors 0 and 2 form 4-cycles, corresponding to edges in the cube; the edges of colors 1 and 2 form 6-cycles, corresponding to the vertices of the cube; and the edges of colors 0 and 1 form 8-cycles, corresponding to the faces of the cube. The vertices of a mani… view at source ↗
Figure 6
Figure 6. Figure 6: Distribution of graphs by order in each database, showing orders up to 640. The only dataset extending beyond this range is the 2-arc-transitive census, where graphs are very rare. Graphs are grouped into buckets of 5 consecutive orders for better visualization. 2. We use RAMP to compute the flag graph of each maniplex and nauty to compute its canonical form. 3. Each flag graph is encoded as an lsparse6 st… view at source ↗
Figure 7
Figure 7. Figure 7: A schematic diagram of the cross-linked dataset. Each maniplex entry (with its lsparse6 encoding) is linked to one or more graph entries (with their sparse6 encodings) via the canonical forms of the underlying graph, 1-skeleton, and 1-coskeleton. The graph table also includes graph-theoretic invariants. 5.2 Cross-Linking Results We now summarize the results of the cross-linking pipeline for the 32 634 ma￾n… view at source ↗
read the original abstract

Graphs, maps on surfaces, and abstract polytopes are related combinatorial structures that tend to be studied by different communities using their own tools and databases. Maniplexes provide a unifying framework that captures all of them. A single database built around maniplexes would help researchers recognize shared structures and translate results across fields. Here we present a compact, interoperable format for storing maniplexes as edge-labeled graphs, designed with such a database in mind. As a first step, we connect two existing datasets of regular 4-maniplexes to the House of Graphs and to Poto\v{c}nik's tetravalent graph censuses, using canonical forms of their flag graphs, 1-skeleton graphs, and 1-coskeleton graphs.

Editorial analysis

A structured set of objections, weighed in public.

Desk editor's note, referee report, simulated authors' rebuttal, and a circularity audit. Tearing a paper down is the easy half of reading it; the pith above is the substance, this is the friction.

Referee Report

0 major / 2 minor

Summary. The manuscript proposes maniplexes as a unifying combinatorial framework that captures graphs, maps on surfaces, and abstract polytopes. It presents a compact, interoperable format for representing maniplexes as edge-labeled graphs, intended to support a single cross-linked database. As a concrete demonstration, the work connects two existing censuses of regular 4-maniplexes to the House of Graphs and to Potočnik's tetravalent graph censuses by means of canonical forms of their flag graphs, 1-skeleton graphs, and 1-coskeleton graphs.

Significance. If the proposed format and linking method prove workable, the paper supplies a practical infrastructure step that could improve interoperability among communities studying symmetric combinatorial objects. The explicit cross-references via canonical flag, 1-skeleton, and 1-coskeleton forms constitute a verifiable strength and illustrate the framework's utility without overclaiming completed translations of results across fields.

minor comments (2)
  1. Abstract: the string 'Poto\v{c}nik's' appears to contain an unrendered LaTeX command; confirm that the name renders correctly as 'Potočnik's' throughout the manuscript.
  2. The description of the edge-labeled graph format would benefit from an explicit small example (e.g., a 3-maniplex or 4-maniplex with its labeled edges) to clarify the encoding conventions for readers outside the immediate community.

Simulated Author's Rebuttal

0 responses · 0 unresolved

We thank the referee for the positive summary and significance assessment of our work on maniplexes and the proposed storage format. The recommendation for minor revision is noted; we will incorporate any editorial or minor clarifications in the revised version.

Circularity Check

0 steps flagged

Framework proposal with no derivation chain or fitted predictions

full rationale

The manuscript proposes an edge-labeled graph format for storing maniplexes and demonstrates concrete cross-references between existing 4-maniplex censuses and graph databases via canonical flag, 1-skeleton, and 1-coskeleton forms. No equations, derivations, predictions of new quantities, or parameter fittings appear. The central claim is that maniplexes unify the structures and the proposed format enables interoperability; this is presented as an infrastructure step rather than a closed mathematical argument. No load-bearing step reduces by construction to its own inputs, and any self-citations are not invoked to justify uniqueness or force a result. The paper is self-contained against external benchmarks as a proposal.

Axiom & Free-Parameter Ledger

0 free parameters · 0 axioms · 0 invented entities

Abstract-only review; no explicit free parameters, axioms, or invented entities are stated.

pith-pipeline@v0.9.1-grok · 5672 in / 1014 out tokens · 38885 ms · 2026-06-29T03:55:49.277688+00:00 · methodology

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.

Reference graph

Works this paper leans on

32 extracted references · 11 canonical work pages

  1. [1]

    https://www.math.mun.ca/distanceregular/, accessed: 2026

    Bailey, R.: DistanceRegular.org. https://www.math.mun.ca/distanceregular/, accessed: 2026

    2026

  2. [2]

    http://bridge.imfm.si/projects/symob/ (2026), accessed: 2026

    Berčič, K., Cunningham, G., Santamaría-Galvis, A.D.: Cross-linked dataset of symmetric objects. http://bridge.imfm.si/projects/symob/ (2026), accessed: 2026

    2026

  3. [3]

    https://discretezoo.xyz, accessed: 2026

    Berčič, K., Vidali, J.: DiscreteZOO: A database of discrete combinatorial objects. https://discretezoo.xyz, accessed: 2026

    2026

  4. [4]

    Berčič, K., Vidali, J.: Labelled graph formats – lsparse6.https://github.com/ DiscreteZOO/Computations/wiki/Labelled-graph-formats#lsparse6, accessed: 2026

    2026

  5. [5]

    Math- ematics in Computer Science14, 559–575 (2020)

    Berčič, K., Vidali, J.: DiscreteZOO: A fingerprint database of discrete objects. Math- ematics in Computer Science14, 559–575 (2020). https://doi.org/10.1007/s11786- 020-00453-5

    work page doi:10.1007/s11786- 2020

  6. [6]

    International Journal of Algebra and Computation12(05), 623–644 (2002)

    Besche, H.U., Eick, B., O’Brien, E.A.: A millennium project: Constructing small groups. International Journal of Algebra and Computation12(05), 623–644 (2002). https://doi.org/10.1142/S0218196702001115

    work page doi:10.1142/s0218196702001115 2002

  7. [7]

    Discrete Applied Mathematics161(1–2), 311–320 (2013)

    Brinkmann, G., Coolsaet, K., De Boeck, J., Goedgebeur, H.: House of Graphs: A database of interesting graphs. Discrete Applied Mathematics161(1–2), 311–320 (2013). https://doi.org/10.1016/j.dam.2012.07.018

    work page doi:10.1016/j.dam.2012.07.018 2013

  8. [8]

    https://www.math.auckland.ac.nz/~conder/, ac- cessed: 2026

    Conder, M.: Lists of regular maps, hypermaps and polytopes, trivalent symmetric graphs, and surface actions. https://www.math.auckland.ac.nz/~conder/, ac- cessed: 2026

    2026

  9. [9]

    https://doi.org/10.5281/zenodo.8060684

    Cunningham, G., Mixer, M., Williams, G.: RAMP, the research assistant for maniplexes and polytopes, Version 0.8.0.https://github.com/SupposeNot/RAMP (2023). https://doi.org/10.5281/zenodo.8060684

    work page doi:10.5281/zenodo.8060684 2023

  10. [10]

    Cunningham, G., Mochán, E., Montero, A., Potočnik, P., Toledo, M.: Faithfulness in maniplexes, submitted 2025

    2025

  11. [11]

    https://doi.org/10.5281/zenodo.19323533 Cross-Linked Databases of Symmetric Objects 15

    Cunningham, G., Montero, A., Potočnik, P., Toledo, M.: Rotary 4-maniplexes with rotation group of order 3550 or less (2026). https://doi.org/10.5281/zenodo.19323533 Cross-Linked Databases of Symmetric Objects 15

    work page doi:10.5281/zenodo.19323533 2026

  12. [12]

    com/chiral/, accessed: 2026

    Hartley, M.I.: An atlas of small chiral polytopes.http://www.abstract-polytopes. com/chiral/, accessed: 2026

    2026

  13. [13]

    http://www

    Hartley, M.I.: An atlas of small regular polytopes. http://www. abstract-polytopes.com/atlas/, accessed: 2026

    2026

  14. [14]

    http://www

    Hartley, M.I.: Polytopes derived from sporadic simple groups. http://www. abstract-polytopes.com/sporpolys/, accessed: 2026

    2026

  15. [15]

    Combinatorica43(2), 385–420 (2023)

    Hubard, I., Mochán, E., Montero, A.: Voltage operations on maniplexes, polytopes and maps. Combinatorica43(2), 385–420 (2023). https://doi.org/10.1007/s00493- 023-00018-7

    work page doi:10.1007/s00493- 2023

  16. [16]

    Ars Mathe- matica Contemporanea25(1), Paper No

    Leemans, D., Toledo, M.: Faithful and thin non-polytopal maniplexes. Ars Mathe- matica Contemporanea25(1), Paper No. 4, 17 (2025)

    2025

  17. [17]

    cecs.anu.edu.au/~bdm/data/formats.txt(2022), accessed: 2026

    McKay, B.: Description of graph6, sparse6 and digraph6 encodings.https://users. cecs.anu.edu.au/~bdm/data/formats.txt(2022), accessed: 2026

    2022

  18. [18]

    Journal of Symbolic Computation60, 94–112 (2014)

    McKay, B.D., Piperno, A.: Practical graph isomorphism, II. Journal of Symbolic Computation60, 94–112 (2014). https://doi.org/10.1016/j.jsc.2013.09.003

    work page doi:10.1016/j.jsc.2013.09.003 2014

  19. [19]

    McMullen, P., Schulte, E.: Abstract Regular Polytopes, Encyclopedia of Math- ematics and its Applications, vol. 92. Cambridge University Press (2002). https://doi.org/10.1017/CBO9780511546686

    work page doi:10.1017/cbo9780511546686 2002

  20. [20]

    Nedela, R.: Maps, hypermaps and related topics.https://www.savbb.sk/~nedela/ CMbook.pdf(2007)

    2007

  21. [21]

    Pellicer, D.: Abstract Chiral Polytopes, New Mathematical Monographs, vol. 49. Cambridge University Press (2025)

    2025

  22. [22]

    Pisanski, T., Marušič, D., Potočnik, P., Orbanić, A., Horvat, B., Lukšič, P.: Ency- clopedia of graphs.http://atlas.gregas.eu/, accessed: 2026

    2026

  23. [23]

    Potočnik, P.: A list of 4-valent 2-arc-transitive graphs and finite faithful amalgams of index (4, 2). Eur. J. Comb.30, 1323–1336 (2009)

    2009

  24. [24]

    net(2024), accessed: 2026

    Potočnik, P.: Graphsym: Datasets of highly symmetric graphs.https://graphsym. net(2024), accessed: 2026

    2024

  25. [25]

    Potočnik, P., Spiga, P., Verret, G.: Cubic vertex-transitive graphs on up to 1280 vertices. J. Symbolic Comput.50, 465–477 (2013)

    2013

  26. [26]

    Potočnik, P., Spiga, P., Verret, G.: Bounding the order of the vertex-stabiliser in 3-valent vertex-transitive and 4-valent arc-transitive graphs. J. Combin. Theory Ser. B111, 148–180 (2015)

    2015

  27. [27]

    Potočnik, P., Wilson, S.E.: Census of edge-transitive tetravalent graphs.https: //jan.ucc.nau.edu/~swilson/C4FullSite/index.html, accessed: 2026

    2026

  28. [28]

    The Art of Discrete and Applied Mathematics3(1), #P1.08 (2020)

    Potočnik, P., Wilson, S.E.: Recipes for edge-transitive tetravalent graphs. The Art of Discrete and Applied Mathematics3(1), #P1.08 (2020). https://doi.org/10.26493/2590-9770.1269.732

    work page doi:10.26493/2590-9770.1269.732 2020

  29. [29]

    https://www.gap-system.org(2022)

    The GAP Group: GAP – Groups, Algorithms, and Programming, Version 4.12. https://www.gap-system.org(2022)

    2022

  30. [30]

    Vauthier, L., Leemans, D.: An atlas of abstract regular polytopes for small al- most simple groups.https://www.math.auckland.ac.nz/~dleemans/polytopes/, accessed: 2026

    2026

  31. [31]

    Sym- metry4(2), 265–275 (2012)

    Wilson, S.E.: Maniplexes: Part 1: Maps, polytopes, symmetry and operators. Sym- metry4(2), 265–275 (2012). https://doi.org/10.3390/sym4020265

    work page doi:10.3390/sym4020265 2012

  32. [32]

    Mathematics Magazine89(4), 267 (2016)

    Wood, J.: Proof without words: The automorphism group of the Petersen graph is isomorphic to s5. Mathematics Magazine89(4), 267 (2016). https://doi.org/10.4169/math.mag.89.4.267

    work page doi:10.4169/math.mag.89.4.267 2016