{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2019:IDY3ARRMVIVTKAS3ZVLXL3OGFP","short_pith_number":"pith:IDY3ARRM","schema_version":"1.0","canonical_sha256":"40f1b0462caa2b35025bcd5775edc62be7242e479f4c3c68459ad5017e86039a","source":{"kind":"arxiv","id":"1907.03902","version":2},"attestation_state":"computed","paper":{"title":"The emergence of informative higher scales in complex networks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.SI"],"primary_cat":"physics.soc-ph","authors_text":"Brennan Klein, Erik Hoel","submitted_at":"2019-07-08T23:00:27Z","abstract_excerpt":"The connectivity of a network contains information about the relationships between nodes, which can denote interactions, associations, or dependencies. We show that this information can be analyzed by measuring the uncertainty (and certainty) contained in paths along nodes and links in a network. Specifically, we derive from first principles a measure known as effective information and describe its behavior in common network models. Networks with higher effective information contain more information in the relationships between nodes. We show how subgraphs of nodes can be grouped into macro-no"},"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":"1907.03902","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"physics.soc-ph","submitted_at":"2019-07-08T23:00:27Z","cross_cats_sorted":["cs.SI"],"title_canon_sha256":"4fc11fdb1a84eb0c7f451aa1edf27d629e21b33c60bb9608e326359ec598d0d0","abstract_canon_sha256":"b998cf0b0b9d1b646fa36d55b4b87aab0f52e4d42ccae4f44e855d8645f0b700"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T00:35:01.177144Z","signature_b64":"JH3Au7qlxCvbikLjLO7sRQS3LstGQQ1SwER6bNcW+SPia5Jp/4Adj5tXMAhbMXo/cYyxR/RzgS0d3fH8CmHnAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"40f1b0462caa2b35025bcd5775edc62be7242e479f4c3c68459ad5017e86039a","last_reissued_at":"2026-07-05T00:35:01.176677Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T00:35:01.176677Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"The emergence of informative higher scales in complex networks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.SI"],"primary_cat":"physics.soc-ph","authors_text":"Brennan Klein, Erik Hoel","submitted_at":"2019-07-08T23:00:27Z","abstract_excerpt":"The connectivity of a network contains information about the relationships between nodes, which can denote interactions, associations, or dependencies. We show that this information can be analyzed by measuring the uncertainty (and certainty) contained in paths along nodes and links in a network. Specifically, we derive from first principles a measure known as effective information and describe its behavior in common network models. Networks with higher effective information contain more information in the relationships between nodes. We show how subgraphs of nodes can be grouped into macro-no"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1907.03902","kind":"arxiv","version":2},"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/1907.03902/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":"1907.03902","created_at":"2026-07-05T00:35:01.176737+00:00"},{"alias_kind":"arxiv_version","alias_value":"1907.03902v2","created_at":"2026-07-05T00:35:01.176737+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1907.03902","created_at":"2026-07-05T00:35:01.176737+00:00"},{"alias_kind":"pith_short_12","alias_value":"IDY3ARRMVIVT","created_at":"2026-07-05T00:35:01.176737+00:00"},{"alias_kind":"pith_short_16","alias_value":"IDY3ARRMVIVTKAS3","created_at":"2026-07-05T00:35:01.176737+00:00"},{"alias_kind":"pith_short_8","alias_value":"IDY3ARRM","created_at":"2026-07-05T00:35:01.176737+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"1908.07565","citing_title":"Finding the right scale of a network: Efficient identification of causal emergence through spectral clustering","ref_index":2,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/IDY3ARRMVIVTKAS3ZVLXL3OGFP","json":"https://pith.science/pith/IDY3ARRMVIVTKAS3ZVLXL3OGFP.json","graph_json":"https://pith.science/api/pith-number/IDY3ARRMVIVTKAS3ZVLXL3OGFP/graph.json","events_json":"https://pith.science/api/pith-number/IDY3ARRMVIVTKAS3ZVLXL3OGFP/events.json","paper":"https://pith.science/paper/IDY3ARRM"},"agent_actions":{"view_html":"https://pith.science/pith/IDY3ARRMVIVTKAS3ZVLXL3OGFP","download_json":"https://pith.science/pith/IDY3ARRMVIVTKAS3ZVLXL3OGFP.json","view_paper":"https://pith.science/paper/IDY3ARRM","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1907.03902&json=true","fetch_graph":"https://pith.science/api/pith-number/IDY3ARRMVIVTKAS3ZVLXL3OGFP/graph.json","fetch_events":"https://pith.science/api/pith-number/IDY3ARRMVIVTKAS3ZVLXL3OGFP/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/IDY3ARRMVIVTKAS3ZVLXL3OGFP/action/timestamp_anchor","attest_storage":"https://pith.science/pith/IDY3ARRMVIVTKAS3ZVLXL3OGFP/action/storage_attestation","attest_author":"https://pith.science/pith/IDY3ARRMVIVTKAS3ZVLXL3OGFP/action/author_attestation","sign_citation":"https://pith.science/pith/IDY3ARRMVIVTKAS3ZVLXL3OGFP/action/citation_signature","submit_replication":"https://pith.science/pith/IDY3ARRMVIVTKAS3ZVLXL3OGFP/action/replication_record"}},"created_at":"2026-07-05T00:35:01.176737+00:00","updated_at":"2026-07-05T00:35:01.176737+00:00"}