{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2011:F62GJRW4CZP4OBYW7PE2ITPTUY","short_pith_number":"pith:F62GJRW4","schema_version":"1.0","canonical_sha256":"2fb464c6dc165fc70716fbc9a44df3a613babcd53edf217b479658c909216789","source":{"kind":"arxiv","id":"1101.5097","version":1},"attestation_state":"computed","paper":{"title":"Infinite Multiple Membership Relational Modeling for Complex Networks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG","physics.soc-ph"],"primary_cat":"cs.SI","authors_text":"Lars Kai Hansen, Mikkel N. Schmidt, Morten M{\\o}rup","submitted_at":"2011-01-26T16:15:22Z","abstract_excerpt":"Learning latent structure in complex networks has become an important problem fueled by many types of networked data originating from practically all fields of science. In this paper, we propose a new non-parametric Bayesian multiple-membership latent feature model for networks. Contrary to existing multiple-membership models that scale quadratically in the number of vertices the proposed model scales linearly in the number of links admitting multiple-membership analysis in large scale networks. We demonstrate a connection between the single membership relational model and multiple membership "},"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":"1101.5097","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SI","submitted_at":"2011-01-26T16:15:22Z","cross_cats_sorted":["cs.LG","physics.soc-ph"],"title_canon_sha256":"0c9c34d88826474dc2a641df91c431d2689aa1886f55e583ef83f2ccf05e1613","abstract_canon_sha256":"3c2b6a43035e12aacaf0a4eb5432e9d7f0b69eddd010f97c4efc276c6cbf30fd"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:22:49.419257Z","signature_b64":"g3OHHZ2GTCjYA/pKrFOevHsqdvZLq5r0dWHPO/vw6ybQsNo5NICUj2aPnWFHSrv7Xu4WalwPf2rMLfgyFjqpBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"2fb464c6dc165fc70716fbc9a44df3a613babcd53edf217b479658c909216789","last_reissued_at":"2026-05-18T02:22:49.418583Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:22:49.418583Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Infinite Multiple Membership Relational Modeling for Complex Networks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG","physics.soc-ph"],"primary_cat":"cs.SI","authors_text":"Lars Kai Hansen, Mikkel N. Schmidt, Morten M{\\o}rup","submitted_at":"2011-01-26T16:15:22Z","abstract_excerpt":"Learning latent structure in complex networks has become an important problem fueled by many types of networked data originating from practically all fields of science. In this paper, we propose a new non-parametric Bayesian multiple-membership latent feature model for networks. Contrary to existing multiple-membership models that scale quadratically in the number of vertices the proposed model scales linearly in the number of links admitting multiple-membership analysis in large scale networks. We demonstrate a connection between the single membership relational model and multiple membership "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1101.5097","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":"1101.5097","created_at":"2026-05-18T02:22:49.418698+00:00"},{"alias_kind":"arxiv_version","alias_value":"1101.5097v1","created_at":"2026-05-18T02:22:49.418698+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1101.5097","created_at":"2026-05-18T02:22:49.418698+00:00"},{"alias_kind":"pith_short_12","alias_value":"F62GJRW4CZP4","created_at":"2026-05-18T12:26:28.662955+00:00"},{"alias_kind":"pith_short_16","alias_value":"F62GJRW4CZP4OBYW","created_at":"2026-05-18T12:26:28.662955+00:00"},{"alias_kind":"pith_short_8","alias_value":"F62GJRW4","created_at":"2026-05-18T12:26:28.662955+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/F62GJRW4CZP4OBYW7PE2ITPTUY","json":"https://pith.science/pith/F62GJRW4CZP4OBYW7PE2ITPTUY.json","graph_json":"https://pith.science/api/pith-number/F62GJRW4CZP4OBYW7PE2ITPTUY/graph.json","events_json":"https://pith.science/api/pith-number/F62GJRW4CZP4OBYW7PE2ITPTUY/events.json","paper":"https://pith.science/paper/F62GJRW4"},"agent_actions":{"view_html":"https://pith.science/pith/F62GJRW4CZP4OBYW7PE2ITPTUY","download_json":"https://pith.science/pith/F62GJRW4CZP4OBYW7PE2ITPTUY.json","view_paper":"https://pith.science/paper/F62GJRW4","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1101.5097&json=true","fetch_graph":"https://pith.science/api/pith-number/F62GJRW4CZP4OBYW7PE2ITPTUY/graph.json","fetch_events":"https://pith.science/api/pith-number/F62GJRW4CZP4OBYW7PE2ITPTUY/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/F62GJRW4CZP4OBYW7PE2ITPTUY/action/timestamp_anchor","attest_storage":"https://pith.science/pith/F62GJRW4CZP4OBYW7PE2ITPTUY/action/storage_attestation","attest_author":"https://pith.science/pith/F62GJRW4CZP4OBYW7PE2ITPTUY/action/author_attestation","sign_citation":"https://pith.science/pith/F62GJRW4CZP4OBYW7PE2ITPTUY/action/citation_signature","submit_replication":"https://pith.science/pith/F62GJRW4CZP4OBYW7PE2ITPTUY/action/replication_record"}},"created_at":"2026-05-18T02:22:49.418698+00:00","updated_at":"2026-05-18T02:22:49.418698+00:00"}