{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:4UZ4TFFYETDR7DT5ZIW2O4DE52","short_pith_number":"pith:4UZ4TFFY","schema_version":"1.0","canonical_sha256":"e533c994b824c71f8e7dca2da77064ee80f4435a57e2b5d5009308f59d58a838","source":{"kind":"arxiv","id":"1703.07369","version":1},"attestation_state":"computed","paper":{"title":"Catching homologies by geometric entropy","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.MP"],"primary_cat":"math-ph","authors_text":"D. Felice, M. Pettini, R. Franzosi, S. Mancini","submitted_at":"2017-03-21T18:03:10Z","abstract_excerpt":"A geometric entropy is defined as the Riemannian volume of the parameter space of a statistical manifold associated with a given network. As such it can be a good candidate for measuring networks complexity. Here we investigate its ability to single out topological features of networks proceeding in a bottom-up manner: first we consider small size networks by analytical methods and then large size networks by numerical techniques. Two different classes of networks, the random graphs and the scale--free networks, are investigated computing their Betti numbers and then showing the capability of "},"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":"1703.07369","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math-ph","submitted_at":"2017-03-21T18:03:10Z","cross_cats_sorted":["math.MP"],"title_canon_sha256":"857a23ed37788bd4980d14d4385e9f91c3c43fc0eb21119066981a3b1af1d91b","abstract_canon_sha256":"2b1dfab60e2cc44657e7f6f2ddc0f3d56515edd808762ea3983db707bbfb6420"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:27:46.915850Z","signature_b64":"twR9H8KoWMsUGSM/AH7zAt649Ch13S+7oqOC819jp293tb1Kg3nBFy8LoxLo8x+NjTBK0bKMjCqlC5WaQ1TMBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"e533c994b824c71f8e7dca2da77064ee80f4435a57e2b5d5009308f59d58a838","last_reissued_at":"2026-05-18T00:27:46.915401Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:27:46.915401Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Catching homologies by geometric entropy","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.MP"],"primary_cat":"math-ph","authors_text":"D. Felice, M. Pettini, R. Franzosi, S. Mancini","submitted_at":"2017-03-21T18:03:10Z","abstract_excerpt":"A geometric entropy is defined as the Riemannian volume of the parameter space of a statistical manifold associated with a given network. As such it can be a good candidate for measuring networks complexity. Here we investigate its ability to single out topological features of networks proceeding in a bottom-up manner: first we consider small size networks by analytical methods and then large size networks by numerical techniques. Two different classes of networks, the random graphs and the scale--free networks, are investigated computing their Betti numbers and then showing the capability of "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1703.07369","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":""},"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":"1703.07369","created_at":"2026-05-18T00:27:46.915475+00:00"},{"alias_kind":"arxiv_version","alias_value":"1703.07369v1","created_at":"2026-05-18T00:27:46.915475+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1703.07369","created_at":"2026-05-18T00:27:46.915475+00:00"},{"alias_kind":"pith_short_12","alias_value":"4UZ4TFFYETDR","created_at":"2026-05-18T12:31:00.734936+00:00"},{"alias_kind":"pith_short_16","alias_value":"4UZ4TFFYETDR7DT5","created_at":"2026-05-18T12:31:00.734936+00:00"},{"alias_kind":"pith_short_8","alias_value":"4UZ4TFFY","created_at":"2026-05-18T12:31:00.734936+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/4UZ4TFFYETDR7DT5ZIW2O4DE52","json":"https://pith.science/pith/4UZ4TFFYETDR7DT5ZIW2O4DE52.json","graph_json":"https://pith.science/api/pith-number/4UZ4TFFYETDR7DT5ZIW2O4DE52/graph.json","events_json":"https://pith.science/api/pith-number/4UZ4TFFYETDR7DT5ZIW2O4DE52/events.json","paper":"https://pith.science/paper/4UZ4TFFY"},"agent_actions":{"view_html":"https://pith.science/pith/4UZ4TFFYETDR7DT5ZIW2O4DE52","download_json":"https://pith.science/pith/4UZ4TFFYETDR7DT5ZIW2O4DE52.json","view_paper":"https://pith.science/paper/4UZ4TFFY","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1703.07369&json=true","fetch_graph":"https://pith.science/api/pith-number/4UZ4TFFYETDR7DT5ZIW2O4DE52/graph.json","fetch_events":"https://pith.science/api/pith-number/4UZ4TFFYETDR7DT5ZIW2O4DE52/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/4UZ4TFFYETDR7DT5ZIW2O4DE52/action/timestamp_anchor","attest_storage":"https://pith.science/pith/4UZ4TFFYETDR7DT5ZIW2O4DE52/action/storage_attestation","attest_author":"https://pith.science/pith/4UZ4TFFYETDR7DT5ZIW2O4DE52/action/author_attestation","sign_citation":"https://pith.science/pith/4UZ4TFFYETDR7DT5ZIW2O4DE52/action/citation_signature","submit_replication":"https://pith.science/pith/4UZ4TFFYETDR7DT5ZIW2O4DE52/action/replication_record"}},"created_at":"2026-05-18T00:27:46.915475+00:00","updated_at":"2026-05-18T00:27:46.915475+00:00"}