{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2024:NQMUFC2EP5LIGFPQMDXNBNWG25","short_pith_number":"pith:NQMUFC2E","schema_version":"1.0","canonical_sha256":"6c19428b447f568315f060eed0b6c6d77d590d511221d68f076770f4d9a89b56","source":{"kind":"arxiv","id":"2403.01092","version":2},"attestation_state":"computed","paper":{"title":"Pairwise Alignment Improves Graph Domain Adaptation","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.LG","authors_text":"Deyu Zou, Han Zhao, Pan Li, Shikun Liu","submitted_at":"2024-03-02T04:31:28Z","abstract_excerpt":"Graph-based methods, pivotal for label inference over interconnected objects in many real-world applications, often encounter generalization challenges, if the graph used for model training differs significantly from the graph used for testing. This work delves into Graph Domain Adaptation (GDA) to address the unique complexities of distribution shifts over graph data, where interconnected data points experience shifts in features, labels, and in particular, connecting patterns. We propose a novel, theoretically principled method, Pairwise Alignment (Pair-Align) to counter graph structure shif"},"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":"2403.01092","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2024-03-02T04:31:28Z","cross_cats_sorted":[],"title_canon_sha256":"c520c566aaa6196f7c5bfc1b21f0cf32f520c4588f723414cee81448af90fe25","abstract_canon_sha256":"3e55bd958cb2061de7b21ecf5fa976a05f46df43c44215ae2f8950d392c84d9d"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T08:27:25.220840Z","signature_b64":"mJsZsWJY0LQzokIHx+rvBGmhhW4IeDtYAzozD4gVihv2rdCuNcRXNhn1eAwUxGDj2o1fdWin/ltEtCbvFYbKBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"6c19428b447f568315f060eed0b6c6d77d590d511221d68f076770f4d9a89b56","last_reissued_at":"2026-07-05T08:27:25.220425Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T08:27:25.220425Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Pairwise Alignment Improves Graph Domain Adaptation","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.LG","authors_text":"Deyu Zou, Han Zhao, Pan Li, Shikun Liu","submitted_at":"2024-03-02T04:31:28Z","abstract_excerpt":"Graph-based methods, pivotal for label inference over interconnected objects in many real-world applications, often encounter generalization challenges, if the graph used for model training differs significantly from the graph used for testing. This work delves into Graph Domain Adaptation (GDA) to address the unique complexities of distribution shifts over graph data, where interconnected data points experience shifts in features, labels, and in particular, connecting patterns. We propose a novel, theoretically principled method, Pairwise Alignment (Pair-Align) to counter graph structure shif"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2403.01092","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/2403.01092/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":"2403.01092","created_at":"2026-07-05T08:27:25.220481+00:00"},{"alias_kind":"arxiv_version","alias_value":"2403.01092v2","created_at":"2026-07-05T08:27:25.220481+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2403.01092","created_at":"2026-07-05T08:27:25.220481+00:00"},{"alias_kind":"pith_short_12","alias_value":"NQMUFC2EP5LI","created_at":"2026-07-05T08:27:25.220481+00:00"},{"alias_kind":"pith_short_16","alias_value":"NQMUFC2EP5LIGFPQ","created_at":"2026-07-05T08:27:25.220481+00:00"},{"alias_kind":"pith_short_8","alias_value":"NQMUFC2E","created_at":"2026-07-05T08:27:25.220481+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":2,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2501.17443","citing_title":"Gradual Domain Adaptation for Graph Learning","ref_index":34,"is_internal_anchor":false},{"citing_arxiv_id":"2604.10882","citing_title":"DIB-OD: Preserving the Invariant Core for Robust Heterogeneous Graph Adaptation via Decoupled Information Bottleneck and Online Distillation","ref_index":12,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/NQMUFC2EP5LIGFPQMDXNBNWG25","json":"https://pith.science/pith/NQMUFC2EP5LIGFPQMDXNBNWG25.json","graph_json":"https://pith.science/api/pith-number/NQMUFC2EP5LIGFPQMDXNBNWG25/graph.json","events_json":"https://pith.science/api/pith-number/NQMUFC2EP5LIGFPQMDXNBNWG25/events.json","paper":"https://pith.science/paper/NQMUFC2E"},"agent_actions":{"view_html":"https://pith.science/pith/NQMUFC2EP5LIGFPQMDXNBNWG25","download_json":"https://pith.science/pith/NQMUFC2EP5LIGFPQMDXNBNWG25.json","view_paper":"https://pith.science/paper/NQMUFC2E","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2403.01092&json=true","fetch_graph":"https://pith.science/api/pith-number/NQMUFC2EP5LIGFPQMDXNBNWG25/graph.json","fetch_events":"https://pith.science/api/pith-number/NQMUFC2EP5LIGFPQMDXNBNWG25/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/NQMUFC2EP5LIGFPQMDXNBNWG25/action/timestamp_anchor","attest_storage":"https://pith.science/pith/NQMUFC2EP5LIGFPQMDXNBNWG25/action/storage_attestation","attest_author":"https://pith.science/pith/NQMUFC2EP5LIGFPQMDXNBNWG25/action/author_attestation","sign_citation":"https://pith.science/pith/NQMUFC2EP5LIGFPQMDXNBNWG25/action/citation_signature","submit_replication":"https://pith.science/pith/NQMUFC2EP5LIGFPQMDXNBNWG25/action/replication_record"}},"created_at":"2026-07-05T08:27:25.220481+00:00","updated_at":"2026-07-05T08:27:25.220481+00:00"}