{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:IZ33FJBDGQDE667TGIDOFNBEOX","short_pith_number":"pith:IZ33FJBD","schema_version":"1.0","canonical_sha256":"4677b2a42334064f7bf33206e2b42475fc82d445e74191c8a3b6cbe6b310e39b","source":{"kind":"arxiv","id":"1704.03943","version":1},"attestation_state":"computed","paper":{"title":"Two-walks degree assortativity in graphs and networks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.SI"],"primary_cat":"physics.soc-ph","authors_text":"Alfonso Allen-Perkins, Ernesto Estrada, Juan Manuel Pastor","submitted_at":"2017-04-12T22:03:26Z","abstract_excerpt":"Degree ssortativity is the tendency for nodes of high degree (resp.low degree) in a graph to be connected to high degree nodes (resp. to low degree ones). It is sually quantified by the Pearson correlation coefficient of the degree-degree correlation. Here we extend this concept to account for the effect of second neighbours to a given node in a graph. That is, we consider the two-walks degree of a node as the sum of all the degrees of its adjacent nodes. The two-walks degree assortativity of a graph is then the Pearson correlation coefficient of the two-walks degree-degree correlation. We fou"},"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.03943","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"physics.soc-ph","submitted_at":"2017-04-12T22:03:26Z","cross_cats_sorted":["cs.SI"],"title_canon_sha256":"03065128e6ec9ecf7365dc91da2e8c57bd361b884042a3c0ca3aacbc1dc49ce2","abstract_canon_sha256":"4746bc4f67711b5c8914ab751fd83b9b0f4547c3a53ffe1fbeac7595fde75cdf"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:46:25.822584Z","signature_b64":"vQOPx9BtAHDki0OIJwPsPhFDpndoqHmQXo1lKQT4GYLmAVpyEk+TjZYT04Q0jC83QPEAkMgalvyA7enUjvsJBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"4677b2a42334064f7bf33206e2b42475fc82d445e74191c8a3b6cbe6b310e39b","last_reissued_at":"2026-05-18T00:46:25.821978Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:46:25.821978Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Two-walks degree assortativity in graphs and networks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.SI"],"primary_cat":"physics.soc-ph","authors_text":"Alfonso Allen-Perkins, Ernesto Estrada, Juan Manuel Pastor","submitted_at":"2017-04-12T22:03:26Z","abstract_excerpt":"Degree ssortativity is the tendency for nodes of high degree (resp.low degree) in a graph to be connected to high degree nodes (resp. to low degree ones). It is sually quantified by the Pearson correlation coefficient of the degree-degree correlation. Here we extend this concept to account for the effect of second neighbours to a given node in a graph. That is, we consider the two-walks degree of a node as the sum of all the degrees of its adjacent nodes. The two-walks degree assortativity of a graph is then the Pearson correlation coefficient of the two-walks degree-degree correlation. We fou"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1704.03943","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":"1704.03943","created_at":"2026-05-18T00:46:25.822085+00:00"},{"alias_kind":"arxiv_version","alias_value":"1704.03943v1","created_at":"2026-05-18T00:46:25.822085+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1704.03943","created_at":"2026-05-18T00:46:25.822085+00:00"},{"alias_kind":"pith_short_12","alias_value":"IZ33FJBDGQDE","created_at":"2026-05-18T12:31:21.493067+00:00"},{"alias_kind":"pith_short_16","alias_value":"IZ33FJBDGQDE667T","created_at":"2026-05-18T12:31:21.493067+00:00"},{"alias_kind":"pith_short_8","alias_value":"IZ33FJBD","created_at":"2026-05-18T12:31:21.493067+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/IZ33FJBDGQDE667TGIDOFNBEOX","json":"https://pith.science/pith/IZ33FJBDGQDE667TGIDOFNBEOX.json","graph_json":"https://pith.science/api/pith-number/IZ33FJBDGQDE667TGIDOFNBEOX/graph.json","events_json":"https://pith.science/api/pith-number/IZ33FJBDGQDE667TGIDOFNBEOX/events.json","paper":"https://pith.science/paper/IZ33FJBD"},"agent_actions":{"view_html":"https://pith.science/pith/IZ33FJBDGQDE667TGIDOFNBEOX","download_json":"https://pith.science/pith/IZ33FJBDGQDE667TGIDOFNBEOX.json","view_paper":"https://pith.science/paper/IZ33FJBD","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1704.03943&json=true","fetch_graph":"https://pith.science/api/pith-number/IZ33FJBDGQDE667TGIDOFNBEOX/graph.json","fetch_events":"https://pith.science/api/pith-number/IZ33FJBDGQDE667TGIDOFNBEOX/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/IZ33FJBDGQDE667TGIDOFNBEOX/action/timestamp_anchor","attest_storage":"https://pith.science/pith/IZ33FJBDGQDE667TGIDOFNBEOX/action/storage_attestation","attest_author":"https://pith.science/pith/IZ33FJBDGQDE667TGIDOFNBEOX/action/author_attestation","sign_citation":"https://pith.science/pith/IZ33FJBDGQDE667TGIDOFNBEOX/action/citation_signature","submit_replication":"https://pith.science/pith/IZ33FJBDGQDE667TGIDOFNBEOX/action/replication_record"}},"created_at":"2026-05-18T00:46:25.822085+00:00","updated_at":"2026-05-18T00:46:25.822085+00:00"}