{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2012:UPYDU5QWZTVHZEVT5XS6F3HBQX","short_pith_number":"pith:UPYDU5QW","schema_version":"1.0","canonical_sha256":"a3f03a7616ccea7c92b3ede5e2ece185c1431ab7c53950a4928278e0f23f026e","source":{"kind":"arxiv","id":"1208.0121","version":1},"attestation_state":"computed","paper":{"title":"Exponential-family Random Network Models","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"stat.ME","authors_text":"Ian Fellows, Mark S. Handcock","submitted_at":"2012-08-01T07:04:29Z","abstract_excerpt":"Random graphs, where the connections between nodes are considered random variables, have wide applicability in the social sciences. Exponential-family Random Graph Models (ERGM) have shown themselves to be a useful class of models for representing com- plex social phenomena. We generalize ERGM by also modeling nodal attributes as random variates, thus creating a random model of the full network, which we call Exponential-family Random Network Models (ERNM). We demonstrate how this framework allows a new formu- lation for logistic regression in network data. We develop likelihood-based inferenc"},"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":"1208.0121","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ME","submitted_at":"2012-08-01T07:04:29Z","cross_cats_sorted":[],"title_canon_sha256":"551b9c7c3811f09c73765176616b24cb84141941e7da1e860f8b5f3dedbf362a","abstract_canon_sha256":"b8c9c52bb599881ff7cfa621e9f4eab6af39c7da0f80391c595dae752e3e9fa4"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:49:36.218692Z","signature_b64":"xWRp5tRSLAz3rSvtl8IxTJSG12PCF0U1b3uBPXeR7xFBaP8Jbhe1WckuSZO9MHxULPGskgKkdPBBRzs0gPhbAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"a3f03a7616ccea7c92b3ede5e2ece185c1431ab7c53950a4928278e0f23f026e","last_reissued_at":"2026-05-18T03:49:36.218007Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:49:36.218007Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Exponential-family Random Network Models","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"stat.ME","authors_text":"Ian Fellows, Mark S. Handcock","submitted_at":"2012-08-01T07:04:29Z","abstract_excerpt":"Random graphs, where the connections between nodes are considered random variables, have wide applicability in the social sciences. Exponential-family Random Graph Models (ERGM) have shown themselves to be a useful class of models for representing com- plex social phenomena. We generalize ERGM by also modeling nodal attributes as random variates, thus creating a random model of the full network, which we call Exponential-family Random Network Models (ERNM). We demonstrate how this framework allows a new formu- lation for logistic regression in network data. We develop likelihood-based inferenc"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1208.0121","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":"1208.0121","created_at":"2026-05-18T03:49:36.218111+00:00"},{"alias_kind":"arxiv_version","alias_value":"1208.0121v1","created_at":"2026-05-18T03:49:36.218111+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1208.0121","created_at":"2026-05-18T03:49:36.218111+00:00"},{"alias_kind":"pith_short_12","alias_value":"UPYDU5QWZTVH","created_at":"2026-05-18T12:27:23.164592+00:00"},{"alias_kind":"pith_short_16","alias_value":"UPYDU5QWZTVHZEVT","created_at":"2026-05-18T12:27:23.164592+00:00"},{"alias_kind":"pith_short_8","alias_value":"UPYDU5QW","created_at":"2026-05-18T12:27:23.164592+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2604.22791","citing_title":"R Package iglm: Regression under Interference in Connected Populations","ref_index":8,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/UPYDU5QWZTVHZEVT5XS6F3HBQX","json":"https://pith.science/pith/UPYDU5QWZTVHZEVT5XS6F3HBQX.json","graph_json":"https://pith.science/api/pith-number/UPYDU5QWZTVHZEVT5XS6F3HBQX/graph.json","events_json":"https://pith.science/api/pith-number/UPYDU5QWZTVHZEVT5XS6F3HBQX/events.json","paper":"https://pith.science/paper/UPYDU5QW"},"agent_actions":{"view_html":"https://pith.science/pith/UPYDU5QWZTVHZEVT5XS6F3HBQX","download_json":"https://pith.science/pith/UPYDU5QWZTVHZEVT5XS6F3HBQX.json","view_paper":"https://pith.science/paper/UPYDU5QW","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1208.0121&json=true","fetch_graph":"https://pith.science/api/pith-number/UPYDU5QWZTVHZEVT5XS6F3HBQX/graph.json","fetch_events":"https://pith.science/api/pith-number/UPYDU5QWZTVHZEVT5XS6F3HBQX/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/UPYDU5QWZTVHZEVT5XS6F3HBQX/action/timestamp_anchor","attest_storage":"https://pith.science/pith/UPYDU5QWZTVHZEVT5XS6F3HBQX/action/storage_attestation","attest_author":"https://pith.science/pith/UPYDU5QWZTVHZEVT5XS6F3HBQX/action/author_attestation","sign_citation":"https://pith.science/pith/UPYDU5QWZTVHZEVT5XS6F3HBQX/action/citation_signature","submit_replication":"https://pith.science/pith/UPYDU5QWZTVHZEVT5XS6F3HBQX/action/replication_record"}},"created_at":"2026-05-18T03:49:36.218111+00:00","updated_at":"2026-05-18T03:49:36.218111+00:00"}