{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2025:S4RBE6VR2UEHLYAEQU65QFBQBB","short_pith_number":"pith:S4RBE6VR","schema_version":"1.0","canonical_sha256":"9722127ab1d50875e004853dd814300872b77447f632a679939c1c21b60c0255","source":{"kind":"arxiv","id":"2505.05989","version":1},"attestation_state":"computed","paper":{"title":"Modeling Multi-Hop Semantic Paths for Recommendation in Heterogeneous Information Networks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG"],"primary_cat":"cs.IR","authors_text":"Hongye Zheng, Junliang Du, Lipeng Zhu, Wanyu Cui, Xu Han, Yue Xing","submitted_at":"2025-05-09T12:18:34Z","abstract_excerpt":"This study focuses on the problem of path modeling in heterogeneous information networks and proposes a multi-hop path-aware recommendation framework. The method centers on multi-hop paths composed of various types of entities and relations. It models user preferences through three stages: path selection, semantic representation, and attention-based fusion. In the path selection stage, a path filtering mechanism is introduced to remove redundant and noisy information. In the representation learning stage, a sequential modeling structure is used to jointly encode entities and relations, preserv"},"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":"2505.05989","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IR","submitted_at":"2025-05-09T12:18:34Z","cross_cats_sorted":["cs.LG"],"title_canon_sha256":"c23f3cff8204ce61937e36cdb9b3d69ebdd5de339acf2875b40a089558b1a5e8","abstract_canon_sha256":"63f313876660012877129598dc4beebada2311e0f558383a8f9907830b49b2db"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T11:00:51.770738Z","signature_b64":"yaBR9RVI6NyT3qb4nBkysf6L8ogzxluFk/dquicrldMZga5R8V46lqJiRsqXt2CF6eUazXWXu+KYI2Cgspf8Dg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"9722127ab1d50875e004853dd814300872b77447f632a679939c1c21b60c0255","last_reissued_at":"2026-07-05T11:00:51.770231Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T11:00:51.770231Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Modeling Multi-Hop Semantic Paths for Recommendation in Heterogeneous Information Networks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG"],"primary_cat":"cs.IR","authors_text":"Hongye Zheng, Junliang Du, Lipeng Zhu, Wanyu Cui, Xu Han, Yue Xing","submitted_at":"2025-05-09T12:18:34Z","abstract_excerpt":"This study focuses on the problem of path modeling in heterogeneous information networks and proposes a multi-hop path-aware recommendation framework. The method centers on multi-hop paths composed of various types of entities and relations. It models user preferences through three stages: path selection, semantic representation, and attention-based fusion. In the path selection stage, a path filtering mechanism is introduced to remove redundant and noisy information. In the representation learning stage, a sequential modeling structure is used to jointly encode entities and relations, preserv"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2505.05989","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2505.05989/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":"2505.05989","created_at":"2026-07-05T11:00:51.770289+00:00"},{"alias_kind":"arxiv_version","alias_value":"2505.05989v1","created_at":"2026-07-05T11:00:51.770289+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2505.05989","created_at":"2026-07-05T11:00:51.770289+00:00"},{"alias_kind":"pith_short_12","alias_value":"S4RBE6VR2UEH","created_at":"2026-07-05T11:00:51.770289+00:00"},{"alias_kind":"pith_short_16","alias_value":"S4RBE6VR2UEHLYAE","created_at":"2026-07-05T11:00:51.770289+00:00"},{"alias_kind":"pith_short_8","alias_value":"S4RBE6VR","created_at":"2026-07-05T11:00:51.770289+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2508.14503","citing_title":"Artificial Intelligence-Based Multiscale Temporal Modeling for Anomaly Detection in Cloud Services","ref_index":22,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/S4RBE6VR2UEHLYAEQU65QFBQBB","json":"https://pith.science/pith/S4RBE6VR2UEHLYAEQU65QFBQBB.json","graph_json":"https://pith.science/api/pith-number/S4RBE6VR2UEHLYAEQU65QFBQBB/graph.json","events_json":"https://pith.science/api/pith-number/S4RBE6VR2UEHLYAEQU65QFBQBB/events.json","paper":"https://pith.science/paper/S4RBE6VR"},"agent_actions":{"view_html":"https://pith.science/pith/S4RBE6VR2UEHLYAEQU65QFBQBB","download_json":"https://pith.science/pith/S4RBE6VR2UEHLYAEQU65QFBQBB.json","view_paper":"https://pith.science/paper/S4RBE6VR","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2505.05989&json=true","fetch_graph":"https://pith.science/api/pith-number/S4RBE6VR2UEHLYAEQU65QFBQBB/graph.json","fetch_events":"https://pith.science/api/pith-number/S4RBE6VR2UEHLYAEQU65QFBQBB/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/S4RBE6VR2UEHLYAEQU65QFBQBB/action/timestamp_anchor","attest_storage":"https://pith.science/pith/S4RBE6VR2UEHLYAEQU65QFBQBB/action/storage_attestation","attest_author":"https://pith.science/pith/S4RBE6VR2UEHLYAEQU65QFBQBB/action/author_attestation","sign_citation":"https://pith.science/pith/S4RBE6VR2UEHLYAEQU65QFBQBB/action/citation_signature","submit_replication":"https://pith.science/pith/S4RBE6VR2UEHLYAEQU65QFBQBB/action/replication_record"}},"created_at":"2026-07-05T11:00:51.770289+00:00","updated_at":"2026-07-05T11:00:51.770289+00:00"}