{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2023:DE5WQISOVRJN3AHCWOQUZF4WDP","short_pith_number":"pith:DE5WQISO","schema_version":"1.0","canonical_sha256":"193b68224eac52dd80e2b3a14c97961be49f17be230399f6513c09f30cd88bf3","source":{"kind":"arxiv","id":"2312.05673","version":1},"attestation_state":"computed","paper":{"title":"Modeling Homophily in Exponential-Family Random Graph Models for Bipartite Networks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["stat.AP"],"primary_cat":"cs.SI","authors_text":"(2) Penn State University, (3) University of Exeter Business School), Alina R. Kuvelkar (2), David R. Hunter (2), Rashmi P. Bomiriya (1), Steffen Triebel (3) ((1) R S Metrics Asia Holdings Pvt Limited","submitted_at":"2023-12-09T20:28:51Z","abstract_excerpt":"Homophily, the tendency of individuals who are alike to form ties with one another, is an important concept in the study of social networks. Yet accounting for homophily effects is complicated in the context of bipartite networks where ties connect individuals not with one another but rather with a separate set of nodes, which might also be individuals but which are often an entirely different type of objects. As a result, much work on the effect of homophily in a bipartite network proceeds by first eliminating the bipartite structure, collapsing a two-mode network to a one-mode network and th"},"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":"2312.05673","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SI","submitted_at":"2023-12-09T20:28:51Z","cross_cats_sorted":["stat.AP"],"title_canon_sha256":"d43581a0289a79804c1c6215384600bda5b73aec7d85f066993e7aa697f5f438","abstract_canon_sha256":"45bc6e8c974b619817f56c36f83bf8c03ccb3a2d8d99ce7fe029f503d4d48402"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T07:22:30.602371Z","signature_b64":"Jvq7Q7an47sXh8mSdMeeItG5eZVjOnG/Zs0ybmKoN4uOBa0LU3tEAVA2bgxgdYxvJzhfzg3k6Lg8EztmxEQ1Cg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"193b68224eac52dd80e2b3a14c97961be49f17be230399f6513c09f30cd88bf3","last_reissued_at":"2026-07-05T07:22:30.601942Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T07:22:30.601942Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Modeling Homophily in Exponential-Family Random Graph Models for Bipartite Networks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["stat.AP"],"primary_cat":"cs.SI","authors_text":"(2) Penn State University, (3) University of Exeter Business School), Alina R. Kuvelkar (2), David R. Hunter (2), Rashmi P. Bomiriya (1), Steffen Triebel (3) ((1) R S Metrics Asia Holdings Pvt Limited","submitted_at":"2023-12-09T20:28:51Z","abstract_excerpt":"Homophily, the tendency of individuals who are alike to form ties with one another, is an important concept in the study of social networks. Yet accounting for homophily effects is complicated in the context of bipartite networks where ties connect individuals not with one another but rather with a separate set of nodes, which might also be individuals but which are often an entirely different type of objects. As a result, much work on the effect of homophily in a bipartite network proceeds by first eliminating the bipartite structure, collapsing a two-mode network to a one-mode network and th"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2312.05673","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2312.05673/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":"2312.05673","created_at":"2026-07-05T07:22:30.602002+00:00"},{"alias_kind":"arxiv_version","alias_value":"2312.05673v1","created_at":"2026-07-05T07:22:30.602002+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2312.05673","created_at":"2026-07-05T07:22:30.602002+00:00"},{"alias_kind":"pith_short_12","alias_value":"DE5WQISOVRJN","created_at":"2026-07-05T07:22:30.602002+00:00"},{"alias_kind":"pith_short_16","alias_value":"DE5WQISOVRJN3AHC","created_at":"2026-07-05T07:22:30.602002+00:00"},{"alias_kind":"pith_short_8","alias_value":"DE5WQISO","created_at":"2026-07-05T07:22:30.602002+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2502.01892","citing_title":"Improving exponential-family random graph models for bipartite networks","ref_index":24,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/DE5WQISOVRJN3AHCWOQUZF4WDP","json":"https://pith.science/pith/DE5WQISOVRJN3AHCWOQUZF4WDP.json","graph_json":"https://pith.science/api/pith-number/DE5WQISOVRJN3AHCWOQUZF4WDP/graph.json","events_json":"https://pith.science/api/pith-number/DE5WQISOVRJN3AHCWOQUZF4WDP/events.json","paper":"https://pith.science/paper/DE5WQISO"},"agent_actions":{"view_html":"https://pith.science/pith/DE5WQISOVRJN3AHCWOQUZF4WDP","download_json":"https://pith.science/pith/DE5WQISOVRJN3AHCWOQUZF4WDP.json","view_paper":"https://pith.science/paper/DE5WQISO","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2312.05673&json=true","fetch_graph":"https://pith.science/api/pith-number/DE5WQISOVRJN3AHCWOQUZF4WDP/graph.json","fetch_events":"https://pith.science/api/pith-number/DE5WQISOVRJN3AHCWOQUZF4WDP/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/DE5WQISOVRJN3AHCWOQUZF4WDP/action/timestamp_anchor","attest_storage":"https://pith.science/pith/DE5WQISOVRJN3AHCWOQUZF4WDP/action/storage_attestation","attest_author":"https://pith.science/pith/DE5WQISOVRJN3AHCWOQUZF4WDP/action/author_attestation","sign_citation":"https://pith.science/pith/DE5WQISOVRJN3AHCWOQUZF4WDP/action/citation_signature","submit_replication":"https://pith.science/pith/DE5WQISOVRJN3AHCWOQUZF4WDP/action/replication_record"}},"created_at":"2026-07-05T07:22:30.602002+00:00","updated_at":"2026-07-05T07:22:30.602002+00:00"}