Paper Citation Record · LEDGER

The Informational Cost of Structure: Representational Complexity in Networked Dynamical Systems

As of 8 August 2026, this Paper Citation Record lists 42 of 42 outbound references and 0 inbound Pith citation observations for arXiv:2607.03608.

A citation records a reference. It does not transfer a finding from one paper to another.

pith.paper-citation-record.v1
2607.03608 v1

Coverage vector

measured 42 of 42 reference resolution

Typed states for the displayed outbound observations.

Source: paper_references, paper_reference_links, observed 2026-07-12T01:14:12.466888Z

measured 42 of 42 standing notices

One-hop event checks from named stored sources.

Source: scholarly_work_events, retraction_status_cache, observed 2026-08-08T06:32:00.761636+00:00

measured 0 of 0 inbound itemization

Pith citing papers itemized under the disclosed page cap.

Source: paper_references, paper_reference_links

measured 0 of 1 external citation measurements

A source-named dated measurement, never combined with another source.

Source: cited_works

Reference resolution

42 of 42 outbound references displayed

verified exact0
verified fuzzy0
unresolved42
parse uncertain0
malformed identifier0
metadata mismatch0

External citation measurements

No source-named external measurement is stored.

Outbound references

Observation ec84cc22-ef04-4ee5-81fd-47031e62ee2e · outbound

This paper cites an unresolved cited work.

The Informational Cost of Structure: Representational Complexity in Networked Dynamical Systems Unresolved cited work

Reference 1

Resolution: unresolved; no resolver link, observed 2026-07-12T01:14:12.466888Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 30fbeb6a-1a45-4c7d-80be-ef4cdd7cc3ba · outbound

This paper cites S∈ L ) and D is constrained to belong to an admissible class of computable dynamical rules C (i.e.

The Informational Cost of Structure: Representational Complexity in Networked Dynamical Systems S∈ L ) and D is constrained to belong to an admissible class of computable dynamical rules C (i.e

Reference 2

Resolution: unresolved; no resolver link, observed 2026-07-12T01:14:12.466888Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation b609f609-3c7e-4e7f-b8d1-4954633d32c6 · outbound

This paper cites an unresolved cited work.

The Informational Cost of Structure: Representational Complexity in Networked Dynamical Systems Unresolved cited work

Reference 3

Resolution: unresolved; no resolver link, observed 2026-07-12T01:14:12.466888Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 1d17d024-0a1e-4f3c-85a9-f2d92c5b03f2 · outbound

This paper cites an unresolved cited work.

The Informational Cost of Structure: Representational Complexity in Networked Dynamical Systems Unresolved cited work

Reference 4

Resolution: unresolved; no resolver link, observed 2026-07-12T01:14:12.466888Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation f4c91bff-163c-4bc5-9a5b-5935dc5e5b25 · outbound

This paper cites an unresolved cited work.

The Informational Cost of Structure: Representational Complexity in Networked Dynamical Systems Unresolved cited work

Reference 5

Resolution: unresolved; no resolver link, observed 2026-07-12T01:14:12.466888Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation e7172b25-baaf-4b78-9a10-85a47c4e4d50 · outbound

This paper cites all k-subsets of each neighborhood.

The Informational Cost of Structure: Representational Complexity in Networked Dynamical Systems all k-subsets of each neighborhood

Reference 6

Resolution: unresolved; no resolver link, observed 2026-07-12T01:14:12.466888Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 3d8c41eb-b960-4836-8508-ca3223238831 · outbound

This paper cites Oxford university press, 2018.

The Informational Cost of Structure: Representational Complexity in Networked Dynamical Systems Oxford university press, 2018

Reference 7

Resolution: unresolved; no resolver link, observed 2026-07-12T01:14:12.466888Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation ff66dd0b-28aa-4c1a-bdfd-3c47a09cd09e · outbound

This paper cites Network science.Philosophical Transactions of the Royal Society A: Mathematical, Physical and Engineering Sciences, 371(1987):20120375, 2013.

The Informational Cost of Structure: Representational Complexity in Networked Dynamical Systems Network science.Philosophical Transactions of the Royal Society A: Mathematical, Physical and Engineering Sciences, 371(1987):20120375, 2013

Reference 8

Resolution: unresolved; no resolver link, observed 2026-07-12T01:14:12.466888Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 74be915a-814b-4ce9-9160-b912ccdf08d9 · outbound

This paper cites Strogatz.

The Informational Cost of Structure: Representational Complexity in Networked Dynamical Systems Strogatz

Reference 9

Resolution: unresolved; no resolver link, observed 2026-07-12T01:14:12.466888Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 732cb02d-92ee-45e3-83fe-297dbaf683af · outbound

This paper cites Oliveira, Gonzalo Travieso, Francisco Aparecido Rodrigues, Paulino Ribeiro Villas Boas, Lucas Antiqueira, Matheus Palhares Viana, and Luis Enrique Correa da Rocha.

The Informational Cost of Structure: Representational Complexity in Networked Dynamical Systems Oliveira, Gonzalo Travieso, Francisco Aparecido Rodrigues, Paulino Ribeiro Villas Boas, Lucas Antiqueira, Matheus Palhares Viana, and Luis Enrique Correa da Rocha

Reference 10

Resolution: unresolved; no resolver link, observed 2026-07-12T01:14:12.466888Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 8d15e0ca-c1ca-454f-a3a7-46b9a3d30a01 · outbound

This paper cites Boccaletti, V.

The Informational Cost of Structure: Representational Complexity in Networked Dynamical Systems Boccaletti, V

Reference 11

Resolution: unresolved; no resolver link, observed 2026-07-12T01:14:12.466888Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 942a64d9-94cf-46fa-ace7-e460f08bd445 · outbound

This paper cites Twenty years of network science.Nature, 558:528–529, 2018.

The Informational Cost of Structure: Representational Complexity in Networked Dynamical Systems Twenty years of network science.Nature, 558:528–529, 2018

Reference 12

Resolution: unresolved; no resolver link, observed 2026-07-12T01:14:12.466888Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 21bd767f-630a-49aa-bc98-1d48bff928a7 · outbound

This paper cites Blevins, Danielle Bassett, and Tina Eliassi-Rad.

The Informational Cost of Structure: Representational Complexity in Networked Dynamical Systems Blevins, Danielle Bassett, and Tina Eliassi-Rad

Reference 13

Resolution: unresolved; no resolver link, observed 2026-07-12T01:14:12.466888Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 98eae5fa-fd0e-475b-96e4-9a2fe1cebc72 · outbound

This paper cites Networks beyond pairwise interactions: Structure and dynamics.Physics Reports, 874:1–92, 2020.

The Informational Cost of Structure: Representational Complexity in Networked Dynamical Systems Networks beyond pairwise interactions: Structure and dynamics.Physics Reports, 874:1–92, 2020

Reference 14

Resolution: unresolved; no resolver link, observed 2026-07-12T01:14:12.466888Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation b3bd08eb-731e-4ab8-8d07-6721e35f5c22 · outbound

This paper cites Harrington, and Michael T.

The Informational Cost of Structure: Representational Complexity in Networked Dynamical Systems Harrington, and Michael T

Reference 15

Resolution: unresolved; no resolver link, observed 2026-07-12T01:14:12.466888Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 163730cf-0b02-44a1-92f9-6151d465bfa8 · outbound

This paper cites From networks to optimal higher-order models of complex systems.

The Informational Cost of Structure: Representational Complexity in Networked Dynamical Systems From networks to optimal higher-order models of complex systems

Reference 16

Resolution: unresolved; no resolver link, observed 2026-07-12T01:14:12.466888Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 872e1dc5-ffc4-4a87-b296-b02eb05ba011 · outbound

This paper cites The physics of higher-order interactions in complex systems.

The Informational Cost of Structure: Representational Complexity in Networked Dynamical Systems The physics of higher-order interactions in complex systems

Reference 17

Resolution: unresolved; no resolver link, observed 2026-07-12T01:14:12.466888Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 4575d3c7-dff1-49a2-8a65-771b9836e0a3 · outbound

This paper cites an unresolved cited work.

The Informational Cost of Structure: Representational Complexity in Networked Dynamical Systems Unresolved cited work

Reference 18

Resolution: unresolved; no resolver link, observed 2026-07-12T01:14:12.466888Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation b035eb20-ffe0-438e-8470-d6c1083e35ed · outbound

This paper cites Gleeson, Yamir Moreno, and Mason A.

The Informational Cost of Structure: Representational Complexity in Networked Dynamical Systems Gleeson, Yamir Moreno, and Mason A

Reference 19

Resolution: unresolved; no resolver link, observed 2026-07-12T01:14:12.466888Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 60a62515-5d0a-4e48-85e2-15d7009e76ef · outbound

This paper cites Temporal networks.Physics Reports, 519(3):97–125, 2012.

The Informational Cost of Structure: Representational Complexity in Networked Dynamical Systems Temporal networks.Physics Reports, 519(3):97–125, 2012

Reference 20

Resolution: unresolved; no resolver link, observed 2026-07-12T01:14:12.466888Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 1ef887d2-a178-4ed8-93a5-30d2ba78cd7d · outbound

This paper cites Peixoto, Leto Peel, Thilo Gross, and Manlio De Domenico.

The Informational Cost of Structure: Representational Complexity in Networked Dynamical Systems Peixoto, Leto Peel, Thilo Gross, and Manlio De Domenico

Reference 21

Resolution: unresolved; no resolver link, observed 2026-07-12T01:14:12.466888Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 2ecaf426-8331-4064-b2e1-292cafe78a8b · outbound

This paper cites Exploring the Non-uniqueness of Node Co-occurrence Matrices of Hypergraphs.

The Informational Cost of Structure: Representational Complexity in Networked Dynamical Systems Exploring the Non-uniqueness of Node Co-occurrence Matrices of Hypergraphs

Reference 22

Resolution: unresolved; no resolver link, observed 2026-07-12T01:14:12.466888Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation fafbd44d-ad7b-46be-9d3f-9c694043742f · outbound

This paper cites On the equivalence between nonlinear graph-based dynamics and linear dynamics on higher-order networks.

The Informational Cost of Structure: Representational Complexity in Networked Dynamical Systems On the equivalence between nonlinear graph-based dynamics and linear dynamics on higher-order networks

Reference 23

Resolution: unresolved; no resolver link, observed 2026-07-12T01:14:12.466888Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 8d2ca57e-8de7-4a47-a171-2212c1d04647 · outbound

This paper cites Reducibility of higher-order to pairwise interactions: Social impact models on hypergraphs.Physical Review Research, 2026.

The Informational Cost of Structure: Representational Complexity in Networked Dynamical Systems Reducibility of higher-order to pairwise interactions: Social impact models on hypergraphs.Physical Review Research, 2026

Reference 24

Resolution: unresolved; no resolver link, observed 2026-07-12T01:14:12.466888Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 1344d1fb-7697-40f5-842d-ec82f321c46d · outbound

This paper cites Modeling by shortest data description.Automatica, 14(5):465–471, 1978.

The Informational Cost of Structure: Representational Complexity in Networked Dynamical Systems Modeling by shortest data description.Automatica, 14(5):465–471, 1978

Reference 25

Resolution: unresolved; no resolver link, observed 2026-07-12T01:14:12.466888Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation beed4b92-eeae-46be-8404-8661910b1c82 · outbound

This paper cites The minimum description length principle in coding and modeling.IEEE transactions on information theory, 44(6):2743–2760, 1998.

The Informational Cost of Structure: Representational Complexity in Networked Dynamical Systems The minimum description length principle in coding and modeling.IEEE transactions on information theory, 44(6):2743–2760, 1998

Reference 26

Resolution: unresolved; no resolver link, observed 2026-07-12T01:14:12.466888Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 15ae4bf2-28f3-4dfd-93a9-a0307680050c · outbound

This paper cites Gr¨ unwald.The Minimum Description Length Principle.

The Informational Cost of Structure: Representational Complexity in Networked Dynamical Systems Gr¨ unwald.The Minimum Description Length Principle

Reference 27

Resolution: unresolved; no resolver link, observed 2026-07-12T01:14:12.466888Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation a82df1ac-457b-464b-be67-be8fbb9604ef · outbound

This paper cites Contagion dynamics on higher-order networks.Nature Reviews Physics, 6(8):468–482, 2024.

The Informational Cost of Structure: Representational Complexity in Networked Dynamical Systems Contagion dynamics on higher-order networks.Nature Reviews Physics, 6(8):468–482, 2024

Reference 28

Resolution: unresolved; no resolver link, observed 2026-07-12T01:14:12.466888Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation f8ce8989-30d5-4c7b-85ba-0758e2d804bd · outbound

This paper cites Defining and classifying models of groups: The social ontology of higher-order networks.

The Informational Cost of Structure: Representational Complexity in Networked Dynamical Systems Defining and classifying models of groups: The social ontology of higher-order networks

Reference 29

Resolution: unresolved; no resolver link, observed 2026-07-12T01:14:12.466888Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation b9ee4297-9b12-485a-8a09-5d76e46852e3 · outbound

This paper cites Hypergraphs and simplicial complexes in focus: A roadmap for future research in higher-order interactions.Journal of Physics: Complexity, 2026.

The Informational Cost of Structure: Representational Complexity in Networked Dynamical Systems Hypergraphs and simplicial complexes in focus: A roadmap for future research in higher-order interactions.Journal of Physics: Complexity, 2026

Reference 30

Resolution: unresolved; no resolver link, observed 2026-07-12T01:14:12.466888Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 3406b1bc-10f3-4a7d-bd89-572175b50a47 · outbound

This paper cites A new look at the statistical model identification.IEEE Transactions on Automatic Control, 19(6):716–723, 1974.

The Informational Cost of Structure: Representational Complexity in Networked Dynamical Systems A new look at the statistical model identification.IEEE Transactions on Automatic Control, 19(6):716–723, 1974

Reference 31

Resolution: unresolved; no resolver link, observed 2026-07-12T01:14:12.466888Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation f241e816-9963-41fe-8e55-ac0a05846b4c · outbound

This paper cites On structural identifiability.Mathematical Biosciences, 7(3):329–339, 1970.

The Informational Cost of Structure: Representational Complexity in Networked Dynamical Systems On structural identifiability.Mathematical Biosciences, 7(3):329–339, 1970

Reference 32

Resolution: unresolved; no resolver link, observed 2026-07-12T01:14:12.466888Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation bd3e0ee0-8355-4699-be07-313198ac3525 · outbound

This paper cites an unresolved cited work.

The Informational Cost of Structure: Representational Complexity in Networked Dynamical Systems Unresolved cited work

Reference 33

Resolution: unresolved; no resolver link, observed 2026-07-12T01:14:12.466888Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 02b6d255-1acc-4e73-b82f-767bf8e393c7 · outbound

This paper cites an unresolved cited work.

The Informational Cost of Structure: Representational Complexity in Networked Dynamical Systems Unresolved cited work

Reference 34

Resolution: unresolved; no resolver link, observed 2026-07-12T01:14:12.466888Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 98b49c70-6877-4d1d-9c3b-c41e293b3134 · outbound

This paper cites Tromp, and Paul M.

The Informational Cost of Structure: Representational Complexity in Networked Dynamical Systems Tromp, and Paul M

Reference 35

Resolution: unresolved; no resolver link, observed 2026-07-12T01:14:12.466888Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 84002947-c5c2-426d-abee-0e469fb244d2 · outbound

This paper cites an unresolved cited work.

The Informational Cost of Structure: Representational Complexity in Networked Dynamical Systems Unresolved cited work

Reference 36

Resolution: unresolved; no resolver link, observed 2026-07-12T01:14:12.466888Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 4f8720ff-062d-47ff-b27b-7376a30eddce · outbound

This paper cites OR over neighbors.

The Informational Cost of Structure: Representational Complexity in Networked Dynamical Systems OR over neighbors

Reference 37

Resolution: unresolved; no resolver link, observed 2026-07-12T01:14:12.466888Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 91d1ad92-86d2-4952-9965-8c3504f79894 · outbound

This paper cites an unresolved cited work.

The Informational Cost of Structure: Representational Complexity in Networked Dynamical Systems Unresolved cited work

Reference 38

Resolution: unresolved; no resolver link, observed 2026-07-12T01:14:12.466888Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 00834411-c329-4c4d-bfa3-fa7b552c03cf · outbound

This paper cites Graph cost.The structure is the adjacency, with P i |Ai| incidences, hence L(G) =P i |Ai|logN.

The Informational Cost of Structure: Representational Complexity in Networked Dynamical Systems Graph cost.The structure is the adjacency, with P i |Ai| incidences, hence L(G) =P i |Ai|logN

Reference 39

Resolution: unresolved; no resolver link, observed 2026-07-12T01:14:12.466888Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation cf278e19-7dd8-4aee-9424-d9eab1203a27 · outbound

This paper cites Graph cost.The edge list costs L(G) = 2|E|logN (two labels per edge), equivalently P i |Ai|logN = 2|E|logN since each edge contributes two incidences.

The Informational Cost of Structure: Representational Complexity in Networked Dynamical Systems Graph cost.The edge list costs L(G) = 2|E|logN (two labels per edge), equivalently P i |Ai|logN = 2|E|logN since each edge contributes two incidences

Reference 40

Resolution: unresolved; no resolver link, observed 2026-07-12T01:14:12.466888Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 69920da0-be9b-473d-869c-6ae0e62eab23 · outbound

This paper cites The hypergraph of operative groups isH={A i}N i=1.

The Informational Cost of Structure: Representational Complexity in Networked Dynamical Systems The hypergraph of operative groups isH={A i}N i=1

Reference 41

Resolution: unresolved; no resolver link, observed 2026-07-12T01:14:12.466888Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation f7ff575a-de00-42e2-8e1f-3232954eec66 · outbound

This paper cites Hypergraph cost.The structure lists M size-k edges, so L(H) = M klogN.

The Informational Cost of Structure: Representational Complexity in Networked Dynamical Systems Hypergraph cost.The structure lists M size-k edges, so L(H) = M klogN

Reference 42

Resolution: unresolved; no resolver link, observed 2026-07-12T01:14:12.466888Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Pith citing papers

No inbound Pith citation observations are available.