{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2022:PV7GFFD2COTMYQGKPCMXWROHI6","short_pith_number":"pith:PV7GFFD2","schema_version":"1.0","canonical_sha256":"7d7e62947a13a6cc40ca78997b45c747b7dd61a4654fae3e6783f9db813000aa","source":{"kind":"arxiv","id":"2208.06144","version":2},"attestation_state":"computed","paper":{"title":"GSim: A Graph Neural Network based Relevance Measure for Heterogeneous Graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG"],"primary_cat":"cs.IR","authors_text":"Linhao Luo, Moli Lu, Wenjie Zhang, Xiaofeng Zhang, Xin Cao, Yixiang Fang","submitted_at":"2022-08-12T07:26:05Z","abstract_excerpt":"Heterogeneous graphs, which contain nodes and edges of multiple types, are prevalent in various domains, including bibliographic networks, social media, and knowledge graphs. As a fundamental task in analyzing heterogeneous graphs, relevance measure aims to calculate the relevance between two objects of different types, which has been used in many applications such as web search, recommendation, and community detection. Most of existing relevance measures focus on homogeneous networks where objects are of the same type, and a few measures are developed for heterogeneous graphs, but they often "},"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":"2208.06144","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IR","submitted_at":"2022-08-12T07:26:05Z","cross_cats_sorted":["cs.LG"],"title_canon_sha256":"4f7ab033a99c4fa712daf4688af6948fbc65b4a02a5f691fbd11e51c041ceced","abstract_canon_sha256":"c0394505179e997f8f982bd87996ebd065cab9cdc90096da0378a034c87d0ea8"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T06:05:28.641744Z","signature_b64":"AgMMGsnBzQp84YC5/Cgxhc6BjIDCQbLYeUw6I9SlGe/RZUHnMaKTU5Ny+D2CVz/3nt2wrkqLDWw/JyrsYOkgAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"7d7e62947a13a6cc40ca78997b45c747b7dd61a4654fae3e6783f9db813000aa","last_reissued_at":"2026-07-05T06:05:28.641261Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T06:05:28.641261Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"GSim: A Graph Neural Network based Relevance Measure for Heterogeneous Graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG"],"primary_cat":"cs.IR","authors_text":"Linhao Luo, Moli Lu, Wenjie Zhang, Xiaofeng Zhang, Xin Cao, Yixiang Fang","submitted_at":"2022-08-12T07:26:05Z","abstract_excerpt":"Heterogeneous graphs, which contain nodes and edges of multiple types, are prevalent in various domains, including bibliographic networks, social media, and knowledge graphs. As a fundamental task in analyzing heterogeneous graphs, relevance measure aims to calculate the relevance between two objects of different types, which has been used in many applications such as web search, recommendation, and community detection. Most of existing relevance measures focus on homogeneous networks where objects are of the same type, and a few measures are developed for heterogeneous graphs, but they often "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2208.06144","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/2208.06144/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":"2208.06144","created_at":"2026-07-05T06:05:28.641325+00:00"},{"alias_kind":"arxiv_version","alias_value":"2208.06144v2","created_at":"2026-07-05T06:05:28.641325+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2208.06144","created_at":"2026-07-05T06:05:28.641325+00:00"},{"alias_kind":"pith_short_12","alias_value":"PV7GFFD2COTM","created_at":"2026-07-05T06:05:28.641325+00:00"},{"alias_kind":"pith_short_16","alias_value":"PV7GFFD2COTMYQGK","created_at":"2026-07-05T06:05:28.641325+00:00"},{"alias_kind":"pith_short_8","alias_value":"PV7GFFD2","created_at":"2026-07-05T06:05:28.641325+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2305.09958","citing_title":"SIGMA: An Efficient Heterophilous Graph Neural Network with Fast Global Aggregation","ref_index":27,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/PV7GFFD2COTMYQGKPCMXWROHI6","json":"https://pith.science/pith/PV7GFFD2COTMYQGKPCMXWROHI6.json","graph_json":"https://pith.science/api/pith-number/PV7GFFD2COTMYQGKPCMXWROHI6/graph.json","events_json":"https://pith.science/api/pith-number/PV7GFFD2COTMYQGKPCMXWROHI6/events.json","paper":"https://pith.science/paper/PV7GFFD2"},"agent_actions":{"view_html":"https://pith.science/pith/PV7GFFD2COTMYQGKPCMXWROHI6","download_json":"https://pith.science/pith/PV7GFFD2COTMYQGKPCMXWROHI6.json","view_paper":"https://pith.science/paper/PV7GFFD2","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2208.06144&json=true","fetch_graph":"https://pith.science/api/pith-number/PV7GFFD2COTMYQGKPCMXWROHI6/graph.json","fetch_events":"https://pith.science/api/pith-number/PV7GFFD2COTMYQGKPCMXWROHI6/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/PV7GFFD2COTMYQGKPCMXWROHI6/action/timestamp_anchor","attest_storage":"https://pith.science/pith/PV7GFFD2COTMYQGKPCMXWROHI6/action/storage_attestation","attest_author":"https://pith.science/pith/PV7GFFD2COTMYQGKPCMXWROHI6/action/author_attestation","sign_citation":"https://pith.science/pith/PV7GFFD2COTMYQGKPCMXWROHI6/action/citation_signature","submit_replication":"https://pith.science/pith/PV7GFFD2COTMYQGKPCMXWROHI6/action/replication_record"}},"created_at":"2026-07-05T06:05:28.641325+00:00","updated_at":"2026-07-05T06:05:28.641325+00:00"}