{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:IFPVHJWAMJCGHE775YNQSF3YZK","short_pith_number":"pith:IFPVHJWA","schema_version":"1.0","canonical_sha256":"415f53a6c062446393ffee1b091778caabe7748632bb3cc66de0d5560ab8c0cb","source":{"kind":"arxiv","id":"1610.09769","version":1},"attestation_state":"computed","paper":{"title":"Meta-Path Guided Embedding for Similarity Search in Large-Scale Heterogeneous Information Networks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG"],"primary_cat":"cs.SI","authors_text":"Jialu Liu, Jian Peng, Jiawei Han, Jingbo Shang, Lance M. Kaplan, Meng Qu","submitted_at":"2016-10-31T03:15:02Z","abstract_excerpt":"Most real-world data can be modeled as heterogeneous information networks (HINs) consisting of vertices of multiple types and their relationships. Search for similar vertices of the same type in large HINs, such as bibliographic networks and business-review networks, is a fundamental problem with broad applications. Although similarity search in HINs has been studied previously, most existing approaches neither explore rich semantic information embedded in the network structures nor take user's preference as a guidance.\n  In this paper, we re-examine similarity search in HINs and propose a nov"},"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":"1610.09769","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SI","submitted_at":"2016-10-31T03:15:02Z","cross_cats_sorted":["cs.LG"],"title_canon_sha256":"fa3295c5e316bd4c1f073b4ab31ec71403ca6add60219bfb358d1170d4300ece","abstract_canon_sha256":"cf1c741c199989f8e1c43a13a302aa9b6a2f9051991aa09f99c18d65bccb8cea"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:00:47.231912Z","signature_b64":"tlFokmK5BD2M7k61yF4Jd5Uug2PfJreFe5ItX+2us1ZLipz+3/lsy1JHjKwb2A+nK0EkNecr4D6gE2YaVL8HBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"415f53a6c062446393ffee1b091778caabe7748632bb3cc66de0d5560ab8c0cb","last_reissued_at":"2026-05-18T01:00:47.231450Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:00:47.231450Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Meta-Path Guided Embedding for Similarity Search in Large-Scale Heterogeneous Information Networks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG"],"primary_cat":"cs.SI","authors_text":"Jialu Liu, Jian Peng, Jiawei Han, Jingbo Shang, Lance M. Kaplan, Meng Qu","submitted_at":"2016-10-31T03:15:02Z","abstract_excerpt":"Most real-world data can be modeled as heterogeneous information networks (HINs) consisting of vertices of multiple types and their relationships. Search for similar vertices of the same type in large HINs, such as bibliographic networks and business-review networks, is a fundamental problem with broad applications. Although similarity search in HINs has been studied previously, most existing approaches neither explore rich semantic information embedded in the network structures nor take user's preference as a guidance.\n  In this paper, we re-examine similarity search in HINs and propose a nov"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1610.09769","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":"1610.09769","created_at":"2026-05-18T01:00:47.231522+00:00"},{"alias_kind":"arxiv_version","alias_value":"1610.09769v1","created_at":"2026-05-18T01:00:47.231522+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1610.09769","created_at":"2026-05-18T01:00:47.231522+00:00"},{"alias_kind":"pith_short_12","alias_value":"IFPVHJWAMJCG","created_at":"2026-05-18T12:30:22.444734+00:00"},{"alias_kind":"pith_short_16","alias_value":"IFPVHJWAMJCGHE77","created_at":"2026-05-18T12:30:22.444734+00:00"},{"alias_kind":"pith_short_8","alias_value":"IFPVHJWA","created_at":"2026-05-18T12:30:22.444734+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/IFPVHJWAMJCGHE775YNQSF3YZK","json":"https://pith.science/pith/IFPVHJWAMJCGHE775YNQSF3YZK.json","graph_json":"https://pith.science/api/pith-number/IFPVHJWAMJCGHE775YNQSF3YZK/graph.json","events_json":"https://pith.science/api/pith-number/IFPVHJWAMJCGHE775YNQSF3YZK/events.json","paper":"https://pith.science/paper/IFPVHJWA"},"agent_actions":{"view_html":"https://pith.science/pith/IFPVHJWAMJCGHE775YNQSF3YZK","download_json":"https://pith.science/pith/IFPVHJWAMJCGHE775YNQSF3YZK.json","view_paper":"https://pith.science/paper/IFPVHJWA","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1610.09769&json=true","fetch_graph":"https://pith.science/api/pith-number/IFPVHJWAMJCGHE775YNQSF3YZK/graph.json","fetch_events":"https://pith.science/api/pith-number/IFPVHJWAMJCGHE775YNQSF3YZK/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/IFPVHJWAMJCGHE775YNQSF3YZK/action/timestamp_anchor","attest_storage":"https://pith.science/pith/IFPVHJWAMJCGHE775YNQSF3YZK/action/storage_attestation","attest_author":"https://pith.science/pith/IFPVHJWAMJCGHE775YNQSF3YZK/action/author_attestation","sign_citation":"https://pith.science/pith/IFPVHJWAMJCGHE775YNQSF3YZK/action/citation_signature","submit_replication":"https://pith.science/pith/IFPVHJWAMJCGHE775YNQSF3YZK/action/replication_record"}},"created_at":"2026-05-18T01:00:47.231522+00:00","updated_at":"2026-05-18T01:00:47.231522+00:00"}