{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2019:FCLEKYGKCPALT2SLX4HOONTPGU","short_pith_number":"pith:FCLEKYGK","schema_version":"1.0","canonical_sha256":"28964560ca13c0b9ea4bbf0ee7366f3509850c0a17e391c0db221d24bd6c935c","source":{"kind":"arxiv","id":"1907.01662","version":2},"attestation_state":"computed","paper":{"title":"From Node Embedding To Community Embedding : A Hyperbolic Approach","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["stat.ML"],"primary_cat":"cs.LG","authors_text":"Hadi Zaatiti, Hatem Hajri, Nicolas Baskiotis, Olivier Schwander, Thomas Gerald","submitted_at":"2019-07-02T21:45:22Z","abstract_excerpt":"Detecting communities on graphs has received significant interest in recent literature. Current state-of-the-art community embedding approach called \\textit{ComE} tackles this problem by coupling graph embedding with community detection. Considering the success of hyperbolic representations of graph-structured data in last years, an ongoing challenge is to set up a hyperbolic approach for the community detection problem. The present paper meets this challenge by introducing a Riemannian equivalent of \\textit{ComE}. Our proposed approach combines hyperbolic embeddings with Riemannian K-means or"},"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":"1907.01662","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2019-07-02T21:45:22Z","cross_cats_sorted":["stat.ML"],"title_canon_sha256":"7a389dfc13d78101dc038ae84013d274622449a779b990578bc9be6b4e86accf","abstract_canon_sha256":"f1474b75f8eb8bf9bdef271fec36282b6d8f7a3210518188f52d69d70a7a1751"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T00:44:38.929529Z","signature_b64":"3rkp638OQOnx8etDiOXy5FFaBV/6E5H9j6HPtTmAzVIh2/BEurJGkRP6SFqdFkwVIi8OW4ox8DHQ1dGJRGcACQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"28964560ca13c0b9ea4bbf0ee7366f3509850c0a17e391c0db221d24bd6c935c","last_reissued_at":"2026-07-05T00:44:38.929123Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T00:44:38.929123Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"From Node Embedding To Community Embedding : A Hyperbolic Approach","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["stat.ML"],"primary_cat":"cs.LG","authors_text":"Hadi Zaatiti, Hatem Hajri, Nicolas Baskiotis, Olivier Schwander, Thomas Gerald","submitted_at":"2019-07-02T21:45:22Z","abstract_excerpt":"Detecting communities on graphs has received significant interest in recent literature. Current state-of-the-art community embedding approach called \\textit{ComE} tackles this problem by coupling graph embedding with community detection. Considering the success of hyperbolic representations of graph-structured data in last years, an ongoing challenge is to set up a hyperbolic approach for the community detection problem. The present paper meets this challenge by introducing a Riemannian equivalent of \\textit{ComE}. Our proposed approach combines hyperbolic embeddings with Riemannian K-means or"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1907.01662","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/1907.01662/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":"1907.01662","created_at":"2026-07-05T00:44:38.929179+00:00"},{"alias_kind":"arxiv_version","alias_value":"1907.01662v2","created_at":"2026-07-05T00:44:38.929179+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1907.01662","created_at":"2026-07-05T00:44:38.929179+00:00"},{"alias_kind":"pith_short_12","alias_value":"FCLEKYGKCPAL","created_at":"2026-07-05T00:44:38.929179+00:00"},{"alias_kind":"pith_short_16","alias_value":"FCLEKYGKCPALT2SL","created_at":"2026-07-05T00:44:38.929179+00:00"},{"alias_kind":"pith_short_8","alias_value":"FCLEKYGK","created_at":"2026-07-05T00:44:38.929179+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/FCLEKYGKCPALT2SLX4HOONTPGU","json":"https://pith.science/pith/FCLEKYGKCPALT2SLX4HOONTPGU.json","graph_json":"https://pith.science/api/pith-number/FCLEKYGKCPALT2SLX4HOONTPGU/graph.json","events_json":"https://pith.science/api/pith-number/FCLEKYGKCPALT2SLX4HOONTPGU/events.json","paper":"https://pith.science/paper/FCLEKYGK"},"agent_actions":{"view_html":"https://pith.science/pith/FCLEKYGKCPALT2SLX4HOONTPGU","download_json":"https://pith.science/pith/FCLEKYGKCPALT2SLX4HOONTPGU.json","view_paper":"https://pith.science/paper/FCLEKYGK","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1907.01662&json=true","fetch_graph":"https://pith.science/api/pith-number/FCLEKYGKCPALT2SLX4HOONTPGU/graph.json","fetch_events":"https://pith.science/api/pith-number/FCLEKYGKCPALT2SLX4HOONTPGU/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/FCLEKYGKCPALT2SLX4HOONTPGU/action/timestamp_anchor","attest_storage":"https://pith.science/pith/FCLEKYGKCPALT2SLX4HOONTPGU/action/storage_attestation","attest_author":"https://pith.science/pith/FCLEKYGKCPALT2SLX4HOONTPGU/action/author_attestation","sign_citation":"https://pith.science/pith/FCLEKYGKCPALT2SLX4HOONTPGU/action/citation_signature","submit_replication":"https://pith.science/pith/FCLEKYGKCPALT2SLX4HOONTPGU/action/replication_record"}},"created_at":"2026-07-05T00:44:38.929179+00:00","updated_at":"2026-07-05T00:44:38.929179+00:00"}