{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2025:TXTYFOXORSMYYC76EWKLDH2TJQ","short_pith_number":"pith:TXTYFOXO","schema_version":"1.0","canonical_sha256":"9de782baee8c998c0bfe2594b19f534c3b7f564b5c50e5a8514ac62ce950a8ab","source":{"kind":"arxiv","id":"2502.10967","version":1},"attestation_state":"computed","paper":{"title":"Open-Set Cross-Network Node Classification via Unknown-Excluded Adversarial Graph Domain Alignment","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.SI","authors_text":"Laurence T. Yang, Shirui Pan, Shuang Zhou, Xiao Shen, Xi Zhou, Zhihao Chen","submitted_at":"2025-02-16T03:00:42Z","abstract_excerpt":"Existing cross-network node classification methods are mainly proposed for closed-set setting, where the source network and the target network share exactly the same label space. Such a setting is restricted in real-world applications, since the target network might contain additional classes that are not present in the source. In this work, we study a more realistic open-set cross-network node classification (O-CNNC) problem, where the target network contains all the known classes in the source and further contains several target-private classes unseen in the source. Borrowing the concept 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":"2502.10967","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SI","submitted_at":"2025-02-16T03:00:42Z","cross_cats_sorted":[],"title_canon_sha256":"5244f489516c4337715f9254b8309533d4cc58ac8e3330cf72e6da3da431476c","abstract_canon_sha256":"e61ef050a10306f24bb068f8709a7be47b258a9a92048c9cdf26f1adcf7ffb56"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T10:24:01.897590Z","signature_b64":"ZRSe2kOcByf+gMSX3YeoyE45SoOH2kGh+wLSH3NGbLZGOEOmyIrJqo4ivYAJF830OM/y+rQa5b5ClnfFYgpWBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"9de782baee8c998c0bfe2594b19f534c3b7f564b5c50e5a8514ac62ce950a8ab","last_reissued_at":"2026-07-05T10:24:01.896640Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T10:24:01.896640Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Open-Set Cross-Network Node Classification via Unknown-Excluded Adversarial Graph Domain Alignment","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.SI","authors_text":"Laurence T. Yang, Shirui Pan, Shuang Zhou, Xiao Shen, Xi Zhou, Zhihao Chen","submitted_at":"2025-02-16T03:00:42Z","abstract_excerpt":"Existing cross-network node classification methods are mainly proposed for closed-set setting, where the source network and the target network share exactly the same label space. Such a setting is restricted in real-world applications, since the target network might contain additional classes that are not present in the source. In this work, we study a more realistic open-set cross-network node classification (O-CNNC) problem, where the target network contains all the known classes in the source and further contains several target-private classes unseen in the source. Borrowing the concept fro"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2502.10967","kind":"arxiv","version":1},"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.10967/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.10967","created_at":"2026-07-05T10:24:01.896770+00:00"},{"alias_kind":"arxiv_version","alias_value":"2502.10967v1","created_at":"2026-07-05T10:24:01.896770+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2502.10967","created_at":"2026-07-05T10:24:01.896770+00:00"},{"alias_kind":"pith_short_12","alias_value":"TXTYFOXORSMY","created_at":"2026-07-05T10:24:01.896770+00:00"},{"alias_kind":"pith_short_16","alias_value":"TXTYFOXORSMYYC76","created_at":"2026-07-05T10:24:01.896770+00:00"},{"alias_kind":"pith_short_8","alias_value":"TXTYFOXO","created_at":"2026-07-05T10:24:01.896770+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/TXTYFOXORSMYYC76EWKLDH2TJQ","json":"https://pith.science/pith/TXTYFOXORSMYYC76EWKLDH2TJQ.json","graph_json":"https://pith.science/api/pith-number/TXTYFOXORSMYYC76EWKLDH2TJQ/graph.json","events_json":"https://pith.science/api/pith-number/TXTYFOXORSMYYC76EWKLDH2TJQ/events.json","paper":"https://pith.science/paper/TXTYFOXO"},"agent_actions":{"view_html":"https://pith.science/pith/TXTYFOXORSMYYC76EWKLDH2TJQ","download_json":"https://pith.science/pith/TXTYFOXORSMYYC76EWKLDH2TJQ.json","view_paper":"https://pith.science/paper/TXTYFOXO","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2502.10967&json=true","fetch_graph":"https://pith.science/api/pith-number/TXTYFOXORSMYYC76EWKLDH2TJQ/graph.json","fetch_events":"https://pith.science/api/pith-number/TXTYFOXORSMYYC76EWKLDH2TJQ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/TXTYFOXORSMYYC76EWKLDH2TJQ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/TXTYFOXORSMYYC76EWKLDH2TJQ/action/storage_attestation","attest_author":"https://pith.science/pith/TXTYFOXORSMYYC76EWKLDH2TJQ/action/author_attestation","sign_citation":"https://pith.science/pith/TXTYFOXORSMYYC76EWKLDH2TJQ/action/citation_signature","submit_replication":"https://pith.science/pith/TXTYFOXORSMYYC76EWKLDH2TJQ/action/replication_record"}},"created_at":"2026-07-05T10:24:01.896770+00:00","updated_at":"2026-07-05T10:24:01.896770+00:00"}