{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2022:CAMOXJYM32FFHXDMR5KUXCJ7IK","short_pith_number":"pith:CAMOXJYM","schema_version":"1.0","canonical_sha256":"1018eba70cde8a53dc6c8f554b893f42a5a4d7a51e978fa311e7b8dbe10fce84","source":{"kind":"arxiv","id":"2211.10627","version":2},"attestation_state":"computed","paper":{"title":"EGRC-Net: Embedding-induced Graph Refinement Clustering Network","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI","cs.MM"],"primary_cat":"cs.LG","authors_text":"Hui Liu, Junhui Hou, Yuheng Jia, Zhihao Peng","submitted_at":"2022-11-19T09:08:43Z","abstract_excerpt":"Existing graph clustering networks heavily rely on a predefined yet fixed graph, which can lead to failures when the initial graph fails to accurately capture the data topology structure of the embedding space. In order to address this issue, we propose a novel clustering network called Embedding-Induced Graph Refinement Clustering Network (EGRC-Net), which effectively utilizes the learned embedding to adaptively refine the initial graph and enhance the clustering performance. To begin, we leverage both semantic and topological information by employing a vanilla auto-encoder and a graph convol"},"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":"2211.10627","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2022-11-19T09:08:43Z","cross_cats_sorted":["cs.AI","cs.MM"],"title_canon_sha256":"357f44b0361410b860a8f1a6b9460f06cba4f8f6a06a7399137d5dadc5e91eac","abstract_canon_sha256":"cbc8b38731cc38a45a3e48de76d6497ea2031c3ef71cbe704f7d403c0b1b5367"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T07:12:15.642483Z","signature_b64":"45U1k44dJlJJNh92rcAokEyZqWDqCfXchww1wXdQBmgeNtthrSxXBfVeRvq8zCt4RTtS7hTtxA2H2FWnk5v9DA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"1018eba70cde8a53dc6c8f554b893f42a5a4d7a51e978fa311e7b8dbe10fce84","last_reissued_at":"2026-07-05T07:12:15.641828Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T07:12:15.641828Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"EGRC-Net: Embedding-induced Graph Refinement Clustering Network","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI","cs.MM"],"primary_cat":"cs.LG","authors_text":"Hui Liu, Junhui Hou, Yuheng Jia, Zhihao Peng","submitted_at":"2022-11-19T09:08:43Z","abstract_excerpt":"Existing graph clustering networks heavily rely on a predefined yet fixed graph, which can lead to failures when the initial graph fails to accurately capture the data topology structure of the embedding space. In order to address this issue, we propose a novel clustering network called Embedding-Induced Graph Refinement Clustering Network (EGRC-Net), which effectively utilizes the learned embedding to adaptively refine the initial graph and enhance the clustering performance. To begin, we leverage both semantic and topological information by employing a vanilla auto-encoder and a graph convol"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2211.10627","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/2211.10627/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":"2211.10627","created_at":"2026-07-05T07:12:15.641894+00:00"},{"alias_kind":"arxiv_version","alias_value":"2211.10627v2","created_at":"2026-07-05T07:12:15.641894+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2211.10627","created_at":"2026-07-05T07:12:15.641894+00:00"},{"alias_kind":"pith_short_12","alias_value":"CAMOXJYM32FF","created_at":"2026-07-05T07:12:15.641894+00:00"},{"alias_kind":"pith_short_16","alias_value":"CAMOXJYM32FFHXDM","created_at":"2026-07-05T07:12:15.641894+00:00"},{"alias_kind":"pith_short_8","alias_value":"CAMOXJYM","created_at":"2026-07-05T07:12:15.641894+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/CAMOXJYM32FFHXDMR5KUXCJ7IK","json":"https://pith.science/pith/CAMOXJYM32FFHXDMR5KUXCJ7IK.json","graph_json":"https://pith.science/api/pith-number/CAMOXJYM32FFHXDMR5KUXCJ7IK/graph.json","events_json":"https://pith.science/api/pith-number/CAMOXJYM32FFHXDMR5KUXCJ7IK/events.json","paper":"https://pith.science/paper/CAMOXJYM"},"agent_actions":{"view_html":"https://pith.science/pith/CAMOXJYM32FFHXDMR5KUXCJ7IK","download_json":"https://pith.science/pith/CAMOXJYM32FFHXDMR5KUXCJ7IK.json","view_paper":"https://pith.science/paper/CAMOXJYM","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2211.10627&json=true","fetch_graph":"https://pith.science/api/pith-number/CAMOXJYM32FFHXDMR5KUXCJ7IK/graph.json","fetch_events":"https://pith.science/api/pith-number/CAMOXJYM32FFHXDMR5KUXCJ7IK/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/CAMOXJYM32FFHXDMR5KUXCJ7IK/action/timestamp_anchor","attest_storage":"https://pith.science/pith/CAMOXJYM32FFHXDMR5KUXCJ7IK/action/storage_attestation","attest_author":"https://pith.science/pith/CAMOXJYM32FFHXDMR5KUXCJ7IK/action/author_attestation","sign_citation":"https://pith.science/pith/CAMOXJYM32FFHXDMR5KUXCJ7IK/action/citation_signature","submit_replication":"https://pith.science/pith/CAMOXJYM32FFHXDMR5KUXCJ7IK/action/replication_record"}},"created_at":"2026-07-05T07:12:15.641894+00:00","updated_at":"2026-07-05T07:12:15.641894+00:00"}