{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:47KSH3FIHQSTF5HW2G2QSISVDI","short_pith_number":"pith:47KSH3FI","schema_version":"1.0","canonical_sha256":"e7d523eca83c2532f4f6d1b50922551a3f314888cd4533175e1c0428bff2b3f8","source":{"kind":"arxiv","id":"1802.03997","version":3},"attestation_state":"computed","paper":{"title":"GEMSEC: Graph Embedding with Self Clustering","license":"http://creativecommons.org/publicdomain/zero/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.SI","authors_text":"Benedek Rozemberczki, Charles Sutton, Rik Sarkar, Ryan Davies","submitted_at":"2018-02-12T12:03:21Z","abstract_excerpt":"Modern graph embedding procedures can efficiently process graphs with millions of nodes. In this paper, we propose GEMSEC -- a graph embedding algorithm which learns a clustering of the nodes simultaneously with computing their embedding. GEMSEC is a general extension of earlier work in the domain of sequence-based graph embedding. GEMSEC places nodes in an abstract feature space where the vertex features minimize the negative log-likelihood of preserving sampled vertex neighborhoods, and it incorporates known social network properties through a machine learning regularization. We present two "},"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":"1802.03997","kind":"arxiv","version":3},"metadata":{"license":"http://creativecommons.org/publicdomain/zero/1.0/","primary_cat":"cs.SI","submitted_at":"2018-02-12T12:03:21Z","cross_cats_sorted":[],"title_canon_sha256":"1f2c4c1fc6c8f8dbb940a4bc31e94c6ffd0df279b2b22bcd7b56271e8dd51f39","abstract_canon_sha256":"d6a9c7b067d2595ed1867a988a1c7e84445a23ec9c2795e3378fb3766bee488a"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:39:37.256555Z","signature_b64":"TNTPqyxPqmfin+b1EQGcYMPaKU4oQ83eQpKcvyWe489n9Ro/xsjlTz+dL7eg/aIF1J4uTEg0Ga5x8m1p31VKCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"e7d523eca83c2532f4f6d1b50922551a3f314888cd4533175e1c0428bff2b3f8","last_reissued_at":"2026-05-17T23:39:37.255953Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:39:37.255953Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"GEMSEC: Graph Embedding with Self Clustering","license":"http://creativecommons.org/publicdomain/zero/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.SI","authors_text":"Benedek Rozemberczki, Charles Sutton, Rik Sarkar, Ryan Davies","submitted_at":"2018-02-12T12:03:21Z","abstract_excerpt":"Modern graph embedding procedures can efficiently process graphs with millions of nodes. In this paper, we propose GEMSEC -- a graph embedding algorithm which learns a clustering of the nodes simultaneously with computing their embedding. GEMSEC is a general extension of earlier work in the domain of sequence-based graph embedding. GEMSEC places nodes in an abstract feature space where the vertex features minimize the negative log-likelihood of preserving sampled vertex neighborhoods, and it incorporates known social network properties through a machine learning regularization. We present two "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1802.03997","kind":"arxiv","version":3},"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":"1802.03997","created_at":"2026-05-17T23:39:37.256078+00:00"},{"alias_kind":"arxiv_version","alias_value":"1802.03997v3","created_at":"2026-05-17T23:39:37.256078+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1802.03997","created_at":"2026-05-17T23:39:37.256078+00:00"},{"alias_kind":"pith_short_12","alias_value":"47KSH3FIHQST","created_at":"2026-05-18T12:32:05.422762+00:00"},{"alias_kind":"pith_short_16","alias_value":"47KSH3FIHQSTF5HW","created_at":"2026-05-18T12:32:05.422762+00:00"},{"alias_kind":"pith_short_8","alias_value":"47KSH3FI","created_at":"2026-05-18T12:32:05.422762+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/47KSH3FIHQSTF5HW2G2QSISVDI","json":"https://pith.science/pith/47KSH3FIHQSTF5HW2G2QSISVDI.json","graph_json":"https://pith.science/api/pith-number/47KSH3FIHQSTF5HW2G2QSISVDI/graph.json","events_json":"https://pith.science/api/pith-number/47KSH3FIHQSTF5HW2G2QSISVDI/events.json","paper":"https://pith.science/paper/47KSH3FI"},"agent_actions":{"view_html":"https://pith.science/pith/47KSH3FIHQSTF5HW2G2QSISVDI","download_json":"https://pith.science/pith/47KSH3FIHQSTF5HW2G2QSISVDI.json","view_paper":"https://pith.science/paper/47KSH3FI","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1802.03997&json=true","fetch_graph":"https://pith.science/api/pith-number/47KSH3FIHQSTF5HW2G2QSISVDI/graph.json","fetch_events":"https://pith.science/api/pith-number/47KSH3FIHQSTF5HW2G2QSISVDI/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/47KSH3FIHQSTF5HW2G2QSISVDI/action/timestamp_anchor","attest_storage":"https://pith.science/pith/47KSH3FIHQSTF5HW2G2QSISVDI/action/storage_attestation","attest_author":"https://pith.science/pith/47KSH3FIHQSTF5HW2G2QSISVDI/action/author_attestation","sign_citation":"https://pith.science/pith/47KSH3FIHQSTF5HW2G2QSISVDI/action/citation_signature","submit_replication":"https://pith.science/pith/47KSH3FIHQSTF5HW2G2QSISVDI/action/replication_record"}},"created_at":"2026-05-17T23:39:37.256078+00:00","updated_at":"2026-05-17T23:39:37.256078+00:00"}