{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2025:UUAXYTTX2H7VNHOZAKS5XZJQTF","short_pith_number":"pith:UUAXYTTX","schema_version":"1.0","canonical_sha256":"a5017c4e77d1ff569dd902a5dbe530995be4204e78ee8fb70726df3aabc893f9","source":{"kind":"arxiv","id":"2504.01605","version":1},"attestation_state":"computed","paper":{"title":"Multi-Relation Graph-Kernel Strengthen Network for Graph-Level Clustering","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.LG","authors_text":"Chengze Du, Guangzhen Yao, Huajie Lei, Mengfei Li, Renda Han, Wen Xin, Wenxin Zhang, Yahe Tian, Yu Li, Zeyu Zhang","submitted_at":"2025-04-02T11:17:15Z","abstract_excerpt":"Graph-level clustering is a fundamental task of data mining, aiming at dividing unlabeled graphs into distinct groups. However, existing deep methods that are limited by pooling have difficulty extracting diverse and complex graph structure features, while traditional graph kernel methods rely on exhaustive substructure search, unable to adaptive handle multi-relational data. This limitation hampers producing robust and representative graph-level embeddings. To address this issue, we propose a novel Multi-Relation Graph-Kernel Strengthen Network for Graph-Level Clustering (MGSN), which integra"},"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":"2504.01605","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2025-04-02T11:17:15Z","cross_cats_sorted":[],"title_canon_sha256":"4603d12e7e12252203c1d7a556804767af89f3f8a3fdd301640d15280be797ff","abstract_canon_sha256":"512b7abb87e933c3fa516a2bd4e23cfecf9ae2c09b7b7ed6867b2dd39c6b6c24"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T10:43:17.971922Z","signature_b64":"NvsoBCp41biJpNOH7QAK+YD2ncNKxuWb6Vm5w0mgwdLTfyKnCvzzIse/yiW3HLXUUjFO9EM/5/xHdjJco/TTAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"a5017c4e77d1ff569dd902a5dbe530995be4204e78ee8fb70726df3aabc893f9","last_reissued_at":"2026-07-05T10:43:17.971463Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T10:43:17.971463Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Multi-Relation Graph-Kernel Strengthen Network for Graph-Level Clustering","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.LG","authors_text":"Chengze Du, Guangzhen Yao, Huajie Lei, Mengfei Li, Renda Han, Wen Xin, Wenxin Zhang, Yahe Tian, Yu Li, Zeyu Zhang","submitted_at":"2025-04-02T11:17:15Z","abstract_excerpt":"Graph-level clustering is a fundamental task of data mining, aiming at dividing unlabeled graphs into distinct groups. However, existing deep methods that are limited by pooling have difficulty extracting diverse and complex graph structure features, while traditional graph kernel methods rely on exhaustive substructure search, unable to adaptive handle multi-relational data. This limitation hampers producing robust and representative graph-level embeddings. To address this issue, we propose a novel Multi-Relation Graph-Kernel Strengthen Network for Graph-Level Clustering (MGSN), which integra"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2504.01605","kind":"arxiv","version":1},"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/2504.01605/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":"2504.01605","created_at":"2026-07-05T10:43:17.971520+00:00"},{"alias_kind":"arxiv_version","alias_value":"2504.01605v1","created_at":"2026-07-05T10:43:17.971520+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2504.01605","created_at":"2026-07-05T10:43:17.971520+00:00"},{"alias_kind":"pith_short_12","alias_value":"UUAXYTTX2H7V","created_at":"2026-07-05T10:43:17.971520+00:00"},{"alias_kind":"pith_short_16","alias_value":"UUAXYTTX2H7VNHOZ","created_at":"2026-07-05T10:43:17.971520+00:00"},{"alias_kind":"pith_short_8","alias_value":"UUAXYTTX","created_at":"2026-07-05T10:43:17.971520+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/UUAXYTTX2H7VNHOZAKS5XZJQTF","json":"https://pith.science/pith/UUAXYTTX2H7VNHOZAKS5XZJQTF.json","graph_json":"https://pith.science/api/pith-number/UUAXYTTX2H7VNHOZAKS5XZJQTF/graph.json","events_json":"https://pith.science/api/pith-number/UUAXYTTX2H7VNHOZAKS5XZJQTF/events.json","paper":"https://pith.science/paper/UUAXYTTX"},"agent_actions":{"view_html":"https://pith.science/pith/UUAXYTTX2H7VNHOZAKS5XZJQTF","download_json":"https://pith.science/pith/UUAXYTTX2H7VNHOZAKS5XZJQTF.json","view_paper":"https://pith.science/paper/UUAXYTTX","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2504.01605&json=true","fetch_graph":"https://pith.science/api/pith-number/UUAXYTTX2H7VNHOZAKS5XZJQTF/graph.json","fetch_events":"https://pith.science/api/pith-number/UUAXYTTX2H7VNHOZAKS5XZJQTF/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/UUAXYTTX2H7VNHOZAKS5XZJQTF/action/timestamp_anchor","attest_storage":"https://pith.science/pith/UUAXYTTX2H7VNHOZAKS5XZJQTF/action/storage_attestation","attest_author":"https://pith.science/pith/UUAXYTTX2H7VNHOZAKS5XZJQTF/action/author_attestation","sign_citation":"https://pith.science/pith/UUAXYTTX2H7VNHOZAKS5XZJQTF/action/citation_signature","submit_replication":"https://pith.science/pith/UUAXYTTX2H7VNHOZAKS5XZJQTF/action/replication_record"}},"created_at":"2026-07-05T10:43:17.971520+00:00","updated_at":"2026-07-05T10:43:17.971520+00:00"}