{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2023:YVRZQGNQIZVL6UELI7RMDIR353","short_pith_number":"pith:YVRZQGNQ","schema_version":"1.0","canonical_sha256":"c5639819b0466abf508b47e2c1a23beec0aab4006d4e120f71ee10902d727f5f","source":{"kind":"arxiv","id":"2309.10773","version":2},"attestation_state":"computed","paper":{"title":"Semi-supervised Domain Adaptation in Graph Transfer Learning","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.LG","authors_text":"Hao Dong, Hui Xiong, Meng Xiao, Xiao Luo, Yuanchun Zhou, Ziyue Qiao","submitted_at":"2023-09-19T17:20:58Z","abstract_excerpt":"As a specific case of graph transfer learning, unsupervised domain adaptation on graphs aims for knowledge transfer from label-rich source graphs to unlabeled target graphs. However, graphs with topology and attributes usually have considerable cross-domain disparity and there are numerous real-world scenarios where merely a subset of nodes are labeled in the source graph. This imposes critical challenges on graph transfer learning due to serious domain shifts and label scarcity. To address these challenges, we propose a method named Semi-supervised Graph Domain Adaptation (SGDA). To deal with"},"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":"2309.10773","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2023-09-19T17:20:58Z","cross_cats_sorted":[],"title_canon_sha256":"0b980acd7ffa61b867bca703e08ce5b8e8b1e1d913a748a3c5360f9d7944fe04","abstract_canon_sha256":"b47c537737107099363aa7d2f83f8563a19ac73e299b0811f8008f95e523bfc0"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T09:12:55.985554Z","signature_b64":"ojroOV0fglDsJ5ehSafzWp2kQlg26Qg0sg1KuT04UjA89fopmLoPk1YFXk/qVyPDGOEIejHnI+HPxImj/L5bAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"c5639819b0466abf508b47e2c1a23beec0aab4006d4e120f71ee10902d727f5f","last_reissued_at":"2026-07-05T09:12:55.985115Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T09:12:55.985115Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Semi-supervised Domain Adaptation in Graph Transfer Learning","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.LG","authors_text":"Hao Dong, Hui Xiong, Meng Xiao, Xiao Luo, Yuanchun Zhou, Ziyue Qiao","submitted_at":"2023-09-19T17:20:58Z","abstract_excerpt":"As a specific case of graph transfer learning, unsupervised domain adaptation on graphs aims for knowledge transfer from label-rich source graphs to unlabeled target graphs. However, graphs with topology and attributes usually have considerable cross-domain disparity and there are numerous real-world scenarios where merely a subset of nodes are labeled in the source graph. This imposes critical challenges on graph transfer learning due to serious domain shifts and label scarcity. To address these challenges, we propose a method named Semi-supervised Graph Domain Adaptation (SGDA). To deal with"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2309.10773","kind":"arxiv","version":2},"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/2309.10773/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":"2309.10773","created_at":"2026-07-05T09:12:55.985170+00:00"},{"alias_kind":"arxiv_version","alias_value":"2309.10773v2","created_at":"2026-07-05T09:12:55.985170+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2309.10773","created_at":"2026-07-05T09:12:55.985170+00:00"},{"alias_kind":"pith_short_12","alias_value":"YVRZQGNQIZVL","created_at":"2026-07-05T09:12:55.985170+00:00"},{"alias_kind":"pith_short_16","alias_value":"YVRZQGNQIZVL6UEL","created_at":"2026-07-05T09:12:55.985170+00:00"},{"alias_kind":"pith_short_8","alias_value":"YVRZQGNQ","created_at":"2026-07-05T09:12:55.985170+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2501.17443","citing_title":"Gradual Domain Adaptation for Graph Learning","ref_index":44,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/YVRZQGNQIZVL6UELI7RMDIR353","json":"https://pith.science/pith/YVRZQGNQIZVL6UELI7RMDIR353.json","graph_json":"https://pith.science/api/pith-number/YVRZQGNQIZVL6UELI7RMDIR353/graph.json","events_json":"https://pith.science/api/pith-number/YVRZQGNQIZVL6UELI7RMDIR353/events.json","paper":"https://pith.science/paper/YVRZQGNQ"},"agent_actions":{"view_html":"https://pith.science/pith/YVRZQGNQIZVL6UELI7RMDIR353","download_json":"https://pith.science/pith/YVRZQGNQIZVL6UELI7RMDIR353.json","view_paper":"https://pith.science/paper/YVRZQGNQ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2309.10773&json=true","fetch_graph":"https://pith.science/api/pith-number/YVRZQGNQIZVL6UELI7RMDIR353/graph.json","fetch_events":"https://pith.science/api/pith-number/YVRZQGNQIZVL6UELI7RMDIR353/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/YVRZQGNQIZVL6UELI7RMDIR353/action/timestamp_anchor","attest_storage":"https://pith.science/pith/YVRZQGNQIZVL6UELI7RMDIR353/action/storage_attestation","attest_author":"https://pith.science/pith/YVRZQGNQIZVL6UELI7RMDIR353/action/author_attestation","sign_citation":"https://pith.science/pith/YVRZQGNQIZVL6UELI7RMDIR353/action/citation_signature","submit_replication":"https://pith.science/pith/YVRZQGNQIZVL6UELI7RMDIR353/action/replication_record"}},"created_at":"2026-07-05T09:12:55.985170+00:00","updated_at":"2026-07-05T09:12:55.985170+00:00"}