{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2019:BPRUXZ7ALLUXAC64UXO5ICADTF","short_pith_number":"pith:BPRUXZ7A","schema_version":"1.0","canonical_sha256":"0be34be7e05ae9700bdca5ddd408039959eb26ffdf2de348febf524d48eb176b","source":{"kind":"arxiv","id":"1906.00684","version":2},"attestation_state":"computed","paper":{"title":"DANE: Domain Adaptive Network Embedding","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.SI","stat.ML"],"primary_cat":"cs.LG","authors_text":"Guojie Song, Lun Du, Shuwen Yang, Yilun Jin, Yizhou Zhang","submitted_at":"2019-06-03T10:11:15Z","abstract_excerpt":"Recent works reveal that network embedding techniques enable many machine learning models to handle diverse downstream tasks on graph structured data. However, as previous methods usually focus on learning embeddings for a single network, they can not learn representations transferable on multiple networks. Hence, it is important to design a network embedding algorithm that supports downstream model transferring on different networks, known as domain adaptation. In this paper, we propose a novel Domain Adaptive Network Embedding framework, which applies graph convolutional network to learn tra"},"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":"1906.00684","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2019-06-03T10:11:15Z","cross_cats_sorted":["cs.SI","stat.ML"],"title_canon_sha256":"f447fac57da0f70352e6fe1a52e085ffcd4733c67df65e0a50b1475f80cef7e0","abstract_canon_sha256":"b6802086062c0a1242a957d54d87568c0afb60a787fdc42305799bb1b2ba4378"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-04T23:58:27.152604Z","signature_b64":"bVzH1YDbdtnU4p1UviUPdhzRB9/wWUenbEh2d6Pvsa/koeqRDqo0xUfsDMXKxDO1+y2tc6r4YhQl4pwVNak+DQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"0be34be7e05ae9700bdca5ddd408039959eb26ffdf2de348febf524d48eb176b","last_reissued_at":"2026-07-04T23:58:27.152143Z","signature_status":"signed_v1","first_computed_at":"2026-07-04T23:58:27.152143Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"DANE: Domain Adaptive Network Embedding","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.SI","stat.ML"],"primary_cat":"cs.LG","authors_text":"Guojie Song, Lun Du, Shuwen Yang, Yilun Jin, Yizhou Zhang","submitted_at":"2019-06-03T10:11:15Z","abstract_excerpt":"Recent works reveal that network embedding techniques enable many machine learning models to handle diverse downstream tasks on graph structured data. However, as previous methods usually focus on learning embeddings for a single network, they can not learn representations transferable on multiple networks. Hence, it is important to design a network embedding algorithm that supports downstream model transferring on different networks, known as domain adaptation. In this paper, we propose a novel Domain Adaptive Network Embedding framework, which applies graph convolutional network to learn tra"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1906.00684","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/1906.00684/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":"1906.00684","created_at":"2026-07-04T23:58:27.152199+00:00"},{"alias_kind":"arxiv_version","alias_value":"1906.00684v2","created_at":"2026-07-04T23:58:27.152199+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1906.00684","created_at":"2026-07-04T23:58:27.152199+00:00"},{"alias_kind":"pith_short_12","alias_value":"BPRUXZ7ALLUX","created_at":"2026-07-04T23:58:27.152199+00:00"},{"alias_kind":"pith_short_16","alias_value":"BPRUXZ7ALLUXAC64","created_at":"2026-07-04T23:58:27.152199+00:00"},{"alias_kind":"pith_short_8","alias_value":"BPRUXZ7A","created_at":"2026-07-04T23:58:27.152199+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":3,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2501.17443","citing_title":"Gradual Domain Adaptation for Graph Learning","ref_index":81,"is_internal_anchor":false},{"citing_arxiv_id":"2511.05456","citing_title":"Parameter-Efficient Conditioning for Material Generalization in Graph-Based Simulators","ref_index":16,"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":22,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/BPRUXZ7ALLUXAC64UXO5ICADTF","json":"https://pith.science/pith/BPRUXZ7ALLUXAC64UXO5ICADTF.json","graph_json":"https://pith.science/api/pith-number/BPRUXZ7ALLUXAC64UXO5ICADTF/graph.json","events_json":"https://pith.science/api/pith-number/BPRUXZ7ALLUXAC64UXO5ICADTF/events.json","paper":"https://pith.science/paper/BPRUXZ7A"},"agent_actions":{"view_html":"https://pith.science/pith/BPRUXZ7ALLUXAC64UXO5ICADTF","download_json":"https://pith.science/pith/BPRUXZ7ALLUXAC64UXO5ICADTF.json","view_paper":"https://pith.science/paper/BPRUXZ7A","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1906.00684&json=true","fetch_graph":"https://pith.science/api/pith-number/BPRUXZ7ALLUXAC64UXO5ICADTF/graph.json","fetch_events":"https://pith.science/api/pith-number/BPRUXZ7ALLUXAC64UXO5ICADTF/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/BPRUXZ7ALLUXAC64UXO5ICADTF/action/timestamp_anchor","attest_storage":"https://pith.science/pith/BPRUXZ7ALLUXAC64UXO5ICADTF/action/storage_attestation","attest_author":"https://pith.science/pith/BPRUXZ7ALLUXAC64UXO5ICADTF/action/author_attestation","sign_citation":"https://pith.science/pith/BPRUXZ7ALLUXAC64UXO5ICADTF/action/citation_signature","submit_replication":"https://pith.science/pith/BPRUXZ7ALLUXAC64UXO5ICADTF/action/replication_record"}},"created_at":"2026-07-04T23:58:27.152199+00:00","updated_at":"2026-07-04T23:58:27.152199+00:00"}