{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2021:OX5M5IKWHQ3NZQ2VO6YYQJQRBR","short_pith_number":"pith:OX5M5IKW","schema_version":"1.0","canonical_sha256":"75facea1563c36dcc35577b18826110c511f3e88fd137024bbe4eb9407815689","source":{"kind":"arxiv","id":"2104.01711","version":2},"attestation_state":"computed","paper":{"title":"Uniting Heterogeneity, Inductiveness, and Efficiency for Graph Representation Learning","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG"],"primary_cat":"cs.SI","authors_text":"Hao Wang, Hongzhi Yin, Jie Ren, Tong Chen, Xiangliang Zhang, Zi Huang","submitted_at":"2021-04-04T23:31:39Z","abstract_excerpt":"With the ubiquitous graph-structured data in various applications, models that can learn compact but expressive vector representations of nodes have become highly desirable. Recently, bearing the message passing paradigm, graph neural networks (GNNs) have greatly advanced the performance of node representation learning on graphs. However, a majority class of GNNs are only designed for homogeneous graphs, leading to inferior adaptivity to the more informative heterogeneous graphs with various types of nodes and edges. Also, despite the necessity of inductively producing representations for comp"},"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":"2104.01711","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SI","submitted_at":"2021-04-04T23:31:39Z","cross_cats_sorted":["cs.LG"],"title_canon_sha256":"4d130ed6d9b298b9512823c65f121f7af0e6bf405d8237a707aae4966283acd0","abstract_canon_sha256":"4111e46c615b22fb8d794d819ed6c7a2c995dc5692d048f64efea892231bdfe2"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T02:31:05.333917Z","signature_b64":"1/4DymPo9zOu9i2vIbtx1YDEoxgJEqNNm8oqDroKIEOTDbtG5vher9bN+LSgYiiMC3QQiZBOcPhCBqpKyjU4Cg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"75facea1563c36dcc35577b18826110c511f3e88fd137024bbe4eb9407815689","last_reissued_at":"2026-07-05T02:31:05.333400Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T02:31:05.333400Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Uniting Heterogeneity, Inductiveness, and Efficiency for Graph Representation Learning","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG"],"primary_cat":"cs.SI","authors_text":"Hao Wang, Hongzhi Yin, Jie Ren, Tong Chen, Xiangliang Zhang, Zi Huang","submitted_at":"2021-04-04T23:31:39Z","abstract_excerpt":"With the ubiquitous graph-structured data in various applications, models that can learn compact but expressive vector representations of nodes have become highly desirable. Recently, bearing the message passing paradigm, graph neural networks (GNNs) have greatly advanced the performance of node representation learning on graphs. However, a majority class of GNNs are only designed for homogeneous graphs, leading to inferior adaptivity to the more informative heterogeneous graphs with various types of nodes and edges. Also, despite the necessity of inductively producing representations for comp"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2104.01711","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/2104.01711/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":"2104.01711","created_at":"2026-07-05T02:31:05.333466+00:00"},{"alias_kind":"arxiv_version","alias_value":"2104.01711v2","created_at":"2026-07-05T02:31:05.333466+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2104.01711","created_at":"2026-07-05T02:31:05.333466+00:00"},{"alias_kind":"pith_short_12","alias_value":"OX5M5IKWHQ3N","created_at":"2026-07-05T02:31:05.333466+00:00"},{"alias_kind":"pith_short_16","alias_value":"OX5M5IKWHQ3NZQ2V","created_at":"2026-07-05T02:31:05.333466+00:00"},{"alias_kind":"pith_short_8","alias_value":"OX5M5IKW","created_at":"2026-07-05T02:31:05.333466+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/OX5M5IKWHQ3NZQ2VO6YYQJQRBR","json":"https://pith.science/pith/OX5M5IKWHQ3NZQ2VO6YYQJQRBR.json","graph_json":"https://pith.science/api/pith-number/OX5M5IKWHQ3NZQ2VO6YYQJQRBR/graph.json","events_json":"https://pith.science/api/pith-number/OX5M5IKWHQ3NZQ2VO6YYQJQRBR/events.json","paper":"https://pith.science/paper/OX5M5IKW"},"agent_actions":{"view_html":"https://pith.science/pith/OX5M5IKWHQ3NZQ2VO6YYQJQRBR","download_json":"https://pith.science/pith/OX5M5IKWHQ3NZQ2VO6YYQJQRBR.json","view_paper":"https://pith.science/paper/OX5M5IKW","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2104.01711&json=true","fetch_graph":"https://pith.science/api/pith-number/OX5M5IKWHQ3NZQ2VO6YYQJQRBR/graph.json","fetch_events":"https://pith.science/api/pith-number/OX5M5IKWHQ3NZQ2VO6YYQJQRBR/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/OX5M5IKWHQ3NZQ2VO6YYQJQRBR/action/timestamp_anchor","attest_storage":"https://pith.science/pith/OX5M5IKWHQ3NZQ2VO6YYQJQRBR/action/storage_attestation","attest_author":"https://pith.science/pith/OX5M5IKWHQ3NZQ2VO6YYQJQRBR/action/author_attestation","sign_citation":"https://pith.science/pith/OX5M5IKWHQ3NZQ2VO6YYQJQRBR/action/citation_signature","submit_replication":"https://pith.science/pith/OX5M5IKWHQ3NZQ2VO6YYQJQRBR/action/replication_record"}},"created_at":"2026-07-05T02:31:05.333466+00:00","updated_at":"2026-07-05T02:31:05.333466+00:00"}