{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2019:D24LKMU23PFJYH5BIEOILQ63T6","short_pith_number":"pith:D24LKMU2","canonical_record":{"source":{"id":"1904.08030","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IR","submitted_at":"2019-04-17T00:39:24Z","cross_cats_sorted":["cs.LG","stat.ML"],"title_canon_sha256":"950a9d281848a7a7273b37fb1e79bdfbfc9203c819bc986077d66e05108f1de0","abstract_canon_sha256":"fcf8d494c25c27257567a5eeceed94dafbd415a684d68095c2eed3e1a13e3367"},"schema_version":"1.0"},"canonical_sha256":"1eb8b5329adbca9c1fa1411c85c3db9fb152c23d6b8f47683c3aef9e186858a8","source":{"kind":"arxiv","id":"1904.08030","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1904.08030","created_at":"2026-05-17T23:48:19Z"},{"alias_kind":"arxiv_version","alias_value":"1904.08030v1","created_at":"2026-05-17T23:48:19Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1904.08030","created_at":"2026-05-17T23:48:19Z"},{"alias_kind":"pith_short_12","alias_value":"D24LKMU23PFJ","created_at":"2026-05-18T12:33:15Z"},{"alias_kind":"pith_short_16","alias_value":"D24LKMU23PFJYH5B","created_at":"2026-05-18T12:33:15Z"},{"alias_kind":"pith_short_8","alias_value":"D24LKMU2","created_at":"2026-05-18T12:33:15Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2019:D24LKMU23PFJYH5BIEOILQ63T6","target":"record","payload":{"canonical_record":{"source":{"id":"1904.08030","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IR","submitted_at":"2019-04-17T00:39:24Z","cross_cats_sorted":["cs.LG","stat.ML"],"title_canon_sha256":"950a9d281848a7a7273b37fb1e79bdfbfc9203c819bc986077d66e05108f1de0","abstract_canon_sha256":"fcf8d494c25c27257567a5eeceed94dafbd415a684d68095c2eed3e1a13e3367"},"schema_version":"1.0"},"canonical_sha256":"1eb8b5329adbca9c1fa1411c85c3db9fb152c23d6b8f47683c3aef9e186858a8","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:48:19.013999Z","signature_b64":"ory2t3WbjvCBas7pMpIrfkOuZzLWaeSpsSeN9JDWCp9lIrAwYr2iUyJqUWr8ksMXjec9cNY6xvsbXgHgJzzeBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"1eb8b5329adbca9c1fa1411c85c3db9fb152c23d6b8f47683c3aef9e186858a8","last_reissued_at":"2026-05-17T23:48:19.013359Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:48:19.013359Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1904.08030","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:48:19Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"/aUjXW/scZdQ1CvelDJNWz/dhGiDE9d8VYKLWldWiGPDgK/plIDkNzXtkq8Cgp1mXq+0fJHGtICQl8q3dkJxDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-29T21:47:54.248191Z"},"content_sha256":"aad5690929b89af0785484b10205fe5c387b637c818217acab9efd45b7d8e0fd","schema_version":"1.0","event_id":"sha256:aad5690929b89af0785484b10205fe5c387b637c818217acab9efd45b7d8e0fd"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2019:D24LKMU23PFJYH5BIEOILQ63T6","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Multi-Interest Network with Dynamic Routing for Recommendation at Tmall","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG","stat.ML"],"primary_cat":"cs.IR","authors_text":"Chao Li, Dik Lun Lee, Guoliang Kang, Huan Zhao, Mengmeng Wu, Pipei Huang, Qiwei Chen, Wei Li, Yuchi Xu, Zhiyuan Liu","submitted_at":"2019-04-17T00:39:24Z","abstract_excerpt":"Industrial recommender systems usually consist of the matching stage and the ranking stage, in order to handle the billion-scale of users and items. The matching stage retrieves candidate items relevant to user interests, while the ranking stage sorts candidate items by user interests. Thus, the most critical ability is to model and represent user interests for either stage. Most of the existing deep learning-based models represent one user as a single vector which is insufficient to capture the varying nature of user's interests. In this paper, we approach this problem from a different view, "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1904.08030","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:48:19Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"/zJgA/rlQsqpUDjWHqsMEJxOTPHYQkZHpl4t1oh5Kevp4cVv+p5MnXbVtn11lirRPPs696KyT2j/cR8Sx/k4AA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-29T21:47:54.248867Z"},"content_sha256":"4290509cc6728dd53df9783e6a2c71485f1633d95b0c8da6fe5d1b2f037f0312","schema_version":"1.0","event_id":"sha256:4290509cc6728dd53df9783e6a2c71485f1633d95b0c8da6fe5d1b2f037f0312"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/D24LKMU23PFJYH5BIEOILQ63T6/bundle.json","state_url":"https://pith.science/pith/D24LKMU23PFJYH5BIEOILQ63T6/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/D24LKMU23PFJYH5BIEOILQ63T6/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-29T21:47:54Z","links":{"resolver":"https://pith.science/pith/D24LKMU23PFJYH5BIEOILQ63T6","bundle":"https://pith.science/pith/D24LKMU23PFJYH5BIEOILQ63T6/bundle.json","state":"https://pith.science/pith/D24LKMU23PFJYH5BIEOILQ63T6/state.json","well_known_bundle":"https://pith.science/.well-known/pith/D24LKMU23PFJYH5BIEOILQ63T6/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2019:D24LKMU23PFJYH5BIEOILQ63T6","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":"fcf8d494c25c27257567a5eeceed94dafbd415a684d68095c2eed3e1a13e3367","cross_cats_sorted":["cs.LG","stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IR","submitted_at":"2019-04-17T00:39:24Z","title_canon_sha256":"950a9d281848a7a7273b37fb1e79bdfbfc9203c819bc986077d66e05108f1de0"},"schema_version":"1.0","source":{"id":"1904.08030","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1904.08030","created_at":"2026-05-17T23:48:19Z"},{"alias_kind":"arxiv_version","alias_value":"1904.08030v1","created_at":"2026-05-17T23:48:19Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1904.08030","created_at":"2026-05-17T23:48:19Z"},{"alias_kind":"pith_short_12","alias_value":"D24LKMU23PFJ","created_at":"2026-05-18T12:33:15Z"},{"alias_kind":"pith_short_16","alias_value":"D24LKMU23PFJYH5B","created_at":"2026-05-18T12:33:15Z"},{"alias_kind":"pith_short_8","alias_value":"D24LKMU2","created_at":"2026-05-18T12:33:15Z"}],"graph_snapshots":[{"event_id":"sha256:4290509cc6728dd53df9783e6a2c71485f1633d95b0c8da6fe5d1b2f037f0312","target":"graph","created_at":"2026-05-17T23:48:19Z","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":"Industrial recommender systems usually consist of the matching stage and the ranking stage, in order to handle the billion-scale of users and items. The matching stage retrieves candidate items relevant to user interests, while the ranking stage sorts candidate items by user interests. Thus, the most critical ability is to model and represent user interests for either stage. Most of the existing deep learning-based models represent one user as a single vector which is insufficient to capture the varying nature of user's interests. In this paper, we approach this problem from a different view, ","authors_text":"Chao Li, Dik Lun Lee, Guoliang Kang, Huan Zhao, Mengmeng Wu, Pipei Huang, Qiwei Chen, Wei Li, Yuchi Xu, Zhiyuan Liu","cross_cats":["cs.LG","stat.ML"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IR","submitted_at":"2019-04-17T00:39:24Z","title":"Multi-Interest Network with Dynamic Routing for Recommendation at Tmall"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1904.08030","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:aad5690929b89af0785484b10205fe5c387b637c818217acab9efd45b7d8e0fd","target":"record","created_at":"2026-05-17T23:48:19Z","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":"fcf8d494c25c27257567a5eeceed94dafbd415a684d68095c2eed3e1a13e3367","cross_cats_sorted":["cs.LG","stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IR","submitted_at":"2019-04-17T00:39:24Z","title_canon_sha256":"950a9d281848a7a7273b37fb1e79bdfbfc9203c819bc986077d66e05108f1de0"},"schema_version":"1.0","source":{"id":"1904.08030","kind":"arxiv","version":1}},"canonical_sha256":"1eb8b5329adbca9c1fa1411c85c3db9fb152c23d6b8f47683c3aef9e186858a8","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"1eb8b5329adbca9c1fa1411c85c3db9fb152c23d6b8f47683c3aef9e186858a8","first_computed_at":"2026-05-17T23:48:19.013359Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:48:19.013359Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"ory2t3WbjvCBas7pMpIrfkOuZzLWaeSpsSeN9JDWCp9lIrAwYr2iUyJqUWr8ksMXjec9cNY6xvsbXgHgJzzeBQ==","signature_status":"signed_v1","signed_at":"2026-05-17T23:48:19.013999Z","signed_message":"canonical_sha256_bytes"},"source_id":"1904.08030","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:aad5690929b89af0785484b10205fe5c387b637c818217acab9efd45b7d8e0fd","sha256:4290509cc6728dd53df9783e6a2c71485f1633d95b0c8da6fe5d1b2f037f0312"],"state_sha256":"0c5405b1acfff2e27b6053bc1d9447594295ba5c752cd4fa3b752a8ce9c22247"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"vTQz2TtfiNHxILtTWI2wbY4d9el4tpRB1CMf0CxDYHxnh9dtflKLK/gL0lco/KchQl0J1fb0rXpor+0Yrep1CQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-29T21:47:54.251963Z","bundle_sha256":"ab25126d320a9e537812eee70dadfbb3f9a90d304b6722819b1e4a348935294b"}}