{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2025:U3UOZHKTQKDCO4PMZPT74PVFLE","short_pith_number":"pith:U3UOZHKT","schema_version":"1.0","canonical_sha256":"a6e8ec9d5382862771eccbe7fe3ea559256466db6340fa041781bf506032a1e5","source":{"kind":"arxiv","id":"2502.06808","version":3},"attestation_state":"computed","paper":{"title":"On the Benefits of Attribute-Driven Graph Domain Adaptation","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.AI"],"primary_cat":"cs.LG","authors_text":"Bingheng Li, Boyu Wang, Charles Ling, Nima Hosseini Dashtbayaz, Qiuhao Zeng, Ruiyi Fang, Ruizhi Pu, Zhao Kang","submitted_at":"2025-02-04T03:04:04Z","abstract_excerpt":"Graph Domain Adaptation (GDA) addresses a pressing challenge in cross-network learning, particularly pertinent due to the absence of labeled data in real-world graph datasets. Recent studies attempted to learn domain invariant representations by eliminating structural shifts between graphs. In this work, we show that existing methodologies have overlooked the significance of the graph node attribute, a pivotal factor for graph domain alignment. Specifically, we first reveal the impact of node attributes for GDA by theoretically proving that in addition to the graph structural divergence betwee"},"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":"2502.06808","kind":"arxiv","version":3},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2025-02-04T03:04:04Z","cross_cats_sorted":["cs.AI"],"title_canon_sha256":"b2e9131be28a3f6b668be3e1dea135a1ed9adbf91c6d6ce2b03d23f3dfaa99ea","abstract_canon_sha256":"b8848e1ee3f46584701af51afd4c1d17c13f9fdbfe4d32b4e10a12c82fe56630"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T10:19:10.555145Z","signature_b64":"ahTyuXhHDbluDNEAroY14SVZoVmW6/ysZ0DDEym8NtGkbkU/fmwFsnWNdoMgjYzRRmr2096QhqOB0g44EqZCBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"a6e8ec9d5382862771eccbe7fe3ea559256466db6340fa041781bf506032a1e5","last_reissued_at":"2026-07-05T10:19:10.554639Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T10:19:10.554639Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"On the Benefits of Attribute-Driven Graph Domain Adaptation","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.AI"],"primary_cat":"cs.LG","authors_text":"Bingheng Li, Boyu Wang, Charles Ling, Nima Hosseini Dashtbayaz, Qiuhao Zeng, Ruiyi Fang, Ruizhi Pu, Zhao Kang","submitted_at":"2025-02-04T03:04:04Z","abstract_excerpt":"Graph Domain Adaptation (GDA) addresses a pressing challenge in cross-network learning, particularly pertinent due to the absence of labeled data in real-world graph datasets. Recent studies attempted to learn domain invariant representations by eliminating structural shifts between graphs. In this work, we show that existing methodologies have overlooked the significance of the graph node attribute, a pivotal factor for graph domain alignment. Specifically, we first reveal the impact of node attributes for GDA by theoretically proving that in addition to the graph structural divergence betwee"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2502.06808","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/2502.06808/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":"2502.06808","created_at":"2026-07-05T10:19:10.554690+00:00"},{"alias_kind":"arxiv_version","alias_value":"2502.06808v3","created_at":"2026-07-05T10:19:10.554690+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2502.06808","created_at":"2026-07-05T10:19:10.554690+00:00"},{"alias_kind":"pith_short_12","alias_value":"U3UOZHKTQKDC","created_at":"2026-07-05T10:19:10.554690+00:00"},{"alias_kind":"pith_short_16","alias_value":"U3UOZHKTQKDCO4PM","created_at":"2026-07-05T10:19:10.554690+00:00"},{"alias_kind":"pith_short_8","alias_value":"U3UOZHKT","created_at":"2026-07-05T10:19:10.554690+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":2,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2602.00656","citing_title":"DisRFM: Polar Riemannian Flow Matching for Structure-Preserving Graph Domain Adaptation","ref_index":5,"is_internal_anchor":false},{"citing_arxiv_id":"2604.03154","citing_title":"DSBD: Dual-Aligned Structural Basis Distillation for Graph Domain Adaptation","ref_index":11,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/U3UOZHKTQKDCO4PMZPT74PVFLE","json":"https://pith.science/pith/U3UOZHKTQKDCO4PMZPT74PVFLE.json","graph_json":"https://pith.science/api/pith-number/U3UOZHKTQKDCO4PMZPT74PVFLE/graph.json","events_json":"https://pith.science/api/pith-number/U3UOZHKTQKDCO4PMZPT74PVFLE/events.json","paper":"https://pith.science/paper/U3UOZHKT"},"agent_actions":{"view_html":"https://pith.science/pith/U3UOZHKTQKDCO4PMZPT74PVFLE","download_json":"https://pith.science/pith/U3UOZHKTQKDCO4PMZPT74PVFLE.json","view_paper":"https://pith.science/paper/U3UOZHKT","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2502.06808&json=true","fetch_graph":"https://pith.science/api/pith-number/U3UOZHKTQKDCO4PMZPT74PVFLE/graph.json","fetch_events":"https://pith.science/api/pith-number/U3UOZHKTQKDCO4PMZPT74PVFLE/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/U3UOZHKTQKDCO4PMZPT74PVFLE/action/timestamp_anchor","attest_storage":"https://pith.science/pith/U3UOZHKTQKDCO4PMZPT74PVFLE/action/storage_attestation","attest_author":"https://pith.science/pith/U3UOZHKTQKDCO4PMZPT74PVFLE/action/author_attestation","sign_citation":"https://pith.science/pith/U3UOZHKTQKDCO4PMZPT74PVFLE/action/citation_signature","submit_replication":"https://pith.science/pith/U3UOZHKTQKDCO4PMZPT74PVFLE/action/replication_record"}},"created_at":"2026-07-05T10:19:10.554690+00:00","updated_at":"2026-07-05T10:19:10.554690+00:00"}