{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:CUCUWKTFPAEC3MRAST6R5F6GKZ","short_pith_number":"pith:CUCUWKTF","schema_version":"1.0","canonical_sha256":"15054b2a6578082db22094fd1e97c656404a835080e986b3aa9f0fa0ed7af36c","source":{"kind":"arxiv","id":"1611.03254","version":1},"attestation_state":"computed","paper":{"title":"When Engagement Meets Similarity: Efficient (k,r)-Core Computation on Social Networks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DB"],"primary_cat":"cs.SI","authors_text":"Fan Zhang, Lu Qin, Wenjie Zhang, Xuemin Lin, Ying Zhang","submitted_at":"2016-11-10T11:02:31Z","abstract_excerpt":"In this paper, we investigate the problem of (k,r)-core which intends to find cohesive subgraphs on social networks considering both user engagement and similarity perspectives. In particular, we adopt the popular concept of k-core to guarantee the engagement of the users (vertices) in a group (subgraph) where each vertex in a (k,r)-core connects to at least k other vertices. Meanwhile, we also consider the pairwise similarity between users based on their profiles. For a given similarity metric and a similarity threshold r, the similarity between any two vertices in a (k,r)-core is ensured not"},"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":"1611.03254","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SI","submitted_at":"2016-11-10T11:02:31Z","cross_cats_sorted":["cs.DB"],"title_canon_sha256":"045afd9683e9fb80ba160a3d7c2e09697acc4b0ccf3fad207442c9b7710f4914","abstract_canon_sha256":"b8d231ca3009946b341dbe9ba8caef7a99ee5f25114786f2e522b496aef01267"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:59:40.824268Z","signature_b64":"eXqjfbRSdnunQFZ18WALzcE7vU5A06K52TT/9FaiXSnlM/zCcv8OjQuf/T/7Xx/4L0NSqAdB5lLCnv434h5cCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"15054b2a6578082db22094fd1e97c656404a835080e986b3aa9f0fa0ed7af36c","last_reissued_at":"2026-05-18T00:59:40.823586Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:59:40.823586Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"When Engagement Meets Similarity: Efficient (k,r)-Core Computation on Social Networks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DB"],"primary_cat":"cs.SI","authors_text":"Fan Zhang, Lu Qin, Wenjie Zhang, Xuemin Lin, Ying Zhang","submitted_at":"2016-11-10T11:02:31Z","abstract_excerpt":"In this paper, we investigate the problem of (k,r)-core which intends to find cohesive subgraphs on social networks considering both user engagement and similarity perspectives. In particular, we adopt the popular concept of k-core to guarantee the engagement of the users (vertices) in a group (subgraph) where each vertex in a (k,r)-core connects to at least k other vertices. Meanwhile, we also consider the pairwise similarity between users based on their profiles. For a given similarity metric and a similarity threshold r, the similarity between any two vertices in a (k,r)-core is ensured not"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1611.03254","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":"1611.03254","created_at":"2026-05-18T00:59:40.823683+00:00"},{"alias_kind":"arxiv_version","alias_value":"1611.03254v1","created_at":"2026-05-18T00:59:40.823683+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1611.03254","created_at":"2026-05-18T00:59:40.823683+00:00"},{"alias_kind":"pith_short_12","alias_value":"CUCUWKTFPAEC","created_at":"2026-05-18T12:30:09.641336+00:00"},{"alias_kind":"pith_short_16","alias_value":"CUCUWKTFPAEC3MRA","created_at":"2026-05-18T12:30:09.641336+00:00"},{"alias_kind":"pith_short_8","alias_value":"CUCUWKTF","created_at":"2026-05-18T12:30:09.641336+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/CUCUWKTFPAEC3MRAST6R5F6GKZ","json":"https://pith.science/pith/CUCUWKTFPAEC3MRAST6R5F6GKZ.json","graph_json":"https://pith.science/api/pith-number/CUCUWKTFPAEC3MRAST6R5F6GKZ/graph.json","events_json":"https://pith.science/api/pith-number/CUCUWKTFPAEC3MRAST6R5F6GKZ/events.json","paper":"https://pith.science/paper/CUCUWKTF"},"agent_actions":{"view_html":"https://pith.science/pith/CUCUWKTFPAEC3MRAST6R5F6GKZ","download_json":"https://pith.science/pith/CUCUWKTFPAEC3MRAST6R5F6GKZ.json","view_paper":"https://pith.science/paper/CUCUWKTF","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1611.03254&json=true","fetch_graph":"https://pith.science/api/pith-number/CUCUWKTFPAEC3MRAST6R5F6GKZ/graph.json","fetch_events":"https://pith.science/api/pith-number/CUCUWKTFPAEC3MRAST6R5F6GKZ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/CUCUWKTFPAEC3MRAST6R5F6GKZ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/CUCUWKTFPAEC3MRAST6R5F6GKZ/action/storage_attestation","attest_author":"https://pith.science/pith/CUCUWKTFPAEC3MRAST6R5F6GKZ/action/author_attestation","sign_citation":"https://pith.science/pith/CUCUWKTFPAEC3MRAST6R5F6GKZ/action/citation_signature","submit_replication":"https://pith.science/pith/CUCUWKTFPAEC3MRAST6R5F6GKZ/action/replication_record"}},"created_at":"2026-05-18T00:59:40.823683+00:00","updated_at":"2026-05-18T00:59:40.823683+00:00"}