{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:3HNS2DOI7CA7MD55YYPS26AFGD","short_pith_number":"pith:3HNS2DOI","canonical_record":{"source":{"id":"1711.05114","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IR","submitted_at":"2017-11-14T14:38:04Z","cross_cats_sorted":[],"title_canon_sha256":"23d9f27688348f1f8c09ac3abf29adaf20095dfe3bb748b9931b09571fa87794","abstract_canon_sha256":"9f54dc7a0398ae093d250c795c5d74449684da8c78eab4a5412ed2d109cf2eaa"},"schema_version":"1.0"},"canonical_sha256":"d9db2d0dc8f881f60fbdc61f2d780530dc1f0521b4961d8cc29efd5e1db5bd2e","source":{"kind":"arxiv","id":"1711.05114","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1711.05114","created_at":"2026-05-18T00:24:28Z"},{"alias_kind":"arxiv_version","alias_value":"1711.05114v3","created_at":"2026-05-18T00:24:28Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1711.05114","created_at":"2026-05-18T00:24:28Z"},{"alias_kind":"pith_short_12","alias_value":"3HNS2DOI7CA7","created_at":"2026-05-18T12:30:58Z"},{"alias_kind":"pith_short_16","alias_value":"3HNS2DOI7CA7MD55","created_at":"2026-05-18T12:30:58Z"},{"alias_kind":"pith_short_8","alias_value":"3HNS2DOI","created_at":"2026-05-18T12:30:58Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:3HNS2DOI7CA7MD55YYPS26AFGD","target":"record","payload":{"canonical_record":{"source":{"id":"1711.05114","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IR","submitted_at":"2017-11-14T14:38:04Z","cross_cats_sorted":[],"title_canon_sha256":"23d9f27688348f1f8c09ac3abf29adaf20095dfe3bb748b9931b09571fa87794","abstract_canon_sha256":"9f54dc7a0398ae093d250c795c5d74449684da8c78eab4a5412ed2d109cf2eaa"},"schema_version":"1.0"},"canonical_sha256":"d9db2d0dc8f881f60fbdc61f2d780530dc1f0521b4961d8cc29efd5e1db5bd2e","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:24:28.779922Z","signature_b64":"7rEuspPflZaLEYRSu5qqQ4hEwydl5rA2WFCRv8mLmMuREWSuGyRxDERvZi0qxYw4CHHFpwYycmDcjbhVD6K/AA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"d9db2d0dc8f881f60fbdc61f2d780530dc1f0521b4961d8cc29efd5e1db5bd2e","last_reissued_at":"2026-05-18T00:24:28.779403Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:24:28.779403Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1711.05114","source_version":3,"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-18T00:24:28Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"jIJGqPZ7LSgN3ErPvzucwOANonIHCVvNa1bAtLTuucoCiItyrEq5I+ngjBp3QFWoAZ1rnbHdmSM68ZIK0X8CCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T18:53:00.797936Z"},"content_sha256":"776374a32e1db34cbb26205e424e273b657c090be2a4bf348cdb1ce115b83b83","schema_version":"1.0","event_id":"sha256:776374a32e1db34cbb26205e424e273b657c090be2a4bf348cdb1ce115b83b83"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:3HNS2DOI7CA7MD55YYPS26AFGD","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"A Hierarchical Contextual Attention-based GRU Network for Sequential Recommendation","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.IR","authors_text":"Liang Wang, Qiang Cui, Shu Wu, Yan Huang","submitted_at":"2017-11-14T14:38:04Z","abstract_excerpt":"Sequential recommendation is one of fundamental tasks for Web applications. Previous methods are mostly based on Markov chains with a strong Markov assumption. Recently, recurrent neural networks (RNNs) are getting more and more popular and has demonstrated its effectiveness in many tasks. The last hidden state is usually applied as the sequence's representation to make recommendation. Benefit from the natural characteristics of RNN, the hidden state is a combination of long-term dependency and short-term interest to some degrees. However, the monotonic temporal dependency of RNN impairs the u"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1711.05114","kind":"arxiv","version":3},"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-18T00:24:28Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"vkqljd2mydZiIlmtg/SAD4CPY3smjLCWJ4totiLZl32Egu3srV88wxNqXvRgkSTdv3hnX54n2H3fXupPtkwUCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T18:53:00.798287Z"},"content_sha256":"2a5689abd86c532c61bfd5bedcb76cafd21fdfa707962d9c986d2ab61265e4fb","schema_version":"1.0","event_id":"sha256:2a5689abd86c532c61bfd5bedcb76cafd21fdfa707962d9c986d2ab61265e4fb"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/3HNS2DOI7CA7MD55YYPS26AFGD/bundle.json","state_url":"https://pith.science/pith/3HNS2DOI7CA7MD55YYPS26AFGD/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/3HNS2DOI7CA7MD55YYPS26AFGD/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-05-26T18:53:00Z","links":{"resolver":"https://pith.science/pith/3HNS2DOI7CA7MD55YYPS26AFGD","bundle":"https://pith.science/pith/3HNS2DOI7CA7MD55YYPS26AFGD/bundle.json","state":"https://pith.science/pith/3HNS2DOI7CA7MD55YYPS26AFGD/state.json","well_known_bundle":"https://pith.science/.well-known/pith/3HNS2DOI7CA7MD55YYPS26AFGD/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:3HNS2DOI7CA7MD55YYPS26AFGD","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":"9f54dc7a0398ae093d250c795c5d74449684da8c78eab4a5412ed2d109cf2eaa","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IR","submitted_at":"2017-11-14T14:38:04Z","title_canon_sha256":"23d9f27688348f1f8c09ac3abf29adaf20095dfe3bb748b9931b09571fa87794"},"schema_version":"1.0","source":{"id":"1711.05114","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1711.05114","created_at":"2026-05-18T00:24:28Z"},{"alias_kind":"arxiv_version","alias_value":"1711.05114v3","created_at":"2026-05-18T00:24:28Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1711.05114","created_at":"2026-05-18T00:24:28Z"},{"alias_kind":"pith_short_12","alias_value":"3HNS2DOI7CA7","created_at":"2026-05-18T12:30:58Z"},{"alias_kind":"pith_short_16","alias_value":"3HNS2DOI7CA7MD55","created_at":"2026-05-18T12:30:58Z"},{"alias_kind":"pith_short_8","alias_value":"3HNS2DOI","created_at":"2026-05-18T12:30:58Z"}],"graph_snapshots":[{"event_id":"sha256:2a5689abd86c532c61bfd5bedcb76cafd21fdfa707962d9c986d2ab61265e4fb","target":"graph","created_at":"2026-05-18T00:24:28Z","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":"Sequential recommendation is one of fundamental tasks for Web applications. Previous methods are mostly based on Markov chains with a strong Markov assumption. Recently, recurrent neural networks (RNNs) are getting more and more popular and has demonstrated its effectiveness in many tasks. The last hidden state is usually applied as the sequence's representation to make recommendation. Benefit from the natural characteristics of RNN, the hidden state is a combination of long-term dependency and short-term interest to some degrees. However, the monotonic temporal dependency of RNN impairs the u","authors_text":"Liang Wang, Qiang Cui, Shu Wu, Yan Huang","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IR","submitted_at":"2017-11-14T14:38:04Z","title":"A Hierarchical Contextual Attention-based GRU Network for Sequential Recommendation"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1711.05114","kind":"arxiv","version":3},"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:776374a32e1db34cbb26205e424e273b657c090be2a4bf348cdb1ce115b83b83","target":"record","created_at":"2026-05-18T00:24:28Z","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":"9f54dc7a0398ae093d250c795c5d74449684da8c78eab4a5412ed2d109cf2eaa","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IR","submitted_at":"2017-11-14T14:38:04Z","title_canon_sha256":"23d9f27688348f1f8c09ac3abf29adaf20095dfe3bb748b9931b09571fa87794"},"schema_version":"1.0","source":{"id":"1711.05114","kind":"arxiv","version":3}},"canonical_sha256":"d9db2d0dc8f881f60fbdc61f2d780530dc1f0521b4961d8cc29efd5e1db5bd2e","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"d9db2d0dc8f881f60fbdc61f2d780530dc1f0521b4961d8cc29efd5e1db5bd2e","first_computed_at":"2026-05-18T00:24:28.779403Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:24:28.779403Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"7rEuspPflZaLEYRSu5qqQ4hEwydl5rA2WFCRv8mLmMuREWSuGyRxDERvZi0qxYw4CHHFpwYycmDcjbhVD6K/AA==","signature_status":"signed_v1","signed_at":"2026-05-18T00:24:28.779922Z","signed_message":"canonical_sha256_bytes"},"source_id":"1711.05114","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:776374a32e1db34cbb26205e424e273b657c090be2a4bf348cdb1ce115b83b83","sha256:2a5689abd86c532c61bfd5bedcb76cafd21fdfa707962d9c986d2ab61265e4fb"],"state_sha256":"9d919dc4a24696369db8bbeadf6ff44fe85520e36e47b9f4c415470b5cb9b353"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"bcHK8EDIthmwud2jJX+6exu/CDnjZeysB39TUJJ8C9g66/23Y1+z3SJ1mJPJgqSfofDAT1hplUlRTePDqB5kAA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-26T18:53:00.800756Z","bundle_sha256":"c90087c3dbaafae73ef7ed77f9cbbf997719644566e8408c1ad7cf1b882333d9"}}