{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2024:IERSPOHJ6PQJBQF5YVMA2ULTHS","short_pith_number":"pith:IERSPOHJ","schema_version":"1.0","canonical_sha256":"412327b8e9f3e090c0bdc5580d51733c8b345580f13fa6b5d61210c25d11ab28","source":{"kind":"arxiv","id":"2408.12071","version":1},"attestation_state":"computed","paper":{"title":"Multi-Task Curriculum Graph Contrastive Learning with Clustering Entropy Guidance","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.LG","authors_text":"Bocheng Wang, Chusheng Zeng, Jinghui Yuan, Mulin Chen, Rong Wang","submitted_at":"2024-08-22T02:18:47Z","abstract_excerpt":"Recent advances in unsupervised deep graph clustering have been significantly promoted by contrastive learning. Despite the strides, most graph contrastive learning models face challenges: 1) graph augmentation is used to improve learning diversity, but commonly used random augmentation methods may destroy inherent semantics and cause noise; 2) the fixed positive and negative sample selection strategy is limited to deal with complex real data, thereby impeding the model's capability to capture fine-grained patterns and relationships. To reduce these problems, we propose the Clustering-guided C"},"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":"2408.12071","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2024-08-22T02:18:47Z","cross_cats_sorted":[],"title_canon_sha256":"5f5d8a77f8fc400d6f5955db5af553f457224838b46a223f9c559d3c5c6e8ebd","abstract_canon_sha256":"b697e1a6310b6ef578456e1d608ac612191445275902f9cc5825667f7e0bc400"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T08:58:03.419767Z","signature_b64":"BvDuVJ1LM8hcxE2J3ZdIed8xzjUY+o95YA7oDTZ7iB64do086FpgkNjsA3KXhf4nj7T/VMSkLxBtxylk06IXCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"412327b8e9f3e090c0bdc5580d51733c8b345580f13fa6b5d61210c25d11ab28","last_reissued_at":"2026-07-05T08:58:03.419347Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T08:58:03.419347Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Multi-Task Curriculum Graph Contrastive Learning with Clustering Entropy Guidance","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.LG","authors_text":"Bocheng Wang, Chusheng Zeng, Jinghui Yuan, Mulin Chen, Rong Wang","submitted_at":"2024-08-22T02:18:47Z","abstract_excerpt":"Recent advances in unsupervised deep graph clustering have been significantly promoted by contrastive learning. Despite the strides, most graph contrastive learning models face challenges: 1) graph augmentation is used to improve learning diversity, but commonly used random augmentation methods may destroy inherent semantics and cause noise; 2) the fixed positive and negative sample selection strategy is limited to deal with complex real data, thereby impeding the model's capability to capture fine-grained patterns and relationships. To reduce these problems, we propose the Clustering-guided C"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2408.12071","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/2408.12071/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":"2408.12071","created_at":"2026-07-05T08:58:03.419410+00:00"},{"alias_kind":"arxiv_version","alias_value":"2408.12071v1","created_at":"2026-07-05T08:58:03.419410+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2408.12071","created_at":"2026-07-05T08:58:03.419410+00:00"},{"alias_kind":"pith_short_12","alias_value":"IERSPOHJ6PQJ","created_at":"2026-07-05T08:58:03.419410+00:00"},{"alias_kind":"pith_short_16","alias_value":"IERSPOHJ6PQJBQF5","created_at":"2026-07-05T08:58:03.419410+00:00"},{"alias_kind":"pith_short_8","alias_value":"IERSPOHJ","created_at":"2026-07-05T08:58:03.419410+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2508.11476","citing_title":"SPG: Style-Prompting Guidance for Style-Specific Content Creation","ref_index":39,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/IERSPOHJ6PQJBQF5YVMA2ULTHS","json":"https://pith.science/pith/IERSPOHJ6PQJBQF5YVMA2ULTHS.json","graph_json":"https://pith.science/api/pith-number/IERSPOHJ6PQJBQF5YVMA2ULTHS/graph.json","events_json":"https://pith.science/api/pith-number/IERSPOHJ6PQJBQF5YVMA2ULTHS/events.json","paper":"https://pith.science/paper/IERSPOHJ"},"agent_actions":{"view_html":"https://pith.science/pith/IERSPOHJ6PQJBQF5YVMA2ULTHS","download_json":"https://pith.science/pith/IERSPOHJ6PQJBQF5YVMA2ULTHS.json","view_paper":"https://pith.science/paper/IERSPOHJ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2408.12071&json=true","fetch_graph":"https://pith.science/api/pith-number/IERSPOHJ6PQJBQF5YVMA2ULTHS/graph.json","fetch_events":"https://pith.science/api/pith-number/IERSPOHJ6PQJBQF5YVMA2ULTHS/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/IERSPOHJ6PQJBQF5YVMA2ULTHS/action/timestamp_anchor","attest_storage":"https://pith.science/pith/IERSPOHJ6PQJBQF5YVMA2ULTHS/action/storage_attestation","attest_author":"https://pith.science/pith/IERSPOHJ6PQJBQF5YVMA2ULTHS/action/author_attestation","sign_citation":"https://pith.science/pith/IERSPOHJ6PQJBQF5YVMA2ULTHS/action/citation_signature","submit_replication":"https://pith.science/pith/IERSPOHJ6PQJBQF5YVMA2ULTHS/action/replication_record"}},"created_at":"2026-07-05T08:58:03.419410+00:00","updated_at":"2026-07-05T08:58:03.419410+00:00"}