{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2019:KBI7ONFQ7ACAQIHZHW5J7MYPSC","short_pith_number":"pith:KBI7ONFQ","schema_version":"1.0","canonical_sha256":"5051f734b0f8040820f93dba9fb30f9080db88d5c05c9a6b444bdbba697694d0","source":{"kind":"arxiv","id":"1907.07055","version":3},"attestation_state":"computed","paper":{"title":"Homophily as a Process Generating Social Networks: Insights from Social Distance Attachment Model","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["physics.soc-ph"],"primary_cat":"cs.SI","authors_text":"Andrzej Nowak, Szymon Talaga","submitted_at":"2019-07-16T15:12:04Z","abstract_excerpt":"Real-world social networks often exhibit high levels of clustering, positive degree assortativity, short average path lengths (small-world property) and right-skewed but rarely power law degree distributions. On the other hand homophily, defined as the propensity of similar agents to connect to each other, is one of the most fundamental social processes observed in many human and animal societies. In this paper we examine the extent to which homophily is sufficient to produce the typical structural properties of social networks. To do so, we conduct a simulation study based on the Social Dista"},"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":"1907.07055","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SI","submitted_at":"2019-07-16T15:12:04Z","cross_cats_sorted":["physics.soc-ph"],"title_canon_sha256":"022bc9150c3c905ec01c2811a43eb2c9c8c1fa1c195f44aff0ed1caa83bae39a","abstract_canon_sha256":"3fa601d2209f093762fc9d645062b346770feec6056fb43015b9f34f4e1feea4"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T00:52:15.500705Z","signature_b64":"la4j2/jS5R85+DTm898Khe+8YdU/tVZsa6eAwIyBihKiZL/bRkPrjMU3aoxyaJ4lLGWVFnwFIdfcTz1vEl11BA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"5051f734b0f8040820f93dba9fb30f9080db88d5c05c9a6b444bdbba697694d0","last_reissued_at":"2026-07-05T00:52:15.500188Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T00:52:15.500188Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Homophily as a Process Generating Social Networks: Insights from Social Distance Attachment Model","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["physics.soc-ph"],"primary_cat":"cs.SI","authors_text":"Andrzej Nowak, Szymon Talaga","submitted_at":"2019-07-16T15:12:04Z","abstract_excerpt":"Real-world social networks often exhibit high levels of clustering, positive degree assortativity, short average path lengths (small-world property) and right-skewed but rarely power law degree distributions. On the other hand homophily, defined as the propensity of similar agents to connect to each other, is one of the most fundamental social processes observed in many human and animal societies. In this paper we examine the extent to which homophily is sufficient to produce the typical structural properties of social networks. To do so, we conduct a simulation study based on the Social Dista"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1907.07055","kind":"arxiv","version":3},"verdict":{"id":null,"model_set":{},"created_at":null,"strongest_claim":"","one_line_summary":"","pipeline_version":null,"weakest_assumption":"","pith_extraction_headline":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/1907.07055/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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":"1907.07055","created_at":"2026-07-05T00:52:15.500237+00:00"},{"alias_kind":"arxiv_version","alias_value":"1907.07055v3","created_at":"2026-07-05T00:52:15.500237+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1907.07055","created_at":"2026-07-05T00:52:15.500237+00:00"},{"alias_kind":"pith_short_12","alias_value":"KBI7ONFQ7ACA","created_at":"2026-07-05T00:52:15.500237+00:00"},{"alias_kind":"pith_short_16","alias_value":"KBI7ONFQ7ACAQIHZ","created_at":"2026-07-05T00:52:15.500237+00:00"},{"alias_kind":"pith_short_8","alias_value":"KBI7ONFQ","created_at":"2026-07-05T00:52:15.500237+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2411.16464","citing_title":"Generating social networks with static and dynamic utility-maximization approaches","ref_index":18,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/KBI7ONFQ7ACAQIHZHW5J7MYPSC","json":"https://pith.science/pith/KBI7ONFQ7ACAQIHZHW5J7MYPSC.json","graph_json":"https://pith.science/api/pith-number/KBI7ONFQ7ACAQIHZHW5J7MYPSC/graph.json","events_json":"https://pith.science/api/pith-number/KBI7ONFQ7ACAQIHZHW5J7MYPSC/events.json","paper":"https://pith.science/paper/KBI7ONFQ"},"agent_actions":{"view_html":"https://pith.science/pith/KBI7ONFQ7ACAQIHZHW5J7MYPSC","download_json":"https://pith.science/pith/KBI7ONFQ7ACAQIHZHW5J7MYPSC.json","view_paper":"https://pith.science/paper/KBI7ONFQ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1907.07055&json=true","fetch_graph":"https://pith.science/api/pith-number/KBI7ONFQ7ACAQIHZHW5J7MYPSC/graph.json","fetch_events":"https://pith.science/api/pith-number/KBI7ONFQ7ACAQIHZHW5J7MYPSC/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/KBI7ONFQ7ACAQIHZHW5J7MYPSC/action/timestamp_anchor","attest_storage":"https://pith.science/pith/KBI7ONFQ7ACAQIHZHW5J7MYPSC/action/storage_attestation","attest_author":"https://pith.science/pith/KBI7ONFQ7ACAQIHZHW5J7MYPSC/action/author_attestation","sign_citation":"https://pith.science/pith/KBI7ONFQ7ACAQIHZHW5J7MYPSC/action/citation_signature","submit_replication":"https://pith.science/pith/KBI7ONFQ7ACAQIHZHW5J7MYPSC/action/replication_record"}},"created_at":"2026-07-05T00:52:15.500237+00:00","updated_at":"2026-07-05T00:52:15.500237+00:00"}