{"as_of":"2026-08-23T11:36:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:ab0b8071227eb12d151dd749ccded735094f74f1ec0ce93c83e9575bd9df56c6","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-23T06:30:58.430688+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-09T04:29:08.540061Z","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:b925c1d112c3e0f05a0b950787fbe2f3d50da21188672f800b10d2a9cd61433e","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-09T04:29:08.540061Z","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:ec69938e189de90e17873121c8d4617a6fe4c83618c53fdb1a470609a40e402a","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-09T04:29:08.540061Z","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:7f287ab21eef021ed2dfe8af475389ed89f943c72b72aa1ac5acb743a85b9cfa","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-09T04:29:08.540061Z","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:c3a918731c8d8fde6bac0df5a7c105410d01eb9485e336b0f4809827251c63ce","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-09T04:29:08.540061Z","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:1db4a4b2568c899f250c56828bb8c0777dc62b02854c1a3d677361c47e20dbf4","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-09T04:29:08.540061Z","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:f6075b70b52391809dc738a9cff2d93b79976b0049595049538172e69b287331","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-09T04:29:08.540061Z","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:2b1abe03ce3f4821506747180b880bf7498da87054765d13986117c263dc10e2","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-09T04:29:08.540061Z","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:491b34880b9db8bbd1d71f12c15d50da89f9f1698374b1d3e6976362418013aa","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-09T04:29:08.540061Z","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:8579521d82ed0f02ce8b389e0b5678cb694423cf40820bd632ad890eba24c05c","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-09T04:29:08.540061Z","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:39e5f3f728e0711c3018db8dd2859965a599adac87cae1d68a21ea48f7e8eb75","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-09T04:29:08.540061Z","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:3c641298661533984db9fbde9f59c903d432c6f2e5f47137b3e21ad34fab8553","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-09T04:29:08.540061Z","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:f2c3a7072bdd5644566cfd5878b4c6b31091d4c4ea751b066d955efb44104de5","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-09T04:29:08.540061Z","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:0323c8b74118b44424b043e4ead1f5cc484ecc6b1a397ea7822c700647affb81","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-09T04:29:08.540061Z","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:649a9b189507abf694bd0968b70142332fe324a720b19db4f5ac4251b65d5d70","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-09T04:29:08.540061Z","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:ba46eda452643bf652550ae93adcc7f96385d662e634c3c7b6c4990f34fa09c0","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-09T04:29:08.540061Z","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:4a985257a5f98818e771c5ee5f393d3a5a0e96388e7c409024a37f6700a62e5f","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-09T04:29:08.540061Z","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:cd2c1ffe66863c883909aa01d8a713f3bfa9ef8d0d7e690ee4883c403fb7d598","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-09T04:29:08.540061Z","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:95f735125e05377868d3e9ceacd1ba621dd896b8e6e996ef31184ebf774adbe0","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-09T04:29:08.540061Z","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:b96df55e2b1b83eca8d4bc54c148d9d252f844c36a2be002032676b4677148f5","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-09T04:29:08.540061Z","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:a47eaf8bf5cd089e49b050e96fc438b35c7da7f098b07a68db31992cae43c39b","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-09T04:29:08.540061Z","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:0bd42f87e8b9ba8129f421796a9ef21b30e940ab195763d518c2010a4141547b","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-09T04:29:08.540061Z","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:7d1b8fe417077f4fd3da204b82e3b1805b453dcdaf7ae92094e8f6e59b9d942f","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-09T04:29:08.540061Z","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:4a853fcb3378f19697039e7d7320d56b70a7c05051732aa715b60e35b6265008","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-09T04:29:08.540061Z","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:97ddf505c849d8bea62567a5d51f2c655cb411722be0bd096205fbe239c973be","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-09T04:29:08.540061Z","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:cfe4baba03a0ef485f3a94dc09d019c45a8c225a65ecfa8df999d3b5bfaacd66","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-09T04:29:08.540061Z","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:5f3b2af8ca059c6af127c3872ec5c8397083f162956f3e6d4686ddaca6e1b16c","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-09T04:29:08.540061Z","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:48c476d78985dcbcd1f9aefa61bd5ebfa363044523f8bb6abe1cebd3ffcbd2c1","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-09T04:29:08.540061Z","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:72874fbd28bff412741f57e38497d58de426950ef9c7f543f9b5574351c978e7","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-09T04:28:33.551440Z","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-09T04:29:08.540061Z","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:b43ee3b8eef18719202a6d3183ac06fcd7b1176dd45ad0a3b2d9961e6aadbf6f","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-09T04:29:08.540061Z","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:716390688afb0eb6e8effec9e04e18daee501a19b68143f2d14df773630acb5f","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-09T04:29:08.540061Z","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:f452d6a0889455e5af93ac2ee58e5700b48dd140cc2970fddaf5adf06c6d0b7e","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-09T04:29:08.540061Z","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:f2bfa496a50872396d1a586364c13618748f085762368cd2c93dde8738dc865a","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-09T04:29:08.540061Z","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:9d84d84d06bf3b51368ebdbf02d7d02a3aeac5b1f0770b7a91636ee69d542a2c","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-09T04:29:08.540061Z","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:b46ebce6df29af939c9efebfc3c48a62fb1d141f2156cf79c1114ea974b1ae0d","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-09T04:29:08.540061Z","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:cae94d8e7d4339d91bd2a177e6b89f632c9bfbc84244b71295c9dceb16ae6d8f","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-09T04:29:08.540061Z","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:58e130be3ff30509957e724e0bb05080ecd01cd20326d3920d1fe2a3410ac9ac","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-09T04:29:08.540061Z","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:246275ec949e6525a187e5d01d398a5fce4ee50adbf4c18881f712784a605329","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-09T04:29:08.540061Z","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:b737fd8fe4634db23a6617b02e9957b373270ed16cb5e124d6951cf6fdcb3b9a","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-09T04:29:08.540061Z","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:1895e5f259c65e28642b5d1c55222f24f52bb0e33afadb9c35681422a7acd5a0","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-09T04:29:08.540061Z","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:727f7f32ba3cadb8ff792c0d7ebc32ac676350a1969588a1946a696d14c0ef20","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-09T04:29:08.540061Z","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:bad0b556c2dcd12d6f411c935476f351e69d491cbb189135d77922210924e663","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-09T04:29:08.540061Z","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:5205014966c1f800bf04dfb05a15ceb9fbf6dffe45eb9ff747a9eb836f97d82e","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-09T04:29:08.540061Z","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-23T06:30:58.430688+00:00","source":"crossref"},{"observed_at":"2026-08-23T06:30:53.778098+00:00","source":"retraction_watch"}],"thesis":"As of 23 August 2026, this Paper Citation Record lists 42 of 42 outbound references and 0 inbound Pith citation observations for arXiv:2607.03608."}