{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:IFISBUEO3GQGZ67HC2HFBCSBOQ","short_pith_number":"pith:IFISBUEO","schema_version":"1.0","canonical_sha256":"415120d08ed9a06cfbe7168e508a417426bebbdff8e3d6350823ec29e06b6931","source":{"kind":"arxiv","id":"1502.00780","version":1},"attestation_state":"computed","paper":{"title":"Measure the similarity of nodes in the complex networks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["physics.soc-ph"],"primary_cat":"cs.SI","authors_text":"Meizhu Li, Qi Zhang, Sankaran Mahadevan, Yong Deng","submitted_at":"2015-02-03T08:48:48Z","abstract_excerpt":"Measure the similarity of the nodes in the complex networks have interested many researchers to explore it. In this paper, a new method which is based on the degree centrality and the Relative-entropy is proposed to measure the similarity of the nodes in the complex networks. The results in this paper show that, the nodes which have a common structure property always have a high similarity to others nodes. The nodes which have a high influential to others always have a small value of similarity to other nodes and the marginal nodes also have a low similar to other nodes. The results in this pa"},"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":"1502.00780","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SI","submitted_at":"2015-02-03T08:48:48Z","cross_cats_sorted":["physics.soc-ph"],"title_canon_sha256":"512551fdbf21c173a7a7eac772326c9900d721fa33cc152997e56781f1765000","abstract_canon_sha256":"9e5f466a6fc708bc58bb287e60708366a71111dd31336fbfca4032cdea08f8a5"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:28:04.322644Z","signature_b64":"oEK7AyebWxEhnU/9G8P4M1DxNJ445fWpVo0SGZJp7v4cyklA6QbhNTpeN0hTfIy1DlGeaJ+gZLOFSQmPvInjBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"415120d08ed9a06cfbe7168e508a417426bebbdff8e3d6350823ec29e06b6931","last_reissued_at":"2026-05-18T02:28:04.322221Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:28:04.322221Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Measure the similarity of nodes in the complex networks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["physics.soc-ph"],"primary_cat":"cs.SI","authors_text":"Meizhu Li, Qi Zhang, Sankaran Mahadevan, Yong Deng","submitted_at":"2015-02-03T08:48:48Z","abstract_excerpt":"Measure the similarity of the nodes in the complex networks have interested many researchers to explore it. In this paper, a new method which is based on the degree centrality and the Relative-entropy is proposed to measure the similarity of the nodes in the complex networks. The results in this paper show that, the nodes which have a common structure property always have a high similarity to others nodes. The nodes which have a high influential to others always have a small value of similarity to other nodes and the marginal nodes also have a low similar to other nodes. The results in this pa"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1502.00780","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":"1502.00780","created_at":"2026-05-18T02:28:04.322277+00:00"},{"alias_kind":"arxiv_version","alias_value":"1502.00780v1","created_at":"2026-05-18T02:28:04.322277+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1502.00780","created_at":"2026-05-18T02:28:04.322277+00:00"},{"alias_kind":"pith_short_12","alias_value":"IFISBUEO3GQG","created_at":"2026-05-18T12:29:25.134429+00:00"},{"alias_kind":"pith_short_16","alias_value":"IFISBUEO3GQGZ67H","created_at":"2026-05-18T12:29:25.134429+00:00"},{"alias_kind":"pith_short_8","alias_value":"IFISBUEO","created_at":"2026-05-18T12:29:25.134429+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/IFISBUEO3GQGZ67HC2HFBCSBOQ","json":"https://pith.science/pith/IFISBUEO3GQGZ67HC2HFBCSBOQ.json","graph_json":"https://pith.science/api/pith-number/IFISBUEO3GQGZ67HC2HFBCSBOQ/graph.json","events_json":"https://pith.science/api/pith-number/IFISBUEO3GQGZ67HC2HFBCSBOQ/events.json","paper":"https://pith.science/paper/IFISBUEO"},"agent_actions":{"view_html":"https://pith.science/pith/IFISBUEO3GQGZ67HC2HFBCSBOQ","download_json":"https://pith.science/pith/IFISBUEO3GQGZ67HC2HFBCSBOQ.json","view_paper":"https://pith.science/paper/IFISBUEO","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1502.00780&json=true","fetch_graph":"https://pith.science/api/pith-number/IFISBUEO3GQGZ67HC2HFBCSBOQ/graph.json","fetch_events":"https://pith.science/api/pith-number/IFISBUEO3GQGZ67HC2HFBCSBOQ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/IFISBUEO3GQGZ67HC2HFBCSBOQ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/IFISBUEO3GQGZ67HC2HFBCSBOQ/action/storage_attestation","attest_author":"https://pith.science/pith/IFISBUEO3GQGZ67HC2HFBCSBOQ/action/author_attestation","sign_citation":"https://pith.science/pith/IFISBUEO3GQGZ67HC2HFBCSBOQ/action/citation_signature","submit_replication":"https://pith.science/pith/IFISBUEO3GQGZ67HC2HFBCSBOQ/action/replication_record"}},"created_at":"2026-05-18T02:28:04.322277+00:00","updated_at":"2026-05-18T02:28:04.322277+00:00"}