{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2021:33I6LG4ATR7DSTJTZW2H6SUUP7","short_pith_number":"pith:33I6LG4A","schema_version":"1.0","canonical_sha256":"ded1e59b809c7e394d33cdb47f4a947ffdcc9b0858c12e18a8e41059df7f9f9f","source":{"kind":"arxiv","id":"2108.08134","version":1},"attestation_state":"computed","paper":{"title":"Hyperbolic Hypergraphs for Sequential Recommendation","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.SI","authors_text":"Guandong Xu, Hongxu Chen, Lin Li, Lizhen Cui, Philip S. Yu, Xiangguo Sun, Yicong Li, Zhenchao Sun","submitted_at":"2021-08-18T13:21:02Z","abstract_excerpt":"Hypergraphs have been becoming a popular choice to model complex, non-pairwise, and higher-order interactions for recommender system. However, compared with traditional graph-based methods, the constructed hypergraphs are usually much sparser, which leads to a dilemma when balancing the benefits of hypergraphs and the modelling difficulty. Moreover, existing sequential hypergraph recommendation overlooks the temporal modelling among user relationships, which neglects rich social signals from the recommendation data. To tackle the above shortcomings of the existing hypergraph-based sequential r"},"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":"2108.08134","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SI","submitted_at":"2021-08-18T13:21:02Z","cross_cats_sorted":[],"title_canon_sha256":"18ae947152811c732fbcafb00ab9ceb9516f1edf54f5c7829640d22d637dd17c","abstract_canon_sha256":"5cc0620ba3f17e12fd57b13d18aec9eb85dffcda2192d87ca506ce99293b40f7"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T03:06:59.994719Z","signature_b64":"a4Ru4fK4aPuZP5CajoCidoUj4X1yWFgDJC54FJ2GT+tPDJIdlnxMsP4oz9NhEVF3bZKL5mme+f3TAlc7OG4aCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"ded1e59b809c7e394d33cdb47f4a947ffdcc9b0858c12e18a8e41059df7f9f9f","last_reissued_at":"2026-07-05T03:06:59.994323Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T03:06:59.994323Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Hyperbolic Hypergraphs for Sequential Recommendation","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.SI","authors_text":"Guandong Xu, Hongxu Chen, Lin Li, Lizhen Cui, Philip S. Yu, Xiangguo Sun, Yicong Li, Zhenchao Sun","submitted_at":"2021-08-18T13:21:02Z","abstract_excerpt":"Hypergraphs have been becoming a popular choice to model complex, non-pairwise, and higher-order interactions for recommender system. However, compared with traditional graph-based methods, the constructed hypergraphs are usually much sparser, which leads to a dilemma when balancing the benefits of hypergraphs and the modelling difficulty. Moreover, existing sequential hypergraph recommendation overlooks the temporal modelling among user relationships, which neglects rich social signals from the recommendation data. To tackle the above shortcomings of the existing hypergraph-based sequential r"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2108.08134","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/2108.08134/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":"2108.08134","created_at":"2026-07-05T03:06:59.994381+00:00"},{"alias_kind":"arxiv_version","alias_value":"2108.08134v1","created_at":"2026-07-05T03:06:59.994381+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2108.08134","created_at":"2026-07-05T03:06:59.994381+00:00"},{"alias_kind":"pith_short_12","alias_value":"33I6LG4ATR7D","created_at":"2026-07-05T03:06:59.994381+00:00"},{"alias_kind":"pith_short_16","alias_value":"33I6LG4ATR7DSTJT","created_at":"2026-07-05T03:06:59.994381+00:00"},{"alias_kind":"pith_short_8","alias_value":"33I6LG4A","created_at":"2026-07-05T03:06:59.994381+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/33I6LG4ATR7DSTJTZW2H6SUUP7","json":"https://pith.science/pith/33I6LG4ATR7DSTJTZW2H6SUUP7.json","graph_json":"https://pith.science/api/pith-number/33I6LG4ATR7DSTJTZW2H6SUUP7/graph.json","events_json":"https://pith.science/api/pith-number/33I6LG4ATR7DSTJTZW2H6SUUP7/events.json","paper":"https://pith.science/paper/33I6LG4A"},"agent_actions":{"view_html":"https://pith.science/pith/33I6LG4ATR7DSTJTZW2H6SUUP7","download_json":"https://pith.science/pith/33I6LG4ATR7DSTJTZW2H6SUUP7.json","view_paper":"https://pith.science/paper/33I6LG4A","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2108.08134&json=true","fetch_graph":"https://pith.science/api/pith-number/33I6LG4ATR7DSTJTZW2H6SUUP7/graph.json","fetch_events":"https://pith.science/api/pith-number/33I6LG4ATR7DSTJTZW2H6SUUP7/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/33I6LG4ATR7DSTJTZW2H6SUUP7/action/timestamp_anchor","attest_storage":"https://pith.science/pith/33I6LG4ATR7DSTJTZW2H6SUUP7/action/storage_attestation","attest_author":"https://pith.science/pith/33I6LG4ATR7DSTJTZW2H6SUUP7/action/author_attestation","sign_citation":"https://pith.science/pith/33I6LG4ATR7DSTJTZW2H6SUUP7/action/citation_signature","submit_replication":"https://pith.science/pith/33I6LG4ATR7DSTJTZW2H6SUUP7/action/replication_record"}},"created_at":"2026-07-05T03:06:59.994381+00:00","updated_at":"2026-07-05T03:06:59.994381+00:00"}