{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:3S4EE7UJ2D2FWYF6IYHELHG66A","short_pith_number":"pith:3S4EE7UJ","schema_version":"1.0","canonical_sha256":"dcb8427e89d0f45b60be460e459cdef004f48642bddfc795bd61412ca9a4faf3","source":{"kind":"arxiv","id":"1803.06937","version":2},"attestation_state":"computed","paper":{"title":"Pearson's correlation coefficient in the theory of networks: A comment","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.SI"],"primary_cat":"cond-mat.dis-nn","authors_text":"Sachin Kumar, Zafar Ahmed","submitted_at":"2018-03-16T10:14:22Z","abstract_excerpt":"In statistics, the Pearson correlation coefficient $r_{x,y}$ determines the degree of linear correlation between two variables and it is known that $-1 \\le r_{x,y} \\le 1$. In the theory of networks, a curious expression proposed in [PRL {\\bf 89} 208701 (2002)] for degree-degree correlation coefficient $r_{j_i,k_i}, i\\in [1,M]$ has been in use. We realize that the suggested form is the conventional Pearson's coefficient for $\\{(j_i,k_i), (k_i,j_i)\\}$ for $2M$ data points and hence it is rightly dedicated to undirected networks."},"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":"1803.06937","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cond-mat.dis-nn","submitted_at":"2018-03-16T10:14:22Z","cross_cats_sorted":["cs.SI"],"title_canon_sha256":"281df0a7d213a45462fa10e8dbfa08abc8d1b40fd0613967d3f5477e3f7608fd","abstract_canon_sha256":"38b680097781c81f94418964bbcd68f074bdab515a98d9c8f84e38ec7e9becf2"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:20:29.693004Z","signature_b64":"VBDDjjC3Auoy9FbDysnTXerGCoCnrIct4EqulW0r83TB8R+mjljzvwSsYgET8JQuNUN/DcjB1xI5rjoEHNjnBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"dcb8427e89d0f45b60be460e459cdef004f48642bddfc795bd61412ca9a4faf3","last_reissued_at":"2026-05-18T00:20:29.692527Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:20:29.692527Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Pearson's correlation coefficient in the theory of networks: A comment","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.SI"],"primary_cat":"cond-mat.dis-nn","authors_text":"Sachin Kumar, Zafar Ahmed","submitted_at":"2018-03-16T10:14:22Z","abstract_excerpt":"In statistics, the Pearson correlation coefficient $r_{x,y}$ determines the degree of linear correlation between two variables and it is known that $-1 \\le r_{x,y} \\le 1$. In the theory of networks, a curious expression proposed in [PRL {\\bf 89} 208701 (2002)] for degree-degree correlation coefficient $r_{j_i,k_i}, i\\in [1,M]$ has been in use. We realize that the suggested form is the conventional Pearson's coefficient for $\\{(j_i,k_i), (k_i,j_i)\\}$ for $2M$ data points and hence it is rightly dedicated to undirected networks."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1803.06937","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":"1803.06937","created_at":"2026-05-18T00:20:29.692592+00:00"},{"alias_kind":"arxiv_version","alias_value":"1803.06937v2","created_at":"2026-05-18T00:20:29.692592+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1803.06937","created_at":"2026-05-18T00:20:29.692592+00:00"},{"alias_kind":"pith_short_12","alias_value":"3S4EE7UJ2D2F","created_at":"2026-05-18T12:32:05.422762+00:00"},{"alias_kind":"pith_short_16","alias_value":"3S4EE7UJ2D2FWYF6","created_at":"2026-05-18T12:32:05.422762+00:00"},{"alias_kind":"pith_short_8","alias_value":"3S4EE7UJ","created_at":"2026-05-18T12:32:05.422762+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/3S4EE7UJ2D2FWYF6IYHELHG66A","json":"https://pith.science/pith/3S4EE7UJ2D2FWYF6IYHELHG66A.json","graph_json":"https://pith.science/api/pith-number/3S4EE7UJ2D2FWYF6IYHELHG66A/graph.json","events_json":"https://pith.science/api/pith-number/3S4EE7UJ2D2FWYF6IYHELHG66A/events.json","paper":"https://pith.science/paper/3S4EE7UJ"},"agent_actions":{"view_html":"https://pith.science/pith/3S4EE7UJ2D2FWYF6IYHELHG66A","download_json":"https://pith.science/pith/3S4EE7UJ2D2FWYF6IYHELHG66A.json","view_paper":"https://pith.science/paper/3S4EE7UJ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1803.06937&json=true","fetch_graph":"https://pith.science/api/pith-number/3S4EE7UJ2D2FWYF6IYHELHG66A/graph.json","fetch_events":"https://pith.science/api/pith-number/3S4EE7UJ2D2FWYF6IYHELHG66A/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/3S4EE7UJ2D2FWYF6IYHELHG66A/action/timestamp_anchor","attest_storage":"https://pith.science/pith/3S4EE7UJ2D2FWYF6IYHELHG66A/action/storage_attestation","attest_author":"https://pith.science/pith/3S4EE7UJ2D2FWYF6IYHELHG66A/action/author_attestation","sign_citation":"https://pith.science/pith/3S4EE7UJ2D2FWYF6IYHELHG66A/action/citation_signature","submit_replication":"https://pith.science/pith/3S4EE7UJ2D2FWYF6IYHELHG66A/action/replication_record"}},"created_at":"2026-05-18T00:20:29.692592+00:00","updated_at":"2026-05-18T00:20:29.692592+00:00"}