{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2022:MSJTGKV6ZBW7VD3YU4ENHYU3QK","short_pith_number":"pith:MSJTGKV6","schema_version":"1.0","canonical_sha256":"6493332abec86dfa8f78a708d3e29b8297c1a8928f0f1df9dc85cdb193d00df2","source":{"kind":"arxiv","id":"2201.04066","version":4},"attestation_state":"computed","paper":{"title":"VGAER: Graph Neural Network Reconstruction based Community Detection","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI","cs.LG"],"primary_cat":"cs.SI","authors_text":"Chenyang Qiu, Huijia Li, Wenzhe Xu, Zhaoci Huang","submitted_at":"2022-01-08T02:19:47Z","abstract_excerpt":"Community detection is a fundamental and important issue in network science, but there are only a few community detection algorithms based on graph neural networks, among which unsupervised algorithms are almost blank. By fusing the high-order modularity information with network features, this paper proposes a Variational Graph AutoEncoder Reconstruction based community detection VGAER for the first time, and gives its non-probabilistic version. They do not need any prior information. We have carefully designed corresponding input features, decoder, and downstream tasks based on the community "},"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":"2201.04066","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SI","submitted_at":"2022-01-08T02:19:47Z","cross_cats_sorted":["cs.AI","cs.LG"],"title_canon_sha256":"1be2f139b72c6a4b1f5add75cb984953f1331fe2f2c50a34b3319c61af27119d","abstract_canon_sha256":"aa7305b0ad51e385097b2a7e5c66452e6dc6c1a2333c5be8f0c62079a087eeff"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T04:02:22.422663Z","signature_b64":"wzzOxb/mIUtdDNQL5YdFc1MmaSaaFJzcyASWRZN7rVRGYrl662UtENSB8U8hstA/WTZhbdq1lrfb9hDf+NMlCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"6493332abec86dfa8f78a708d3e29b8297c1a8928f0f1df9dc85cdb193d00df2","last_reissued_at":"2026-07-05T04:02:22.422199Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T04:02:22.422199Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"VGAER: Graph Neural Network Reconstruction based Community Detection","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI","cs.LG"],"primary_cat":"cs.SI","authors_text":"Chenyang Qiu, Huijia Li, Wenzhe Xu, Zhaoci Huang","submitted_at":"2022-01-08T02:19:47Z","abstract_excerpt":"Community detection is a fundamental and important issue in network science, but there are only a few community detection algorithms based on graph neural networks, among which unsupervised algorithms are almost blank. By fusing the high-order modularity information with network features, this paper proposes a Variational Graph AutoEncoder Reconstruction based community detection VGAER for the first time, and gives its non-probabilistic version. They do not need any prior information. We have carefully designed corresponding input features, decoder, and downstream tasks based on the community "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2201.04066","kind":"arxiv","version":4},"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/2201.04066/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":"2201.04066","created_at":"2026-07-05T04:02:22.422255+00:00"},{"alias_kind":"arxiv_version","alias_value":"2201.04066v4","created_at":"2026-07-05T04:02:22.422255+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2201.04066","created_at":"2026-07-05T04:02:22.422255+00:00"},{"alias_kind":"pith_short_12","alias_value":"MSJTGKV6ZBW7","created_at":"2026-07-05T04:02:22.422255+00:00"},{"alias_kind":"pith_short_16","alias_value":"MSJTGKV6ZBW7VD3Y","created_at":"2026-07-05T04:02:22.422255+00:00"},{"alias_kind":"pith_short_8","alias_value":"MSJTGKV6","created_at":"2026-07-05T04:02:22.422255+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2605.28209","citing_title":"Robust Contrastive Graph Clustering with Adaptive Local-Global Integration","ref_index":1,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/MSJTGKV6ZBW7VD3YU4ENHYU3QK","json":"https://pith.science/pith/MSJTGKV6ZBW7VD3YU4ENHYU3QK.json","graph_json":"https://pith.science/api/pith-number/MSJTGKV6ZBW7VD3YU4ENHYU3QK/graph.json","events_json":"https://pith.science/api/pith-number/MSJTGKV6ZBW7VD3YU4ENHYU3QK/events.json","paper":"https://pith.science/paper/MSJTGKV6"},"agent_actions":{"view_html":"https://pith.science/pith/MSJTGKV6ZBW7VD3YU4ENHYU3QK","download_json":"https://pith.science/pith/MSJTGKV6ZBW7VD3YU4ENHYU3QK.json","view_paper":"https://pith.science/paper/MSJTGKV6","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2201.04066&json=true","fetch_graph":"https://pith.science/api/pith-number/MSJTGKV6ZBW7VD3YU4ENHYU3QK/graph.json","fetch_events":"https://pith.science/api/pith-number/MSJTGKV6ZBW7VD3YU4ENHYU3QK/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/MSJTGKV6ZBW7VD3YU4ENHYU3QK/action/timestamp_anchor","attest_storage":"https://pith.science/pith/MSJTGKV6ZBW7VD3YU4ENHYU3QK/action/storage_attestation","attest_author":"https://pith.science/pith/MSJTGKV6ZBW7VD3YU4ENHYU3QK/action/author_attestation","sign_citation":"https://pith.science/pith/MSJTGKV6ZBW7VD3YU4ENHYU3QK/action/citation_signature","submit_replication":"https://pith.science/pith/MSJTGKV6ZBW7VD3YU4ENHYU3QK/action/replication_record"}},"created_at":"2026-07-05T04:02:22.422255+00:00","updated_at":"2026-07-05T04:02:22.422255+00:00"}