{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:Z3KZYK45LA2AWI4JBARMGJZL6B","short_pith_number":"pith:Z3KZYK45","schema_version":"1.0","canonical_sha256":"ced59c2b9d58340b23890822c3272bf06a06f97ab380a2a96fc539783837d307","source":{"kind":"arxiv","id":"1704.07599","version":2},"attestation_state":"computed","paper":{"title":"Mapping and discrimination of networks in the complexity-entropy plane","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["physics.soc-ph"],"primary_cat":"physics.data-an","authors_text":"Jonathan F. Donges, J\\\"urgen Kurths, Marc Wiedermann, Reik V. Donner","submitted_at":"2017-04-25T09:20:19Z","abstract_excerpt":"Complex networks are usually characterized in terms of their topological, spatial, or information-theoretic properties and combinations of the associated metrics are used to discriminate networks into different classes or categories. However, even with the present variety of characteristics at hand it still remains a subject of current research to appropriately quantify a network's complexity and correspondingly discriminate between different types of complex networks, like infrastructure or social networks, on such a basis. Here, we explore the possibility to classify complex networks by mean"},"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":"1704.07599","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"physics.data-an","submitted_at":"2017-04-25T09:20:19Z","cross_cats_sorted":["physics.soc-ph"],"title_canon_sha256":"3a5c8201ec4b7fbc752e4bb74728958c2407bdbd7642acd127c99124f272458f","abstract_canon_sha256":"6615ca2b30c892b0bac75a622d196270724bcfea49165c92c2d04301b3a7ce34"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:32:10.613856Z","signature_b64":"M8EwJLns/nw33D72lioZDBec9Dr+3B+ZL2wHufVEnld8DDp5j2+fA7xjIXHq7aiCc5YxmS/ixthuSAvx3iWeDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"ced59c2b9d58340b23890822c3272bf06a06f97ab380a2a96fc539783837d307","last_reissued_at":"2026-05-18T00:32:10.613148Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:32:10.613148Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Mapping and discrimination of networks in the complexity-entropy plane","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["physics.soc-ph"],"primary_cat":"physics.data-an","authors_text":"Jonathan F. Donges, J\\\"urgen Kurths, Marc Wiedermann, Reik V. Donner","submitted_at":"2017-04-25T09:20:19Z","abstract_excerpt":"Complex networks are usually characterized in terms of their topological, spatial, or information-theoretic properties and combinations of the associated metrics are used to discriminate networks into different classes or categories. However, even with the present variety of characteristics at hand it still remains a subject of current research to appropriately quantify a network's complexity and correspondingly discriminate between different types of complex networks, like infrastructure or social networks, on such a basis. Here, we explore the possibility to classify complex networks by mean"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1704.07599","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":""},"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":"1704.07599","created_at":"2026-05-18T00:32:10.613260+00:00"},{"alias_kind":"arxiv_version","alias_value":"1704.07599v2","created_at":"2026-05-18T00:32:10.613260+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1704.07599","created_at":"2026-05-18T00:32:10.613260+00:00"},{"alias_kind":"pith_short_12","alias_value":"Z3KZYK45LA2A","created_at":"2026-05-18T12:31:59.375834+00:00"},{"alias_kind":"pith_short_16","alias_value":"Z3KZYK45LA2AWI4J","created_at":"2026-05-18T12:31:59.375834+00:00"},{"alias_kind":"pith_short_8","alias_value":"Z3KZYK45","created_at":"2026-05-18T12:31:59.375834+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/Z3KZYK45LA2AWI4JBARMGJZL6B","json":"https://pith.science/pith/Z3KZYK45LA2AWI4JBARMGJZL6B.json","graph_json":"https://pith.science/api/pith-number/Z3KZYK45LA2AWI4JBARMGJZL6B/graph.json","events_json":"https://pith.science/api/pith-number/Z3KZYK45LA2AWI4JBARMGJZL6B/events.json","paper":"https://pith.science/paper/Z3KZYK45"},"agent_actions":{"view_html":"https://pith.science/pith/Z3KZYK45LA2AWI4JBARMGJZL6B","download_json":"https://pith.science/pith/Z3KZYK45LA2AWI4JBARMGJZL6B.json","view_paper":"https://pith.science/paper/Z3KZYK45","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1704.07599&json=true","fetch_graph":"https://pith.science/api/pith-number/Z3KZYK45LA2AWI4JBARMGJZL6B/graph.json","fetch_events":"https://pith.science/api/pith-number/Z3KZYK45LA2AWI4JBARMGJZL6B/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/Z3KZYK45LA2AWI4JBARMGJZL6B/action/timestamp_anchor","attest_storage":"https://pith.science/pith/Z3KZYK45LA2AWI4JBARMGJZL6B/action/storage_attestation","attest_author":"https://pith.science/pith/Z3KZYK45LA2AWI4JBARMGJZL6B/action/author_attestation","sign_citation":"https://pith.science/pith/Z3KZYK45LA2AWI4JBARMGJZL6B/action/citation_signature","submit_replication":"https://pith.science/pith/Z3KZYK45LA2AWI4JBARMGJZL6B/action/replication_record"}},"created_at":"2026-05-18T00:32:10.613260+00:00","updated_at":"2026-05-18T00:32:10.613260+00:00"}