{"as_of":"2026-08-08T23:02:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:fb407e0ae615d1838da967a66a1715b58e3fbbd91aaa3dea847ec3bb81fceb9c","coverage":[{"denominator":42,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":42,"source":"paper_references, paper_reference_links","source_observed_at":"2026-07-12T01:14:12.466888Z","state":"measured"},{"denominator":42,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":42,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-08T06:32:00.761636+00:00","state":"measured"},{"denominator":0,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":0,"source":"paper_references, paper_reference_links","source_observed_at":null,"state":"measured"},{"denominator":1,"lane":"external_citation_measurements","note":"A source-named dated measurement, never combined with another source.","records_observed":0,"source":"cited_works","source_observed_at":null,"state":"measured"}],"external_citation_measurements":[],"inbound":[],"links":{"evidence":"/evidence","html":"/paper/2607.03608/citation-record","integrity":"/paper/2607.03608/integrity","json":"/paper/2607.03608/citation-record.json","paper":"/paper/2607.03608"},"outbound":[{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-12T01:14:12.466888Z","title":null,"venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.03608","last_updated":"2026-07-03T21:41:30Z","snapshot_observed_at":"2026-08-08T20:55:45.286301Z","submitted_at":"2026-07-03T21:41:30Z","title":"The Informational Cost of Structure: Representational Complexity in Networked Dynamical Systems","version":1},"reference_index":1,"source":"pdf_text","source_observed_at":"2026-07-12T01:14:12.466888Z"},"links":{"citing_paper":"/paper/2607.03608"},"observation_digest":"sha256:a53dddcafe7e969ef02d47a8e8c55ebd03b66995c12eef82c7f381a5bf659a8f","observation_id":"ec84cc22-ef04-4ee5-81fd-47031e62ee2e","resolution":{"observed_at":"2026-07-12T01:14:12.466888Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-12T01:14:12.466888Z","title":"S∈ L ) and D is constrained to belong to an admissible class of computable dynamical rules C (i.e","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.03608","last_updated":"2026-07-03T21:41:30Z","snapshot_observed_at":"2026-08-08T20:55:45.286301Z","submitted_at":"2026-07-03T21:41:30Z","title":"The Informational Cost of Structure: Representational Complexity in Networked Dynamical Systems","version":1},"reference_index":2,"source":"pdf_text","source_observed_at":"2026-07-12T01:14:12.466888Z"},"links":{"citing_paper":"/paper/2607.03608"},"observation_digest":"sha256:7c327162f5695f16ec42c0f4e60cc2d9622c3eb8604a6c5843656e0d65f24963","observation_id":"30fbeb6a-1a45-4c7d-80be-ef4cdd7cc3ba","resolution":{"observed_at":"2026-07-12T01:14:12.466888Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-12T01:14:12.466888Z","title":null,"venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.03608","last_updated":"2026-07-03T21:41:30Z","snapshot_observed_at":"2026-08-08T20:55:45.286301Z","submitted_at":"2026-07-03T21:41:30Z","title":"The Informational Cost of Structure: Representational Complexity in Networked Dynamical Systems","version":1},"reference_index":3,"source":"pdf_text","source_observed_at":"2026-07-12T01:14:12.466888Z"},"links":{"citing_paper":"/paper/2607.03608"},"observation_digest":"sha256:bf27ea0320558e3d0f79e94b9ff6c203b376204bf7fa0b23e1b95723e11ff42e","observation_id":"b609f609-3c7e-4e7f-b8d1-4954633d32c6","resolution":{"observed_at":"2026-07-12T01:14:12.466888Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-12T01:14:12.466888Z","title":null,"venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.03608","last_updated":"2026-07-03T21:41:30Z","snapshot_observed_at":"2026-08-08T20:55:45.286301Z","submitted_at":"2026-07-03T21:41:30Z","title":"The Informational Cost of Structure: Representational Complexity in Networked Dynamical Systems","version":1},"reference_index":4,"source":"pdf_text","source_observed_at":"2026-07-12T01:14:12.466888Z"},"links":{"citing_paper":"/paper/2607.03608"},"observation_digest":"sha256:1e565e811b7f3a9f9f62b436902ee04f8ada9704124d756f031fcbbb20e4e603","observation_id":"1d17d024-0a1e-4f3c-85a9-f2d92c5b03f2","resolution":{"observed_at":"2026-07-12T01:14:12.466888Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-12T01:14:12.466888Z","title":null,"venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.03608","last_updated":"2026-07-03T21:41:30Z","snapshot_observed_at":"2026-08-08T20:55:45.286301Z","submitted_at":"2026-07-03T21:41:30Z","title":"The Informational Cost of Structure: Representational Complexity in Networked Dynamical Systems","version":1},"reference_index":5,"source":"pdf_text","source_observed_at":"2026-07-12T01:14:12.466888Z"},"links":{"citing_paper":"/paper/2607.03608"},"observation_digest":"sha256:eaa7f011239d66ca8ba0efd3aaee2ed42ce9b13f2d40550098747a4bfeecd132","observation_id":"f4c91bff-163c-4bc5-9a5b-5935dc5e5b25","resolution":{"observed_at":"2026-07-12T01:14:12.466888Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-12T01:14:12.466888Z","title":"all k-subsets of each neighborhood","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2607.03608","last_updated":"2026-07-03T21:41:30Z","snapshot_observed_at":"2026-08-08T20:55:45.286301Z","submitted_at":"2026-07-03T21:41:30Z","title":"The Informational Cost of Structure: Representational Complexity in Networked Dynamical Systems","version":1},"reference_index":6,"source":"pdf_text","source_observed_at":"2026-07-12T01:14:12.466888Z"},"links":{"citing_paper":"/paper/2607.03608"},"observation_digest":"sha256:470972dfd059d3ce7fce2957cc5c5c26301982abb0324416efe6c0157c76fae5","observation_id":"e7172b25-baaf-4b78-9a10-85a47c4e4d50","resolution":{"observed_at":"2026-07-12T01:14:12.466888Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-12T01:14:12.466888Z","title":"Oxford university press, 2018","venue":null,"work_id":null,"year":2018},"citing_paper":{"arxiv_id":"2607.03608","last_updated":"2026-07-03T21:41:30Z","snapshot_observed_at":"2026-08-08T20:55:45.286301Z","submitted_at":"2026-07-03T21:41:30Z","title":"The Informational Cost of Structure: Representational Complexity in Networked Dynamical Systems","version":1},"reference_index":7,"source":"pdf_text","source_observed_at":"2026-07-12T01:14:12.466888Z"},"links":{"citing_paper":"/paper/2607.03608"},"observation_digest":"sha256:0833ae11439ece0e9946c78fff16e82f68ed0cb94eb9ec47196f162489f05060","observation_id":"3d8c41eb-b960-4836-8508-ca3223238831","resolution":{"observed_at":"2026-07-12T01:14:12.466888Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-12T01:14:12.466888Z","title":"Network science.Philosophical Transactions of the Royal Society A: Mathematical, Physical and Engineering Sciences, 371(1987):20120375, 2013","venue":null,"work_id":null,"year":1987},"citing_paper":{"arxiv_id":"2607.03608","last_updated":"2026-07-03T21:41:30Z","snapshot_observed_at":"2026-08-08T20:55:45.286301Z","submitted_at":"2026-07-03T21:41:30Z","title":"The Informational Cost of Structure: Representational Complexity in Networked Dynamical Systems","version":1},"reference_index":8,"source":"pdf_text","source_observed_at":"2026-07-12T01:14:12.466888Z"},"links":{"citing_paper":"/paper/2607.03608"},"observation_digest":"sha256:a45ae3ebc4e0420f8a23e7d7520b1772337f5aabd486f1d56668017711ffd722","observation_id":"ff66dd0b-28aa-4c1a-bdfd-3c47a09cd09e","resolution":{"observed_at":"2026-07-12T01:14:12.466888Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-12T01:14:12.466888Z","title":"Strogatz","venue":null,"work_id":null,"year":2001},"citing_paper":{"arxiv_id":"2607.03608","last_updated":"2026-07-03T21:41:30Z","snapshot_observed_at":"2026-08-08T20:55:45.286301Z","submitted_at":"2026-07-03T21:41:30Z","title":"The Informational Cost of Structure: Representational Complexity in Networked Dynamical Systems","version":1},"reference_index":9,"source":"pdf_text","source_observed_at":"2026-07-12T01:14:12.466888Z"},"links":{"citing_paper":"/paper/2607.03608"},"observation_digest":"sha256:c30a97fbb342e12a243c6d2343c01a3f569d3ea0aa8304a169a580bb8c325710","observation_id":"74be915a-814b-4ce9-9160-b912ccdf08d9","resolution":{"observed_at":"2026-07-12T01:14:12.466888Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-12T01:14:12.466888Z","title":"Oliveira, Gonzalo Travieso, Francisco Aparecido Rodrigues, Paulino Ribeiro Villas Boas, Lucas Antiqueira, Matheus Palhares Viana, and Luis Enrique Correa da Rocha","venue":null,"work_id":null,"year":2011},"citing_paper":{"arxiv_id":"2607.03608","last_updated":"2026-07-03T21:41:30Z","snapshot_observed_at":"2026-08-08T20:55:45.286301Z","submitted_at":"2026-07-03T21:41:30Z","title":"The Informational Cost of Structure: Representational Complexity in Networked Dynamical Systems","version":1},"reference_index":10,"source":"pdf_text","source_observed_at":"2026-07-12T01:14:12.466888Z"},"links":{"citing_paper":"/paper/2607.03608"},"observation_digest":"sha256:04049dd459880491560eddfcd3b084ba6d63035a5760ea4fa0418fe066de0e79","observation_id":"732cb02d-92ee-45e3-83fe-297dbaf683af","resolution":{"observed_at":"2026-07-12T01:14:12.466888Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-12T01:14:12.466888Z","title":"Boccaletti, V","venue":null,"work_id":null,"year":2006},"citing_paper":{"arxiv_id":"2607.03608","last_updated":"2026-07-03T21:41:30Z","snapshot_observed_at":"2026-08-08T20:55:45.286301Z","submitted_at":"2026-07-03T21:41:30Z","title":"The Informational Cost of Structure: Representational Complexity in Networked Dynamical Systems","version":1},"reference_index":11,"source":"pdf_text","source_observed_at":"2026-07-12T01:14:12.466888Z"},"links":{"citing_paper":"/paper/2607.03608"},"observation_digest":"sha256:e28c83750e2d5e7a63b7d41044019c2430e694997e5539f453192ff7abb66e2a","observation_id":"8d15e0ca-c1ca-454f-a3a7-46b9a3d30a01","resolution":{"observed_at":"2026-07-12T01:14:12.466888Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-12T01:14:12.466888Z","title":"Twenty years of network science.Nature, 558:528–529, 2018","venue":null,"work_id":null,"year":2018},"citing_paper":{"arxiv_id":"2607.03608","last_updated":"2026-07-03T21:41:30Z","snapshot_observed_at":"2026-08-08T20:55:45.286301Z","submitted_at":"2026-07-03T21:41:30Z","title":"The Informational Cost of Structure: Representational Complexity in Networked Dynamical Systems","version":1},"reference_index":12,"source":"pdf_text","source_observed_at":"2026-07-12T01:14:12.466888Z"},"links":{"citing_paper":"/paper/2607.03608"},"observation_digest":"sha256:35d64671141c397ca002ecb26139078fd1d11df0534d4d8f435fd5c1183326cb","observation_id":"942a64d9-94cf-46fa-ace7-e460f08bd445","resolution":{"observed_at":"2026-07-12T01:14:12.466888Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-12T01:14:12.466888Z","title":"Blevins, Danielle Bassett, and Tina Eliassi-Rad","venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2607.03608","last_updated":"2026-07-03T21:41:30Z","snapshot_observed_at":"2026-08-08T20:55:45.286301Z","submitted_at":"2026-07-03T21:41:30Z","title":"The Informational Cost of Structure: Representational Complexity in Networked Dynamical Systems","version":1},"reference_index":13,"source":"pdf_text","source_observed_at":"2026-07-12T01:14:12.466888Z"},"links":{"citing_paper":"/paper/2607.03608"},"observation_digest":"sha256:c1190a01ee4622ddaeb9159dec182331fa84c0f7c8a1b270f0403f53ccba7ae6","observation_id":"21bd767f-630a-49aa-bc98-1d48bff928a7","resolution":{"observed_at":"2026-07-12T01:14:12.466888Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-12T01:14:12.466888Z","title":"Networks beyond pairwise interactions: Structure and dynamics.Physics Reports, 874:1–92, 2020","venue":null,"work_id":null,"year":2020},"citing_paper":{"arxiv_id":"2607.03608","last_updated":"2026-07-03T21:41:30Z","snapshot_observed_at":"2026-08-08T20:55:45.286301Z","submitted_at":"2026-07-03T21:41:30Z","title":"The Informational Cost of Structure: Representational Complexity in Networked Dynamical Systems","version":1},"reference_index":14,"source":"pdf_text","source_observed_at":"2026-07-12T01:14:12.466888Z"},"links":{"citing_paper":"/paper/2607.03608"},"observation_digest":"sha256:20e9c7d44194ab7ae6f76af6b2d10b2c27ede1f177d688b46d82e202d15ee691","observation_id":"98eae5fa-fd0e-475b-96e4-9a2fe1cebc72","resolution":{"observed_at":"2026-07-12T01:14:12.466888Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-12T01:14:12.466888Z","title":"Harrington, and Michael T","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2607.03608","last_updated":"2026-07-03T21:41:30Z","snapshot_observed_at":"2026-08-08T20:55:45.286301Z","submitted_at":"2026-07-03T21:41:30Z","title":"The Informational Cost of Structure: Representational Complexity in Networked Dynamical Systems","version":1},"reference_index":15,"source":"pdf_text","source_observed_at":"2026-07-12T01:14:12.466888Z"},"links":{"citing_paper":"/paper/2607.03608"},"observation_digest":"sha256:23b5a01ff6f247e4f1d711988f131065f7c9ae23bcd07fda16c370f8f7ebce06","observation_id":"b3bd08eb-731e-4ab8-8d07-6721e35f5c22","resolution":{"observed_at":"2026-07-12T01:14:12.466888Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-12T01:14:12.466888Z","title":"From networks to optimal higher-order models of complex systems","venue":null,"work_id":null,"year":2019},"citing_paper":{"arxiv_id":"2607.03608","last_updated":"2026-07-03T21:41:30Z","snapshot_observed_at":"2026-08-08T20:55:45.286301Z","submitted_at":"2026-07-03T21:41:30Z","title":"The Informational Cost of Structure: Representational Complexity in Networked Dynamical Systems","version":1},"reference_index":16,"source":"pdf_text","source_observed_at":"2026-07-12T01:14:12.466888Z"},"links":{"citing_paper":"/paper/2607.03608"},"observation_digest":"sha256:baa8279e004c18461c0d5a13edc311b8c51d5ce5e2f9991d6a9cfa93811a874a","observation_id":"163730cf-0b02-44a1-92f9-6151d465bfa8","resolution":{"observed_at":"2026-07-12T01:14:12.466888Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-12T01:14:12.466888Z","title":"The physics of higher-order interactions in complex systems","venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2607.03608","last_updated":"2026-07-03T21:41:30Z","snapshot_observed_at":"2026-08-08T20:55:45.286301Z","submitted_at":"2026-07-03T21:41:30Z","title":"The Informational Cost of Structure: Representational Complexity in Networked Dynamical Systems","version":1},"reference_index":17,"source":"pdf_text","source_observed_at":"2026-07-12T01:14:12.466888Z"},"links":{"citing_paper":"/paper/2607.03608"},"observation_digest":"sha256:d41a762a850818992c353537a4f0a49afd15c79b8d528e182c7514acb3b6f148","observation_id":"872e1dc5-ffc4-4a87-b296-b02eb05ba011","resolution":{"observed_at":"2026-07-12T01:14:12.466888Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-12T01:14:12.466888Z","title":null,"venue":null,"work_id":null,"year":2009},"citing_paper":{"arxiv_id":"2607.03608","last_updated":"2026-07-03T21:41:30Z","snapshot_observed_at":"2026-08-08T20:55:45.286301Z","submitted_at":"2026-07-03T21:41:30Z","title":"The Informational Cost of Structure: Representational Complexity in Networked Dynamical Systems","version":1},"reference_index":18,"source":"pdf_text","source_observed_at":"2026-07-12T01:14:12.466888Z"},"links":{"citing_paper":"/paper/2607.03608"},"observation_digest":"sha256:2b9a690736a95596d5157f1b79fb21857c0cad7ab3c3fc73302500f2b3498739","observation_id":"4575d3c7-dff1-49a2-8a65-771b9836e0a3","resolution":{"observed_at":"2026-07-12T01:14:12.466888Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-12T01:14:12.466888Z","title":"Gleeson, Yamir Moreno, and Mason A","venue":null,"work_id":null,"year":2014},"citing_paper":{"arxiv_id":"2607.03608","last_updated":"2026-07-03T21:41:30Z","snapshot_observed_at":"2026-08-08T20:55:45.286301Z","submitted_at":"2026-07-03T21:41:30Z","title":"The Informational Cost of Structure: Representational Complexity in Networked Dynamical Systems","version":1},"reference_index":19,"source":"pdf_text","source_observed_at":"2026-07-12T01:14:12.466888Z"},"links":{"citing_paper":"/paper/2607.03608"},"observation_digest":"sha256:5340789f5865a312440e779a85371d65447f31d4317bbc0cba24284f4781525a","observation_id":"b035eb20-ffe0-438e-8470-d6c1083e35ed","resolution":{"observed_at":"2026-07-12T01:14:12.466888Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-12T01:14:12.466888Z","title":"Temporal networks.Physics Reports, 519(3):97–125, 2012","venue":null,"work_id":null,"year":2012},"citing_paper":{"arxiv_id":"2607.03608","last_updated":"2026-07-03T21:41:30Z","snapshot_observed_at":"2026-08-08T20:55:45.286301Z","submitted_at":"2026-07-03T21:41:30Z","title":"The Informational Cost of Structure: Representational Complexity in Networked Dynamical Systems","version":1},"reference_index":20,"source":"pdf_text","source_observed_at":"2026-07-12T01:14:12.466888Z"},"links":{"citing_paper":"/paper/2607.03608"},"observation_digest":"sha256:f822e22cc9b26ea6e60c78228e28fc24434c9b60297a8d76d1c74086cbfd70b6","observation_id":"60a62515-5d0a-4e48-85e2-15d7009e76ef","resolution":{"observed_at":"2026-07-12T01:14:12.466888Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-12T01:14:12.466888Z","title":"Peixoto, Leto Peel, Thilo Gross, and Manlio De Domenico","venue":null,"work_id":null,"year":2026},"citing_paper":{"arxiv_id":"2607.03608","last_updated":"2026-07-03T21:41:30Z","snapshot_observed_at":"2026-08-08T20:55:45.286301Z","submitted_at":"2026-07-03T21:41:30Z","title":"The Informational Cost of Structure: Representational Complexity in Networked Dynamical Systems","version":1},"reference_index":21,"source":"pdf_text","source_observed_at":"2026-07-12T01:14:12.466888Z"},"links":{"citing_paper":"/paper/2607.03608"},"observation_digest":"sha256:02eb0e6047fdf00b1da8ca1148e723fd301dc14901a15ac60a028d0d72d93696","observation_id":"1ef887d2-a178-4ed8-93a5-30d2ba78cd7d","resolution":{"observed_at":"2026-07-12T01:14:12.466888Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2506.01479","last_updated":"2025-06-20T13:30:47Z","snapshot_observed_at":"2026-08-07T11:37:52.351538Z","submitted_at":"2025-06-02T09:37:43Z","title":"Exploring the Non-uniqueness of Node Co-occurrence Matrices of Hypergraphs","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2506.01479","snapshot_observed_at":"2026-07-12T01:14:12.466888Z","title":"Exploring the non-uniqueness of node co-occurrence matrices of hypergraphs","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2607.03608","last_updated":"2026-07-03T21:41:30Z","snapshot_observed_at":"2026-08-08T20:55:45.286301Z","submitted_at":"2026-07-03T21:41:30Z","title":"The Informational Cost of Structure: Representational Complexity in Networked Dynamical Systems","version":1},"reference_index":22,"source":"pdf_text","source_observed_at":"2026-07-12T01:14:12.466888Z"},"links":{"cited_paper":"/paper/2506.01479","citing_paper":"/paper/2607.03608"},"observation_digest":"sha256:fec4d1b47615be4801123d0cfde9b74bfcb725abe113a619d9df8c3ce8eac7e6","observation_id":"2ecaf426-8331-4064-b2e1-292cafe78a8b","resolution":{"observed_at":"2026-07-12T01:14:12.466888Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-12T01:14:12.466888Z","title":"On the equivalence between nonlinear graph-based dynamics and linear dynamics on higher-order networks","venue":null,"work_id":null,"year":2026},"citing_paper":{"arxiv_id":"2607.03608","last_updated":"2026-07-03T21:41:30Z","snapshot_observed_at":"2026-08-08T20:55:45.286301Z","submitted_at":"2026-07-03T21:41:30Z","title":"The Informational Cost of Structure: Representational Complexity in Networked Dynamical Systems","version":1},"reference_index":23,"source":"pdf_text","source_observed_at":"2026-07-12T01:14:12.466888Z"},"links":{"citing_paper":"/paper/2607.03608"},"observation_digest":"sha256:88f45f5aff60983e3d3269aae3dbea5d85e623d4ec20142adf3244523089897f","observation_id":"fafbd44d-ad7b-46be-9d3f-9c694043742f","resolution":{"observed_at":"2026-07-12T01:14:12.466888Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-12T01:14:12.466888Z","title":"Reducibility of higher-order to pairwise interactions: Social impact models on hypergraphs.Physical Review Research, 2026","venue":null,"work_id":null,"year":2026},"citing_paper":{"arxiv_id":"2607.03608","last_updated":"2026-07-03T21:41:30Z","snapshot_observed_at":"2026-08-08T20:55:45.286301Z","submitted_at":"2026-07-03T21:41:30Z","title":"The Informational Cost of Structure: Representational Complexity in Networked Dynamical Systems","version":1},"reference_index":24,"source":"pdf_text","source_observed_at":"2026-07-12T01:14:12.466888Z"},"links":{"citing_paper":"/paper/2607.03608"},"observation_digest":"sha256:2abf4c697895ded48f2224cf552af9aa96f49b29bb67c2941695094e62f9bb94","observation_id":"8d2ca57e-8de7-4a47-a171-2212c1d04647","resolution":{"observed_at":"2026-07-12T01:14:12.466888Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-12T01:14:12.466888Z","title":"Modeling by shortest data description.Automatica, 14(5):465–471, 1978","venue":null,"work_id":null,"year":1978},"citing_paper":{"arxiv_id":"2607.03608","last_updated":"2026-07-03T21:41:30Z","snapshot_observed_at":"2026-08-08T20:55:45.286301Z","submitted_at":"2026-07-03T21:41:30Z","title":"The Informational Cost of Structure: Representational Complexity in Networked Dynamical Systems","version":1},"reference_index":25,"source":"pdf_text","source_observed_at":"2026-07-12T01:14:12.466888Z"},"links":{"citing_paper":"/paper/2607.03608"},"observation_digest":"sha256:e35aa5f15017a01c4c6939580b92825282f0d4ed5cf4e46bd6b490d4ee7dafcb","observation_id":"1344d1fb-7697-40f5-842d-ec82f321c46d","resolution":{"observed_at":"2026-07-12T01:14:12.466888Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-12T01:14:12.466888Z","title":"The minimum description length principle in coding and modeling.IEEE transactions on information theory, 44(6):2743–2760, 1998","venue":null,"work_id":null,"year":1998},"citing_paper":{"arxiv_id":"2607.03608","last_updated":"2026-07-03T21:41:30Z","snapshot_observed_at":"2026-08-08T20:55:45.286301Z","submitted_at":"2026-07-03T21:41:30Z","title":"The Informational Cost of Structure: Representational Complexity in Networked Dynamical Systems","version":1},"reference_index":26,"source":"pdf_text","source_observed_at":"2026-07-12T01:14:12.466888Z"},"links":{"citing_paper":"/paper/2607.03608"},"observation_digest":"sha256:903fa47c87370d4b65443f1585ba144e162b2da0081a88a817efa3501b581ffa","observation_id":"beed4b92-eeae-46be-8404-8661910b1c82","resolution":{"observed_at":"2026-07-12T01:14:12.466888Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-12T01:14:12.466888Z","title":"Gr¨ unwald.The Minimum Description Length Principle","venue":null,"work_id":null,"year":2007},"citing_paper":{"arxiv_id":"2607.03608","last_updated":"2026-07-03T21:41:30Z","snapshot_observed_at":"2026-08-08T20:55:45.286301Z","submitted_at":"2026-07-03T21:41:30Z","title":"The Informational Cost of Structure: Representational Complexity in Networked Dynamical Systems","version":1},"reference_index":27,"source":"pdf_text","source_observed_at":"2026-07-12T01:14:12.466888Z"},"links":{"citing_paper":"/paper/2607.03608"},"observation_digest":"sha256:1c155c6f790f83201a5ae00f64f0c4663ab164a1496c1d6808300b951bd1d2d6","observation_id":"15ae4bf2-28f3-4dfd-93a9-a0307680050c","resolution":{"observed_at":"2026-07-12T01:14:12.466888Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-12T01:14:12.466888Z","title":"Contagion dynamics on higher-order networks.Nature Reviews Physics, 6(8):468–482, 2024","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2607.03608","last_updated":"2026-07-03T21:41:30Z","snapshot_observed_at":"2026-08-08T20:55:45.286301Z","submitted_at":"2026-07-03T21:41:30Z","title":"The Informational Cost of Structure: Representational Complexity in Networked Dynamical Systems","version":1},"reference_index":28,"source":"pdf_text","source_observed_at":"2026-07-12T01:14:12.466888Z"},"links":{"citing_paper":"/paper/2607.03608"},"observation_digest":"sha256:bfd38cd58b257d5c8d5739d0d0e4ce8f6b2c02005e83ad0cd0728d6a294b3bda","observation_id":"a82df1ac-457b-464b-be67-be8fbb9604ef","resolution":{"observed_at":"2026-07-12T01:14:12.466888Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2507.02758","last_updated":"2026-06-04T16:19:22Z","snapshot_observed_at":"2026-08-06T20:19:23.970523Z","submitted_at":"2025-07-03T16:20:52Z","title":"Defining and classifying models of groups: The social ontology of higher-order networks","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2507.02758","snapshot_observed_at":"2026-07-12T01:14:12.466888Z","title":"Defining and classifying models of groups: The social ontology of higher-order networks.arXiv preprint arXiv:2507.02758, 2025","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2607.03608","last_updated":"2026-07-03T21:41:30Z","snapshot_observed_at":"2026-08-08T20:55:45.286301Z","submitted_at":"2026-07-03T21:41:30Z","title":"The Informational Cost of Structure: Representational Complexity in Networked Dynamical Systems","version":1},"reference_index":29,"source":"pdf_text","source_observed_at":"2026-07-12T01:14:12.466888Z"},"links":{"cited_paper":"/paper/2507.02758","citing_paper":"/paper/2607.03608"},"observation_digest":"sha256:c429bda73f1813a9b8c34bd6f53c477f4142bc78b0579a5b368e072d154f2622","observation_id":"f8ce8989-30d5-4c7b-85ba-0758e2d804bd","resolution":{"observed_at":"2026-07-12T01:14:12.466888Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-12T01:14:12.466888Z","title":"Hypergraphs and simplicial complexes in focus: A roadmap for future research in higher-order interactions.Journal of Physics: Complexity, 2026","venue":null,"work_id":null,"year":2026},"citing_paper":{"arxiv_id":"2607.03608","last_updated":"2026-07-03T21:41:30Z","snapshot_observed_at":"2026-08-08T20:55:45.286301Z","submitted_at":"2026-07-03T21:41:30Z","title":"The Informational Cost of Structure: Representational Complexity in Networked Dynamical Systems","version":1},"reference_index":30,"source":"pdf_text","source_observed_at":"2026-07-12T01:14:12.466888Z"},"links":{"citing_paper":"/paper/2607.03608"},"observation_digest":"sha256:58470d22f6173fd7360df17455cdffa146fdf8d0a75623555bcf3b97c591986f","observation_id":"b9ee4297-9b12-485a-8a09-5d76e46852e3","resolution":{"observed_at":"2026-07-12T01:14:12.466888Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-12T01:14:12.466888Z","title":"A new look at the statistical model identification.IEEE Transactions on Automatic Control, 19(6):716–723, 1974","venue":null,"work_id":null,"year":1974},"citing_paper":{"arxiv_id":"2607.03608","last_updated":"2026-07-03T21:41:30Z","snapshot_observed_at":"2026-08-08T20:55:45.286301Z","submitted_at":"2026-07-03T21:41:30Z","title":"The Informational Cost of Structure: Representational Complexity in Networked Dynamical Systems","version":1},"reference_index":31,"source":"pdf_text","source_observed_at":"2026-07-12T01:14:12.466888Z"},"links":{"citing_paper":"/paper/2607.03608"},"observation_digest":"sha256:925aecfd5fa162be3c72e407223dd98924d1b1192ad61a4caec5a0f0b55a4531","observation_id":"3406b1bc-10f3-4a7d-bd89-572175b50a47","resolution":{"observed_at":"2026-07-12T01:14:12.466888Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-12T01:14:12.466888Z","title":"On structural identifiability.Mathematical Biosciences, 7(3):329–339, 1970","venue":null,"work_id":null,"year":1970},"citing_paper":{"arxiv_id":"2607.03608","last_updated":"2026-07-03T21:41:30Z","snapshot_observed_at":"2026-08-08T20:55:45.286301Z","submitted_at":"2026-07-03T21:41:30Z","title":"The Informational Cost of Structure: Representational Complexity in Networked Dynamical Systems","version":1},"reference_index":32,"source":"pdf_text","source_observed_at":"2026-07-12T01:14:12.466888Z"},"links":{"citing_paper":"/paper/2607.03608"},"observation_digest":"sha256:10a372bf48399ad6e796d28b72fcc51413383a6edb8fe86972aab940f66e06ba","observation_id":"f241e816-9963-41fe-8e55-ac0a05846b4c","resolution":{"observed_at":"2026-07-12T01:14:12.466888Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-12T01:14:12.466888Z","title":null,"venue":null,"work_id":null,"year":2000},"citing_paper":{"arxiv_id":"2607.03608","last_updated":"2026-07-03T21:41:30Z","snapshot_observed_at":"2026-08-08T20:55:45.286301Z","submitted_at":"2026-07-03T21:41:30Z","title":"The Informational Cost of Structure: Representational Complexity in Networked Dynamical Systems","version":1},"reference_index":33,"source":"pdf_text","source_observed_at":"2026-07-12T01:14:12.466888Z"},"links":{"citing_paper":"/paper/2607.03608"},"observation_digest":"sha256:8342eaafed25fdc719ce66b549196e7e98be0e5e6896afc7159e3d8415db546c","observation_id":"bd3e0ee0-8355-4699-be07-313198ac3525","resolution":{"observed_at":"2026-07-12T01:14:12.466888Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-12T01:14:12.466888Z","title":null,"venue":null,"work_id":null,"year":2019},"citing_paper":{"arxiv_id":"2607.03608","last_updated":"2026-07-03T21:41:30Z","snapshot_observed_at":"2026-08-08T20:55:45.286301Z","submitted_at":"2026-07-03T21:41:30Z","title":"The Informational Cost of Structure: Representational Complexity in Networked Dynamical Systems","version":1},"reference_index":34,"source":"pdf_text","source_observed_at":"2026-07-12T01:14:12.466888Z"},"links":{"citing_paper":"/paper/2607.03608"},"observation_digest":"sha256:37d9636dc2394edc8cd7705dd33195d3437fb4cb0b2fcd55f379813b24e60331","observation_id":"02b6d255-1acc-4e73-b82f-767bf8e393c7","resolution":{"observed_at":"2026-07-12T01:14:12.466888Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-12T01:14:12.466888Z","title":"Tromp, and Paul M","venue":null,"work_id":null,"year":2001},"citing_paper":{"arxiv_id":"2607.03608","last_updated":"2026-07-03T21:41:30Z","snapshot_observed_at":"2026-08-08T20:55:45.286301Z","submitted_at":"2026-07-03T21:41:30Z","title":"The Informational Cost of Structure: Representational Complexity in Networked Dynamical Systems","version":1},"reference_index":35,"source":"pdf_text","source_observed_at":"2026-07-12T01:14:12.466888Z"},"links":{"citing_paper":"/paper/2607.03608"},"observation_digest":"sha256:8bdafe7e1971820c6f9461f526daf893479a9a3ee442ba16efa4acb541db7b28","observation_id":"98b49c70-6877-4d1d-9c3b-c41e293b3134","resolution":{"observed_at":"2026-07-12T01:14:12.466888Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-12T01:14:12.466888Z","title":null,"venue":null,"work_id":null,"year":2004},"citing_paper":{"arxiv_id":"2607.03608","last_updated":"2026-07-03T21:41:30Z","snapshot_observed_at":"2026-08-08T20:55:45.286301Z","submitted_at":"2026-07-03T21:41:30Z","title":"The Informational Cost of Structure: Representational Complexity in Networked Dynamical Systems","version":1},"reference_index":36,"source":"pdf_text","source_observed_at":"2026-07-12T01:14:12.466888Z"},"links":{"citing_paper":"/paper/2607.03608"},"observation_digest":"sha256:599a5a51674fa526a902eedbaf9e9fa7909ac5128d8144ca92fb7e22026dd6f4","observation_id":"84002947-c5c2-426d-abee-0e469fb244d2","resolution":{"observed_at":"2026-07-12T01:14:12.466888Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-12T01:14:12.466888Z","title":"OR over neighbors","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2607.03608","last_updated":"2026-07-03T21:41:30Z","snapshot_observed_at":"2026-08-08T20:55:45.286301Z","submitted_at":"2026-07-03T21:41:30Z","title":"The Informational Cost of Structure: Representational Complexity in Networked Dynamical Systems","version":1},"reference_index":37,"source":"pdf_text","source_observed_at":"2026-07-12T01:14:12.466888Z"},"links":{"citing_paper":"/paper/2607.03608"},"observation_digest":"sha256:920fd9edc265e7b78ac79ed00801d291cfc555fad8af54246ddfc938230aaacd","observation_id":"4f8720ff-062d-47ff-b27b-7376a30eddce","resolution":{"observed_at":"2026-07-12T01:14:12.466888Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-12T01:14:12.466888Z","title":null,"venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.03608","last_updated":"2026-07-03T21:41:30Z","snapshot_observed_at":"2026-08-08T20:55:45.286301Z","submitted_at":"2026-07-03T21:41:30Z","title":"The Informational Cost of Structure: Representational Complexity in Networked Dynamical Systems","version":1},"reference_index":38,"source":"pdf_text","source_observed_at":"2026-07-12T01:14:12.466888Z"},"links":{"citing_paper":"/paper/2607.03608"},"observation_digest":"sha256:6294d30446800a1b683b14d3ecaa63be8b317b21d4efcbd424e0a58d1cec9e4a","observation_id":"91d1ad92-86d2-4952-9965-8c3504f79894","resolution":{"observed_at":"2026-07-12T01:14:12.466888Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-12T01:14:12.466888Z","title":"Graph cost.The structure is the adjacency, with P i |Ai| incidences, hence L(G) =P i |Ai|logN","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.03608","last_updated":"2026-07-03T21:41:30Z","snapshot_observed_at":"2026-08-08T20:55:45.286301Z","submitted_at":"2026-07-03T21:41:30Z","title":"The Informational Cost of Structure: Representational Complexity in Networked Dynamical Systems","version":1},"reference_index":39,"source":"pdf_text","source_observed_at":"2026-07-12T01:14:12.466888Z"},"links":{"citing_paper":"/paper/2607.03608"},"observation_digest":"sha256:9f1b1baadc470fd6202cd9dbed9bdffd497f21eecefcc9288a82d1d844127bb8","observation_id":"00834411-c329-4c4d-bfa3-fa7b552c03cf","resolution":{"observed_at":"2026-07-12T01:14:12.466888Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-12T01:14:12.466888Z","title":"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","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.03608","last_updated":"2026-07-03T21:41:30Z","snapshot_observed_at":"2026-08-08T20:55:45.286301Z","submitted_at":"2026-07-03T21:41:30Z","title":"The Informational Cost of Structure: Representational Complexity in Networked Dynamical Systems","version":1},"reference_index":40,"source":"pdf_text","source_observed_at":"2026-07-12T01:14:12.466888Z"},"links":{"citing_paper":"/paper/2607.03608"},"observation_digest":"sha256:4e47cb9e22c9c97079d07970dbc7b789b4c0d0150f78504bba1efacac0405d24","observation_id":"cf278e19-7dd8-4aee-9424-d9eab1203a27","resolution":{"observed_at":"2026-07-12T01:14:12.466888Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-12T01:14:12.466888Z","title":"The hypergraph of operative groups isH={A i}N i=1","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.03608","last_updated":"2026-07-03T21:41:30Z","snapshot_observed_at":"2026-08-08T20:55:45.286301Z","submitted_at":"2026-07-03T21:41:30Z","title":"The Informational Cost of Structure: Representational Complexity in Networked Dynamical Systems","version":1},"reference_index":41,"source":"pdf_text","source_observed_at":"2026-07-12T01:14:12.466888Z"},"links":{"citing_paper":"/paper/2607.03608"},"observation_digest":"sha256:b0c45b9676980b3a42f1431d68bb4b6b0c5487133093221354f0c1223d9c705f","observation_id":"69920da0-be9b-473d-869c-6ae0e62eab23","resolution":{"observed_at":"2026-07-12T01:14:12.466888Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-12T01:14:12.466888Z","title":"Hypergraph cost.The structure lists M size-k edges, so L(H) = M klogN","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.03608","last_updated":"2026-07-03T21:41:30Z","snapshot_observed_at":"2026-08-08T20:55:45.286301Z","submitted_at":"2026-07-03T21:41:30Z","title":"The Informational Cost of Structure: Representational Complexity in Networked Dynamical Systems","version":1},"reference_index":42,"source":"pdf_text","source_observed_at":"2026-07-12T01:14:12.466888Z"},"links":{"citing_paper":"/paper/2607.03608"},"observation_digest":"sha256:0e5191334f2624c7cb094d86b8402caef127d7a6278d471727e7619a64f4801e","observation_id":"f7ff575a-de00-42e2-8e1f-3232954eec66","resolution":{"observed_at":"2026-07-12T01:14:12.466888Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"paper":{"arxiv_id":"2607.03608","last_updated":"2026-07-03T21:41:30Z","latest_version":1,"primary_category":"cs.IT","snapshot_observed_at":"2026-08-08T20:55:45.286301Z","submitted_at":"2026-07-03T21:41:30Z","title":"The Informational Cost of Structure: Representational Complexity in Networked Dynamical Systems"},"reference_resolution":{"displayed":42,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":42,"verified_exact":0,"verified_fuzzy":0},"total_outbound_references":42},"refusal":"A citation records a reference. It does not transfer a finding from one paper to another.","schema":"pith.paper-citation-record.v1","standing_sources":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"thesis":"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."}