{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2014:X6G7ANS2WWA25RSFC6T7B46ZA7","short_pith_number":"pith:X6G7ANS2","schema_version":"1.0","canonical_sha256":"bf8df0365ab581aec64517a7f0f3d907dbc0cf4f1ec3b45f3d6b7573c54134e3","source":{"kind":"arxiv","id":"1410.5459","version":5},"attestation_state":"computed","paper":{"title":"Riemannian-geometric entropy for measuring network complexity","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.MP"],"primary_cat":"math-ph","authors_text":"Domenico Felice, Marco Pettini, Roberto Franzosi, Stefano Mancini","submitted_at":"2014-10-20T20:44:14Z","abstract_excerpt":"A central issue of the science of complex systems is the quantitative characterization of complexity. In the present work we address this issue by resorting to information geometry. Actually we propose a constructive way to associate to a - in principle any - network a differentiable object (a Riemannian manifold) whose volume is used to define an entropy. The effectiveness of the latter to measure networks complexity is successfully proved through its capability of detecting a classical phase transition occurring in both random graphs and scale--free networks, as well as of characterizing sma"},"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":"1410.5459","kind":"arxiv","version":5},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math-ph","submitted_at":"2014-10-20T20:44:14Z","cross_cats_sorted":["math.MP"],"title_canon_sha256":"55793c2a7a5c99437d01f500551c3677af95fd174e99fe75a43548e4527ea724","abstract_canon_sha256":"6163db93acb9c51397e0e6ce8f4fbb325acfe11b99c06b3da08acd378641c690"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:27:55.514333Z","signature_b64":"JFkK2pDSZim3Rta/6dB5BlTbtHv/LVQPArcqLZS0nY9g4lmjLjTBn627YSR/1u/Hfav9FTO7vD+EVnWVNhCiCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"bf8df0365ab581aec64517a7f0f3d907dbc0cf4f1ec3b45f3d6b7573c54134e3","last_reissued_at":"2026-05-18T00:27:55.513659Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:27:55.513659Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Riemannian-geometric entropy for measuring network complexity","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.MP"],"primary_cat":"math-ph","authors_text":"Domenico Felice, Marco Pettini, Roberto Franzosi, Stefano Mancini","submitted_at":"2014-10-20T20:44:14Z","abstract_excerpt":"A central issue of the science of complex systems is the quantitative characterization of complexity. In the present work we address this issue by resorting to information geometry. Actually we propose a constructive way to associate to a - in principle any - network a differentiable object (a Riemannian manifold) whose volume is used to define an entropy. The effectiveness of the latter to measure networks complexity is successfully proved through its capability of detecting a classical phase transition occurring in both random graphs and scale--free networks, as well as of characterizing sma"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1410.5459","kind":"arxiv","version":5},"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":"1410.5459","created_at":"2026-05-18T00:27:55.513748+00:00"},{"alias_kind":"arxiv_version","alias_value":"1410.5459v5","created_at":"2026-05-18T00:27:55.513748+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1410.5459","created_at":"2026-05-18T00:27:55.513748+00:00"},{"alias_kind":"pith_short_12","alias_value":"X6G7ANS2WWA2","created_at":"2026-05-18T12:28:57.508820+00:00"},{"alias_kind":"pith_short_16","alias_value":"X6G7ANS2WWA25RSF","created_at":"2026-05-18T12:28:57.508820+00:00"},{"alias_kind":"pith_short_8","alias_value":"X6G7ANS2","created_at":"2026-05-18T12:28:57.508820+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/X6G7ANS2WWA25RSFC6T7B46ZA7","json":"https://pith.science/pith/X6G7ANS2WWA25RSFC6T7B46ZA7.json","graph_json":"https://pith.science/api/pith-number/X6G7ANS2WWA25RSFC6T7B46ZA7/graph.json","events_json":"https://pith.science/api/pith-number/X6G7ANS2WWA25RSFC6T7B46ZA7/events.json","paper":"https://pith.science/paper/X6G7ANS2"},"agent_actions":{"view_html":"https://pith.science/pith/X6G7ANS2WWA25RSFC6T7B46ZA7","download_json":"https://pith.science/pith/X6G7ANS2WWA25RSFC6T7B46ZA7.json","view_paper":"https://pith.science/paper/X6G7ANS2","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1410.5459&json=true","fetch_graph":"https://pith.science/api/pith-number/X6G7ANS2WWA25RSFC6T7B46ZA7/graph.json","fetch_events":"https://pith.science/api/pith-number/X6G7ANS2WWA25RSFC6T7B46ZA7/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/X6G7ANS2WWA25RSFC6T7B46ZA7/action/timestamp_anchor","attest_storage":"https://pith.science/pith/X6G7ANS2WWA25RSFC6T7B46ZA7/action/storage_attestation","attest_author":"https://pith.science/pith/X6G7ANS2WWA25RSFC6T7B46ZA7/action/author_attestation","sign_citation":"https://pith.science/pith/X6G7ANS2WWA25RSFC6T7B46ZA7/action/citation_signature","submit_replication":"https://pith.science/pith/X6G7ANS2WWA25RSFC6T7B46ZA7/action/replication_record"}},"created_at":"2026-05-18T00:27:55.513748+00:00","updated_at":"2026-05-18T00:27:55.513748+00:00"}