{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:CUCUWKTFPAEC3MRAST6R5F6GKZ","short_pith_number":"pith:CUCUWKTF","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"},"canonical_sha256":"15054b2a6578082db22094fd1e97c656404a835080e986b3aa9f0fa0ed7af36c","source":{"kind":"arxiv","id":"1611.03254","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1611.03254","created_at":"2026-05-18T00:59:40Z"},{"alias_kind":"arxiv_version","alias_value":"1611.03254v1","created_at":"2026-05-18T00:59:40Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1611.03254","created_at":"2026-05-18T00:59:40Z"},{"alias_kind":"pith_short_12","alias_value":"CUCUWKTFPAEC","created_at":"2026-05-18T12:30:09Z"},{"alias_kind":"pith_short_16","alias_value":"CUCUWKTFPAEC3MRA","created_at":"2026-05-18T12:30:09Z"},{"alias_kind":"pith_short_8","alias_value":"CUCUWKTF","created_at":"2026-05-18T12:30:09Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:CUCUWKTFPAEC3MRAST6R5F6GKZ","target":"record","payload":{"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"},"canonical_sha256":"15054b2a6578082db22094fd1e97c656404a835080e986b3aa9f0fa0ed7af36c","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"},"source_kind":"arxiv","source_id":"1611.03254","source_version":1,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T00:59:40Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"t2vDSuIMZgeG5Vm9qwVzmB2JGARjGRktVBEeSoiaCD4Mz72X3IlKB0J8wIRLtftHGVEZCOqdS3hPujXaD4M3DQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T00:25:58.588687Z"},"content_sha256":"c2523c6dab459154a4c9514385d8f1828992f5f63f5fe3ec664e9d9cd62063a4","schema_version":"1.0","event_id":"sha256:c2523c6dab459154a4c9514385d8f1828992f5f63f5fe3ec664e9d9cd62063a4"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:CUCUWKTFPAEC3MRAST6R5F6GKZ","target":"graph","payload":{"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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T00:59:40Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"D/EcEgHgksvWLGzPbTbL47Cdjis+5rwiK16k94uMW5fLLujMrOH994xmUslHje79QcRhI/U5+YtxPiJ1aPuVDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T00:25:58.589074Z"},"content_sha256":"f9b1c26fd8e9caa76db34374d1b603c36e40c43a1caf773ac9d5d4296d010c5f","schema_version":"1.0","event_id":"sha256:f9b1c26fd8e9caa76db34374d1b603c36e40c43a1caf773ac9d5d4296d010c5f"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/CUCUWKTFPAEC3MRAST6R5F6GKZ/bundle.json","state_url":"https://pith.science/pith/CUCUWKTFPAEC3MRAST6R5F6GKZ/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/CUCUWKTFPAEC3MRAST6R5F6GKZ/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-05-31T00:25:58Z","links":{"resolver":"https://pith.science/pith/CUCUWKTFPAEC3MRAST6R5F6GKZ","bundle":"https://pith.science/pith/CUCUWKTFPAEC3MRAST6R5F6GKZ/bundle.json","state":"https://pith.science/pith/CUCUWKTFPAEC3MRAST6R5F6GKZ/state.json","well_known_bundle":"https://pith.science/.well-known/pith/CUCUWKTFPAEC3MRAST6R5F6GKZ/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:CUCUWKTFPAEC3MRAST6R5F6GKZ","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"b8d231ca3009946b341dbe9ba8caef7a99ee5f25114786f2e522b496aef01267","cross_cats_sorted":["cs.DB"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SI","submitted_at":"2016-11-10T11:02:31Z","title_canon_sha256":"045afd9683e9fb80ba160a3d7c2e09697acc4b0ccf3fad207442c9b7710f4914"},"schema_version":"1.0","source":{"id":"1611.03254","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1611.03254","created_at":"2026-05-18T00:59:40Z"},{"alias_kind":"arxiv_version","alias_value":"1611.03254v1","created_at":"2026-05-18T00:59:40Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1611.03254","created_at":"2026-05-18T00:59:40Z"},{"alias_kind":"pith_short_12","alias_value":"CUCUWKTFPAEC","created_at":"2026-05-18T12:30:09Z"},{"alias_kind":"pith_short_16","alias_value":"CUCUWKTFPAEC3MRA","created_at":"2026-05-18T12:30:09Z"},{"alias_kind":"pith_short_8","alias_value":"CUCUWKTF","created_at":"2026-05-18T12:30:09Z"}],"graph_snapshots":[{"event_id":"sha256:f9b1c26fd8e9caa76db34374d1b603c36e40c43a1caf773ac9d5d4296d010c5f","target":"graph","created_at":"2026-05-18T00:59:40Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"paper":{"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","authors_text":"Fan Zhang, Lu Qin, Wenjie Zhang, Xuemin Lin, Ying Zhang","cross_cats":["cs.DB"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SI","submitted_at":"2016-11-10T11:02:31Z","title":"When Engagement Meets Similarity: Efficient (k,r)-Core Computation on Social Networks"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1611.03254","kind":"arxiv","version":1},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:c2523c6dab459154a4c9514385d8f1828992f5f63f5fe3ec664e9d9cd62063a4","target":"record","created_at":"2026-05-18T00:59:40Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"b8d231ca3009946b341dbe9ba8caef7a99ee5f25114786f2e522b496aef01267","cross_cats_sorted":["cs.DB"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SI","submitted_at":"2016-11-10T11:02:31Z","title_canon_sha256":"045afd9683e9fb80ba160a3d7c2e09697acc4b0ccf3fad207442c9b7710f4914"},"schema_version":"1.0","source":{"id":"1611.03254","kind":"arxiv","version":1}},"canonical_sha256":"15054b2a6578082db22094fd1e97c656404a835080e986b3aa9f0fa0ed7af36c","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"15054b2a6578082db22094fd1e97c656404a835080e986b3aa9f0fa0ed7af36c","first_computed_at":"2026-05-18T00:59:40.823586Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:59:40.823586Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"eXqjfbRSdnunQFZ18WALzcE7vU5A06K52TT/9FaiXSnlM/zCcv8OjQuf/T/7Xx/4L0NSqAdB5lLCnv434h5cCQ==","signature_status":"signed_v1","signed_at":"2026-05-18T00:59:40.824268Z","signed_message":"canonical_sha256_bytes"},"source_id":"1611.03254","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:c2523c6dab459154a4c9514385d8f1828992f5f63f5fe3ec664e9d9cd62063a4","sha256:f9b1c26fd8e9caa76db34374d1b603c36e40c43a1caf773ac9d5d4296d010c5f"],"state_sha256":"f7f0900d0d9e13985408bb34a421b2f061c7fe2274d5fa4d4ddee8f0fd2d45d6"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"DURsZqFoV+nOhDn4K00wVLV5bQPmXtaFSHlG9dzRpI9Jl0NK6bk4OONNK/pEc74qJm5hSesLqpRr06QZt8i9Cw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-31T00:25:58.591874Z","bundle_sha256":"0a358f45f4f759736bb406402b7ffe6c76e1ad8ae954214708d1bdf66971ac15"}}