{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2022:I4LDA6OKFS6BWD3P2N5HVDVKZD","short_pith_number":"pith:I4LDA6OK","schema_version":"1.0","canonical_sha256":"47163079ca2cbc1b0f6fd37a7a8eaac8d46b4a8be85c49b6f2077a4b64770700","source":{"kind":"arxiv","id":"2206.05614","version":1},"attestation_state":"computed","paper":{"title":"Information theory of spatial network ensembles","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.SI","physics.soc-ph"],"primary_cat":"cond-mat.dis-nn","authors_text":"Ginestra Bianconi","submitted_at":"2022-06-11T21:01:01Z","abstract_excerpt":"This chapter provides a comprehensive and self-contained discussion of the most recent developments of information theory of networks. Maximum entropy models of networks are the least biased ensembles enforcing a set of constraints and are used in a number of application to produce null model of networks. Here maximum entropy ensembles of networks are introduced by distinguishing between microcanonical and canonical ensembles revealing the the non-equivalence of these two classes of ensembles in the case in which an extensive number of constraints is imposed. It is very common that network dat"},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"canonical_record":{"source":{"id":"2206.05614","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cond-mat.dis-nn","submitted_at":"2022-06-11T21:01:01Z","cross_cats_sorted":["cs.SI","physics.soc-ph"],"title_canon_sha256":"bbf162c94e9f581e06c61b0ab27d8542bda3d22b2015815466e03dd073264fc6","abstract_canon_sha256":"3f4ed2095df4447cb2261c290f6cd614461802d9a29cc5e66a1620caf6d852d8"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T04:31:00.981048Z","signature_b64":"a7u0pjDCLdgJ4F7huPPmqNCQsgzb1C62oq5WxcspKZZnRNj1Q2n1RJCRcYzkUCCpnla8+3aSuuyZ9bF3gTs8Dg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"47163079ca2cbc1b0f6fd37a7a8eaac8d46b4a8be85c49b6f2077a4b64770700","last_reissued_at":"2026-07-05T04:31:00.980522Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T04:31:00.980522Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Information theory of spatial network ensembles","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.SI","physics.soc-ph"],"primary_cat":"cond-mat.dis-nn","authors_text":"Ginestra Bianconi","submitted_at":"2022-06-11T21:01:01Z","abstract_excerpt":"This chapter provides a comprehensive and self-contained discussion of the most recent developments of information theory of networks. Maximum entropy models of networks are the least biased ensembles enforcing a set of constraints and are used in a number of application to produce null model of networks. Here maximum entropy ensembles of networks are introduced by distinguishing between microcanonical and canonical ensembles revealing the the non-equivalence of these two classes of ensembles in the case in which an extensive number of constraints is imposed. It is very common that network dat"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2206.05614","kind":"arxiv","version":1},"verdict":{"id":null,"model_set":{},"created_at":null,"strongest_claim":"","one_line_summary":"","pipeline_version":null,"weakest_assumption":"","pith_extraction_headline":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2206.05614/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"references":{"count":0,"sample":[],"resolved_work":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","internal_anchors":0},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"author_claims":{"count":0,"strong_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"builder_version":"pith-number-builder-2026-05-17-v1"},"aliases":[{"alias_kind":"arxiv","alias_value":"2206.05614","created_at":"2026-07-05T04:31:00.980585+00:00"},{"alias_kind":"arxiv_version","alias_value":"2206.05614v1","created_at":"2026-07-05T04:31:00.980585+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2206.05614","created_at":"2026-07-05T04:31:00.980585+00:00"},{"alias_kind":"pith_short_12","alias_value":"I4LDA6OKFS6B","created_at":"2026-07-05T04:31:00.980585+00:00"},{"alias_kind":"pith_short_16","alias_value":"I4LDA6OKFS6BWD3P","created_at":"2026-07-05T04:31:00.980585+00:00"},{"alias_kind":"pith_short_8","alias_value":"I4LDA6OK","created_at":"2026-07-05T04:31:00.980585+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/I4LDA6OKFS6BWD3P2N5HVDVKZD","json":"https://pith.science/pith/I4LDA6OKFS6BWD3P2N5HVDVKZD.json","graph_json":"https://pith.science/api/pith-number/I4LDA6OKFS6BWD3P2N5HVDVKZD/graph.json","events_json":"https://pith.science/api/pith-number/I4LDA6OKFS6BWD3P2N5HVDVKZD/events.json","paper":"https://pith.science/paper/I4LDA6OK"},"agent_actions":{"view_html":"https://pith.science/pith/I4LDA6OKFS6BWD3P2N5HVDVKZD","download_json":"https://pith.science/pith/I4LDA6OKFS6BWD3P2N5HVDVKZD.json","view_paper":"https://pith.science/paper/I4LDA6OK","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2206.05614&json=true","fetch_graph":"https://pith.science/api/pith-number/I4LDA6OKFS6BWD3P2N5HVDVKZD/graph.json","fetch_events":"https://pith.science/api/pith-number/I4LDA6OKFS6BWD3P2N5HVDVKZD/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/I4LDA6OKFS6BWD3P2N5HVDVKZD/action/timestamp_anchor","attest_storage":"https://pith.science/pith/I4LDA6OKFS6BWD3P2N5HVDVKZD/action/storage_attestation","attest_author":"https://pith.science/pith/I4LDA6OKFS6BWD3P2N5HVDVKZD/action/author_attestation","sign_citation":"https://pith.science/pith/I4LDA6OKFS6BWD3P2N5HVDVKZD/action/citation_signature","submit_replication":"https://pith.science/pith/I4LDA6OKFS6BWD3P2N5HVDVKZD/action/replication_record"}},"created_at":"2026-07-05T04:31:00.980585+00:00","updated_at":"2026-07-05T04:31:00.980585+00:00"}