{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2025:IMRUATK2X55T7US4JZS3WNROKA","short_pith_number":"pith:IMRUATK2","schema_version":"1.0","canonical_sha256":"4323404d5abf7b3fd25c4e65bb362e503f60fabd960a3935e64a87ac972af2fc","source":{"kind":"arxiv","id":"2501.17443","version":4},"attestation_state":"computed","paper":{"title":"Gradual Domain Adaptation for Graph Learning","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.LG","authors_text":"Pui Ieng Lei, Qiang Yang, Ximing Chen, Yanyan Liu, Yijun Sheng, Zhiguo Gong","submitted_at":"2025-01-29T06:48:59Z","abstract_excerpt":"Existing machine learning literature lacks graph-based domain adaptation techniques capable of handling large distribution shifts, primarily due to the difficulty in simulating a coherent evolutionary path from source to target graph. To meet this challenge, we present a graph gradual domain adaptation (GGDA) framework, which constructs a compact domain sequence that minimizes information loss during adaptation. Our approach starts with an efficient generation of knowledge-preserving intermediate graphs over the Fused Gromov-Wasserstein (FGW) metric. A GGDA domain sequence is then constructed "},"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":"2501.17443","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2025-01-29T06:48:59Z","cross_cats_sorted":[],"title_canon_sha256":"eb514b23c8cc8fb34b2bd8885b0aac1cce204be1dd3b3045c07bbc107edaa14e","abstract_canon_sha256":"902bf98847f18f2c043852c07d47972b25ce2516d60f89beec95fead46c166bf"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:09:46.168914Z","signature_b64":"pOWGbkookqntqaLY/MFcHYCO9jzeqJvOxjUdu89bWzbgCgTb6+bVw/nBbtAXJQpp3Jg9rb7bUwBL+htVMkIOBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"4323404d5abf7b3fd25c4e65bb362e503f60fabd960a3935e64a87ac972af2fc","last_reissued_at":"2026-05-18T03:09:46.167955Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:09:46.167955Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Gradual Domain Adaptation for Graph Learning","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.LG","authors_text":"Pui Ieng Lei, Qiang Yang, Ximing Chen, Yanyan Liu, Yijun Sheng, Zhiguo Gong","submitted_at":"2025-01-29T06:48:59Z","abstract_excerpt":"Existing machine learning literature lacks graph-based domain adaptation techniques capable of handling large distribution shifts, primarily due to the difficulty in simulating a coherent evolutionary path from source to target graph. To meet this challenge, we present a graph gradual domain adaptation (GGDA) framework, which constructs a compact domain sequence that minimizes information loss during adaptation. Our approach starts with an efficient generation of knowledge-preserving intermediate graphs over the Fused Gromov-Wasserstein (FGW) metric. A GGDA domain sequence is then constructed "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2501.17443","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":""},"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":"2501.17443","created_at":"2026-05-18T03:09:46.168094+00:00"},{"alias_kind":"arxiv_version","alias_value":"2501.17443v4","created_at":"2026-05-18T03:09:46.168094+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2501.17443","created_at":"2026-05-18T03:09:46.168094+00:00"},{"alias_kind":"pith_short_12","alias_value":"IMRUATK2X55T","created_at":"2026-05-18T12:33:37.589309+00:00"},{"alias_kind":"pith_short_16","alias_value":"IMRUATK2X55T7US4","created_at":"2026-05-18T12:33:37.589309+00:00"},{"alias_kind":"pith_short_8","alias_value":"IMRUATK2","created_at":"2026-05-18T12:33:37.589309+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/IMRUATK2X55T7US4JZS3WNROKA","json":"https://pith.science/pith/IMRUATK2X55T7US4JZS3WNROKA.json","graph_json":"https://pith.science/api/pith-number/IMRUATK2X55T7US4JZS3WNROKA/graph.json","events_json":"https://pith.science/api/pith-number/IMRUATK2X55T7US4JZS3WNROKA/events.json","paper":"https://pith.science/paper/IMRUATK2"},"agent_actions":{"view_html":"https://pith.science/pith/IMRUATK2X55T7US4JZS3WNROKA","download_json":"https://pith.science/pith/IMRUATK2X55T7US4JZS3WNROKA.json","view_paper":"https://pith.science/paper/IMRUATK2","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2501.17443&json=true","fetch_graph":"https://pith.science/api/pith-number/IMRUATK2X55T7US4JZS3WNROKA/graph.json","fetch_events":"https://pith.science/api/pith-number/IMRUATK2X55T7US4JZS3WNROKA/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/IMRUATK2X55T7US4JZS3WNROKA/action/timestamp_anchor","attest_storage":"https://pith.science/pith/IMRUATK2X55T7US4JZS3WNROKA/action/storage_attestation","attest_author":"https://pith.science/pith/IMRUATK2X55T7US4JZS3WNROKA/action/author_attestation","sign_citation":"https://pith.science/pith/IMRUATK2X55T7US4JZS3WNROKA/action/citation_signature","submit_replication":"https://pith.science/pith/IMRUATK2X55T7US4JZS3WNROKA/action/replication_record"}},"created_at":"2026-05-18T03:09:46.168094+00:00","updated_at":"2026-05-18T03:09:46.168094+00:00"}