{"as_of":"2026-08-08T03:08:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:f276a11a610eb3cafb47cb223fce807fe74e9e12aee010e7b7d9c23b38d294a8","coverage":[{"denominator":77,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":77,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-04T07:03:46.181537Z","state":"measured"},{"denominator":79,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":79,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-07T06:34:17.273281+00:00","state":"measured"},{"denominator":2,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":2,"source":"paper_references, paper_reference_links","source_observed_at":"2026-07-12T15:27:56.509683Z","state":"measured"},{"denominator":1,"lane":"external_citation_measurements","note":"A source-named dated measurement, never combined with another source.","records_observed":0,"source":"pith","source_observed_at":"2026-07-01T20:46:14.286417Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2510.27411","last_updated":"2026-06-11T15:02:10Z","snapshot_observed_at":"2026-08-04T07:03:37.783281Z","submitted_at":"2025-10-31T12:00:27Z","title":"Information theory for hypergraph similarity","version":2},"cited_work":{"arxiv_id":"2510.27411","doi":null,"metadata_source":"pith","pith_arxiv_id":"2510.27411","snapshot_observed_at":"2026-07-01T20:46:14.286417Z","title":"Information theory for hypergraph similarity","venue":"physics.soc-ph","work_id":"101278fa-5f95-47d3-891a-06b37950851f","year":2025},"citing_paper":{"arxiv_id":"2606.00893","last_updated":"2026-07-08T09:19:07Z","snapshot_observed_at":"2026-07-12T15:27:55.265310Z","submitted_at":"2026-05-30T20:57:05Z","title":"Hypergraph backboning","version":1},"reference_index":56,"source":"pdf_text","source_observed_at":"2026-06-28T17:39:06.619337Z"},"links":{"cited_paper":"/paper/2510.27411","citing_paper":"/paper/2606.00893"},"observation_digest":"sha256:98823992789a6e70c0ddad02ce921924af98d11af802af4718982c3360eb4b5e","observation_id":"3af2ac1d-878d-4059-abea-2e386ba1ff62","resolution":{"observed_at":"2026-07-01T20:46:14.287757Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2510.27411","last_updated":"2026-06-11T15:02:10Z","snapshot_observed_at":"2026-08-04T07:03:37.783281Z","submitted_at":"2025-10-31T12:00:27Z","title":"Information theory for hypergraph similarity","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2510.27411","snapshot_observed_at":"2026-07-12T15:27:56.509683Z","title":"Felippe, A","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2606.00893","last_updated":"2026-07-08T09:19:07Z","snapshot_observed_at":"2026-07-12T15:27:55.265310Z","submitted_at":"2026-05-30T20:57:05Z","title":"Hypergraph backboning","version":2},"reference_index":56,"source":"pdf_text","source_observed_at":"2026-07-12T15:27:56.509683Z"},"links":{"cited_paper":"/paper/2510.27411","citing_paper":"/paper/2606.00893"},"observation_digest":"sha256:3f263fb41dfab888f90cae6159cb22102d8fc1c6684e5fa962c5c0a5fa4636dd","observation_id":"db46d573-4601-4e77-acab-a32047d84398","resolution":{"observed_at":"2026-07-12T15:27:56.509683Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"links":{"evidence":"/evidence","html":"/paper/2510.27411/citation-record","integrity":"/paper/2510.27411/integrity","json":"/paper/2510.27411/citation-record.json","paper":"/paper/2510.27411"},"outbound":[{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-04T07:03:40.435941Z","title":", B}at random to form the majority affiliation of a new hyperedge","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2510.27411","last_updated":"2026-06-11T15:02:10Z","snapshot_observed_at":"2026-08-04T07:03:37.783281Z","submitted_at":"2025-10-31T12:00:27Z","title":"Information theory for hypergraph similarity","version":2},"reference_index":1,"source":"pdf_text","source_observed_at":"2026-08-04T07:03:40.435941Z"},"links":{"citing_paper":"/paper/2510.27411"},"observation_digest":"sha256:f35e413d979a3be83de07bc572d98ba4c46e25d1211bbcfd5e51e05b053aa00d","observation_id":"a9b11f30-6462-498b-8b01-f28e4ba4d211","resolution":{"observed_at":"2026-08-04T07:03:40.435941Z","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-08-04T07:03:40.523380Z","title":null,"venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2510.27411","last_updated":"2026-06-11T15:02:10Z","snapshot_observed_at":"2026-08-04T07:03:37.783281Z","submitted_at":"2025-10-31T12:00:27Z","title":"Information theory for hypergraph similarity","version":2},"reference_index":2,"source":"pdf_text","source_observed_at":"2026-08-04T07:03:40.523380Z"},"links":{"citing_paper":"/paper/2510.27411"},"observation_digest":"sha256:9d8a2bf9567b7d094c3471a40df616a2cb8de0c66a25f25675930f809078ec86","observation_id":"86e27f69-2087-4355-ac1b-4bf1188edf58","resolution":{"observed_at":"2026-08-04T07:03:40.523380Z","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-08-04T07:03:40.599797Z","title":"detectability transition","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2510.27411","last_updated":"2026-06-11T15:02:10Z","snapshot_observed_at":"2026-08-04T07:03:37.783281Z","submitted_at":"2025-10-31T12:00:27Z","title":"Information theory for hypergraph similarity","version":2},"reference_index":3,"source":"pdf_text","source_observed_at":"2026-08-04T07:03:40.599797Z"},"links":{"citing_paper":"/paper/2510.27411"},"observation_digest":"sha256:4d0340e3ba975900de63a54b87da0fe35fa417dc64b3f4c02c30c36236510edf","observation_id":"2cd72a76-604b-449f-9dd3-2c8ad53fb786","resolution":{"observed_at":"2026-08-04T07:03:40.599797Z","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-08-04T07:03:40.695046Z","title":"De Domenico, V","venue":null,"work_id":null,"year":2015},"citing_paper":{"arxiv_id":"2510.27411","last_updated":"2026-06-11T15:02:10Z","snapshot_observed_at":"2026-08-04T07:03:37.783281Z","submitted_at":"2025-10-31T12:00:27Z","title":"Information theory for hypergraph similarity","version":2},"reference_index":4,"source":"pdf_text","source_observed_at":"2026-08-04T07:03:40.695046Z"},"links":{"citing_paper":"/paper/2510.27411"},"observation_digest":"sha256:8b12d3ce2971b1ada0743c6a29eca0370d2407e002e95a3a94a38789fdc02b7c","observation_id":"1617131e-3a4d-4320-9c60-537f1578e58d","resolution":{"observed_at":"2026-08-04T07:03:40.695046Z","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-08-04T07:03:40.811932Z","title":"Ok, A graph similarity for deep learning.Advances in Neural Information Processing Systems33, 1–12 (2020)","venue":null,"work_id":null,"year":2020},"citing_paper":{"arxiv_id":"2510.27411","last_updated":"2026-06-11T15:02:10Z","snapshot_observed_at":"2026-08-04T07:03:37.783281Z","submitted_at":"2025-10-31T12:00:27Z","title":"Information theory for hypergraph similarity","version":2},"reference_index":5,"source":"pdf_text","source_observed_at":"2026-08-04T07:03:40.811932Z"},"links":{"citing_paper":"/paper/2510.27411"},"observation_digest":"sha256:a1ef3d45de36b7002d3c9b874d91c24ce997c33f83ee5e1602ba276b6a3a02b5","observation_id":"ca6a6d98-f32f-453b-a202-29dbfac22be7","resolution":{"observed_at":"2026-08-04T07:03:40.811932Z","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-08-04T07:03:40.881223Z","title":"Attar and S","venue":null,"work_id":null,"year":2017},"citing_paper":{"arxiv_id":"2510.27411","last_updated":"2026-06-11T15:02:10Z","snapshot_observed_at":"2026-08-04T07:03:37.783281Z","submitted_at":"2025-10-31T12:00:27Z","title":"Information theory for hypergraph similarity","version":2},"reference_index":6,"source":"pdf_text","source_observed_at":"2026-08-04T07:03:40.881223Z"},"links":{"citing_paper":"/paper/2510.27411"},"observation_digest":"sha256:f98a4e01fcf1fb8269a0928fcf0c051f08aeb4b4727a6f78e1e94e5d5628d688","observation_id":"c80844f5-b411-4f85-b3f0-f40f67469301","resolution":{"observed_at":"2026-08-04T07:03:40.881223Z","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-08-04T07:03:41.032000Z","title":"Wills and F","venue":null,"work_id":null,"year":2020},"citing_paper":{"arxiv_id":"2510.27411","last_updated":"2026-06-11T15:02:10Z","snapshot_observed_at":"2026-08-04T07:03:37.783281Z","submitted_at":"2025-10-31T12:00:27Z","title":"Information theory for hypergraph similarity","version":2},"reference_index":7,"source":"pdf_text","source_observed_at":"2026-08-04T07:03:41.032000Z"},"links":{"citing_paper":"/paper/2510.27411"},"observation_digest":"sha256:370f2c1cbce0fb6714b6d3d53fe93ae511fea543c6b2ad453504d4e4d3145955","observation_id":"12e675dc-7605-4f96-8255-e18efedb2c55","resolution":{"observed_at":"2026-08-04T07:03:41.032000Z","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-08-04T07:03:41.115265Z","title":null,"venue":null,"work_id":null,"year":2020},"citing_paper":{"arxiv_id":"2510.27411","last_updated":"2026-06-11T15:02:10Z","snapshot_observed_at":"2026-08-04T07:03:37.783281Z","submitted_at":"2025-10-31T12:00:27Z","title":"Information theory for hypergraph similarity","version":2},"reference_index":8,"source":"pdf_text","source_observed_at":"2026-08-04T07:03:41.115265Z"},"links":{"citing_paper":"/paper/2510.27411"},"observation_digest":"sha256:47c73664f9524b79f4347582258095f759b39606054759f3e49ea5a4a125f51b","observation_id":"5eaf399b-4902-4f79-acf9-2536cf69ae52","resolution":{"observed_at":"2026-08-04T07:03:41.115265Z","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-08-04T07:03:41.190992Z","title":"Sharan and T","venue":null,"work_id":null,"year":2006},"citing_paper":{"arxiv_id":"2510.27411","last_updated":"2026-06-11T15:02:10Z","snapshot_observed_at":"2026-08-04T07:03:37.783281Z","submitted_at":"2025-10-31T12:00:27Z","title":"Information theory for hypergraph similarity","version":2},"reference_index":9,"source":"pdf_text","source_observed_at":"2026-08-04T07:03:41.190992Z"},"links":{"citing_paper":"/paper/2510.27411"},"observation_digest":"sha256:4ee3f60b4708623163c83ea69358e33a8be97ce8437a8facfcdd036cdfd0bb50","observation_id":"4cae5a55-5e33-4725-804e-6da6f64742bb","resolution":{"observed_at":"2026-08-04T07:03:41.190992Z","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-08-04T07:03:41.254037Z","title":"Nikolova and J","venue":null,"work_id":null,"year":2003},"citing_paper":{"arxiv_id":"2510.27411","last_updated":"2026-06-11T15:02:10Z","snapshot_observed_at":"2026-08-04T07:03:37.783281Z","submitted_at":"2025-10-31T12:00:27Z","title":"Information theory for hypergraph similarity","version":2},"reference_index":10,"source":"pdf_text","source_observed_at":"2026-08-04T07:03:41.254037Z"},"links":{"citing_paper":"/paper/2510.27411"},"observation_digest":"sha256:ea75040df16a7166fdc87aa142f9532080bddfdfb60dfbad11decad323a3aaab","observation_id":"951e9057-643d-4eb4-87c4-640d9d8ba0e6","resolution":{"observed_at":"2026-08-04T07:03:41.254037Z","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-08-04T07:03:41.364700Z","title":"Mheich, F","venue":null,"work_id":null,"year":2020},"citing_paper":{"arxiv_id":"2510.27411","last_updated":"2026-06-11T15:02:10Z","snapshot_observed_at":"2026-08-04T07:03:37.783281Z","submitted_at":"2025-10-31T12:00:27Z","title":"Information theory for hypergraph similarity","version":2},"reference_index":11,"source":"pdf_text","source_observed_at":"2026-08-04T07:03:41.364700Z"},"links":{"citing_paper":"/paper/2510.27411"},"observation_digest":"sha256:8340b1dbc09b05bf0d40f06828f21b2d54f1721081ffbe9b40e1a4e14e4e7516","observation_id":"f311f3b8-91aa-49a3-98c5-227deeb42e51","resolution":{"observed_at":"2026-08-04T07:03:41.364700Z","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-08-04T07:03:41.461969Z","title":"Faust and J","venue":null,"work_id":null,"year":2002},"citing_paper":{"arxiv_id":"2510.27411","last_updated":"2026-06-11T15:02:10Z","snapshot_observed_at":"2026-08-04T07:03:37.783281Z","submitted_at":"2025-10-31T12:00:27Z","title":"Information theory for hypergraph similarity","version":2},"reference_index":12,"source":"pdf_text","source_observed_at":"2026-08-04T07:03:41.461969Z"},"links":{"citing_paper":"/paper/2510.27411"},"observation_digest":"sha256:41acd363bed570841cb6944c53433ca946b299b0ed7566605de675edd01ad096","observation_id":"4ffe7d59-5b94-47c0-80a9-75a340f21548","resolution":{"observed_at":"2026-08-04T07:03:41.461969Z","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-08-04T07:03:41.549680Z","title":"Lambiotte, M","venue":null,"work_id":null,"year":2019},"citing_paper":{"arxiv_id":"2510.27411","last_updated":"2026-06-11T15:02:10Z","snapshot_observed_at":"2026-08-04T07:03:37.783281Z","submitted_at":"2025-10-31T12:00:27Z","title":"Information theory for hypergraph similarity","version":2},"reference_index":13,"source":"pdf_text","source_observed_at":"2026-08-04T07:03:41.549680Z"},"links":{"citing_paper":"/paper/2510.27411"},"observation_digest":"sha256:dbe1017b32148723be633e2e4eaaa1803bee85a44f3e5bc22879fcc5182dd2dd","observation_id":"ec3acda0-a8f2-4b33-8e38-94064c7e234c","resolution":{"observed_at":"2026-08-04T07:03:41.549680Z","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-08-04T07:03:41.632077Z","title":"Battiston, G","venue":null,"work_id":null,"year":2020},"citing_paper":{"arxiv_id":"2510.27411","last_updated":"2026-06-11T15:02:10Z","snapshot_observed_at":"2026-08-04T07:03:37.783281Z","submitted_at":"2025-10-31T12:00:27Z","title":"Information theory for hypergraph similarity","version":2},"reference_index":14,"source":"pdf_text","source_observed_at":"2026-08-04T07:03:41.632077Z"},"links":{"citing_paper":"/paper/2510.27411"},"observation_digest":"sha256:0af8002ae13a1d69e3b54265ae967934c162914573acdbc320731b0c592e0d42","observation_id":"3a0b5198-9fe6-4e9f-b400-96bdd44017c4","resolution":{"observed_at":"2026-08-04T07:03:41.632077Z","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-08-04T07:03:41.760146Z","title":"Battiston, E","venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2510.27411","last_updated":"2026-06-11T15:02:10Z","snapshot_observed_at":"2026-08-04T07:03:37.783281Z","submitted_at":"2025-10-31T12:00:27Z","title":"Information theory for hypergraph similarity","version":2},"reference_index":15,"source":"pdf_text","source_observed_at":"2026-08-04T07:03:41.760146Z"},"links":{"citing_paper":"/paper/2510.27411"},"observation_digest":"sha256:f0704208e49c1c5f5dd7911f988f4fdb058b35e39aad368c84334eb02d5f3606","observation_id":"349ce99a-5d72-44b8-83ca-b8e12c9c0623","resolution":{"observed_at":"2026-08-04T07:03:41.760146Z","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-08-04T07:03:41.802597Z","title":"Bianconi,Higher-order networks","venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2510.27411","last_updated":"2026-06-11T15:02:10Z","snapshot_observed_at":"2026-08-04T07:03:37.783281Z","submitted_at":"2025-10-31T12:00:27Z","title":"Information theory for hypergraph similarity","version":2},"reference_index":16,"source":"pdf_text","source_observed_at":"2026-08-04T07:03:41.802597Z"},"links":{"citing_paper":"/paper/2510.27411"},"observation_digest":"sha256:c1a19279c8618cf2bfdcb1b4d61bfbd227d06d445f328d685cf03705c38fafd6","observation_id":"0a7aaaad-d773-4603-85b7-60cef79d4339","resolution":{"observed_at":"2026-08-04T07:03:41.802597Z","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-08-04T07:03:41.948688Z","title":null,"venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2510.27411","last_updated":"2026-06-11T15:02:10Z","snapshot_observed_at":"2026-08-04T07:03:37.783281Z","submitted_at":"2025-10-31T12:00:27Z","title":"Information theory for hypergraph similarity","version":2},"reference_index":17,"source":"pdf_text","source_observed_at":"2026-08-04T07:03:41.948688Z"},"links":{"citing_paper":"/paper/2510.27411"},"observation_digest":"sha256:bc07d0a16e75443af18e00defab1431b9d516ae664d7acb8898ae8317ae2e13e","observation_id":"2f47cf70-aa28-4c8c-b60e-0970b466b540","resolution":{"observed_at":"2026-08-04T07:03:41.948688Z","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-08-04T07:03:42.035063Z","title":"Berge,Hypergraphs: Combinatorics of Finite Sets, volume 45","venue":null,"work_id":null,"year":1984},"citing_paper":{"arxiv_id":"2510.27411","last_updated":"2026-06-11T15:02:10Z","snapshot_observed_at":"2026-08-04T07:03:37.783281Z","submitted_at":"2025-10-31T12:00:27Z","title":"Information theory for hypergraph similarity","version":2},"reference_index":18,"source":"pdf_text","source_observed_at":"2026-08-04T07:03:42.035063Z"},"links":{"citing_paper":"/paper/2510.27411"},"observation_digest":"sha256:e965d5ffbfd2a378a13025dca34c339a8446906006b4c51166037170f6092c3c","observation_id":"6a185671-f495-4828-8e55-ad3db3bae2da","resolution":{"observed_at":"2026-08-04T07:03:42.035063Z","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-08-04T07:03:42.162424Z","title":"Iacopini, G","venue":null,"work_id":null,"year":2019},"citing_paper":{"arxiv_id":"2510.27411","last_updated":"2026-06-11T15:02:10Z","snapshot_observed_at":"2026-08-04T07:03:37.783281Z","submitted_at":"2025-10-31T12:00:27Z","title":"Information theory for hypergraph similarity","version":2},"reference_index":19,"source":"pdf_text","source_observed_at":"2026-08-04T07:03:42.162424Z"},"links":{"citing_paper":"/paper/2510.27411"},"observation_digest":"sha256:8cd7e2e23e1e008d68c8bca6d7f69ff4c63c69c71357c10f4de43787b9bdb48b","observation_id":"6642d664-b4eb-46a9-9cf7-a1b1fbf898cb","resolution":{"observed_at":"2026-08-04T07:03:42.162424Z","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-08-04T07:03:42.267233Z","title":"Neuh¨ auser, A","venue":null,"work_id":null,"year":2020},"citing_paper":{"arxiv_id":"2510.27411","last_updated":"2026-06-11T15:02:10Z","snapshot_observed_at":"2026-08-04T07:03:37.783281Z","submitted_at":"2025-10-31T12:00:27Z","title":"Information theory for hypergraph similarity","version":2},"reference_index":20,"source":"pdf_text","source_observed_at":"2026-08-04T07:03:42.267233Z"},"links":{"citing_paper":"/paper/2510.27411"},"observation_digest":"sha256:7c51dabd88ec6c0d739028b9dc7c958e43d2c18f825c3efb8c654d2d601e21ae","observation_id":"1a8ad402-065e-46b9-a12d-6f1db78ab357","resolution":{"observed_at":"2026-08-04T07:03:42.267233Z","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-08-04T07:03:42.303255Z","title":"Ferraz de Arruda, A","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2510.27411","last_updated":"2026-06-11T15:02:10Z","snapshot_observed_at":"2026-08-04T07:03:37.783281Z","submitted_at":"2025-10-31T12:00:27Z","title":"Information theory for hypergraph similarity","version":2},"reference_index":21,"source":"pdf_text","source_observed_at":"2026-08-04T07:03:42.303255Z"},"links":{"citing_paper":"/paper/2510.27411"},"observation_digest":"sha256:ec975927b96737e382d04b2c852222fb44918cc290ca108729715b45044dc8dd","observation_id":"16141c21-63e5-4c3d-b8c0-fbf4173d251b","resolution":{"observed_at":"2026-08-04T07:03:42.303255Z","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-08-04T07:03:42.381024Z","title":"Di Gaetano, G","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2510.27411","last_updated":"2026-06-11T15:02:10Z","snapshot_observed_at":"2026-08-04T07:03:37.783281Z","submitted_at":"2025-10-31T12:00:27Z","title":"Information theory for hypergraph similarity","version":2},"reference_index":22,"source":"pdf_text","source_observed_at":"2026-08-04T07:03:42.381024Z"},"links":{"citing_paper":"/paper/2510.27411"},"observation_digest":"sha256:c53beffa53b3ccdc218316a73aba5a27ed531cfdbcab4ac705a4fc001fd2118a","observation_id":"a823f012-1b84-4542-9b94-d0757cbdb2dd","resolution":{"observed_at":"2026-08-04T07:03:42.381024Z","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-08-04T07:03:42.505075Z","title":null,"venue":null,"work_id":null,"year":2020},"citing_paper":{"arxiv_id":"2510.27411","last_updated":"2026-06-11T15:02:10Z","snapshot_observed_at":"2026-08-04T07:03:37.783281Z","submitted_at":"2025-10-31T12:00:27Z","title":"Information theory for hypergraph similarity","version":2},"reference_index":23,"source":"pdf_text","source_observed_at":"2026-08-04T07:03:42.505075Z"},"links":{"citing_paper":"/paper/2510.27411"},"observation_digest":"sha256:f684561b99a69a3cd55da5e72c78087870bece3ae985207d0ad87141f8b27720","observation_id":"128d38bc-8643-4a01-bb10-77879433e8d5","resolution":{"observed_at":"2026-08-04T07:03:42.505075Z","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-08-04T07:03:42.600556Z","title":"Zhang, M","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2510.27411","last_updated":"2026-06-11T15:02:10Z","snapshot_observed_at":"2026-08-04T07:03:37.783281Z","submitted_at":"2025-10-31T12:00:27Z","title":"Information theory for hypergraph similarity","version":2},"reference_index":24,"source":"pdf_text","source_observed_at":"2026-08-04T07:03:42.600556Z"},"links":{"citing_paper":"/paper/2510.27411"},"observation_digest":"sha256:26681ed93ef75de3fd1f6317c6cd0c1f6419f06efb05f0ec80c376859a6bf316","observation_id":"dc063795-87b2-4e72-9d97-4e45c486937a","resolution":{"observed_at":"2026-08-04T07:03:42.600556Z","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-08-04T07:03:42.670395Z","title":"Civilini, O","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2510.27411","last_updated":"2026-06-11T15:02:10Z","snapshot_observed_at":"2026-08-04T07:03:37.783281Z","submitted_at":"2025-10-31T12:00:27Z","title":"Information theory for hypergraph similarity","version":2},"reference_index":25,"source":"pdf_text","source_observed_at":"2026-08-04T07:03:42.670395Z"},"links":{"citing_paper":"/paper/2510.27411"},"observation_digest":"sha256:667507f2ba29801bd62ef1417d72b065d36aecfc92dc29552af8705527664363","observation_id":"1fb8d5cf-703b-44a9-bcee-ddd8e0aee572","resolution":{"observed_at":"2026-08-04T07:03:42.670395Z","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-08-04T07:03:42.761686Z","title":null,"venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2510.27411","last_updated":"2026-06-11T15:02:10Z","snapshot_observed_at":"2026-08-04T07:03:37.783281Z","submitted_at":"2025-10-31T12:00:27Z","title":"Information theory for hypergraph similarity","version":2},"reference_index":26,"source":"pdf_text","source_observed_at":"2026-08-04T07:03:42.761686Z"},"links":{"citing_paper":"/paper/2510.27411"},"observation_digest":"sha256:1968a95af5cb92a538d7ea4dbb350fe5b86f67c1ff034307087b39c71562a715","observation_id":"5d904209-9933-41b2-acd5-8b01a3eb24c9","resolution":{"observed_at":"2026-08-04T07:03:42.761686Z","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-08-04T07:03:42.806964Z","title":"Veldt, A","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2510.27411","last_updated":"2026-06-11T15:02:10Z","snapshot_observed_at":"2026-08-04T07:03:37.783281Z","submitted_at":"2025-10-31T12:00:27Z","title":"Information theory for hypergraph similarity","version":2},"reference_index":27,"source":"pdf_text","source_observed_at":"2026-08-04T07:03:42.806964Z"},"links":{"citing_paper":"/paper/2510.27411"},"observation_digest":"sha256:f23815fe0baf09ad09b907055e0b8f1b6702b3846a1a070f484cc42d3d65c0d3","observation_id":"09645a8e-64b0-457e-9b2a-38c2084e57b3","resolution":{"observed_at":"2026-08-04T07:03:42.806964Z","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-08-04T07:03:42.866101Z","title":"Ruggeri, M","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2510.27411","last_updated":"2026-06-11T15:02:10Z","snapshot_observed_at":"2026-08-04T07:03:37.783281Z","submitted_at":"2025-10-31T12:00:27Z","title":"Information theory for hypergraph similarity","version":2},"reference_index":28,"source":"pdf_text","source_observed_at":"2026-08-04T07:03:42.866101Z"},"links":{"citing_paper":"/paper/2510.27411"},"observation_digest":"sha256:b431cdc19dc2910c32009bc725086277da9b2721ee3e274e42697d7411556a0e","observation_id":"d6d266db-6022-4cbe-b3d5-31d3b9f83c70","resolution":{"observed_at":"2026-08-04T07:03:42.866101Z","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-08-04T07:03:42.925143Z","title":"Surana, C","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2510.27411","last_updated":"2026-06-11T15:02:10Z","snapshot_observed_at":"2026-08-04T07:03:37.783281Z","submitted_at":"2025-10-31T12:00:27Z","title":"Information theory for hypergraph similarity","version":2},"reference_index":29,"source":"pdf_text","source_observed_at":"2026-08-04T07:03:42.925143Z"},"links":{"citing_paper":"/paper/2510.27411"},"observation_digest":"sha256:008ad2e92c45503696975d72acc64463346332ebbe60a61b840b81f1798f41d2","observation_id":"c671edd5-6842-4375-bc44-110735590260","resolution":{"observed_at":"2026-08-04T07:03:42.925143Z","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-08-04T07:03:42.986016Z","title":"Martino and A","venue":null,"work_id":null,"year":2020},"citing_paper":{"arxiv_id":"2510.27411","last_updated":"2026-06-11T15:02:10Z","snapshot_observed_at":"2026-08-04T07:03:37.783281Z","submitted_at":"2025-10-31T12:00:27Z","title":"Information theory for hypergraph similarity","version":2},"reference_index":30,"source":"pdf_text","source_observed_at":"2026-08-04T07:03:42.986016Z"},"links":{"citing_paper":"/paper/2510.27411"},"observation_digest":"sha256:acfa29afe89e7e249175e726e85ad06d9b1305be877e413124e9d2f2b2745481","observation_id":"f9bafbec-a188-4b74-814e-e50baaad260b","resolution":{"observed_at":"2026-08-04T07:03:42.986016Z","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-08-04T07:03:43.054094Z","title":"Agostinelli, M","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2510.27411","last_updated":"2026-06-11T15:02:10Z","snapshot_observed_at":"2026-08-04T07:03:37.783281Z","submitted_at":"2025-10-31T12:00:27Z","title":"Information theory for hypergraph similarity","version":2},"reference_index":31,"source":"pdf_text","source_observed_at":"2026-08-04T07:03:43.054094Z"},"links":{"citing_paper":"/paper/2510.27411"},"observation_digest":"sha256:23ede631e8d0f5c1b1e1064fffc1454243ad5915a8f5ecb783f5473ed3fd4c47","observation_id":"e17fdf7c-06ed-489f-b152-0c89a576a18a","resolution":{"observed_at":"2026-08-04T07:03:43.054094Z","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-08-04T07:03:43.117324Z","title":null,"venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2510.27411","last_updated":"2026-06-11T15:02:10Z","snapshot_observed_at":"2026-08-04T07:03:37.783281Z","submitted_at":"2025-10-31T12:00:27Z","title":"Information theory for hypergraph similarity","version":2},"reference_index":32,"source":"pdf_text","source_observed_at":"2026-08-04T07:03:43.117324Z"},"links":{"citing_paper":"/paper/2510.27411"},"observation_digest":"sha256:c74af9741395b8f9ce9e4b16ddc56503dfb8355b49d6f46f8b4bb37682df555a","observation_id":"a13e7168-a3ea-42b5-83fc-8497120a63c2","resolution":{"observed_at":"2026-08-04T07:03:43.117324Z","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-08-04T07:03:43.203434Z","title":null,"venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2510.27411","last_updated":"2026-06-11T15:02:10Z","snapshot_observed_at":"2026-08-04T07:03:37.783281Z","submitted_at":"2025-10-31T12:00:27Z","title":"Information theory for hypergraph similarity","version":2},"reference_index":33,"source":"pdf_text","source_observed_at":"2026-08-04T07:03:43.203434Z"},"links":{"citing_paper":"/paper/2510.27411"},"observation_digest":"sha256:24c6b73f8d19cb7dfc18f8606cb1590caa3d2c2a0c64433a7bb7c45b100212bd","observation_id":"75a8f20b-db99-49e9-bd35-0708bd83f8d7","resolution":{"observed_at":"2026-08-04T07:03:43.203434Z","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-08-04T07:03:43.243032Z","title":"Saito, Hypergraph modeling via spectral embedding connection: Hypergraph cut, weighted kernel k-means, and heat kernel","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2510.27411","last_updated":"2026-06-11T15:02:10Z","snapshot_observed_at":"2026-08-04T07:03:37.783281Z","submitted_at":"2025-10-31T12:00:27Z","title":"Information theory for hypergraph similarity","version":2},"reference_index":34,"source":"pdf_text","source_observed_at":"2026-08-04T07:03:43.243032Z"},"links":{"citing_paper":"/paper/2510.27411"},"observation_digest":"sha256:5587658d786f733abca7c625aa0f92d965ae06c39d131b48e63986ad700799da","observation_id":"4c554c4c-87e9-4729-8dcf-37ffd5896b7b","resolution":{"observed_at":"2026-08-04T07:03:43.243032Z","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-08-04T07:03:43.362288Z","title":null,"venue":null,"work_id":null,"year":2012},"citing_paper":{"arxiv_id":"2510.27411","last_updated":"2026-06-11T15:02:10Z","snapshot_observed_at":"2026-08-04T07:03:37.783281Z","submitted_at":"2025-10-31T12:00:27Z","title":"Information theory for hypergraph similarity","version":2},"reference_index":35,"source":"pdf_text","source_observed_at":"2026-08-04T07:03:43.362288Z"},"links":{"citing_paper":"/paper/2510.27411"},"observation_digest":"sha256:6727396e796c3ad3d68757f5e5450e218b7e061f095cd0e09e16b510399aa647","observation_id":"3c4b39de-ada3-4453-9044-ba36d77b69f7","resolution":{"observed_at":"2026-08-04T07:03:43.362288Z","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-08-04T07:03:43.441612Z","title":"Lugo-Martinez, D","venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2510.27411","last_updated":"2026-06-11T15:02:10Z","snapshot_observed_at":"2026-08-04T07:03:37.783281Z","submitted_at":"2025-10-31T12:00:27Z","title":"Information theory for hypergraph similarity","version":2},"reference_index":36,"source":"pdf_text","source_observed_at":"2026-08-04T07:03:43.441612Z"},"links":{"citing_paper":"/paper/2510.27411"},"observation_digest":"sha256:f8ee379d9c34aec094a9b73422e4323ddc46e134ef247c700a505180d27a49be","observation_id":"83ee904d-f54f-4574-b0b8-b20acc3f2faf","resolution":{"observed_at":"2026-08-04T07:03:43.441612Z","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-08-04T07:03:43.513940Z","title":null,"venue":null,"work_id":null,"year":2003},"citing_paper":{"arxiv_id":"2510.27411","last_updated":"2026-06-11T15:02:10Z","snapshot_observed_at":"2026-08-04T07:03:37.783281Z","submitted_at":"2025-10-31T12:00:27Z","title":"Information theory for hypergraph similarity","version":2},"reference_index":37,"source":"pdf_text","source_observed_at":"2026-08-04T07:03:43.513940Z"},"links":{"citing_paper":"/paper/2510.27411"},"observation_digest":"sha256:a3584ff8775c79d0b54ca8839dbd061908946f02af2046b4cab1d7d8df9bfdc0","observation_id":"54c0d984-3df8-4038-8a89-8960282909ef","resolution":{"observed_at":"2026-08-04T07:03:43.513940Z","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-08-04T07:03:43.576350Z","title":"Rissanen, Modeling by the shortest data description","venue":null,"work_id":null,"year":1978},"citing_paper":{"arxiv_id":"2510.27411","last_updated":"2026-06-11T15:02:10Z","snapshot_observed_at":"2026-08-04T07:03:37.783281Z","submitted_at":"2025-10-31T12:00:27Z","title":"Information theory for hypergraph similarity","version":2},"reference_index":38,"source":"pdf_text","source_observed_at":"2026-08-04T07:03:43.576350Z"},"links":{"citing_paper":"/paper/2510.27411"},"observation_digest":"sha256:d48d2ed2ef7ec335f0b0cfceaacb9762bd59f0124e403f7d5f29df4a346a88d9","observation_id":"e3d7df8e-3d74-46f5-a76f-b4e2436e7a4d","resolution":{"observed_at":"2026-08-04T07:03:43.576350Z","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-08-04T07:03:43.660158Z","title":null,"venue":null,"work_id":null,"year":2019},"citing_paper":{"arxiv_id":"2510.27411","last_updated":"2026-06-11T15:02:10Z","snapshot_observed_at":"2026-08-04T07:03:37.783281Z","submitted_at":"2025-10-31T12:00:27Z","title":"Information theory for hypergraph similarity","version":2},"reference_index":39,"source":"pdf_text","source_observed_at":"2026-08-04T07:03:43.660158Z"},"links":{"citing_paper":"/paper/2510.27411"},"observation_digest":"sha256:0713f717e6ac2cb9b9de9470d8ef38adc2750dc737ce74ba9cde3516b796b43c","observation_id":"323f9fb8-1620-46a7-826b-aac2013b216f","resolution":{"observed_at":"2026-08-04T07:03:43.660158Z","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-08-04T07:03:43.728990Z","title":"Kirkley, Spatial regionalization based on optimal in- formation compression.Communications Physics5(1), 1–10 (2022)","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2510.27411","last_updated":"2026-06-11T15:02:10Z","snapshot_observed_at":"2026-08-04T07:03:37.783281Z","submitted_at":"2025-10-31T12:00:27Z","title":"Information theory for hypergraph similarity","version":2},"reference_index":40,"source":"pdf_text","source_observed_at":"2026-08-04T07:03:43.728990Z"},"links":{"citing_paper":"/paper/2510.27411"},"observation_digest":"sha256:00ea0f4979472ae1227204fa7861ce36462b3ed4c1d63489333e8cbe2ceb5834","observation_id":"2f6599c2-86a2-425a-9e79-cfc309ec775a","resolution":{"observed_at":"2026-08-04T07:03:43.728990Z","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-08-04T07:03:43.811636Z","title":"Morel-Balbi and A","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2510.27411","last_updated":"2026-06-11T15:02:10Z","snapshot_observed_at":"2026-08-04T07:03:37.783281Z","submitted_at":"2025-10-31T12:00:27Z","title":"Information theory for hypergraph similarity","version":2},"reference_index":41,"source":"pdf_text","source_observed_at":"2026-08-04T07:03:43.811636Z"},"links":{"citing_paper":"/paper/2510.27411"},"observation_digest":"sha256:a5aa7ba3a52c0d7ae8f180b8738b6895d72f9be56ac887d68b235e334f569ae2","observation_id":"effe1cf8-69d5-4e2f-b37d-24840a6b5fed","resolution":{"observed_at":"2026-08-04T07:03:43.811636Z","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-08-04T07:03:43.885134Z","title":null,"venue":null,"work_id":null,"year":2018},"citing_paper":{"arxiv_id":"2510.27411","last_updated":"2026-06-11T15:02:10Z","snapshot_observed_at":"2026-08-04T07:03:37.783281Z","submitted_at":"2025-10-31T12:00:27Z","title":"Information theory for hypergraph similarity","version":2},"reference_index":42,"source":"pdf_text","source_observed_at":"2026-08-04T07:03:43.885134Z"},"links":{"citing_paper":"/paper/2510.27411"},"observation_digest":"sha256:e891fe735b733605444af9555666b63e6910f6d5171dce3b65a6b461112da923","observation_id":"5b6711fa-f1aa-4e97-b11c-ae2500a4334d","resolution":{"observed_at":"2026-08-04T07:03:43.885134Z","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-08-04T07:03:43.957820Z","title":"Kirkley, A","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2510.27411","last_updated":"2026-06-11T15:02:10Z","snapshot_observed_at":"2026-08-04T07:03:37.783281Z","submitted_at":"2025-10-31T12:00:27Z","title":"Information theory for hypergraph similarity","version":2},"reference_index":43,"source":"pdf_text","source_observed_at":"2026-08-04T07:03:43.957820Z"},"links":{"citing_paper":"/paper/2510.27411"},"observation_digest":"sha256:ffdae49500068f0088463b8b746b7fcd0b25ae8b874b5b5063edab3faa4a8856","observation_id":"b9c4f348-a3b0-4574-b1e8-d5eddfe4b292","resolution":{"observed_at":"2026-08-04T07:03:43.957820Z","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-08-04T07:03:43.995366Z","title":null,"venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2510.27411","last_updated":"2026-06-11T15:02:10Z","snapshot_observed_at":"2026-08-04T07:03:37.783281Z","submitted_at":"2025-10-31T12:00:27Z","title":"Information theory for hypergraph similarity","version":2},"reference_index":44,"source":"pdf_text","source_observed_at":"2026-08-04T07:03:43.995366Z"},"links":{"citing_paper":"/paper/2510.27411"},"observation_digest":"sha256:87182249ab8032ce49d24660484a80139fe8e2beba35883949c031f4c5146a6f","observation_id":"eb72e4ea-8128-4e26-941b-13f6a7892b17","resolution":{"observed_at":"2026-08-04T07:03:43.995366Z","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-08-04T07:03:44.048739Z","title":"Kirkley, Identifying hubs in directed networks.Phys- ical Review E109(3), 034310 (2024)","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2510.27411","last_updated":"2026-06-11T15:02:10Z","snapshot_observed_at":"2026-08-04T07:03:37.783281Z","submitted_at":"2025-10-31T12:00:27Z","title":"Information theory for hypergraph similarity","version":2},"reference_index":45,"source":"pdf_text","source_observed_at":"2026-08-04T07:03:44.048739Z"},"links":{"citing_paper":"/paper/2510.27411"},"observation_digest":"sha256:ad5ff2b612a2e86ddd4d3d80ad9946b3a361c75c99876a39015354a5f68d246d","observation_id":"933315d8-93b8-43c1-bafb-f92f40a44e88","resolution":{"observed_at":"2026-08-04T07:03:44.048739Z","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-08-04T07:03:44.136056Z","title":"De Domenico and J","venue":null,"work_id":null,"year":2016},"citing_paper":{"arxiv_id":"2510.27411","last_updated":"2026-06-11T15:02:10Z","snapshot_observed_at":"2026-08-04T07:03:37.783281Z","submitted_at":"2025-10-31T12:00:27Z","title":"Information theory for hypergraph similarity","version":2},"reference_index":46,"source":"pdf_text","source_observed_at":"2026-08-04T07:03:44.136056Z"},"links":{"citing_paper":"/paper/2510.27411"},"observation_digest":"sha256:7a3a4d3b97eecc77072c021d16d74be09a2eb68d5c520960fa436b0d9eefbb38","observation_id":"0d7be130-cd7d-4997-a532-f14c6f57bf6c","resolution":{"observed_at":"2026-08-04T07:03:44.136056Z","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-08-04T07:03:44.205425Z","title":"Escolano, E","venue":null,"work_id":null,"year":2017},"citing_paper":{"arxiv_id":"2510.27411","last_updated":"2026-06-11T15:02:10Z","snapshot_observed_at":"2026-08-04T07:03:37.783281Z","submitted_at":"2025-10-31T12:00:27Z","title":"Information theory for hypergraph similarity","version":2},"reference_index":47,"source":"pdf_text","source_observed_at":"2026-08-04T07:03:44.205425Z"},"links":{"citing_paper":"/paper/2510.27411"},"observation_digest":"sha256:6103086afb43d5534aab1cdeb154260b4a8617a2ca5afa9acc86de8fb3d71639","observation_id":"402ece22-1f14-4077-a5c5-db123a7355a7","resolution":{"observed_at":"2026-08-04T07:03:44.205425Z","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-08-04T07:03:44.273383Z","title":"Corso, G","venue":null,"work_id":null,"year":2020},"citing_paper":{"arxiv_id":"2510.27411","last_updated":"2026-06-11T15:02:10Z","snapshot_observed_at":"2026-08-04T07:03:37.783281Z","submitted_at":"2025-10-31T12:00:27Z","title":"Information theory for hypergraph similarity","version":2},"reference_index":48,"source":"pdf_text","source_observed_at":"2026-08-04T07:03:44.273383Z"},"links":{"citing_paper":"/paper/2510.27411"},"observation_digest":"sha256:4e5b473755eccedaadcf4fe306737930aea524833dc933eae6e1642d5b5e0751","observation_id":"bfa85b19-ee55-47b4-aab2-7e3c0eaee630","resolution":{"observed_at":"2026-08-04T07:03:44.273383Z","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-08-04T07:03:44.341213Z","title":"Coupette and J","venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2510.27411","last_updated":"2026-06-11T15:02:10Z","snapshot_observed_at":"2026-08-04T07:03:37.783281Z","submitted_at":"2025-10-31T12:00:27Z","title":"Information theory for hypergraph similarity","version":2},"reference_index":49,"source":"pdf_text","source_observed_at":"2026-08-04T07:03:44.341213Z"},"links":{"citing_paper":"/paper/2510.27411"},"observation_digest":"sha256:512d68f00c2794c87af9b763dd6d2a4e762dc54303740445afb2a8e872977a56","observation_id":"ab9dfd40-788f-4142-a6eb-079da3eccf77","resolution":{"observed_at":"2026-08-04T07:03:44.341213Z","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-08-04T07:03:44.433900Z","title":"Felippe, F","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2510.27411","last_updated":"2026-06-11T15:02:10Z","snapshot_observed_at":"2026-08-04T07:03:37.783281Z","submitted_at":"2025-10-31T12:00:27Z","title":"Information theory for hypergraph similarity","version":2},"reference_index":50,"source":"pdf_text","source_observed_at":"2026-08-04T07:03:44.433900Z"},"links":{"citing_paper":"/paper/2510.27411"},"observation_digest":"sha256:4d31010c297e685d74d4ff775a416da09a3876384650317b2d8d71486494eb28","observation_id":"da84f70f-40a0-4960-a7f8-e8283ad25517","resolution":{"observed_at":"2026-08-04T07:03:44.433900Z","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-08-04T07:03:44.491586Z","title":null,"venue":null,"work_id":null,"year":2020},"citing_paper":{"arxiv_id":"2510.27411","last_updated":"2026-06-11T15:02:10Z","snapshot_observed_at":"2026-08-04T07:03:37.783281Z","submitted_at":"2025-10-31T12:00:27Z","title":"Information theory for hypergraph similarity","version":2},"reference_index":51,"source":"pdf_text","source_observed_at":"2026-08-04T07:03:44.491586Z"},"links":{"citing_paper":"/paper/2510.27411"},"observation_digest":"sha256:4a96d026fb3b8dbe96035ab46782027a1a9500ce514a1daa8179a7f3ac585f59","observation_id":"f5e1125c-fbc5-43b2-ab0d-a37eb653f503","resolution":{"observed_at":"2026-08-04T07:03:44.491586Z","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-08-04T07:03:44.566880Z","title":"Jerdee, A","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2510.27411","last_updated":"2026-06-11T15:02:10Z","snapshot_observed_at":"2026-08-04T07:03:37.783281Z","submitted_at":"2025-10-31T12:00:27Z","title":"Information theory for hypergraph similarity","version":2},"reference_index":52,"source":"pdf_text","source_observed_at":"2026-08-04T07:03:44.566880Z"},"links":{"citing_paper":"/paper/2510.27411"},"observation_digest":"sha256:9c348ba4809b790d82a7d61e96e209580a35f1ab71afbd3fb713d90c6e6e6c84","observation_id":"356e1024-c4e4-4ab0-a2e0-332f7f341b5e","resolution":{"observed_at":"2026-08-04T07:03:44.566880Z","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-08-04T07:03:44.630651Z","title":null,"venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2510.27411","last_updated":"2026-06-11T15:02:10Z","snapshot_observed_at":"2026-08-04T07:03:37.783281Z","submitted_at":"2025-10-31T12:00:27Z","title":"Information theory for hypergraph similarity","version":2},"reference_index":53,"source":"pdf_text","source_observed_at":"2026-08-04T07:03:44.630651Z"},"links":{"citing_paper":"/paper/2510.27411"},"observation_digest":"sha256:fdd55551860f065f4fa88581a4aa02d13af408761a3065318c1bcd567b7b47b9","observation_id":"24c3f5ea-1652-4c21-8c29-c2b41fc79b83","resolution":{"observed_at":"2026-08-04T07:03:44.630651Z","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-08-04T07:03:44.663023Z","title":"LaRock and R","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2510.27411","last_updated":"2026-06-11T15:02:10Z","snapshot_observed_at":"2026-08-04T07:03:37.783281Z","submitted_at":"2025-10-31T12:00:27Z","title":"Information theory for hypergraph similarity","version":2},"reference_index":54,"source":"pdf_text","source_observed_at":"2026-08-04T07:03:44.663023Z"},"links":{"citing_paper":"/paper/2510.27411"},"observation_digest":"sha256:0315f037b1e61a64086cada3aaf890eb9c3375e8bc68fdbe657ef330c74e7655","observation_id":"1a897064-f6ee-409c-8203-875a30441375","resolution":{"observed_at":"2026-08-04T07:03:44.663023Z","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-08-04T07:03:44.688268Z","title":null,"venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2510.27411","last_updated":"2026-06-11T15:02:10Z","snapshot_observed_at":"2026-08-04T07:03:37.783281Z","submitted_at":"2025-10-31T12:00:27Z","title":"Information theory for hypergraph similarity","version":2},"reference_index":55,"source":"pdf_text","source_observed_at":"2026-08-04T07:03:44.688268Z"},"links":{"citing_paper":"/paper/2510.27411"},"observation_digest":"sha256:5438c70ce0c26f6d75fd9ca0f0e1551bf9e901f11bea5b44f3ebdf753a2ec167","observation_id":"0ce8d1d8-a176-4cca-b353-ab12941b7c06","resolution":{"observed_at":"2026-08-04T07:03:44.688268Z","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-08-04T07:03:44.731414Z","title":"Gallo, L","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2510.27411","last_updated":"2026-06-11T15:02:10Z","snapshot_observed_at":"2026-08-04T07:03:37.783281Z","submitted_at":"2025-10-31T12:00:27Z","title":"Information theory for hypergraph similarity","version":2},"reference_index":56,"source":"pdf_text","source_observed_at":"2026-08-04T07:03:44.731414Z"},"links":{"citing_paper":"/paper/2510.27411"},"observation_digest":"sha256:9eff27b7c3818c5a2f7712fb532ea841f3bc59d1cceb12cc1a185178120697af","observation_id":"4d5296b8-882c-4253-9c6f-008cbed7a355","resolution":{"observed_at":"2026-08-04T07:03:44.731414Z","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-08-04T07:03:44.791222Z","title":"LaRock and R","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2510.27411","last_updated":"2026-06-11T15:02:10Z","snapshot_observed_at":"2026-08-04T07:03:37.783281Z","submitted_at":"2025-10-31T12:00:27Z","title":"Information theory for hypergraph similarity","version":2},"reference_index":57,"source":"pdf_text","source_observed_at":"2026-08-04T07:03:44.791222Z"},"links":{"cited_paper":"/paper/2506.01479","citing_paper":"/paper/2510.27411"},"observation_digest":"sha256:899524869fc99b97fc396df5cb4e413efa6eb1ba5cbbf7ffcedccca9c7c2760e","observation_id":"5d898aec-4a3c-4e7f-8009-89e36f3f08ca","resolution":{"observed_at":"2026-08-04T07:03:44.791222Z","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-08-04T07:03:44.858161Z","title":"Cencetti, F","venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2510.27411","last_updated":"2026-06-11T15:02:10Z","snapshot_observed_at":"2026-08-04T07:03:37.783281Z","submitted_at":"2025-10-31T12:00:27Z","title":"Information theory for hypergraph similarity","version":2},"reference_index":58,"source":"pdf_text","source_observed_at":"2026-08-04T07:03:44.858161Z"},"links":{"citing_paper":"/paper/2510.27411"},"observation_digest":"sha256:9036ce6fbafa3bb7d09ad6211635810b937da24fdd9f6d6b8f96a545493ca9b8","observation_id":"e074bf60-a55a-4b85-9fb7-52f3c1ffa524","resolution":{"observed_at":"2026-08-04T07:03:44.858161Z","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-08-04T07:03:44.946338Z","title":"Decelle, F","venue":null,"work_id":null,"year":2011},"citing_paper":{"arxiv_id":"2510.27411","last_updated":"2026-06-11T15:02:10Z","snapshot_observed_at":"2026-08-04T07:03:37.783281Z","submitted_at":"2025-10-31T12:00:27Z","title":"Information theory for hypergraph similarity","version":2},"reference_index":59,"source":"pdf_text","source_observed_at":"2026-08-04T07:03:44.946338Z"},"links":{"citing_paper":"/paper/2510.27411"},"observation_digest":"sha256:cc6198f78b2f93913c8fb4a67a9ee2b02e6a747696819278efa40eed2ea335f8","observation_id":"09f8e875-94a9-49f5-b362-8e4a37ff895e","resolution":{"observed_at":"2026-08-04T07:03:44.946338Z","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-08-04T07:03:45.035419Z","title":null,"venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2510.27411","last_updated":"2026-06-11T15:02:10Z","snapshot_observed_at":"2026-08-04T07:03:37.783281Z","submitted_at":"2025-10-31T12:00:27Z","title":"Information theory for hypergraph similarity","version":2},"reference_index":60,"source":"pdf_text","source_observed_at":"2026-08-04T07:03:45.035419Z"},"links":{"citing_paper":"/paper/2510.27411"},"observation_digest":"sha256:20801873430af5d354b21d654034c785dde5eeae694a4d10e3d2aaa90a8b298d","observation_id":"60752c22-0b0f-4992-b763-31262f0e5c43","resolution":{"observed_at":"2026-08-04T07:03:45.035419Z","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-08-04T07:03:45.124103Z","title":"Schueller, J","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2510.27411","last_updated":"2026-06-11T15:02:10Z","snapshot_observed_at":"2026-08-04T07:03:37.783281Z","submitted_at":"2025-10-31T12:00:27Z","title":"Information theory for hypergraph similarity","version":2},"reference_index":61,"source":"pdf_text","source_observed_at":"2026-08-04T07:03:45.124103Z"},"links":{"citing_paper":"/paper/2510.27411"},"observation_digest":"sha256:582dcd458e7a909e9eab4fed3a5c7c785cba7e28198c59a6fe27926b11110ce9","observation_id":"10800563-70f3-4a65-831c-15e2b903f60f","resolution":{"observed_at":"2026-08-04T07:03:45.124103Z","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-08-04T07:03:45.198050Z","title":"Schueller and J","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2510.27411","last_updated":"2026-06-11T15:02:10Z","snapshot_observed_at":"2026-08-04T07:03:37.783281Z","submitted_at":"2025-10-31T12:00:27Z","title":"Information theory for hypergraph similarity","version":2},"reference_index":62,"source":"pdf_text","source_observed_at":"2026-08-04T07:03:45.198050Z"},"links":{"citing_paper":"/paper/2510.27411"},"observation_digest":"sha256:a652590013910d55708e04961bfa20e1e28e838608e737147345f434c84dadeb","observation_id":"2dc4758c-42b4-417b-88dd-2e605feb0514","resolution":{"observed_at":"2026-08-04T07:03:45.198050Z","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-08-04T07:03:45.273037Z","title":"Betti, L","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2510.27411","last_updated":"2026-06-11T15:02:10Z","snapshot_observed_at":"2026-08-04T07:03:37.783281Z","submitted_at":"2025-10-31T12:00:27Z","title":"Information theory for hypergraph similarity","version":2},"reference_index":63,"source":"pdf_text","source_observed_at":"2026-08-04T07:03:45.273037Z"},"links":{"citing_paper":"/paper/2510.27411"},"observation_digest":"sha256:ec6fc381c2f7c017f816ed7c4a8abb45f13d1bdbbf5020d601b84ed1082d11f6","observation_id":"b1f014d0-bc0f-49ff-a164-cb61abf33f3c","resolution":{"observed_at":"2026-08-04T07:03:45.273037Z","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-08-04T07:03:45.345906Z","title":null,"venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2510.27411","last_updated":"2026-06-11T15:02:10Z","snapshot_observed_at":"2026-08-04T07:03:37.783281Z","submitted_at":"2025-10-31T12:00:27Z","title":"Information theory for hypergraph similarity","version":2},"reference_index":64,"source":"pdf_text","source_observed_at":"2026-08-04T07:03:45.345906Z"},"links":{"citing_paper":"/paper/2510.27411"},"observation_digest":"sha256:7a86723d806e2d2a04796c13e89ae702979564be9a36312142f10ac6510d7ebd","observation_id":"6407fb21-7cda-44a5-a87b-0ae3af0790c8","resolution":{"observed_at":"2026-08-04T07:03:45.345906Z","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-08-04T07:03:45.416457Z","title":"Kirkley, Inference of dynamic hypergraph represen- tations in temporal interaction data.Physical Review E 109(5), 054306 (2024)","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2510.27411","last_updated":"2026-06-11T15:02:10Z","snapshot_observed_at":"2026-08-04T07:03:37.783281Z","submitted_at":"2025-10-31T12:00:27Z","title":"Information theory for hypergraph similarity","version":2},"reference_index":65,"source":"pdf_text","source_observed_at":"2026-08-04T07:03:45.416457Z"},"links":{"citing_paper":"/paper/2510.27411"},"observation_digest":"sha256:f7f0bde20904dcd5834a4557bb713c578af095447f43e22d27787f24fa316804","observation_id":"292c9d11-614e-42a1-91b2-333c705f5704","resolution":{"observed_at":"2026-08-04T07:03:45.416457Z","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-08-04T07:03:45.507966Z","title":"Santoro, F","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2510.27411","last_updated":"2026-06-11T15:02:10Z","snapshot_observed_at":"2026-08-04T07:03:37.783281Z","submitted_at":"2025-10-31T12:00:27Z","title":"Information theory for hypergraph similarity","version":2},"reference_index":66,"source":"pdf_text","source_observed_at":"2026-08-04T07:03:45.507966Z"},"links":{"citing_paper":"/paper/2510.27411"},"observation_digest":"sha256:4f5bac305aeb9236d69a6649e9a0d5d613c318c3f3e522b10fa867f30b25593a","observation_id":"39811770-a888-400f-a769-fc544ab05173","resolution":{"observed_at":"2026-08-04T07:03:45.507966Z","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-08-04T07:03:45.597447Z","title":null,"venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2510.27411","last_updated":"2026-06-11T15:02:10Z","snapshot_observed_at":"2026-08-04T07:03:37.783281Z","submitted_at":"2025-10-31T12:00:27Z","title":"Information theory for hypergraph similarity","version":2},"reference_index":67,"source":"pdf_text","source_observed_at":"2026-08-04T07:03:45.597447Z"},"links":{"citing_paper":"/paper/2510.27411"},"observation_digest":"sha256:3504f3d0cb0719b5dfbaf8566813c13452d073fa9c453f88e07537bb16f11e5e","observation_id":"69aed043-1b91-4228-a0a8-a3201c875302","resolution":{"observed_at":"2026-08-04T07:03:45.597447Z","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-08-04T07:03:45.663552Z","title":null,"venue":null,"work_id":null,"year":2012},"citing_paper":{"arxiv_id":"2510.27411","last_updated":"2026-06-11T15:02:10Z","snapshot_observed_at":"2026-08-04T07:03:37.783281Z","submitted_at":"2025-10-31T12:00:27Z","title":"Information theory for hypergraph similarity","version":2},"reference_index":68,"source":"pdf_text","source_observed_at":"2026-08-04T07:03:45.663552Z"},"links":{"citing_paper":"/paper/2510.27411"},"observation_digest":"sha256:57de15aee175fbe72c4ddf3943fecd37e3568ab13dd3c13a32423e485f275a32","observation_id":"7ac02c54-752d-4937-9aa5-df2d3c5f2870","resolution":{"observed_at":"2026-08-04T07:03:45.663552Z","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-08-04T07:03:45.729788Z","title":null,"venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2510.27411","last_updated":"2026-06-11T15:02:10Z","snapshot_observed_at":"2026-08-04T07:03:37.783281Z","submitted_at":"2025-10-31T12:00:27Z","title":"Information theory for hypergraph similarity","version":2},"reference_index":69,"source":"pdf_text","source_observed_at":"2026-08-04T07:03:45.729788Z"},"links":{"citing_paper":"/paper/2510.27411"},"observation_digest":"sha256:47f6c60a9914671f4e6b15a843d9ce0d017156b22d5e0e479331fcd211658600","observation_id":"a6874569-d6f9-4bb8-9661-4d1ef5946c96","resolution":{"observed_at":"2026-08-04T07:03:45.729788Z","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-08-04T07:03:45.789301Z","title":"Jerdee, A","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2510.27411","last_updated":"2026-06-11T15:02:10Z","snapshot_observed_at":"2026-08-04T07:03:37.783281Z","submitted_at":"2025-10-31T12:00:27Z","title":"Information theory for hypergraph similarity","version":2},"reference_index":70,"source":"pdf_text","source_observed_at":"2026-08-04T07:03:45.789301Z"},"links":{"citing_paper":"/paper/2510.27411"},"observation_digest":"sha256:6b0c039ed45e9e710d3ac8daf3a6889a5f28388021e956d99cf1755a889e8d6f","observation_id":"c391500d-444d-43de-b666-6432d05bda40","resolution":{"observed_at":"2026-08-04T07:03:45.789301Z","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-08-04T07:03:45.835565Z","title":"Ruggeri, F","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2510.27411","last_updated":"2026-06-11T15:02:10Z","snapshot_observed_at":"2026-08-04T07:03:37.783281Z","submitted_at":"2025-10-31T12:00:27Z","title":"Information theory for hypergraph similarity","version":2},"reference_index":71,"source":"pdf_text","source_observed_at":"2026-08-04T07:03:45.835565Z"},"links":{"citing_paper":"/paper/2510.27411"},"observation_digest":"sha256:a25261cec285c17e5b39051e870a35d9fc2b071b186b5be40ee7d11b3d4c5ffe","observation_id":"bde69962-a925-48bc-ac77-79b8f1ed8195","resolution":{"observed_at":"2026-08-04T07:03:45.835565Z","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-08-04T07:03:45.929500Z","title":"Iacopini, J","venue":null,"work_id":null,"year":1905},"citing_paper":{"arxiv_id":"2510.27411","last_updated":"2026-06-11T15:02:10Z","snapshot_observed_at":"2026-08-04T07:03:37.783281Z","submitted_at":"2025-10-31T12:00:27Z","title":"Information theory for hypergraph similarity","version":2},"reference_index":72,"source":"pdf_text","source_observed_at":"2026-08-04T07:03:45.929500Z"},"links":{"citing_paper":"/paper/2510.27411"},"observation_digest":"sha256:23f07b1c0cf0c7be47904c326fbe475168cc4851b609b3f63f8d2efc5d8643ae","observation_id":"95f5a9fb-06e0-4d50-be76-4b90f657ed4d","resolution":{"observed_at":"2026-08-04T07:03:45.929500Z","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-08-04T07:03:45.970602Z","title":"Iacopini, M","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2510.27411","last_updated":"2026-06-11T15:02:10Z","snapshot_observed_at":"2026-08-04T07:03:37.783281Z","submitted_at":"2025-10-31T12:00:27Z","title":"Information theory for hypergraph similarity","version":2},"reference_index":73,"source":"pdf_text","source_observed_at":"2026-08-04T07:03:45.970602Z"},"links":{"citing_paper":"/paper/2510.27411"},"observation_digest":"sha256:4c03c8fea14c8c0718afcb5000e53db2b3574a3c8734903e267532f80fb41af8","observation_id":"cb779ad4-c856-4cc3-b432-c35b3b8a8517","resolution":{"observed_at":"2026-08-04T07:03:45.970602Z","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-08-04T07:03:46.024991Z","title":"Klimt and Y","venue":null,"work_id":null,"year":2004},"citing_paper":{"arxiv_id":"2510.27411","last_updated":"2026-06-11T15:02:10Z","snapshot_observed_at":"2026-08-04T07:03:37.783281Z","submitted_at":"2025-10-31T12:00:27Z","title":"Information theory for hypergraph similarity","version":2},"reference_index":74,"source":"pdf_text","source_observed_at":"2026-08-04T07:03:46.024991Z"},"links":{"citing_paper":"/paper/2510.27411"},"observation_digest":"sha256:f1e10e6bf20877d8b123b6358abcc6dadd0d1464e0687387f09c4f11b118fca7","observation_id":"fd815ab9-d0df-4072-8f1d-2249dcddb35e","resolution":{"observed_at":"2026-08-04T07:03:46.024991Z","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-08-04T07:03:46.060661Z","title":null,"venue":null,"work_id":null,"year":2018},"citing_paper":{"arxiv_id":"2510.27411","last_updated":"2026-06-11T15:02:10Z","snapshot_observed_at":"2026-08-04T07:03:37.783281Z","submitted_at":"2025-10-31T12:00:27Z","title":"Information theory for hypergraph similarity","version":2},"reference_index":75,"source":"pdf_text","source_observed_at":"2026-08-04T07:03:46.060661Z"},"links":{"citing_paper":"/paper/2510.27411"},"observation_digest":"sha256:de2852976798fadf01a631e094a2cf6d865b3b7adb5f4e397c4a33a0f83421e3","observation_id":"71728c47-7c60-43bd-a32e-05a50dc23ee0","resolution":{"observed_at":"2026-08-04T07:03:46.060661Z","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-08-04T07:03:46.128409Z","title":"it’s al- ways about the people. enron is no different","venue":null,"work_id":null,"year":2005},"citing_paper":{"arxiv_id":"2510.27411","last_updated":"2026-06-11T15:02:10Z","snapshot_observed_at":"2026-08-04T07:03:37.783281Z","submitted_at":"2025-10-31T12:00:27Z","title":"Information theory for hypergraph similarity","version":2},"reference_index":76,"source":"pdf_text","source_observed_at":"2026-08-04T07:03:46.128409Z"},"links":{"citing_paper":"/paper/2510.27411"},"observation_digest":"sha256:b9e6bef1a08f1bb52ec16195773cb54cc29514e671b5f370209f0ff3a60a1d71","observation_id":"ccdcbb9e-bf40-4e3e-b6f1-638911939d7c","resolution":{"observed_at":"2026-08-04T07:03:46.128409Z","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-08-04T07:03:46.181537Z","title":"zoom out","venue":null,"work_id":null,"year":2015},"citing_paper":{"arxiv_id":"2510.27411","last_updated":"2026-06-11T15:02:10Z","snapshot_observed_at":"2026-08-04T07:03:37.783281Z","submitted_at":"2025-10-31T12:00:27Z","title":"Information theory for hypergraph similarity","version":2},"reference_index":77,"source":"pdf_text","source_observed_at":"2026-08-04T07:03:46.181537Z"},"links":{"citing_paper":"/paper/2510.27411"},"observation_digest":"sha256:5e627832434c937df1f5786257aa5c96b8fd102b1cf8d17d77e46deded25aa43","observation_id":"b450d114-5259-4dde-91fb-78fdf736461c","resolution":{"observed_at":"2026-08-04T07:03:46.181537Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"paper":{"arxiv_id":"2510.27411","last_updated":"2026-06-11T15:02:10Z","latest_version":2,"primary_category":"physics.soc-ph","snapshot_observed_at":"2026-08-04T07:03:37.783281Z","submitted_at":"2025-10-31T12:00:27Z","title":"Information theory for hypergraph similarity"},"reference_resolution":{"displayed":77,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":77,"verified_exact":0,"verified_fuzzy":0},"total_outbound_references":77},"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-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"thesis":"As of 8 August 2026, this Paper Citation Record lists 77 of 77 outbound references and 2 inbound Pith citation observations for arXiv:2510.27411."}