{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2014:X6G7ANS2WWA25RSFC6T7B46ZA7","short_pith_number":"pith:X6G7ANS2","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"},"canonical_sha256":"bf8df0365ab581aec64517a7f0f3d907dbc0cf4f1ec3b45f3d6b7573c54134e3","source":{"kind":"arxiv","id":"1410.5459","version":5},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1410.5459","created_at":"2026-05-18T00:27:55Z"},{"alias_kind":"arxiv_version","alias_value":"1410.5459v5","created_at":"2026-05-18T00:27:55Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1410.5459","created_at":"2026-05-18T00:27:55Z"},{"alias_kind":"pith_short_12","alias_value":"X6G7ANS2WWA2","created_at":"2026-05-18T12:28:57Z"},{"alias_kind":"pith_short_16","alias_value":"X6G7ANS2WWA25RSF","created_at":"2026-05-18T12:28:57Z"},{"alias_kind":"pith_short_8","alias_value":"X6G7ANS2","created_at":"2026-05-18T12:28:57Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2014:X6G7ANS2WWA25RSFC6T7B46ZA7","target":"record","payload":{"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"},"canonical_sha256":"bf8df0365ab581aec64517a7f0f3d907dbc0cf4f1ec3b45f3d6b7573c54134e3","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"},"source_kind":"arxiv","source_id":"1410.5459","source_version":5,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T00:27:55Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"zdd10pw+WOKOzcENi3mNkrcftRkaRN2Usoobk3d5aVVHts0BJ+3eB542AJcZ0eS5FWYrtFkJTUgtTWecDRrcCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T10:28:25.032287Z"},"content_sha256":"35f1b818db0ca72fb8bdaba83159a1eea6d9244c16a741434dbc506de87213d2","schema_version":"1.0","event_id":"sha256:35f1b818db0ca72fb8bdaba83159a1eea6d9244c16a741434dbc506de87213d2"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2014:X6G7ANS2WWA25RSFC6T7B46ZA7","target":"graph","payload":{"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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T00:27:55Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"3o+shEqL9IIUlCeHeiVl79TVmPuHFE83WvyMjy4Zxdf1og6osESze4nTdYDfQdsnmvtisvRTR2x4wsQAv1/SBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T10:28:25.032654Z"},"content_sha256":"2ae453cdb1ffd542a47821536842feec6f01b3012f817ca4be66ced48b97b091","schema_version":"1.0","event_id":"sha256:2ae453cdb1ffd542a47821536842feec6f01b3012f817ca4be66ced48b97b091"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/X6G7ANS2WWA25RSFC6T7B46ZA7/bundle.json","state_url":"https://pith.science/pith/X6G7ANS2WWA25RSFC6T7B46ZA7/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/X6G7ANS2WWA25RSFC6T7B46ZA7/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-05-28T10:28:25Z","links":{"resolver":"https://pith.science/pith/X6G7ANS2WWA25RSFC6T7B46ZA7","bundle":"https://pith.science/pith/X6G7ANS2WWA25RSFC6T7B46ZA7/bundle.json","state":"https://pith.science/pith/X6G7ANS2WWA25RSFC6T7B46ZA7/state.json","well_known_bundle":"https://pith.science/.well-known/pith/X6G7ANS2WWA25RSFC6T7B46ZA7/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:X6G7ANS2WWA25RSFC6T7B46ZA7","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"6163db93acb9c51397e0e6ce8f4fbb325acfe11b99c06b3da08acd378641c690","cross_cats_sorted":["math.MP"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math-ph","submitted_at":"2014-10-20T20:44:14Z","title_canon_sha256":"55793c2a7a5c99437d01f500551c3677af95fd174e99fe75a43548e4527ea724"},"schema_version":"1.0","source":{"id":"1410.5459","kind":"arxiv","version":5}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1410.5459","created_at":"2026-05-18T00:27:55Z"},{"alias_kind":"arxiv_version","alias_value":"1410.5459v5","created_at":"2026-05-18T00:27:55Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1410.5459","created_at":"2026-05-18T00:27:55Z"},{"alias_kind":"pith_short_12","alias_value":"X6G7ANS2WWA2","created_at":"2026-05-18T12:28:57Z"},{"alias_kind":"pith_short_16","alias_value":"X6G7ANS2WWA25RSF","created_at":"2026-05-18T12:28:57Z"},{"alias_kind":"pith_short_8","alias_value":"X6G7ANS2","created_at":"2026-05-18T12:28:57Z"}],"graph_snapshots":[{"event_id":"sha256:2ae453cdb1ffd542a47821536842feec6f01b3012f817ca4be66ced48b97b091","target":"graph","created_at":"2026-05-18T00:27:55Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"paper":{"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","authors_text":"Domenico Felice, Marco Pettini, Roberto Franzosi, Stefano Mancini","cross_cats":["math.MP"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math-ph","submitted_at":"2014-10-20T20:44:14Z","title":"Riemannian-geometric entropy for measuring network complexity"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1410.5459","kind":"arxiv","version":5},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:35f1b818db0ca72fb8bdaba83159a1eea6d9244c16a741434dbc506de87213d2","target":"record","created_at":"2026-05-18T00:27:55Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"6163db93acb9c51397e0e6ce8f4fbb325acfe11b99c06b3da08acd378641c690","cross_cats_sorted":["math.MP"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math-ph","submitted_at":"2014-10-20T20:44:14Z","title_canon_sha256":"55793c2a7a5c99437d01f500551c3677af95fd174e99fe75a43548e4527ea724"},"schema_version":"1.0","source":{"id":"1410.5459","kind":"arxiv","version":5}},"canonical_sha256":"bf8df0365ab581aec64517a7f0f3d907dbc0cf4f1ec3b45f3d6b7573c54134e3","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"bf8df0365ab581aec64517a7f0f3d907dbc0cf4f1ec3b45f3d6b7573c54134e3","first_computed_at":"2026-05-18T00:27:55.513659Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:27:55.513659Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"JFkK2pDSZim3Rta/6dB5BlTbtHv/LVQPArcqLZS0nY9g4lmjLjTBn627YSR/1u/Hfav9FTO7vD+EVnWVNhCiCg==","signature_status":"signed_v1","signed_at":"2026-05-18T00:27:55.514333Z","signed_message":"canonical_sha256_bytes"},"source_id":"1410.5459","source_kind":"arxiv","source_version":5}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:35f1b818db0ca72fb8bdaba83159a1eea6d9244c16a741434dbc506de87213d2","sha256:2ae453cdb1ffd542a47821536842feec6f01b3012f817ca4be66ced48b97b091"],"state_sha256":"b539d42717fbb1e0ac9610b15dce3b8052396878a5f0f1434b78a959b8c8338a"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"FWBJFc2M+q7azmaQs5RH3aOvIGB3nNnSymlZP2CobfAhwC+JMuc5QQmaQwYVI7hbyrzD98c7EfYgXP1QYgGTCA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-28T10:28:25.034579Z","bundle_sha256":"de25fbd1cedee34f394c02e45343c40496055e266ec793bab68c4fdca8ac9928"}}