{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2023:KS7HGBNUTFLXF7M3X5RDTLBKIR","short_pith_number":"pith:KS7HGBNU","schema_version":"1.0","canonical_sha256":"54be7305b4995772fd9bbf6239ac2a4473ef38f0adeb8255f430fee92024a957","source":{"kind":"arxiv","id":"2306.04979","version":4},"attestation_state":"computed","paper":{"title":"CoCo: A Coupled Contrastive Framework for Unsupervised Domain Adaptive Graph Classification","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.AI"],"primary_cat":"cs.LG","authors_text":"Chong Chen, Li Shen, Long Lan, Mengzhu Wang, Nan Yin, Xian-Sheng Hua, Xiao Luo, Zeyu Ma","submitted_at":"2023-06-08T07:10:35Z","abstract_excerpt":"Although graph neural networks (GNNs) have achieved impressive achievements in graph classification, they often need abundant task-specific labels, which could be extensively costly to acquire. A credible solution is to explore additional labeled graphs to enhance unsupervised learning on the target domain. However, how to apply GNNs to domain adaptation remains unsolved owing to the insufficient exploration of graph topology and the significant domain discrepancy. In this paper, we propose Coupled Contrastive Graph Representation Learning (CoCo), which extracts the topological information fro"},"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":"2306.04979","kind":"arxiv","version":4},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2023-06-08T07:10:35Z","cross_cats_sorted":["cs.AI"],"title_canon_sha256":"646ace1916911fabb2439b1d96bd27ac1f387c96467abd361b4bdb2d92087487","abstract_canon_sha256":"be2cbb4302fec76ace3e3d6702f56314df7b6aca5b5b2263cab7a6c89ee2c877"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T11:35:47.719508Z","signature_b64":"O+BWb20TRW+3BkyEHKfOmWnza7XM0qDKlKYKkg64RTmjC/f+pFm0ud7mlbIQOFYq65bVvNLjvEiuXvTa0L7rCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"54be7305b4995772fd9bbf6239ac2a4473ef38f0adeb8255f430fee92024a957","last_reissued_at":"2026-07-05T11:35:47.718960Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T11:35:47.718960Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"CoCo: A Coupled Contrastive Framework for Unsupervised Domain Adaptive Graph Classification","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.AI"],"primary_cat":"cs.LG","authors_text":"Chong Chen, Li Shen, Long Lan, Mengzhu Wang, Nan Yin, Xian-Sheng Hua, Xiao Luo, Zeyu Ma","submitted_at":"2023-06-08T07:10:35Z","abstract_excerpt":"Although graph neural networks (GNNs) have achieved impressive achievements in graph classification, they often need abundant task-specific labels, which could be extensively costly to acquire. A credible solution is to explore additional labeled graphs to enhance unsupervised learning on the target domain. However, how to apply GNNs to domain adaptation remains unsolved owing to the insufficient exploration of graph topology and the significant domain discrepancy. In this paper, we propose Coupled Contrastive Graph Representation Learning (CoCo), which extracts the topological information fro"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2306.04979","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/2306.04979/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":"2306.04979","created_at":"2026-07-05T11:35:47.719039+00:00"},{"alias_kind":"arxiv_version","alias_value":"2306.04979v4","created_at":"2026-07-05T11:35:47.719039+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2306.04979","created_at":"2026-07-05T11:35:47.719039+00:00"},{"alias_kind":"pith_short_12","alias_value":"KS7HGBNUTFLX","created_at":"2026-07-05T11:35:47.719039+00:00"},{"alias_kind":"pith_short_16","alias_value":"KS7HGBNUTFLXF7M3","created_at":"2026-07-05T11:35:47.719039+00:00"},{"alias_kind":"pith_short_8","alias_value":"KS7HGBNU","created_at":"2026-07-05T11:35:47.719039+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2507.07621","citing_title":"Sparse Causal Discovery with Generative Intervention for Unsupervised Graph Domain Adaptation","ref_index":68,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/KS7HGBNUTFLXF7M3X5RDTLBKIR","json":"https://pith.science/pith/KS7HGBNUTFLXF7M3X5RDTLBKIR.json","graph_json":"https://pith.science/api/pith-number/KS7HGBNUTFLXF7M3X5RDTLBKIR/graph.json","events_json":"https://pith.science/api/pith-number/KS7HGBNUTFLXF7M3X5RDTLBKIR/events.json","paper":"https://pith.science/paper/KS7HGBNU"},"agent_actions":{"view_html":"https://pith.science/pith/KS7HGBNUTFLXF7M3X5RDTLBKIR","download_json":"https://pith.science/pith/KS7HGBNUTFLXF7M3X5RDTLBKIR.json","view_paper":"https://pith.science/paper/KS7HGBNU","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2306.04979&json=true","fetch_graph":"https://pith.science/api/pith-number/KS7HGBNUTFLXF7M3X5RDTLBKIR/graph.json","fetch_events":"https://pith.science/api/pith-number/KS7HGBNUTFLXF7M3X5RDTLBKIR/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/KS7HGBNUTFLXF7M3X5RDTLBKIR/action/timestamp_anchor","attest_storage":"https://pith.science/pith/KS7HGBNUTFLXF7M3X5RDTLBKIR/action/storage_attestation","attest_author":"https://pith.science/pith/KS7HGBNUTFLXF7M3X5RDTLBKIR/action/author_attestation","sign_citation":"https://pith.science/pith/KS7HGBNUTFLXF7M3X5RDTLBKIR/action/citation_signature","submit_replication":"https://pith.science/pith/KS7HGBNUTFLXF7M3X5RDTLBKIR/action/replication_record"}},"created_at":"2026-07-05T11:35:47.719039+00:00","updated_at":"2026-07-05T11:35:47.719039+00:00"}