{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2019:VWFD3HQFCK7J7UOY7XYSYNQLIU","short_pith_number":"pith:VWFD3HQF","schema_version":"1.0","canonical_sha256":"ad8a3d9e0512be9fd1d8fdf12c360b4511b4cc9baea0ebeba159c0ebafc88e7a","source":{"kind":"arxiv","id":"1905.08865","version":2},"attestation_state":"computed","paper":{"title":"Estimating Node Importance in Knowledge Graphs Using Graph Neural Networks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.IR","stat.ML"],"primary_cat":"cs.LG","authors_text":"Andrey Kan, Christos Faloutsos, Namyong Park, Tong Zhao, Xin Luna Dong","submitted_at":"2019-05-21T20:48:42Z","abstract_excerpt":"How can we estimate the importance of nodes in a knowledge graph (KG)? A KG is a multi-relational graph that has proven valuable for many tasks including question answering and semantic search. In this paper, we present GENI, a method for tackling the problem of estimating node importance in KGs, which enables several downstream applications such as item recommendation and resource allocation. While a number of approaches have been developed to address this problem for general graphs, they do not fully utilize information available in KGs, or lack flexibility needed to model complex relationsh"},"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":"1905.08865","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2019-05-21T20:48:42Z","cross_cats_sorted":["cs.IR","stat.ML"],"title_canon_sha256":"473a1452d8030ac85ba6e7a395d7a7ce7bda69c9dad12fc51f01a00c2776d64f","abstract_canon_sha256":"97bed0c2fc3a28932d1924c6b7ba6bc62495a58c4bfca3a0f3466fb3cb3c2df9"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:43:14.308184Z","signature_b64":"aCP6uR0kMELvNOzrKdJG7fWC0jcyzIZHNFn62+AWO31H8VdF9Ic0T0/24qYd7VO2xmJS+8rI84ksUITY0v4EDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"ad8a3d9e0512be9fd1d8fdf12c360b4511b4cc9baea0ebeba159c0ebafc88e7a","last_reissued_at":"2026-05-17T23:43:14.307688Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:43:14.307688Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Estimating Node Importance in Knowledge Graphs Using Graph Neural Networks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.IR","stat.ML"],"primary_cat":"cs.LG","authors_text":"Andrey Kan, Christos Faloutsos, Namyong Park, Tong Zhao, Xin Luna Dong","submitted_at":"2019-05-21T20:48:42Z","abstract_excerpt":"How can we estimate the importance of nodes in a knowledge graph (KG)? A KG is a multi-relational graph that has proven valuable for many tasks including question answering and semantic search. In this paper, we present GENI, a method for tackling the problem of estimating node importance in KGs, which enables several downstream applications such as item recommendation and resource allocation. While a number of approaches have been developed to address this problem for general graphs, they do not fully utilize information available in KGs, or lack flexibility needed to model complex relationsh"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1905.08865","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":""},"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":"1905.08865","created_at":"2026-05-17T23:43:14.307772+00:00"},{"alias_kind":"arxiv_version","alias_value":"1905.08865v2","created_at":"2026-05-17T23:43:14.307772+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1905.08865","created_at":"2026-05-17T23:43:14.307772+00:00"},{"alias_kind":"pith_short_12","alias_value":"VWFD3HQFCK7J","created_at":"2026-05-18T12:33:30.264802+00:00"},{"alias_kind":"pith_short_16","alias_value":"VWFD3HQFCK7J7UOY","created_at":"2026-05-18T12:33:30.264802+00:00"},{"alias_kind":"pith_short_8","alias_value":"VWFD3HQF","created_at":"2026-05-18T12:33:30.264802+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/VWFD3HQFCK7J7UOY7XYSYNQLIU","json":"https://pith.science/pith/VWFD3HQFCK7J7UOY7XYSYNQLIU.json","graph_json":"https://pith.science/api/pith-number/VWFD3HQFCK7J7UOY7XYSYNQLIU/graph.json","events_json":"https://pith.science/api/pith-number/VWFD3HQFCK7J7UOY7XYSYNQLIU/events.json","paper":"https://pith.science/paper/VWFD3HQF"},"agent_actions":{"view_html":"https://pith.science/pith/VWFD3HQFCK7J7UOY7XYSYNQLIU","download_json":"https://pith.science/pith/VWFD3HQFCK7J7UOY7XYSYNQLIU.json","view_paper":"https://pith.science/paper/VWFD3HQF","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1905.08865&json=true","fetch_graph":"https://pith.science/api/pith-number/VWFD3HQFCK7J7UOY7XYSYNQLIU/graph.json","fetch_events":"https://pith.science/api/pith-number/VWFD3HQFCK7J7UOY7XYSYNQLIU/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/VWFD3HQFCK7J7UOY7XYSYNQLIU/action/timestamp_anchor","attest_storage":"https://pith.science/pith/VWFD3HQFCK7J7UOY7XYSYNQLIU/action/storage_attestation","attest_author":"https://pith.science/pith/VWFD3HQFCK7J7UOY7XYSYNQLIU/action/author_attestation","sign_citation":"https://pith.science/pith/VWFD3HQFCK7J7UOY7XYSYNQLIU/action/citation_signature","submit_replication":"https://pith.science/pith/VWFD3HQFCK7J7UOY7XYSYNQLIU/action/replication_record"}},"created_at":"2026-05-17T23:43:14.307772+00:00","updated_at":"2026-05-17T23:43:14.307772+00:00"}