{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2010:QZ3QPEIFJGIKEN2DG6OVM2YMIT","short_pith_number":"pith:QZ3QPEIF","schema_version":"1.0","canonical_sha256":"86770791054990a23743379d566b0c44c986fa765f8cb4404ff83b4494942901","source":{"kind":"arxiv","id":"1012.2774","version":1},"attestation_state":"computed","paper":{"title":"Modeling Social Networks with Overlapping Communities Using Hypergraphs and Their Line Graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["physics.soc-ph"],"primary_cat":"cs.SI","authors_text":"D. Liu, N. Blenn, P. Van Mieghem","submitted_at":"2010-12-13T15:46:50Z","abstract_excerpt":"We propose that hypergraphs can be used to model social networks with overlapping communities. The nodes of the hypergraphs represent the communities. The hyperlinks of the hypergraphs denote the individuals who may participate in multiple communities. The hypergraphs are not easy to analyze, however, the line graphs of hypergraphs are simple graphs or weighted graphs, so that the network theory can be applied. We define the overlapping depth $k$ of an individual by the number of communities that overlap in that individual, and we prove that the minimum adjacency eigenvalue of the correspondin"},"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":"1012.2774","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SI","submitted_at":"2010-12-13T15:46:50Z","cross_cats_sorted":["physics.soc-ph"],"title_canon_sha256":"3dc0dbdb2f2c773c8e02c5046b9e369539bd7ed11c9e0777264b562e07fdc03d","abstract_canon_sha256":"408d912bc535b10fb155907221fb7f839ad3e8dc51bb0c148d1539723e213dba"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:33:27.784241Z","signature_b64":"wDD4w14/e8z80Lz83BjOORtQbW/tQILM2DEepz0meZVxqgFQxeaqnJ2iAo6xDpY8bxrBSSSe/c6Zf2uY6vL/AA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"86770791054990a23743379d566b0c44c986fa765f8cb4404ff83b4494942901","last_reissued_at":"2026-05-18T04:33:27.783717Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:33:27.783717Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Modeling Social Networks with Overlapping Communities Using Hypergraphs and Their Line Graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["physics.soc-ph"],"primary_cat":"cs.SI","authors_text":"D. Liu, N. Blenn, P. Van Mieghem","submitted_at":"2010-12-13T15:46:50Z","abstract_excerpt":"We propose that hypergraphs can be used to model social networks with overlapping communities. The nodes of the hypergraphs represent the communities. The hyperlinks of the hypergraphs denote the individuals who may participate in multiple communities. The hypergraphs are not easy to analyze, however, the line graphs of hypergraphs are simple graphs or weighted graphs, so that the network theory can be applied. We define the overlapping depth $k$ of an individual by the number of communities that overlap in that individual, and we prove that the minimum adjacency eigenvalue of the correspondin"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1012.2774","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":"1012.2774","created_at":"2026-05-18T04:33:27.783801+00:00"},{"alias_kind":"arxiv_version","alias_value":"1012.2774v1","created_at":"2026-05-18T04:33:27.783801+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1012.2774","created_at":"2026-05-18T04:33:27.783801+00:00"},{"alias_kind":"pith_short_12","alias_value":"QZ3QPEIFJGIK","created_at":"2026-05-18T12:26:13.927090+00:00"},{"alias_kind":"pith_short_16","alias_value":"QZ3QPEIFJGIKEN2D","created_at":"2026-05-18T12:26:13.927090+00:00"},{"alias_kind":"pith_short_8","alias_value":"QZ3QPEIF","created_at":"2026-05-18T12:26:13.927090+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/QZ3QPEIFJGIKEN2DG6OVM2YMIT","json":"https://pith.science/pith/QZ3QPEIFJGIKEN2DG6OVM2YMIT.json","graph_json":"https://pith.science/api/pith-number/QZ3QPEIFJGIKEN2DG6OVM2YMIT/graph.json","events_json":"https://pith.science/api/pith-number/QZ3QPEIFJGIKEN2DG6OVM2YMIT/events.json","paper":"https://pith.science/paper/QZ3QPEIF"},"agent_actions":{"view_html":"https://pith.science/pith/QZ3QPEIFJGIKEN2DG6OVM2YMIT","download_json":"https://pith.science/pith/QZ3QPEIFJGIKEN2DG6OVM2YMIT.json","view_paper":"https://pith.science/paper/QZ3QPEIF","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1012.2774&json=true","fetch_graph":"https://pith.science/api/pith-number/QZ3QPEIFJGIKEN2DG6OVM2YMIT/graph.json","fetch_events":"https://pith.science/api/pith-number/QZ3QPEIFJGIKEN2DG6OVM2YMIT/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/QZ3QPEIFJGIKEN2DG6OVM2YMIT/action/timestamp_anchor","attest_storage":"https://pith.science/pith/QZ3QPEIFJGIKEN2DG6OVM2YMIT/action/storage_attestation","attest_author":"https://pith.science/pith/QZ3QPEIFJGIKEN2DG6OVM2YMIT/action/author_attestation","sign_citation":"https://pith.science/pith/QZ3QPEIFJGIKEN2DG6OVM2YMIT/action/citation_signature","submit_replication":"https://pith.science/pith/QZ3QPEIFJGIKEN2DG6OVM2YMIT/action/replication_record"}},"created_at":"2026-05-18T04:33:27.783801+00:00","updated_at":"2026-05-18T04:33:27.783801+00:00"}