{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:ASOA663H3BMQVPZ6Z4ILHGFOOZ","short_pith_number":"pith:ASOA663H","schema_version":"1.0","canonical_sha256":"049c0f7b67d8590abf3ecf10b398ae7643b28bc7b9f4a26397c614dbdaab4dad","source":{"kind":"arxiv","id":"1809.04110","version":1},"attestation_state":"computed","paper":{"title":"Joint Embedding of Meta-Path and Meta-Graph for Heterogeneous Information Networks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG","stat.ML"],"primary_cat":"cs.SI","authors_text":"Bokai Cao, Congying Xia, Lichao Sun, Lifang He, Philip S. Yu, Xiaokai Wei, Zhipeng Huang","submitted_at":"2018-09-11T19:03:31Z","abstract_excerpt":"Meta-graph is currently the most powerful tool for similarity search on heterogeneous information networks,where a meta-graph is a composition of meta-paths that captures the complex structural information. However, current relevance computing based on meta-graph only considers the complex structural information, but ignores its embedded meta-paths information. To address this problem, we proposeMEta-GrAph-based network embedding models, called MEGA and MEGA++, respectively. The MEGA model uses normalized relevance or similarity measures that are derived from a meta-graph and its embedded meta"},"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":"1809.04110","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SI","submitted_at":"2018-09-11T19:03:31Z","cross_cats_sorted":["cs.LG","stat.ML"],"title_canon_sha256":"3d22016f44825c12846f295508554deff6ca7ba13df0d0ba53449a825649bc0b","abstract_canon_sha256":"06de784724163e46deba3b563dd01b368f2b55d7a8bd0b480a9b67064a9746cc"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:05:55.475300Z","signature_b64":"Tghe33HMJ0bdwz7CXOIwMRYEbB5s4WF+ipGiFHkGjLewDAk/BIV6W1SGooogSBBcZ19MxFNdX8q8okGofSmLAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"049c0f7b67d8590abf3ecf10b398ae7643b28bc7b9f4a26397c614dbdaab4dad","last_reissued_at":"2026-05-18T00:05:55.474676Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:05:55.474676Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Joint Embedding of Meta-Path and Meta-Graph for Heterogeneous Information Networks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG","stat.ML"],"primary_cat":"cs.SI","authors_text":"Bokai Cao, Congying Xia, Lichao Sun, Lifang He, Philip S. Yu, Xiaokai Wei, Zhipeng Huang","submitted_at":"2018-09-11T19:03:31Z","abstract_excerpt":"Meta-graph is currently the most powerful tool for similarity search on heterogeneous information networks,where a meta-graph is a composition of meta-paths that captures the complex structural information. However, current relevance computing based on meta-graph only considers the complex structural information, but ignores its embedded meta-paths information. To address this problem, we proposeMEta-GrAph-based network embedding models, called MEGA and MEGA++, respectively. The MEGA model uses normalized relevance or similarity measures that are derived from a meta-graph and its embedded meta"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1809.04110","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":""},"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":"1809.04110","created_at":"2026-05-18T00:05:55.474776+00:00"},{"alias_kind":"arxiv_version","alias_value":"1809.04110v1","created_at":"2026-05-18T00:05:55.474776+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1809.04110","created_at":"2026-05-18T00:05:55.474776+00:00"},{"alias_kind":"pith_short_12","alias_value":"ASOA663H3BMQ","created_at":"2026-05-18T12:32:13.499390+00:00"},{"alias_kind":"pith_short_16","alias_value":"ASOA663H3BMQVPZ6","created_at":"2026-05-18T12:32:13.499390+00:00"},{"alias_kind":"pith_short_8","alias_value":"ASOA663H","created_at":"2026-05-18T12:32:13.499390+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/ASOA663H3BMQVPZ6Z4ILHGFOOZ","json":"https://pith.science/pith/ASOA663H3BMQVPZ6Z4ILHGFOOZ.json","graph_json":"https://pith.science/api/pith-number/ASOA663H3BMQVPZ6Z4ILHGFOOZ/graph.json","events_json":"https://pith.science/api/pith-number/ASOA663H3BMQVPZ6Z4ILHGFOOZ/events.json","paper":"https://pith.science/paper/ASOA663H"},"agent_actions":{"view_html":"https://pith.science/pith/ASOA663H3BMQVPZ6Z4ILHGFOOZ","download_json":"https://pith.science/pith/ASOA663H3BMQVPZ6Z4ILHGFOOZ.json","view_paper":"https://pith.science/paper/ASOA663H","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1809.04110&json=true","fetch_graph":"https://pith.science/api/pith-number/ASOA663H3BMQVPZ6Z4ILHGFOOZ/graph.json","fetch_events":"https://pith.science/api/pith-number/ASOA663H3BMQVPZ6Z4ILHGFOOZ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/ASOA663H3BMQVPZ6Z4ILHGFOOZ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/ASOA663H3BMQVPZ6Z4ILHGFOOZ/action/storage_attestation","attest_author":"https://pith.science/pith/ASOA663H3BMQVPZ6Z4ILHGFOOZ/action/author_attestation","sign_citation":"https://pith.science/pith/ASOA663H3BMQVPZ6Z4ILHGFOOZ/action/citation_signature","submit_replication":"https://pith.science/pith/ASOA663H3BMQVPZ6Z4ILHGFOOZ/action/replication_record"}},"created_at":"2026-05-18T00:05:55.474776+00:00","updated_at":"2026-05-18T00:05:55.474776+00:00"}