{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2011:3ZSZTIZWCRL6VDGSSA3265ASG5","short_pith_number":"pith:3ZSZTIZW","schema_version":"1.0","canonical_sha256":"de6599a3361457ea8cd29037af7412376fbd473643d54db99c5cbec3265239b8","source":{"kind":"arxiv","id":"1106.5053","version":1},"attestation_state":"computed","paper":{"title":"Modeling Social Networks with Node Attributes using the Multiplicative Attribute Graph Model","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["physics.soc-ph"],"primary_cat":"cs.SI","authors_text":"Jure Leskovec, Myunghwan Kim","submitted_at":"2011-06-24T20:01:21Z","abstract_excerpt":"Networks arising from social, technological and natural domains exhibit rich connectivity patterns and nodes in such networks are often labeled with attributes or features. We address the question of modeling the structure of networks where nodes have attribute information. We present a Multiplicative Attribute Graph (MAG) model that considers nodes with categorical attributes and models the probability of an edge as the product of individual attribute link formation affinities. We develop a scalable variational expectation maximization parameter estimation method. Experiments show that MAG mo"},"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":"1106.5053","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SI","submitted_at":"2011-06-24T20:01:21Z","cross_cats_sorted":["physics.soc-ph"],"title_canon_sha256":"5fff53fc19245be3a0f29a6af396e697aeb01089ada730afcbc894bf239519f7","abstract_canon_sha256":"51d08f5d97eff0e50744ece574b69a127c2403022e862c5593c170c84e37f697"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:19:21.436469Z","signature_b64":"cnEVzV8h64+KKU78nIxqL33eM65FlBWb++ftdX/k8EHY4/HxpEwc/uMQtyESuYY9yZ/1ybxuLBDEhh70iRt4Cg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"de6599a3361457ea8cd29037af7412376fbd473643d54db99c5cbec3265239b8","last_reissued_at":"2026-05-18T04:19:21.435883Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:19:21.435883Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Modeling Social Networks with Node Attributes using the Multiplicative Attribute Graph Model","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["physics.soc-ph"],"primary_cat":"cs.SI","authors_text":"Jure Leskovec, Myunghwan Kim","submitted_at":"2011-06-24T20:01:21Z","abstract_excerpt":"Networks arising from social, technological and natural domains exhibit rich connectivity patterns and nodes in such networks are often labeled with attributes or features. We address the question of modeling the structure of networks where nodes have attribute information. We present a Multiplicative Attribute Graph (MAG) model that considers nodes with categorical attributes and models the probability of an edge as the product of individual attribute link formation affinities. We develop a scalable variational expectation maximization parameter estimation method. Experiments show that MAG mo"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1106.5053","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":"1106.5053","created_at":"2026-05-18T04:19:21.435962+00:00"},{"alias_kind":"arxiv_version","alias_value":"1106.5053v1","created_at":"2026-05-18T04:19:21.435962+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1106.5053","created_at":"2026-05-18T04:19:21.435962+00:00"},{"alias_kind":"pith_short_12","alias_value":"3ZSZTIZWCRL6","created_at":"2026-05-18T12:26:20.644004+00:00"},{"alias_kind":"pith_short_16","alias_value":"3ZSZTIZWCRL6VDGS","created_at":"2026-05-18T12:26:20.644004+00:00"},{"alias_kind":"pith_short_8","alias_value":"3ZSZTIZW","created_at":"2026-05-18T12:26:20.644004+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/3ZSZTIZWCRL6VDGSSA3265ASG5","json":"https://pith.science/pith/3ZSZTIZWCRL6VDGSSA3265ASG5.json","graph_json":"https://pith.science/api/pith-number/3ZSZTIZWCRL6VDGSSA3265ASG5/graph.json","events_json":"https://pith.science/api/pith-number/3ZSZTIZWCRL6VDGSSA3265ASG5/events.json","paper":"https://pith.science/paper/3ZSZTIZW"},"agent_actions":{"view_html":"https://pith.science/pith/3ZSZTIZWCRL6VDGSSA3265ASG5","download_json":"https://pith.science/pith/3ZSZTIZWCRL6VDGSSA3265ASG5.json","view_paper":"https://pith.science/paper/3ZSZTIZW","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1106.5053&json=true","fetch_graph":"https://pith.science/api/pith-number/3ZSZTIZWCRL6VDGSSA3265ASG5/graph.json","fetch_events":"https://pith.science/api/pith-number/3ZSZTIZWCRL6VDGSSA3265ASG5/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/3ZSZTIZWCRL6VDGSSA3265ASG5/action/timestamp_anchor","attest_storage":"https://pith.science/pith/3ZSZTIZWCRL6VDGSSA3265ASG5/action/storage_attestation","attest_author":"https://pith.science/pith/3ZSZTIZWCRL6VDGSSA3265ASG5/action/author_attestation","sign_citation":"https://pith.science/pith/3ZSZTIZWCRL6VDGSSA3265ASG5/action/citation_signature","submit_replication":"https://pith.science/pith/3ZSZTIZWCRL6VDGSSA3265ASG5/action/replication_record"}},"created_at":"2026-05-18T04:19:21.435962+00:00","updated_at":"2026-05-18T04:19:21.435962+00:00"}