{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:FKDZKXM67YL3XZJVP5TCD7DNT6","short_pith_number":"pith:FKDZKXM6","schema_version":"1.0","canonical_sha256":"2a87955d9efe17bbe5357f6621fc6d9fbcb8b9a989c198f788a448c486a40c93","source":{"kind":"arxiv","id":"1704.05707","version":4},"attestation_state":"computed","paper":{"title":"Average nearest neighbor degrees in scale-free networks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.PR","authors_text":"Dong Yao, Nelly Litvak, Pim van der Hoorn","submitted_at":"2017-04-19T12:33:05Z","abstract_excerpt":"The average nearest neighbor degree (ANND) of a node of degree $k$ is widely used to measure dependencies between degrees of neighbor nodes in a network. We formally analyze ANND in undirected random graphs when the graph size tends to infinity. The limiting behavior of ANND depends on the variance of the degree distribution. When the variance is finite, the ANND has a deterministic limit. When the variance is infinite, the ANND scales with the size of the graph, and we prove a corresponding central limit theorem in the configuration model (CM, a network with random connections). As ANND prove"},"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":"1704.05707","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2017-04-19T12:33:05Z","cross_cats_sorted":[],"title_canon_sha256":"f5a94cacc9e0502746455eef22a66b146b4c18092a40ccc4c76afc031101974c","abstract_canon_sha256":"ca568216ac34168a1259002bec0fe3ae8a3f166505535d49106f26550b4cb2d7"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:27:04.704538Z","signature_b64":"U1dgmP1jPZlXP6z8JrLMd2b2Q6i+BeSPwMYMqLun9JSQpJvIjwDDTqyHYORsG8fsJAuVXujHd7fYq0ruqP3tAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"2a87955d9efe17bbe5357f6621fc6d9fbcb8b9a989c198f788a448c486a40c93","last_reissued_at":"2026-05-18T00:27:04.704014Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:27:04.704014Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Average nearest neighbor degrees in scale-free networks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.PR","authors_text":"Dong Yao, Nelly Litvak, Pim van der Hoorn","submitted_at":"2017-04-19T12:33:05Z","abstract_excerpt":"The average nearest neighbor degree (ANND) of a node of degree $k$ is widely used to measure dependencies between degrees of neighbor nodes in a network. We formally analyze ANND in undirected random graphs when the graph size tends to infinity. The limiting behavior of ANND depends on the variance of the degree distribution. When the variance is finite, the ANND has a deterministic limit. When the variance is infinite, the ANND scales with the size of the graph, and we prove a corresponding central limit theorem in the configuration model (CM, a network with random connections). As ANND prove"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1704.05707","kind":"arxiv","version":4},"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":"1704.05707","created_at":"2026-05-18T00:27:04.704094+00:00"},{"alias_kind":"arxiv_version","alias_value":"1704.05707v4","created_at":"2026-05-18T00:27:04.704094+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1704.05707","created_at":"2026-05-18T00:27:04.704094+00:00"},{"alias_kind":"pith_short_12","alias_value":"FKDZKXM67YL3","created_at":"2026-05-18T12:31:15.632608+00:00"},{"alias_kind":"pith_short_16","alias_value":"FKDZKXM67YL3XZJV","created_at":"2026-05-18T12:31:15.632608+00:00"},{"alias_kind":"pith_short_8","alias_value":"FKDZKXM6","created_at":"2026-05-18T12:31:15.632608+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/FKDZKXM67YL3XZJVP5TCD7DNT6","json":"https://pith.science/pith/FKDZKXM67YL3XZJVP5TCD7DNT6.json","graph_json":"https://pith.science/api/pith-number/FKDZKXM67YL3XZJVP5TCD7DNT6/graph.json","events_json":"https://pith.science/api/pith-number/FKDZKXM67YL3XZJVP5TCD7DNT6/events.json","paper":"https://pith.science/paper/FKDZKXM6"},"agent_actions":{"view_html":"https://pith.science/pith/FKDZKXM67YL3XZJVP5TCD7DNT6","download_json":"https://pith.science/pith/FKDZKXM67YL3XZJVP5TCD7DNT6.json","view_paper":"https://pith.science/paper/FKDZKXM6","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1704.05707&json=true","fetch_graph":"https://pith.science/api/pith-number/FKDZKXM67YL3XZJVP5TCD7DNT6/graph.json","fetch_events":"https://pith.science/api/pith-number/FKDZKXM67YL3XZJVP5TCD7DNT6/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/FKDZKXM67YL3XZJVP5TCD7DNT6/action/timestamp_anchor","attest_storage":"https://pith.science/pith/FKDZKXM67YL3XZJVP5TCD7DNT6/action/storage_attestation","attest_author":"https://pith.science/pith/FKDZKXM67YL3XZJVP5TCD7DNT6/action/author_attestation","sign_citation":"https://pith.science/pith/FKDZKXM67YL3XZJVP5TCD7DNT6/action/citation_signature","submit_replication":"https://pith.science/pith/FKDZKXM67YL3XZJVP5TCD7DNT6/action/replication_record"}},"created_at":"2026-05-18T00:27:04.704094+00:00","updated_at":"2026-05-18T00:27:04.704094+00:00"}