{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2023:Z5D4VUI6OWM56QXKULWD2MGNEC","short_pith_number":"pith:Z5D4VUI6","schema_version":"1.0","canonical_sha256":"cf47cad11e7599df42eaa2ec3d30cd20a87e4e96753cbca73b89cb6cd674394e","source":{"kind":"arxiv","id":"2304.09512","version":2},"attestation_state":"computed","paper":{"title":"Community Detection Using Revised Medoid-Shift Based on KNN","license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","headline":"","cross_cats":["cs.LG"],"primary_cat":"cs.SI","authors_text":"Jiakang Li, Jie Hou, Wei Ke, Xiaokang Peng, Yonggang Lu","submitted_at":"2023-04-19T09:02:24Z","abstract_excerpt":"Community detection becomes an important problem with the booming of social networks. The Medoid-Shift algorithm preserves the benefits of Mean-Shift and can be applied to problems based on distance matrix, such as community detection. One drawback of the Medoid-Shift algorithm is that there may be no data points within the neighborhood region defined by a distance parameter. To deal with the community detection problem better, a new algorithm called Revised Medoid-Shift (RMS) in this work is thus proposed. During the process of finding the next medoid, the RMS algorithm is based on a neighbor"},"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":"2304.09512","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","primary_cat":"cs.SI","submitted_at":"2023-04-19T09:02:24Z","cross_cats_sorted":["cs.LG"],"title_canon_sha256":"c23b259a94795e92ee46f514b37fcb3cda35c769e52e24643f60f110a5fd8484","abstract_canon_sha256":"75431a687fca270edb33c1e392e404e16fe5e10d87e87b72ff21d9d1f9ca0115"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T06:52:03.848435Z","signature_b64":"ljzFgYIh97NZ9qeDFL2eMNeoJDWTIc9zLxztxpQ+KxC4DAGcj6GNImQbxOWItYWVwZ0OLMFrDWuP9xDTJ3q6CA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"cf47cad11e7599df42eaa2ec3d30cd20a87e4e96753cbca73b89cb6cd674394e","last_reissued_at":"2026-07-05T06:52:03.847922Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T06:52:03.847922Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Community Detection Using Revised Medoid-Shift Based on KNN","license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","headline":"","cross_cats":["cs.LG"],"primary_cat":"cs.SI","authors_text":"Jiakang Li, Jie Hou, Wei Ke, Xiaokang Peng, Yonggang Lu","submitted_at":"2023-04-19T09:02:24Z","abstract_excerpt":"Community detection becomes an important problem with the booming of social networks. The Medoid-Shift algorithm preserves the benefits of Mean-Shift and can be applied to problems based on distance matrix, such as community detection. One drawback of the Medoid-Shift algorithm is that there may be no data points within the neighborhood region defined by a distance parameter. To deal with the community detection problem better, a new algorithm called Revised Medoid-Shift (RMS) in this work is thus proposed. During the process of finding the next medoid, the RMS algorithm is based on a neighbor"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2304.09512","kind":"arxiv","version":2},"verdict":{"id":null,"model_set":{},"created_at":null,"strongest_claim":"","one_line_summary":"","pipeline_version":null,"weakest_assumption":"","pith_extraction_headline":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2304.09512/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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":"2304.09512","created_at":"2026-07-05T06:52:03.847983+00:00"},{"alias_kind":"arxiv_version","alias_value":"2304.09512v2","created_at":"2026-07-05T06:52:03.847983+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2304.09512","created_at":"2026-07-05T06:52:03.847983+00:00"},{"alias_kind":"pith_short_12","alias_value":"Z5D4VUI6OWM5","created_at":"2026-07-05T06:52:03.847983+00:00"},{"alias_kind":"pith_short_16","alias_value":"Z5D4VUI6OWM56QXK","created_at":"2026-07-05T06:52:03.847983+00:00"},{"alias_kind":"pith_short_8","alias_value":"Z5D4VUI6","created_at":"2026-07-05T06:52:03.847983+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/Z5D4VUI6OWM56QXKULWD2MGNEC","json":"https://pith.science/pith/Z5D4VUI6OWM56QXKULWD2MGNEC.json","graph_json":"https://pith.science/api/pith-number/Z5D4VUI6OWM56QXKULWD2MGNEC/graph.json","events_json":"https://pith.science/api/pith-number/Z5D4VUI6OWM56QXKULWD2MGNEC/events.json","paper":"https://pith.science/paper/Z5D4VUI6"},"agent_actions":{"view_html":"https://pith.science/pith/Z5D4VUI6OWM56QXKULWD2MGNEC","download_json":"https://pith.science/pith/Z5D4VUI6OWM56QXKULWD2MGNEC.json","view_paper":"https://pith.science/paper/Z5D4VUI6","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2304.09512&json=true","fetch_graph":"https://pith.science/api/pith-number/Z5D4VUI6OWM56QXKULWD2MGNEC/graph.json","fetch_events":"https://pith.science/api/pith-number/Z5D4VUI6OWM56QXKULWD2MGNEC/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/Z5D4VUI6OWM56QXKULWD2MGNEC/action/timestamp_anchor","attest_storage":"https://pith.science/pith/Z5D4VUI6OWM56QXKULWD2MGNEC/action/storage_attestation","attest_author":"https://pith.science/pith/Z5D4VUI6OWM56QXKULWD2MGNEC/action/author_attestation","sign_citation":"https://pith.science/pith/Z5D4VUI6OWM56QXKULWD2MGNEC/action/citation_signature","submit_replication":"https://pith.science/pith/Z5D4VUI6OWM56QXKULWD2MGNEC/action/replication_record"}},"created_at":"2026-07-05T06:52:03.847983+00:00","updated_at":"2026-07-05T06:52:03.847983+00:00"}