{"as_of":"2026-08-16T08:12:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:92c3211366ba7519462d442a4fb9807d49eef9a760f9c2bfc7ba8a9349a27879","coverage":[{"denominator":40,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":40,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-14T14:14:03.143144Z","state":"measured"},{"denominator":40,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":40,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-16T06:30:59.297886+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/1908.03811/citation-record","integrity":"/paper/1908.03811/integrity","json":"/paper/1908.03811/citation-record.json","paper":"/paper/1908.03811"},"outbound":[{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T14:14:02.946677Z","title":"Information theory and statistical mechanics","venue":null,"work_id":null,"year":1957},"citing_paper":{"arxiv_id":"1908.03811","last_updated":"2020-05-14T11:07:21Z","snapshot_observed_at":"2026-08-16T03:37:43.849086Z","submitted_at":"2019-08-10T21:35:23Z","title":"Classical Information Theory of Networks","version":4},"reference_index":1,"source":"pdf_text","source_observed_at":"2026-08-14T14:14:02.946677Z"},"links":{"citing_paper":"/paper/1908.03811"},"observation_digest":"sha256:07a0cfd871aa244c23d3fb36562b8b9b6a688e283cf544185f7d437877269134","observation_id":"82426f09-e2c3-4d5a-8fae-936010d3374e","resolution":{"observed_at":"2026-08-14T14:14:02.946677Z","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":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T14:14:03.757408Z","title":"Principles of maximum entropy and maximum caliber in statistical physics","venue":null,"work_id":"85d4eb6f-380b-468e-a217-cf3a28f48828","year":2013},"citing_paper":{"arxiv_id":"1908.03811","last_updated":"2020-05-14T11:07:21Z","snapshot_observed_at":"2026-08-16T03:37:43.849086Z","submitted_at":"2019-08-10T21:35:23Z","title":"Classical Information Theory of Networks","version":4},"reference_index":2,"source":"pdf_text","source_observed_at":"2026-08-14T14:14:02.954172Z"},"links":{"citing_paper":"/paper/1908.03811"},"observation_digest":"sha256:e0ad5a12d8e851587e9ed5dc03095e52a046a4848bcd2678039dfc4ebb355671","observation_id":"513c9179-914a-4a58-97d4-bf8baef9eb5b","resolution":{"observed_at":"2026-08-14T14:14:03.762551Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T14:14:03.740681Z","title":"A simple introduction to maximum entropy models for natural language processing","venue":null,"work_id":"022ab159-b9a1-4542-84ed-a1d74541b3b5","year":1997},"citing_paper":{"arxiv_id":"1908.03811","last_updated":"2020-05-14T11:07:21Z","snapshot_observed_at":"2026-08-16T03:37:43.849086Z","submitted_at":"2019-08-10T21:35:23Z","title":"Classical Information Theory of Networks","version":4},"reference_index":3,"source":"pdf_text","source_observed_at":"2026-08-14T14:14:02.958888Z"},"links":{"citing_paper":"/paper/1908.03811"},"observation_digest":"sha256:adbf2ceb774120701c5ed16ecd07903e8f66d54bfb65d77a8fc84db025ae07c9","observation_id":"dcfb40a9-c798-4e77-9a20-75f1338e7915","resolution":{"observed_at":"2026-08-14T14:14:03.746583Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T14:14:03.724845Z","title":null,"venue":null,"work_id":"6eb81a4e-dfa2-40a2-a65a-92e736f21ccb","year":1967},"citing_paper":{"arxiv_id":"1908.03811","last_updated":"2020-05-14T11:07:21Z","snapshot_observed_at":"2026-08-16T03:37:43.849086Z","submitted_at":"2019-08-10T21:35:23Z","title":"Classical Information Theory of Networks","version":4},"reference_index":4,"source":"pdf_text","source_observed_at":"2026-08-14T14:14:02.963702Z"},"links":{"citing_paper":"/paper/1908.03811"},"observation_digest":"sha256:fb2513e3fe411eddef22dd691278077197541f5bbf3a2ce52c8bbefa1fcf117e","observation_id":"16d14925-777e-49dc-9046-0a3c01128353","resolution":{"observed_at":"2026-08-14T14:14:03.729407Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T14:14:03.708891Z","title":"Fifty years of regional inequality in china: a journey through central planning, reform, and openness","venue":null,"work_id":"75803407-eb83-4a7c-9eb7-c6bd63461dde","year":2005},"citing_paper":{"arxiv_id":"1908.03811","last_updated":"2020-05-14T11:07:21Z","snapshot_observed_at":"2026-08-16T03:37:43.849086Z","submitted_at":"2019-08-10T21:35:23Z","title":"Classical Information Theory of Networks","version":4},"reference_index":5,"source":"pdf_text","source_observed_at":"2026-08-14T14:14:02.969086Z"},"links":{"citing_paper":"/paper/1908.03811"},"observation_digest":"sha256:95159581e203bcb93df36efbd3edcc3ec7521e4122854a8a797eb13772003aa2","observation_id":"265c83e4-62c7-41bf-b37f-eaaa7f707a88","resolution":{"observed_at":"2026-08-14T14:14:03.714547Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T14:14:03.691872Z","title":"Detecting direct associations in a network by information theoretic approaches","venue":null,"work_id":"27378c30-0239-4d72-85a3-d68d06134177","year":2019},"citing_paper":{"arxiv_id":"1908.03811","last_updated":"2020-05-14T11:07:21Z","snapshot_observed_at":"2026-08-16T03:37:43.849086Z","submitted_at":"2019-08-10T21:35:23Z","title":"Classical Information Theory of Networks","version":4},"reference_index":6,"source":"pdf_text","source_observed_at":"2026-08-14T14:14:02.974898Z"},"links":{"citing_paper":"/paper/1908.03811"},"observation_digest":"sha256:2bd40c262c4c49dddc974365d1f08563757917faf62ff82129675c0bf1947b6d","observation_id":"3092bf92-d49f-4691-9a45-83bf1c6c75bf","resolution":{"observed_at":"2026-08-14T14:14:03.697448Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T14:14:03.674377Z","title":"A maximum entropy model applied to spatial and temporal correlations from cortical networks in vitro","venue":null,"work_id":"26fdfc40-44f7-4de3-8df0-7eacd5be2766","year":2008},"citing_paper":{"arxiv_id":"1908.03811","last_updated":"2020-05-14T11:07:21Z","snapshot_observed_at":"2026-08-16T03:37:43.849086Z","submitted_at":"2019-08-10T21:35:23Z","title":"Classical Information Theory of Networks","version":4},"reference_index":7,"source":"pdf_text","source_observed_at":"2026-08-14T14:14:02.980788Z"},"links":{"citing_paper":"/paper/1908.03811"},"observation_digest":"sha256:7276f94bfa4682a3191a5632bbaacb041a1e88270fc9d67e3da16cc966193d7a","observation_id":"fb5357d5-d20b-435a-87a1-bd21d31d2ce9","resolution":{"observed_at":"2026-08-14T14:14:03.680843Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"physics/0004057","last_updated":"2000-04-24T15:22:30Z","snapshot_observed_at":"2026-08-12T16:03:20.142135Z","submitted_at":"2000-04-24T15:22:30Z","title":"The information bottleneck method","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"physics/0004057","snapshot_observed_at":"2026-08-14T14:14:02.985595Z","title":"The information bottleneck method","venue":null,"work_id":null,"year":2000},"citing_paper":{"arxiv_id":"1908.03811","last_updated":"2020-05-14T11:07:21Z","snapshot_observed_at":"2026-08-16T03:37:43.849086Z","submitted_at":"2019-08-10T21:35:23Z","title":"Classical Information Theory of Networks","version":4},"reference_index":8,"source":"pdf_text","source_observed_at":"2026-08-14T14:14:02.985595Z"},"links":{"cited_paper":"/paper/physics/0004057","citing_paper":"/paper/1908.03811"},"observation_digest":"sha256:31ac905b66f4c08ce9f7cd0ffd4d1c82ac5e8195773f50bcc3d473a81eb4740a","observation_id":"c35511d1-f433-4820-ace7-243e9285def5","resolution":{"observed_at":"2026-08-14T14:14:02.985595Z","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":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T14:14:03.658196Z","title":"Resolution and relevance trade-offs in deep learning","venue":null,"work_id":"498a177a-cbbc-4f46-af56-8c8e1971b035","year":2018},"citing_paper":{"arxiv_id":"1908.03811","last_updated":"2020-05-14T11:07:21Z","snapshot_observed_at":"2026-08-16T03:37:43.849086Z","submitted_at":"2019-08-10T21:35:23Z","title":"Classical Information Theory of Networks","version":4},"reference_index":9,"source":"pdf_text","source_observed_at":"2026-08-14T14:14:02.990983Z"},"links":{"citing_paper":"/paper/1908.03811"},"observation_digest":"sha256:a9af5c62bbe77b5d340fffb52f2026e4bcf5215d3304281fb385d10f3c1106e4","observation_id":"907360a6-07cb-4165-99bf-0ac10f303182","resolution":{"observed_at":"2026-08-14T14:14:03.662757Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T14:14:03.642589Z","title":"The stochastic thermodynamics of computation","venue":null,"work_id":"2f27aaad-0ea9-46dd-8732-b809db739c59","year":2019},"citing_paper":{"arxiv_id":"1908.03811","last_updated":"2020-05-14T11:07:21Z","snapshot_observed_at":"2026-08-16T03:37:43.849086Z","submitted_at":"2019-08-10T21:35:23Z","title":"Classical Information Theory of Networks","version":4},"reference_index":10,"source":"pdf_text","source_observed_at":"2026-08-14T14:14:02.995861Z"},"links":{"citing_paper":"/paper/1908.03811"},"observation_digest":"sha256:ffbdb808032d4fc5d7a98e3af828d804551f021b0278f46c9b60143ed33083f2","observation_id":"d2b12ab4-fea4-4d95-a38a-0565f75c7508","resolution":{"observed_at":"2026-08-14T14:14:03.647859Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T14:14:03.626020Z","title":"The statistical physics of real-world networks","venue":null,"work_id":"f1a9f590-27d4-4b22-a569-2295eba62ce5","year":2019},"citing_paper":{"arxiv_id":"1908.03811","last_updated":"2020-05-14T11:07:21Z","snapshot_observed_at":"2026-08-16T03:37:43.849086Z","submitted_at":"2019-08-10T21:35:23Z","title":"Classical Information Theory of Networks","version":4},"reference_index":11,"source":"pdf_text","source_observed_at":"2026-08-14T14:14:03.000946Z"},"links":{"citing_paper":"/paper/1908.03811"},"observation_digest":"sha256:03ddc6d320662c14b096bb39433556fe6224d280921f02d4f471979f410fa19c","observation_id":"0e80d7f8-0c96-4926-b22a-3d98a38ed151","resolution":{"observed_at":"2026-08-14T14:14:03.631139Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T14:14:03.609559Z","title":"Statistical mechanics of networks","venue":null,"work_id":"a4ee5460-82e6-4dc3-a8e8-01b9e6df7b6a","year":2004},"citing_paper":{"arxiv_id":"1908.03811","last_updated":"2020-05-14T11:07:21Z","snapshot_observed_at":"2026-08-16T03:37:43.849086Z","submitted_at":"2019-08-10T21:35:23Z","title":"Classical Information Theory of Networks","version":4},"reference_index":12,"source":"pdf_text","source_observed_at":"2026-08-14T14:14:03.005856Z"},"links":{"citing_paper":"/paper/1908.03811"},"observation_digest":"sha256:6410895b970199d3a4811b95cfd37c0e27da7cc326d8215da64aa98b5d331398","observation_id":"44496265-aaea-4caf-8d18-23b4323b564a","resolution":{"observed_at":"2026-08-14T14:14:03.614935Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T14:14:03.593375Z","title":"Entropy of network ensembles","venue":null,"work_id":"852c8948-ec89-4674-85c8-ccfcb29e5231","year":2009},"citing_paper":{"arxiv_id":"1908.03811","last_updated":"2020-05-14T11:07:21Z","snapshot_observed_at":"2026-08-16T03:37:43.849086Z","submitted_at":"2019-08-10T21:35:23Z","title":"Classical Information Theory of Networks","version":4},"reference_index":13,"source":"pdf_text","source_observed_at":"2026-08-14T14:14:03.010306Z"},"links":{"citing_paper":"/paper/1908.03811"},"observation_digest":"sha256:fb3b4f7d9b3168a2cb3f48e3ebbf0f27a0d870761c9ba94b4dd1e46ae2c8b4ed","observation_id":"92f2000e-761f-456a-ae87-99ce0a782541","resolution":{"observed_at":"2026-08-14T14:14:03.598281Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T14:14:03.015735Z","title":"Entropy measures for networks: Toward an information theory of complex topologies","venue":null,"work_id":null,"year":2009},"citing_paper":{"arxiv_id":"1908.03811","last_updated":"2020-05-14T11:07:21Z","snapshot_observed_at":"2026-08-16T03:37:43.849086Z","submitted_at":"2019-08-10T21:35:23Z","title":"Classical Information Theory of Networks","version":4},"reference_index":14,"source":"pdf_text","source_observed_at":"2026-08-14T14:14:03.015735Z"},"links":{"citing_paper":"/paper/1908.03811"},"observation_digest":"sha256:a8b0f15a3fb26d2080f4a54a9b24f1ba0b4c4509f4961788370c2f5669de6a77","observation_id":"2b52b443-b8fd-42ab-8b55-7470cdbb672a","resolution":{"observed_at":"2026-08-14T14:14:03.015735Z","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":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T14:14:03.564743Z","title":"Gibbs entropy of network ensembles by cavity methods","venue":null,"work_id":"c280bdd0-1a2c-44aa-a18e-c1c23c27a332","year":2010},"citing_paper":{"arxiv_id":"1908.03811","last_updated":"2020-05-14T11:07:21Z","snapshot_observed_at":"2026-08-16T03:37:43.849086Z","submitted_at":"2019-08-10T21:35:23Z","title":"Classical Information Theory of Networks","version":4},"reference_index":15,"source":"pdf_text","source_observed_at":"2026-08-14T14:14:03.020570Z"},"links":{"citing_paper":"/paper/1908.03811"},"observation_digest":"sha256:99fbfe017a563d6ff1537d9bde300aeca13093295c46ebb38c87fa8c480cfbe9","observation_id":"e664765c-21b3-4e2e-b377-da14eafafe8a","resolution":{"observed_at":"2026-08-14T14:14:03.570402Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T14:14:03.547616Z","title":"A statistical mechanics approach for scale-free networks and finite-scale networks","venue":null,"work_id":"6f4b59d5-ab48-4350-a1ea-a09321311956","year":2007},"citing_paper":{"arxiv_id":"1908.03811","last_updated":"2020-05-14T11:07:21Z","snapshot_observed_at":"2026-08-16T03:37:43.849086Z","submitted_at":"2019-08-10T21:35:23Z","title":"Classical Information Theory of Networks","version":4},"reference_index":16,"source":"pdf_text","source_observed_at":"2026-08-14T14:14:03.025968Z"},"links":{"citing_paper":"/paper/1908.03811"},"observation_digest":"sha256:086a415897bd1039a0a083012094428c7b267e45a5c9e7d5ccd11539dfe14463","observation_id":"b0bf63fe-6e84-41e2-9a63-66954fbafb1f","resolution":{"observed_at":"2026-08-14T14:14:03.552939Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T14:14:03.531144Z","title":"Entropy of stochastic blockmodel ensembles","venue":null,"work_id":"1590206e-3a51-46f2-b26f-a8c813070382","year":2012},"citing_paper":{"arxiv_id":"1908.03811","last_updated":"2020-05-14T11:07:21Z","snapshot_observed_at":"2026-08-16T03:37:43.849086Z","submitted_at":"2019-08-10T21:35:23Z","title":"Classical Information Theory of Networks","version":4},"reference_index":17,"source":"pdf_text","source_observed_at":"2026-08-14T14:14:03.030796Z"},"links":{"citing_paper":"/paper/1908.03811"},"observation_digest":"sha256:da1ed4162b2e743afaa0db20c93d9969027c8fe13590a68dbf62d26e91f6448c","observation_id":"9281380d-da25-48ee-a4c3-a15731648c81","resolution":{"observed_at":"2026-08-14T14:14:03.536228Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T14:14:03.514656Z","title":"Reducing degeneracy in maximum entropy models of networks","venue":null,"work_id":"464faf75-8b82-4d8b-b374-a95404377693","year":2015},"citing_paper":{"arxiv_id":"1908.03811","last_updated":"2020-05-14T11:07:21Z","snapshot_observed_at":"2026-08-16T03:37:43.849086Z","submitted_at":"2019-08-10T21:35:23Z","title":"Classical Information Theory of Networks","version":4},"reference_index":18,"source":"pdf_text","source_observed_at":"2026-08-14T14:14:03.035574Z"},"links":{"citing_paper":"/paper/1908.03811"},"observation_digest":"sha256:f60187057a2c1ebb23ea2af3022d5b70398bf6a0ba846f45c501afd017811894","observation_id":"ec4be36d-0473-4f54-9cf5-10df78f72e65","resolution":{"observed_at":"2026-08-14T14:14:03.520125Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T14:14:03.498577Z","title":"Statistical mechanics of multiedge networks","venue":null,"work_id":"9f10d6f3-c7dc-4817-bbd3-884a7c3a2fae","year":2013},"citing_paper":{"arxiv_id":"1908.03811","last_updated":"2020-05-14T11:07:21Z","snapshot_observed_at":"2026-08-16T03:37:43.849086Z","submitted_at":"2019-08-10T21:35:23Z","title":"Classical Information Theory of Networks","version":4},"reference_index":19,"source":"pdf_text","source_observed_at":"2026-08-14T14:14:03.039968Z"},"links":{"citing_paper":"/paper/1908.03811"},"observation_digest":"sha256:99d3aa5db7061f8c104fc66a3fb214f82e466fb38f0de5d2953f6e14f2852118","observation_id":"5efba4ed-75dd-41a6-86f0-eef2098d4272","resolution":{"observed_at":"2026-08-14T14:14:03.503534Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T14:14:03.483000Z","title":"An exponential family of probability distributions for directed graphs","venue":null,"work_id":"3c4ae0f2-b871-4f8d-bc9c-b240e1b648ec","year":1981},"citing_paper":{"arxiv_id":"1908.03811","last_updated":"2020-05-14T11:07:21Z","snapshot_observed_at":"2026-08-16T03:37:43.849086Z","submitted_at":"2019-08-10T21:35:23Z","title":"Classical Information Theory of Networks","version":4},"reference_index":20,"source":"pdf_text","source_observed_at":"2026-08-14T14:14:03.044985Z"},"links":{"citing_paper":"/paper/1908.03811"},"observation_digest":"sha256:3b1ee93413cd9438a80e1dd75e91bbb0247b4ffc1922a0a160226a72652aa024","observation_id":"d51e6a52-1f60-4d77-ba97-b45cc7d2ae6d","resolution":{"observed_at":"2026-08-14T14:14:03.487698Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T14:14:03.049874Z","title":"Emergence of scaling in random networks","venue":null,"work_id":null,"year":1999},"citing_paper":{"arxiv_id":"1908.03811","last_updated":"2020-05-14T11:07:21Z","snapshot_observed_at":"2026-08-16T03:37:43.849086Z","submitted_at":"2019-08-10T21:35:23Z","title":"Classical Information Theory of Networks","version":4},"reference_index":21,"source":"pdf_text","source_observed_at":"2026-08-14T14:14:03.049874Z"},"links":{"citing_paper":"/paper/1908.03811"},"observation_digest":"sha256:2e2b8c4c82eb786c50159304cc556531d5e8227721768a3d8ff4246e07271e6b","observation_id":"2db42b7a-e2d8-4dd3-8e6b-a8eb4ebe90f9","resolution":{"observed_at":"2026-08-14T14:14:03.049874Z","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":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T14:14:03.459186Z","title":"Scale-free networks well done","venue":null,"work_id":"3ddfb025-1367-4840-a3a8-b43adcb30963","year":2019},"citing_paper":{"arxiv_id":"1908.03811","last_updated":"2020-05-14T11:07:21Z","snapshot_observed_at":"2026-08-16T03:37:43.849086Z","submitted_at":"2019-08-10T21:35:23Z","title":"Classical Information Theory of Networks","version":4},"reference_index":22,"source":"pdf_text","source_observed_at":"2026-08-14T14:14:03.054117Z"},"links":{"citing_paper":"/paper/1908.03811"},"observation_digest":"sha256:e9afea37844a3b376047566eabdb1f289456096cffe99faedc74fb7b7bc830d0","observation_id":"4cd210e6-3a4a-4a7f-81ef-23537ba874bc","resolution":{"observed_at":"2026-08-14T14:14:03.463309Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T14:14:03.058758Z","title":"The architecture of complex weighted networks","venue":null,"work_id":null,"year":2004},"citing_paper":{"arxiv_id":"1908.03811","last_updated":"2020-05-14T11:07:21Z","snapshot_observed_at":"2026-08-16T03:37:43.849086Z","submitted_at":"2019-08-10T21:35:23Z","title":"Classical Information Theory of Networks","version":4},"reference_index":23,"source":"pdf_text","source_observed_at":"2026-08-14T14:14:03.058758Z"},"links":{"citing_paper":"/paper/1908.03811"},"observation_digest":"sha256:50043b4eb788e707858f769df8be2f4b5720ad8a7b3b7472298e05451030813a","observation_id":"74debd28-c525-455f-a1b2-ad4c48f9ca46","resolution":{"observed_at":"2026-08-14T14:14:03.058758Z","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":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T14:14:03.433417Z","title":"Defining and identifying communities in networks","venue":null,"work_id":"879d344c-89e0-4d76-a6c3-359325a75515","year":2004},"citing_paper":{"arxiv_id":"1908.03811","last_updated":"2020-05-14T11:07:21Z","snapshot_observed_at":"2026-08-16T03:37:43.849086Z","submitted_at":"2019-08-10T21:35:23Z","title":"Classical Information Theory of Networks","version":4},"reference_index":24,"source":"pdf_text","source_observed_at":"2026-08-14T14:14:03.063970Z"},"links":{"citing_paper":"/paper/1908.03811"},"observation_digest":"sha256:971b95840094e76094a02bfbef50ee8a468262e782084e2a61b3829d2dcbb50d","observation_id":"e7c58fb2-376b-42cc-ab88-b9efd29ee9e3","resolution":{"observed_at":"2026-08-14T14:14:03.438477Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T14:14:03.068700Z","title":"Benchmark graphs for testing community detection algorithms","venue":null,"work_id":null,"year":2008},"citing_paper":{"arxiv_id":"1908.03811","last_updated":"2020-05-14T11:07:21Z","snapshot_observed_at":"2026-08-16T03:37:43.849086Z","submitted_at":"2019-08-10T21:35:23Z","title":"Classical Information Theory of Networks","version":4},"reference_index":25,"source":"pdf_text","source_observed_at":"2026-08-14T14:14:03.068700Z"},"links":{"citing_paper":"/paper/1908.03811"},"observation_digest":"sha256:5be6809379aae629a9e0f38170b4d3b4ec5c81a895848ccffac5b58d274fe07f","observation_id":"2d9266bf-4ea6-42d9-ae03-1580885c6cee","resolution":{"observed_at":"2026-08-14T14:14:03.068700Z","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":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T14:14:03.407385Z","title":"Information theory, inference and learning algorithms","venue":null,"work_id":"93595e95-f768-4431-88cf-394b574d0079","year":2003},"citing_paper":{"arxiv_id":"1908.03811","last_updated":"2020-05-14T11:07:21Z","snapshot_observed_at":"2026-08-16T03:37:43.849086Z","submitted_at":"2019-08-10T21:35:23Z","title":"Classical Information Theory of Networks","version":4},"reference_index":26,"source":"pdf_text","source_observed_at":"2026-08-14T14:14:03.074733Z"},"links":{"citing_paper":"/paper/1908.03811"},"observation_digest":"sha256:312ea5e27a5657e1b9b081a3ada54f24ba029abdb854066ec6a334fd215126b2","observation_id":"d5b90dd1-ce94-4196-bbb6-a72df502cfc1","resolution":{"observed_at":"2026-08-14T14:14:03.412529Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T14:14:03.392300Z","title":"On random graphs i.Publ","venue":null,"work_id":"815284c9-2d4d-4a24-8d41-9e0e9bda4261","year":1959},"citing_paper":{"arxiv_id":"1908.03811","last_updated":"2020-05-14T11:07:21Z","snapshot_observed_at":"2026-08-16T03:37:43.849086Z","submitted_at":"2019-08-10T21:35:23Z","title":"Classical Information Theory of Networks","version":4},"reference_index":27,"source":"pdf_text","source_observed_at":"2026-08-14T14:14:03.079568Z"},"links":{"citing_paper":"/paper/1908.03811"},"observation_digest":"sha256:e7c003a966937764ff05786bf796c30e99f0a4c1615ac7f1dab6b3088f1a5f40","observation_id":"56f01d4e-9003-4dde-a72f-2535fb76aa5a","resolution":{"observed_at":"2026-08-14T14:14:03.396803Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T14:14:03.377435Z","title":"Number 73","venue":null,"work_id":"625b4909-7cd7-466d-bbde-5e16650e72ff","year":2001},"citing_paper":{"arxiv_id":"1908.03811","last_updated":"2020-05-14T11:07:21Z","snapshot_observed_at":"2026-08-16T03:37:43.849086Z","submitted_at":"2019-08-10T21:35:23Z","title":"Classical Information Theory of Networks","version":4},"reference_index":28,"source":"pdf_text","source_observed_at":"2026-08-14T14:14:03.083527Z"},"links":{"citing_paper":"/paper/1908.03811"},"observation_digest":"sha256:ac7df268571e12ccf3eee8ee571d1507577b5a9645cf456929aa4f87651c48fc","observation_id":"71d3995f-6b4a-4d08-9632-04ebedd47d4a","resolution":{"observed_at":"2026-08-14T14:14:03.382364Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T14:14:03.361804Z","title":"Breaking of ensemble equivalence in networks","venue":null,"work_id":"af9ee20c-4cd7-4fdc-b21a-63bc1e37a52f","year":2015},"citing_paper":{"arxiv_id":"1908.03811","last_updated":"2020-05-14T11:07:21Z","snapshot_observed_at":"2026-08-16T03:37:43.849086Z","submitted_at":"2019-08-10T21:35:23Z","title":"Classical Information Theory of Networks","version":4},"reference_index":29,"source":"pdf_text","source_observed_at":"2026-08-14T14:14:03.088036Z"},"links":{"citing_paper":"/paper/1908.03811"},"observation_digest":"sha256:d4a895fa612e688fc86cf6ac59fc7a70fe361d2e5fd4431174d10ee2a2c875a9","observation_id":"0d995a77-5afd-486a-9285-e55c07a9fc02","resolution":{"observed_at":"2026-08-14T14:14:03.366683Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T14:14:03.348182Z","title":"A critical point for random graphs with a given degree sequence","venue":null,"work_id":"dda48159-e54e-49a9-870a-4593425d82a3","year":1995},"citing_paper":{"arxiv_id":"1908.03811","last_updated":"2020-05-14T11:07:21Z","snapshot_observed_at":"2026-08-16T03:37:43.849086Z","submitted_at":"2019-08-10T21:35:23Z","title":"Classical Information Theory of Networks","version":4},"reference_index":30,"source":"pdf_text","source_observed_at":"2026-08-14T14:14:03.093236Z"},"links":{"citing_paper":"/paper/1908.03811"},"observation_digest":"sha256:881594c395ae645588eaa3ec0a588fca3ca632b0dcf465c71f1336a19c71fa96","observation_id":"eb032662-1127-4747-a565-f970e37d6630","resolution":{"observed_at":"2026-08-14T14:14:03.352382Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T14:14:03.331250Z","title":"Generalized bose-fermi statistics and structural correlations in weighted networks","venue":null,"work_id":"24ed0ac4-b53e-43fb-ba53-d2848cadf1ee","year":2009},"citing_paper":{"arxiv_id":"1908.03811","last_updated":"2020-05-14T11:07:21Z","snapshot_observed_at":"2026-08-16T03:37:43.849086Z","submitted_at":"2019-08-10T21:35:23Z","title":"Classical Information Theory of Networks","version":4},"reference_index":31,"source":"pdf_text","source_observed_at":"2026-08-14T14:14:03.097918Z"},"links":{"citing_paper":"/paper/1908.03811"},"observation_digest":"sha256:f941ab8d9611da5ded81b4a0ff5282a7ec3457cb56b0bb946cb33568460b185d","observation_id":"f1b7d6f3-6a60-4c27-856d-ee1a7f48b3df","resolution":{"observed_at":"2026-08-14T14:14:03.336353Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T14:14:03.315006Z","title":"Finding and evaluating community structure in networks","venue":null,"work_id":"fc6b4213-e9b8-470a-9f60-a1839981250e","year":2004},"citing_paper":{"arxiv_id":"1908.03811","last_updated":"2020-05-14T11:07:21Z","snapshot_observed_at":"2026-08-16T03:37:43.849086Z","submitted_at":"2019-08-10T21:35:23Z","title":"Classical Information Theory of Networks","version":4},"reference_index":32,"source":"pdf_text","source_observed_at":"2026-08-14T14:14:03.103105Z"},"links":{"citing_paper":"/paper/1908.03811"},"observation_digest":"sha256:e9be88401d9ceb7d877e99aed6b4f5eec9d14749c9350a0a73c982e8c6a76046","observation_id":"2935f3f7-f31f-4eb5-a5aa-04aa191bd5bd","resolution":{"observed_at":"2026-08-14T14:14:03.320519Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T14:14:03.297876Z","title":"A few useful things to know about machine learning","venue":null,"work_id":"b084d46c-5d2b-4dde-ab17-716f40d5c06a","year":2012},"citing_paper":{"arxiv_id":"1908.03811","last_updated":"2020-05-14T11:07:21Z","snapshot_observed_at":"2026-08-16T03:37:43.849086Z","submitted_at":"2019-08-10T21:35:23Z","title":"Classical Information Theory of Networks","version":4},"reference_index":33,"source":"pdf_text","source_observed_at":"2026-08-14T14:14:03.108563Z"},"links":{"citing_paper":"/paper/1908.03811"},"observation_digest":"sha256:c6ec7f70dfd06e30c4eaef465d3b51086f0adccb7347bb60a1b51f0c22211f8e","observation_id":"ae605a68-35f2-492d-9903-a5c621532a43","resolution":{"observed_at":"2026-08-14T14:14:03.303126Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T14:14:03.281136Z","title":"Hyperbolic geometry of complex networks","venue":null,"work_id":"e4ee0b26-e268-4f59-b53d-e19c96933824","year":2010},"citing_paper":{"arxiv_id":"1908.03811","last_updated":"2020-05-14T11:07:21Z","snapshot_observed_at":"2026-08-16T03:37:43.849086Z","submitted_at":"2019-08-10T21:35:23Z","title":"Classical Information Theory of Networks","version":4},"reference_index":34,"source":"pdf_text","source_observed_at":"2026-08-14T14:14:03.113928Z"},"links":{"citing_paper":"/paper/1908.03811"},"observation_digest":"sha256:3bf62fa73d059bc5bd9e6c72564bb312a56087634ea649a718ee3c548f17ef0f","observation_id":"fb256a0a-95ff-4249-bec9-ff35532bd0e2","resolution":{"observed_at":"2026-08-14T14:14:03.286349Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T14:14:03.265446Z","title":null,"venue":null,"work_id":"ffa5bd83-d636-451b-ba3d-4c57fe5c8307","year":null},"citing_paper":{"arxiv_id":"1908.03811","last_updated":"2020-05-14T11:07:21Z","snapshot_observed_at":"2026-08-16T03:37:43.849086Z","submitted_at":"2019-08-10T21:35:23Z","title":"Classical Information Theory of Networks","version":4},"reference_index":35,"source":"pdf_text","source_observed_at":"2026-08-14T14:14:03.118240Z"},"links":{"citing_paper":"/paper/1908.03811"},"observation_digest":"sha256:f04e5e46dccb250fc64097d0b5a881372a41a6711d24b180b79db10ae2e6c859","observation_id":"f230837b-a395-4bc6-8701-67efac3e380b","resolution":{"observed_at":"2026-08-14T14:14:03.270259Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T14:14:03.251125Z","title":"Emergence of network features from multiplexity","venue":null,"work_id":"f517983f-4a70-4b5e-9a1a-b6fbe8fa5c49","year":2013},"citing_paper":{"arxiv_id":"1908.03811","last_updated":"2020-05-14T11:07:21Z","snapshot_observed_at":"2026-08-16T03:37:43.849086Z","submitted_at":"2019-08-10T21:35:23Z","title":"Classical Information Theory of Networks","version":4},"reference_index":36,"source":"pdf_text","source_observed_at":"2026-08-14T14:14:03.122530Z"},"links":{"citing_paper":"/paper/1908.03811"},"observation_digest":"sha256:d58710a6b7b69fb752d2e1cacbd64f4ac277022490d123b027ee7e7d9dc63b7d","observation_id":"0b145fce-454e-4ef0-b812-7a44fdaa24f3","resolution":{"observed_at":"2026-08-14T14:14:03.255438Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T14:14:03.234139Z","title":"Statistical mechanics of multiplex networks: Entropy and overlap","venue":null,"work_id":"786b0bcd-9256-4b5f-bc71-43cf10b5e3d7","year":2013},"citing_paper":{"arxiv_id":"1908.03811","last_updated":"2020-05-14T11:07:21Z","snapshot_observed_at":"2026-08-16T03:37:43.849086Z","submitted_at":"2019-08-10T21:35:23Z","title":"Classical Information Theory of Networks","version":4},"reference_index":37,"source":"pdf_text","source_observed_at":"2026-08-14T14:14:03.127584Z"},"links":{"citing_paper":"/paper/1908.03811"},"observation_digest":"sha256:adf8cf250d3210127574ca32bed40095d9957aabecf54664b557a18d19b76928","observation_id":"81c046e9-4298-404b-9a21-f51122e872a6","resolution":{"observed_at":"2026-08-14T14:14:03.239555Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T14:14:03.216534Z","title":"Generalized network structures: The configuration model and the canonical ensemble of simplicial complexes","venue":null,"work_id":"4d977876-2f6b-44e9-848b-becd8e188ba1","year":2016},"citing_paper":{"arxiv_id":"1908.03811","last_updated":"2020-05-14T11:07:21Z","snapshot_observed_at":"2026-08-16T03:37:43.849086Z","submitted_at":"2019-08-10T21:35:23Z","title":"Classical Information Theory of Networks","version":4},"reference_index":38,"source":"pdf_text","source_observed_at":"2026-08-14T14:14:03.133401Z"},"links":{"citing_paper":"/paper/1908.03811"},"observation_digest":"sha256:74395fa00fd783949a17be476961ee152c36e1c78f73bcb9f95f24a250816eae","observation_id":"e9ff5986-6f5d-4177-8ae7-98246befc1f9","resolution":{"observed_at":"2026-08-14T14:14:03.222636Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T14:14:03.137932Z","title":"Spectral entropies as information-theoretic tools for complex network comparison","venue":null,"work_id":null,"year":2016},"citing_paper":{"arxiv_id":"1908.03811","last_updated":"2020-05-14T11:07:21Z","snapshot_observed_at":"2026-08-16T03:37:43.849086Z","submitted_at":"2019-08-10T21:35:23Z","title":"Classical Information Theory of Networks","version":4},"reference_index":39,"source":"pdf_text","source_observed_at":"2026-08-14T14:14:03.137932Z"},"links":{"citing_paper":"/paper/1908.03811"},"observation_digest":"sha256:1ebbd5ec9e7f3fdcece103522218c651dcffe2b172d0cd0a2b119e2db8ecc206","observation_id":"60ae551c-2151-44f3-abd4-af62aab8b97a","resolution":{"observed_at":"2026-08-14T14:14:03.137932Z","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":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T14:14:03.191341Z","title":"Statistical Mechanics","venue":null,"work_id":"78298958-cd68-42aa-97f9-a7f028f474af","year":1963},"citing_paper":{"arxiv_id":"1908.03811","last_updated":"2020-05-14T11:07:21Z","snapshot_observed_at":"2026-08-16T03:37:43.849086Z","submitted_at":"2019-08-10T21:35:23Z","title":"Classical Information Theory of Networks","version":4},"reference_index":40,"source":"pdf_text","source_observed_at":"2026-08-14T14:14:03.143144Z"},"links":{"citing_paper":"/paper/1908.03811"},"observation_digest":"sha256:dd5be79955f814608ec8c9b1b5b50609696815001b1857645a5b159b51251d69","observation_id":"e5e21210-a230-4f58-9e7a-aad1ad761657","resolution":{"observed_at":"2026-08-14T14:14:03.196944Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}}],"paper":{"arxiv_id":"1908.03811","last_updated":"2020-05-14T11:07:21Z","latest_version":4,"primary_category":"physics.soc-ph","snapshot_observed_at":"2026-08-16T03:37:43.849086Z","submitted_at":"2019-08-10T21:35:23Z","title":"Classical Information Theory of Networks"},"reference_resolution":{"displayed":40,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":9,"verified_exact":0,"verified_fuzzy":31},"total_outbound_references":40},"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-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"thesis":"As of 16 August 2026, this Paper Citation Record lists 40 of 40 outbound references and 0 inbound Pith citation observations for arXiv:1908.03811."}