{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2020:5KD36BKKBKQQJGCPGVZUDT7ZAQ","short_pith_number":"pith:5KD36BKK","schema_version":"1.0","canonical_sha256":"ea87bf054a0aa104984f357341cff9040032a3e2000a2edfa6462def63835e79","source":{"kind":"arxiv","id":"2007.00216","version":1},"attestation_state":"computed","paper":{"title":"An Efficient Neighborhood-based Interaction Model for Recommendation on Heterogeneous Graph","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.IR","authors_text":"Alexander J. Smola, Jiarui Jin, Jiarui Qin, Kounianhua Du, Weinan Zhang, Yong Yu, Yuchen Fang, Zheng Zhang","submitted_at":"2020-07-01T04:04:52Z","abstract_excerpt":"There is an influx of heterogeneous information network (HIN) based recommender systems in recent years since HIN is capable of characterizing complex graphs and contains rich semantics. Although the existing approaches have achieved performance improvement, while practical, they still face the following problems. On one hand, most existing HIN-based methods rely on explicit path reachability to leverage path-based semantic relatedness between users and items, e.g., metapath-based similarities. These methods are hard to use and integrate since path connections are sparse or noisy, and are ofte"},"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":"2007.00216","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IR","submitted_at":"2020-07-01T04:04:52Z","cross_cats_sorted":[],"title_canon_sha256":"85c0f6f8e638d64f87ebe16b58e85164613f9c680dfe3f3279dc8fdb693351a6","abstract_canon_sha256":"29528ea2d7bec3fd7abd6bd04eaf7e051845aa64348e942bb506a5fd30ffd7e1"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T01:15:29.591746Z","signature_b64":"MSMuK9TLlurOAPEGg/O+R4UmyeHIplcWsT9bwn2UTpLlsal7Mrc5PKY8dDo3v/6YoltlwdFp/0LmeT7DPJyQBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"ea87bf054a0aa104984f357341cff9040032a3e2000a2edfa6462def63835e79","last_reissued_at":"2026-07-05T01:15:29.591358Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T01:15:29.591358Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"An Efficient Neighborhood-based Interaction Model for Recommendation on Heterogeneous Graph","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.IR","authors_text":"Alexander J. Smola, Jiarui Jin, Jiarui Qin, Kounianhua Du, Weinan Zhang, Yong Yu, Yuchen Fang, Zheng Zhang","submitted_at":"2020-07-01T04:04:52Z","abstract_excerpt":"There is an influx of heterogeneous information network (HIN) based recommender systems in recent years since HIN is capable of characterizing complex graphs and contains rich semantics. Although the existing approaches have achieved performance improvement, while practical, they still face the following problems. On one hand, most existing HIN-based methods rely on explicit path reachability to leverage path-based semantic relatedness between users and items, e.g., metapath-based similarities. These methods are hard to use and integrate since path connections are sparse or noisy, and are ofte"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2007.00216","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/2007.00216/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":"2007.00216","created_at":"2026-07-05T01:15:29.591406+00:00"},{"alias_kind":"arxiv_version","alias_value":"2007.00216v1","created_at":"2026-07-05T01:15:29.591406+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2007.00216","created_at":"2026-07-05T01:15:29.591406+00:00"},{"alias_kind":"pith_short_12","alias_value":"5KD36BKKBKQQ","created_at":"2026-07-05T01:15:29.591406+00:00"},{"alias_kind":"pith_short_16","alias_value":"5KD36BKKBKQQJGCP","created_at":"2026-07-05T01:15:29.591406+00:00"},{"alias_kind":"pith_short_8","alias_value":"5KD36BKK","created_at":"2026-07-05T01:15:29.591406+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/5KD36BKKBKQQJGCPGVZUDT7ZAQ","json":"https://pith.science/pith/5KD36BKKBKQQJGCPGVZUDT7ZAQ.json","graph_json":"https://pith.science/api/pith-number/5KD36BKKBKQQJGCPGVZUDT7ZAQ/graph.json","events_json":"https://pith.science/api/pith-number/5KD36BKKBKQQJGCPGVZUDT7ZAQ/events.json","paper":"https://pith.science/paper/5KD36BKK"},"agent_actions":{"view_html":"https://pith.science/pith/5KD36BKKBKQQJGCPGVZUDT7ZAQ","download_json":"https://pith.science/pith/5KD36BKKBKQQJGCPGVZUDT7ZAQ.json","view_paper":"https://pith.science/paper/5KD36BKK","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2007.00216&json=true","fetch_graph":"https://pith.science/api/pith-number/5KD36BKKBKQQJGCPGVZUDT7ZAQ/graph.json","fetch_events":"https://pith.science/api/pith-number/5KD36BKKBKQQJGCPGVZUDT7ZAQ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/5KD36BKKBKQQJGCPGVZUDT7ZAQ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/5KD36BKKBKQQJGCPGVZUDT7ZAQ/action/storage_attestation","attest_author":"https://pith.science/pith/5KD36BKKBKQQJGCPGVZUDT7ZAQ/action/author_attestation","sign_citation":"https://pith.science/pith/5KD36BKKBKQQJGCPGVZUDT7ZAQ/action/citation_signature","submit_replication":"https://pith.science/pith/5KD36BKKBKQQJGCPGVZUDT7ZAQ/action/replication_record"}},"created_at":"2026-07-05T01:15:29.591406+00:00","updated_at":"2026-07-05T01:15:29.591406+00:00"}