{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2019:PO6XRWCYBJRNYTBN3BX622ZIIX","short_pith_number":"pith:PO6XRWCY","canonical_record":{"source":{"id":"1906.09217","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IR","submitted_at":"2019-06-21T16:02:41Z","cross_cats_sorted":[],"title_canon_sha256":"f3f76c35c1b5370489723b454cc32ee6c0ba50f9fc940256b908a7d593bebfdc","abstract_canon_sha256":"e68623515dd7443e1255ab66049e83a26ecbb6bb3b393d08f814148c0e459341"},"schema_version":"1.0"},"canonical_sha256":"7bbd78d8580a62dc4c2dd86fed6b2845ed8bac93b87ad71be5993a18f8fa06f2","source":{"kind":"arxiv","id":"1906.09217","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1906.09217","created_at":"2026-05-17T23:42:44Z"},{"alias_kind":"arxiv_version","alias_value":"1906.09217v1","created_at":"2026-05-17T23:42:44Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1906.09217","created_at":"2026-05-17T23:42:44Z"},{"alias_kind":"pith_short_12","alias_value":"PO6XRWCYBJRN","created_at":"2026-05-18T12:33:24Z"},{"alias_kind":"pith_short_16","alias_value":"PO6XRWCYBJRNYTBN","created_at":"2026-05-18T12:33:24Z"},{"alias_kind":"pith_short_8","alias_value":"PO6XRWCY","created_at":"2026-05-18T12:33:24Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2019:PO6XRWCYBJRNYTBN3BX622ZIIX","target":"record","payload":{"canonical_record":{"source":{"id":"1906.09217","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IR","submitted_at":"2019-06-21T16:02:41Z","cross_cats_sorted":[],"title_canon_sha256":"f3f76c35c1b5370489723b454cc32ee6c0ba50f9fc940256b908a7d593bebfdc","abstract_canon_sha256":"e68623515dd7443e1255ab66049e83a26ecbb6bb3b393d08f814148c0e459341"},"schema_version":"1.0"},"canonical_sha256":"7bbd78d8580a62dc4c2dd86fed6b2845ed8bac93b87ad71be5993a18f8fa06f2","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:42:44.138428Z","signature_b64":"NxWS5kIZnVnyVLzBOpDgZ4PSfAVfi/Hwa2aWPIGu4rj+Jpnv1sfk951zM7kjrdEoU+4kC/llTnVrE3D8yXCnDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"7bbd78d8580a62dc4c2dd86fed6b2845ed8bac93b87ad71be5993a18f8fa06f2","last_reissued_at":"2026-05-17T23:42:44.137593Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:42:44.137593Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1906.09217","source_version":1,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-17T23:42:44Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"w8Hs7vMLqoJ6tPPR8YxFxSPkydO1s7jmbxAUW3JTXurrj85qiend+6t/yK5/zyqDx2tKzpilJAzPi3vDzL5bCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-09T00:45:17.562887Z"},"content_sha256":"c2ca34a2085b624afadbbd5770424c6162ed939054264f3219ea70ad21d60160","schema_version":"1.0","event_id":"sha256:c2ca34a2085b624afadbbd5770424c6162ed939054264f3219ea70ad21d60160"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2019:PO6XRWCYBJRNYTBN3BX622ZIIX","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Hierarchical Gating Networks for Sequential Recommendation","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.IR","authors_text":"Chen Ma, Peng Kang, Xue Liu","submitted_at":"2019-06-21T16:02:41Z","abstract_excerpt":"The chronological order of user-item interactions is a key feature in many recommender systems, where the items that users will interact may largely depend on those items that users just accessed recently. However, with the tremendous increase of users and items, sequential recommender systems still face several challenging problems: (1) the hardness of modeling the long-term user interests from sparse implicit feedback; (2) the difficulty of capturing the short-term user interests given several items the user just accessed. To cope with these challenges, we propose a hierarchical gating netwo"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1906.09217","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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-17T23:42:44Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"/npnlfY4wonkugeD2fsur16VqO2vc8874lkgR5wiuC2wFhgEoETNFuMN+QgV3xAwbYj5Acn9RXYFWljYc34BCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-09T00:45:17.563229Z"},"content_sha256":"87399a9fa704de2016559758feb9e36e7f75881369ec4e1a4bc342202838dc8f","schema_version":"1.0","event_id":"sha256:87399a9fa704de2016559758feb9e36e7f75881369ec4e1a4bc342202838dc8f"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/PO6XRWCYBJRNYTBN3BX622ZIIX/bundle.json","state_url":"https://pith.science/pith/PO6XRWCYBJRNYTBN3BX622ZIIX/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/PO6XRWCYBJRNYTBN3BX622ZIIX/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-06-09T00:45:17Z","links":{"resolver":"https://pith.science/pith/PO6XRWCYBJRNYTBN3BX622ZIIX","bundle":"https://pith.science/pith/PO6XRWCYBJRNYTBN3BX622ZIIX/bundle.json","state":"https://pith.science/pith/PO6XRWCYBJRNYTBN3BX622ZIIX/state.json","well_known_bundle":"https://pith.science/.well-known/pith/PO6XRWCYBJRNYTBN3BX622ZIIX/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2019:PO6XRWCYBJRNYTBN3BX622ZIIX","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"e68623515dd7443e1255ab66049e83a26ecbb6bb3b393d08f814148c0e459341","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IR","submitted_at":"2019-06-21T16:02:41Z","title_canon_sha256":"f3f76c35c1b5370489723b454cc32ee6c0ba50f9fc940256b908a7d593bebfdc"},"schema_version":"1.0","source":{"id":"1906.09217","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1906.09217","created_at":"2026-05-17T23:42:44Z"},{"alias_kind":"arxiv_version","alias_value":"1906.09217v1","created_at":"2026-05-17T23:42:44Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1906.09217","created_at":"2026-05-17T23:42:44Z"},{"alias_kind":"pith_short_12","alias_value":"PO6XRWCYBJRN","created_at":"2026-05-18T12:33:24Z"},{"alias_kind":"pith_short_16","alias_value":"PO6XRWCYBJRNYTBN","created_at":"2026-05-18T12:33:24Z"},{"alias_kind":"pith_short_8","alias_value":"PO6XRWCY","created_at":"2026-05-18T12:33:24Z"}],"graph_snapshots":[{"event_id":"sha256:87399a9fa704de2016559758feb9e36e7f75881369ec4e1a4bc342202838dc8f","target":"graph","created_at":"2026-05-17T23:42:44Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"paper":{"abstract_excerpt":"The chronological order of user-item interactions is a key feature in many recommender systems, where the items that users will interact may largely depend on those items that users just accessed recently. However, with the tremendous increase of users and items, sequential recommender systems still face several challenging problems: (1) the hardness of modeling the long-term user interests from sparse implicit feedback; (2) the difficulty of capturing the short-term user interests given several items the user just accessed. To cope with these challenges, we propose a hierarchical gating netwo","authors_text":"Chen Ma, Peng Kang, Xue Liu","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IR","submitted_at":"2019-06-21T16:02:41Z","title":"Hierarchical Gating Networks for Sequential Recommendation"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1906.09217","kind":"arxiv","version":1},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:c2ca34a2085b624afadbbd5770424c6162ed939054264f3219ea70ad21d60160","target":"record","created_at":"2026-05-17T23:42:44Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"e68623515dd7443e1255ab66049e83a26ecbb6bb3b393d08f814148c0e459341","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IR","submitted_at":"2019-06-21T16:02:41Z","title_canon_sha256":"f3f76c35c1b5370489723b454cc32ee6c0ba50f9fc940256b908a7d593bebfdc"},"schema_version":"1.0","source":{"id":"1906.09217","kind":"arxiv","version":1}},"canonical_sha256":"7bbd78d8580a62dc4c2dd86fed6b2845ed8bac93b87ad71be5993a18f8fa06f2","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"7bbd78d8580a62dc4c2dd86fed6b2845ed8bac93b87ad71be5993a18f8fa06f2","first_computed_at":"2026-05-17T23:42:44.137593Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:42:44.137593Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"NxWS5kIZnVnyVLzBOpDgZ4PSfAVfi/Hwa2aWPIGu4rj+Jpnv1sfk951zM7kjrdEoU+4kC/llTnVrE3D8yXCnDw==","signature_status":"signed_v1","signed_at":"2026-05-17T23:42:44.138428Z","signed_message":"canonical_sha256_bytes"},"source_id":"1906.09217","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:c2ca34a2085b624afadbbd5770424c6162ed939054264f3219ea70ad21d60160","sha256:87399a9fa704de2016559758feb9e36e7f75881369ec4e1a4bc342202838dc8f"],"state_sha256":"758f646227fb98e99e52f626905aadb0557be2ee8c7e356b413137384fc398b9"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"xl3bsE5hlGVaDBplM3pikLJ/mnT+DWaVVLOeqyjpxoYhggpanylR5w2XGytPC5CPSoSlBszNL6r8MMsZbBYHAA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-09T00:45:17.565159Z","bundle_sha256":"e9d068593a2aac092ba88babc65f806dc410114f77d536bf646f870e93c788d8"}}