{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2022:BQEANXBHSIIDQTZALVFUYDOVXN","short_pith_number":"pith:BQEANXBH","canonical_record":{"source":{"id":"2205.07865","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2022-05-11T06:45:19Z","cross_cats_sorted":["cs.AI"],"title_canon_sha256":"f05c1510390bbbb6701518d236757529b5514edc2d18a24d25965809ca135f55","abstract_canon_sha256":"5bfe0f2306f74f477f2388158a954974f5a662cd9133f88472d9caf1d4df122c"},"schema_version":"1.0"},"canonical_sha256":"0c0806dc279210384f205d4b4c0dd5bb5618e3bf83b8a80482c928281e38ab3d","source":{"kind":"arxiv","id":"2205.07865","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2205.07865","created_at":"2026-07-05T04:34:53Z"},{"alias_kind":"arxiv_version","alias_value":"2205.07865v3","created_at":"2026-07-05T04:34:53Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2205.07865","created_at":"2026-07-05T04:34:53Z"},{"alias_kind":"pith_short_12","alias_value":"BQEANXBHSIID","created_at":"2026-07-05T04:34:53Z"},{"alias_kind":"pith_short_16","alias_value":"BQEANXBHSIIDQTZA","created_at":"2026-07-05T04:34:53Z"},{"alias_kind":"pith_short_8","alias_value":"BQEANXBH","created_at":"2026-07-05T04:34:53Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2022:BQEANXBHSIIDQTZALVFUYDOVXN","target":"record","payload":{"canonical_record":{"source":{"id":"2205.07865","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2022-05-11T06:45:19Z","cross_cats_sorted":["cs.AI"],"title_canon_sha256":"f05c1510390bbbb6701518d236757529b5514edc2d18a24d25965809ca135f55","abstract_canon_sha256":"5bfe0f2306f74f477f2388158a954974f5a662cd9133f88472d9caf1d4df122c"},"schema_version":"1.0"},"canonical_sha256":"0c0806dc279210384f205d4b4c0dd5bb5618e3bf83b8a80482c928281e38ab3d","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T04:34:53.749301Z","signature_b64":"3gVD3lvkC8o2Ndj+4xJdcy+z718e933pSQZ6SRN96ui27HIcog1KIgYOYvYPx3qc5PJqhUONGG88IeveLukGBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"0c0806dc279210384f205d4b4c0dd5bb5618e3bf83b8a80482c928281e38ab3d","last_reissued_at":"2026-07-05T04:34:53.748946Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T04:34:53.748946Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2205.07865","source_version":3,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-07-05T04:34:53Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"FjDIHu+Hfdh+0urqhlxvrfJh9YXcEUkLUQYFVgS9H0DCbcGGdZc5HohNdvqGX2t+1j0jyipnszsGBDmD08otBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-13T03:27:37.136171Z"},"content_sha256":"a15c202672ce7a7eff633d078e4e499f6255f59df11c2930ec729395de3698e2","schema_version":"1.0","event_id":"sha256:a15c202672ce7a7eff633d078e4e499f6255f59df11c2930ec729395de3698e2"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2022:BQEANXBHSIIDQTZALVFUYDOVXN","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Simple Contrastive Graph Clustering","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI"],"primary_cat":"cs.LG","authors_text":"Sihang Zhou, Xihong Yang, Xinwang Liu, Yue Liu","submitted_at":"2022-05-11T06:45:19Z","abstract_excerpt":"Contrastive learning has recently attracted plenty of attention in deep graph clustering for its promising performance. However, complicated data augmentations and time-consuming graph convolutional operation undermine the efficiency of these methods. To solve this problem, we propose a Simple Contrastive Graph Clustering (SCGC) algorithm to improve the existing methods from the perspectives of network architecture, data augmentation, and objective function. As to the architecture, our network includes two main parts, i.e., pre-processing and network backbone. A simple low-pass denoising opera"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2205.07865","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2205.07865/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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-07-05T04:34:53Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"PzSL8hcOUigSmqbG6PUxtfcQpWgKeeAGQUXWKz0mAd8mQjFUsMLR8LDTJ0BfUUfJFtZZKBfwMUzmpHtBSyQMAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-13T03:27:37.136554Z"},"content_sha256":"c85c20e744575aad64eb32017d5f6966911b99e8e702eccd02a4f0309767aab6","schema_version":"1.0","event_id":"sha256:c85c20e744575aad64eb32017d5f6966911b99e8e702eccd02a4f0309767aab6"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/BQEANXBHSIIDQTZALVFUYDOVXN/bundle.json","state_url":"https://pith.science/pith/BQEANXBHSIIDQTZALVFUYDOVXN/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/BQEANXBHSIIDQTZALVFUYDOVXN/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-08-13T03:27:37Z","links":{"resolver":"https://pith.science/pith/BQEANXBHSIIDQTZALVFUYDOVXN","bundle":"https://pith.science/pith/BQEANXBHSIIDQTZALVFUYDOVXN/bundle.json","state":"https://pith.science/pith/BQEANXBHSIIDQTZALVFUYDOVXN/state.json","well_known_bundle":"https://pith.science/.well-known/pith/BQEANXBHSIIDQTZALVFUYDOVXN/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2022:BQEANXBHSIIDQTZALVFUYDOVXN","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"5bfe0f2306f74f477f2388158a954974f5a662cd9133f88472d9caf1d4df122c","cross_cats_sorted":["cs.AI"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2022-05-11T06:45:19Z","title_canon_sha256":"f05c1510390bbbb6701518d236757529b5514edc2d18a24d25965809ca135f55"},"schema_version":"1.0","source":{"id":"2205.07865","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2205.07865","created_at":"2026-07-05T04:34:53Z"},{"alias_kind":"arxiv_version","alias_value":"2205.07865v3","created_at":"2026-07-05T04:34:53Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2205.07865","created_at":"2026-07-05T04:34:53Z"},{"alias_kind":"pith_short_12","alias_value":"BQEANXBHSIID","created_at":"2026-07-05T04:34:53Z"},{"alias_kind":"pith_short_16","alias_value":"BQEANXBHSIIDQTZA","created_at":"2026-07-05T04:34:53Z"},{"alias_kind":"pith_short_8","alias_value":"BQEANXBH","created_at":"2026-07-05T04:34:53Z"}],"graph_snapshots":[{"event_id":"sha256:c85c20e744575aad64eb32017d5f6966911b99e8e702eccd02a4f0309767aab6","target":"graph","created_at":"2026-07-05T04:34:53Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2205.07865/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Contrastive learning has recently attracted plenty of attention in deep graph clustering for its promising performance. However, complicated data augmentations and time-consuming graph convolutional operation undermine the efficiency of these methods. To solve this problem, we propose a Simple Contrastive Graph Clustering (SCGC) algorithm to improve the existing methods from the perspectives of network architecture, data augmentation, and objective function. As to the architecture, our network includes two main parts, i.e., pre-processing and network backbone. A simple low-pass denoising opera","authors_text":"Sihang Zhou, Xihong Yang, Xinwang Liu, Yue Liu","cross_cats":["cs.AI"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2022-05-11T06:45:19Z","title":"Simple Contrastive Graph Clustering"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2205.07865","kind":"arxiv","version":3},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:a15c202672ce7a7eff633d078e4e499f6255f59df11c2930ec729395de3698e2","target":"record","created_at":"2026-07-05T04:34:53Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"5bfe0f2306f74f477f2388158a954974f5a662cd9133f88472d9caf1d4df122c","cross_cats_sorted":["cs.AI"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2022-05-11T06:45:19Z","title_canon_sha256":"f05c1510390bbbb6701518d236757529b5514edc2d18a24d25965809ca135f55"},"schema_version":"1.0","source":{"id":"2205.07865","kind":"arxiv","version":3}},"canonical_sha256":"0c0806dc279210384f205d4b4c0dd5bb5618e3bf83b8a80482c928281e38ab3d","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"0c0806dc279210384f205d4b4c0dd5bb5618e3bf83b8a80482c928281e38ab3d","first_computed_at":"2026-07-05T04:34:53.748946Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T04:34:53.748946Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"3gVD3lvkC8o2Ndj+4xJdcy+z718e933pSQZ6SRN96ui27HIcog1KIgYOYvYPx3qc5PJqhUONGG88IeveLukGBQ==","signature_status":"signed_v1","signed_at":"2026-07-05T04:34:53.749301Z","signed_message":"canonical_sha256_bytes"},"source_id":"2205.07865","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:a15c202672ce7a7eff633d078e4e499f6255f59df11c2930ec729395de3698e2","sha256:c85c20e744575aad64eb32017d5f6966911b99e8e702eccd02a4f0309767aab6"],"state_sha256":"0511fc017e44a5118c9b401064a5403f8901624cac40c8932bce9988df1c35bd"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"oGgkJzKIuR32IXUYohIvAzNyXMPUqPqGObihpOXjHIuC6k48BrDBUQHPaviXgfkjIwmxxBQ0MnBWbcBmmDaLCA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-13T03:27:37.138841Z","bundle_sha256":"c9bc505e3db8179ec63f49bbfa9cec534a9eb9f234dee2806f083eeca43c165d"}}