{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2023:NNOUX3T4LWKUAQ5ZH2IADJC5U5","short_pith_number":"pith:NNOUX3T4","schema_version":"1.0","canonical_sha256":"6b5d4bee7c5d954043b93e9001a45da745038b307199ce855cd40f56ac501b68","source":{"kind":"arxiv","id":"2304.02961","version":2},"attestation_state":"computed","paper":{"title":"HGCH: A Hyperbolic Graph Convolution Network Model for Heterogeneous Collaborative Graph Recommendation","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.IR","authors_text":"Lu Zhang, Ning Wu","submitted_at":"2023-04-06T09:38:54Z","abstract_excerpt":"User-item interaction data in collaborative filtering and graph modeling tasks often exhibit power-law characteristics, which suggest the suitability of hyperbolic space modeling. Hyperbolic Graph Convolution Neural Networks (HGCNs) are a novel technique that leverages the advantages of GCN and hyperbolic space, and then achieves remarkable results. However, existing HGCN methods have several drawbacks: they fail to fully leverage hyperbolic space properties due to arbitrary embedding initialization and imprecise tangent space aggregation; they overlook auxiliary information that could enrich "},"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":"2304.02961","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IR","submitted_at":"2023-04-06T09:38:54Z","cross_cats_sorted":[],"title_canon_sha256":"baf1a9769ab55c56c8d1cd01dbe8eec1802fcd30d6c4f9b62e02222d5dfe1942","abstract_canon_sha256":"488d72885088b95be51e40cf77472f831b192adb6148a0da450a9ff8fb04dfd3"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T09:48:10.963877Z","signature_b64":"N9eEJmraFc+6m/3tcY1wzsUN6SkvWdp8oLsWBlRNDBns879MHFs82LOWEpqcALc+cfEpD1OBNMvw2HpS6DIuDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"6b5d4bee7c5d954043b93e9001a45da745038b307199ce855cd40f56ac501b68","last_reissued_at":"2026-07-05T09:48:10.963529Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T09:48:10.963529Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"HGCH: A Hyperbolic Graph Convolution Network Model for Heterogeneous Collaborative Graph Recommendation","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.IR","authors_text":"Lu Zhang, Ning Wu","submitted_at":"2023-04-06T09:38:54Z","abstract_excerpt":"User-item interaction data in collaborative filtering and graph modeling tasks often exhibit power-law characteristics, which suggest the suitability of hyperbolic space modeling. Hyperbolic Graph Convolution Neural Networks (HGCNs) are a novel technique that leverages the advantages of GCN and hyperbolic space, and then achieves remarkable results. However, existing HGCN methods have several drawbacks: they fail to fully leverage hyperbolic space properties due to arbitrary embedding initialization and imprecise tangent space aggregation; they overlook auxiliary information that could enrich "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2304.02961","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/2304.02961/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":"2304.02961","created_at":"2026-07-05T09:48:10.963586+00:00"},{"alias_kind":"arxiv_version","alias_value":"2304.02961v2","created_at":"2026-07-05T09:48:10.963586+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2304.02961","created_at":"2026-07-05T09:48:10.963586+00:00"},{"alias_kind":"pith_short_12","alias_value":"NNOUX3T4LWKU","created_at":"2026-07-05T09:48:10.963586+00:00"},{"alias_kind":"pith_short_16","alias_value":"NNOUX3T4LWKUAQ5Z","created_at":"2026-07-05T09:48:10.963586+00:00"},{"alias_kind":"pith_short_8","alias_value":"NNOUX3T4","created_at":"2026-07-05T09:48:10.963586+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2502.15693","citing_title":"Hgformer: Hyperbolic Graph Transformer for Recommendation","ref_index":26,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/NNOUX3T4LWKUAQ5ZH2IADJC5U5","json":"https://pith.science/pith/NNOUX3T4LWKUAQ5ZH2IADJC5U5.json","graph_json":"https://pith.science/api/pith-number/NNOUX3T4LWKUAQ5ZH2IADJC5U5/graph.json","events_json":"https://pith.science/api/pith-number/NNOUX3T4LWKUAQ5ZH2IADJC5U5/events.json","paper":"https://pith.science/paper/NNOUX3T4"},"agent_actions":{"view_html":"https://pith.science/pith/NNOUX3T4LWKUAQ5ZH2IADJC5U5","download_json":"https://pith.science/pith/NNOUX3T4LWKUAQ5ZH2IADJC5U5.json","view_paper":"https://pith.science/paper/NNOUX3T4","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2304.02961&json=true","fetch_graph":"https://pith.science/api/pith-number/NNOUX3T4LWKUAQ5ZH2IADJC5U5/graph.json","fetch_events":"https://pith.science/api/pith-number/NNOUX3T4LWKUAQ5ZH2IADJC5U5/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/NNOUX3T4LWKUAQ5ZH2IADJC5U5/action/timestamp_anchor","attest_storage":"https://pith.science/pith/NNOUX3T4LWKUAQ5ZH2IADJC5U5/action/storage_attestation","attest_author":"https://pith.science/pith/NNOUX3T4LWKUAQ5ZH2IADJC5U5/action/author_attestation","sign_citation":"https://pith.science/pith/NNOUX3T4LWKUAQ5ZH2IADJC5U5/action/citation_signature","submit_replication":"https://pith.science/pith/NNOUX3T4LWKUAQ5ZH2IADJC5U5/action/replication_record"}},"created_at":"2026-07-05T09:48:10.963586+00:00","updated_at":"2026-07-05T09:48:10.963586+00:00"}