{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2019:CQCCBFLSPB6MMVR2Q54V5AVAOT","short_pith_number":"pith:CQCCBFLS","canonical_record":{"source":{"id":"1902.00245","kind":"arxiv","version":3},"metadata":{"license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","primary_cat":"cs.IR","submitted_at":"2019-02-01T09:34:08Z","cross_cats_sorted":[],"title_canon_sha256":"42ad14b68ec6d3fa41192d8b454a887f871ec0af7eba4ae30ee62e69da75cc46","abstract_canon_sha256":"6f39496168d9ac0e7b363cd656f12813f77c65cb44843a8599ddd9c877b01eff"},"schema_version":"1.0"},"canonical_sha256":"1404209572787cc6563a87795e82a074cb9e0e3c2c67e92f0fa434d35760db71","source":{"kind":"arxiv","id":"1902.00245","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1902.00245","created_at":"2026-05-17T23:42:42Z"},{"alias_kind":"arxiv_version","alias_value":"1902.00245v3","created_at":"2026-05-17T23:42:42Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1902.00245","created_at":"2026-05-17T23:42:42Z"},{"alias_kind":"pith_short_12","alias_value":"CQCCBFLSPB6M","created_at":"2026-05-18T12:33:15Z"},{"alias_kind":"pith_short_16","alias_value":"CQCCBFLSPB6MMVR2","created_at":"2026-05-18T12:33:15Z"},{"alias_kind":"pith_short_8","alias_value":"CQCCBFLS","created_at":"2026-05-18T12:33:15Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2019:CQCCBFLSPB6MMVR2Q54V5AVAOT","target":"record","payload":{"canonical_record":{"source":{"id":"1902.00245","kind":"arxiv","version":3},"metadata":{"license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","primary_cat":"cs.IR","submitted_at":"2019-02-01T09:34:08Z","cross_cats_sorted":[],"title_canon_sha256":"42ad14b68ec6d3fa41192d8b454a887f871ec0af7eba4ae30ee62e69da75cc46","abstract_canon_sha256":"6f39496168d9ac0e7b363cd656f12813f77c65cb44843a8599ddd9c877b01eff"},"schema_version":"1.0"},"canonical_sha256":"1404209572787cc6563a87795e82a074cb9e0e3c2c67e92f0fa434d35760db71","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:42:42.422672Z","signature_b64":"jCkAnChzEOFdvH+yJNRR40MsKeQTqvqIobjWZLRdFN8rU4KXdb3fMcW+9HDHx1e10q0lYMyNdUTvfECpGQNIDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"1404209572787cc6563a87795e82a074cb9e0e3c2c67e92f0fa434d35760db71","last_reissued_at":"2026-05-17T23:42:42.422130Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:42:42.422130Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1902.00245","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-17T23:42:42Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"4dUQ0EZrO/kxsa2TTTrIjvyMNCWeVrq7FdRxXnANE1QvhNEpXA/lCFsKbd5GSGXsl0VRoEeL5yheHUZNW2wJBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T05:52:13.770297Z"},"content_sha256":"dc63e5ac17f21eb7a7dbd6a62dfbf4542580c9f09731481202e95e00de684ca1","schema_version":"1.0","event_id":"sha256:dc63e5ac17f21eb7a7dbd6a62dfbf4542580c9f09731481202e95e00de684ca1"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2019:CQCCBFLSPB6MMVR2Q54V5AVAOT","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Sequential Evaluation and Generation Framework for Combinatorial Recommender System","license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.IR","authors_text":"Cihang Jin, Fan Wang, Hao Tian, Jiucheng Tao, Lihang Liu, Xiaomin Fang, Yaxue Chen, Zhiming Peng","submitted_at":"2019-02-01T09:34:08Z","abstract_excerpt":"In the combinatorial recommender systems, multiple items are fed to the user at one time in the result page, where the correlations among the items have impact on the user behavior. In this work, we model the combinatorial recommendation as the problem of generating a sequence(ordered list) of items from a candidate set, with the target of maximizing the expected overall utility(e.g. total clicks) of the sequence. Toward solving this problem, we propose the Evaluation-Generation framework. On the one hand of this framework, an evaluation model is trained to evaluate the expected overall utilit"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1902.00245","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-17T23:42:42Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"EAjeYGuIleEVp0IadXPzLZrroTIIPbJw/tdw945NlrIwWgkXk7/8Pm3WCxinFU1jmJUOhE0cghLdBuYajtiTAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T05:52:13.770984Z"},"content_sha256":"092138c48815c2a5b6aa62a793b98011dd855d74cf2575e5239d934eed8ce5e3","schema_version":"1.0","event_id":"sha256:092138c48815c2a5b6aa62a793b98011dd855d74cf2575e5239d934eed8ce5e3"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/CQCCBFLSPB6MMVR2Q54V5AVAOT/bundle.json","state_url":"https://pith.science/pith/CQCCBFLSPB6MMVR2Q54V5AVAOT/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/CQCCBFLSPB6MMVR2Q54V5AVAOT/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-30T05:52:13Z","links":{"resolver":"https://pith.science/pith/CQCCBFLSPB6MMVR2Q54V5AVAOT","bundle":"https://pith.science/pith/CQCCBFLSPB6MMVR2Q54V5AVAOT/bundle.json","state":"https://pith.science/pith/CQCCBFLSPB6MMVR2Q54V5AVAOT/state.json","well_known_bundle":"https://pith.science/.well-known/pith/CQCCBFLSPB6MMVR2Q54V5AVAOT/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2019:CQCCBFLSPB6MMVR2Q54V5AVAOT","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":"6f39496168d9ac0e7b363cd656f12813f77c65cb44843a8599ddd9c877b01eff","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","primary_cat":"cs.IR","submitted_at":"2019-02-01T09:34:08Z","title_canon_sha256":"42ad14b68ec6d3fa41192d8b454a887f871ec0af7eba4ae30ee62e69da75cc46"},"schema_version":"1.0","source":{"id":"1902.00245","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1902.00245","created_at":"2026-05-17T23:42:42Z"},{"alias_kind":"arxiv_version","alias_value":"1902.00245v3","created_at":"2026-05-17T23:42:42Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1902.00245","created_at":"2026-05-17T23:42:42Z"},{"alias_kind":"pith_short_12","alias_value":"CQCCBFLSPB6M","created_at":"2026-05-18T12:33:15Z"},{"alias_kind":"pith_short_16","alias_value":"CQCCBFLSPB6MMVR2","created_at":"2026-05-18T12:33:15Z"},{"alias_kind":"pith_short_8","alias_value":"CQCCBFLS","created_at":"2026-05-18T12:33:15Z"}],"graph_snapshots":[{"event_id":"sha256:092138c48815c2a5b6aa62a793b98011dd855d74cf2575e5239d934eed8ce5e3","target":"graph","created_at":"2026-05-17T23:42:42Z","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":"In the combinatorial recommender systems, multiple items are fed to the user at one time in the result page, where the correlations among the items have impact on the user behavior. In this work, we model the combinatorial recommendation as the problem of generating a sequence(ordered list) of items from a candidate set, with the target of maximizing the expected overall utility(e.g. total clicks) of the sequence. Toward solving this problem, we propose the Evaluation-Generation framework. On the one hand of this framework, an evaluation model is trained to evaluate the expected overall utilit","authors_text":"Cihang Jin, Fan Wang, Hao Tian, Jiucheng Tao, Lihang Liu, Xiaomin Fang, Yaxue Chen, Zhiming Peng","cross_cats":[],"headline":"","license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","primary_cat":"cs.IR","submitted_at":"2019-02-01T09:34:08Z","title":"Sequential Evaluation and Generation Framework for Combinatorial Recommender System"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1902.00245","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:dc63e5ac17f21eb7a7dbd6a62dfbf4542580c9f09731481202e95e00de684ca1","target":"record","created_at":"2026-05-17T23:42:42Z","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":"6f39496168d9ac0e7b363cd656f12813f77c65cb44843a8599ddd9c877b01eff","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","primary_cat":"cs.IR","submitted_at":"2019-02-01T09:34:08Z","title_canon_sha256":"42ad14b68ec6d3fa41192d8b454a887f871ec0af7eba4ae30ee62e69da75cc46"},"schema_version":"1.0","source":{"id":"1902.00245","kind":"arxiv","version":3}},"canonical_sha256":"1404209572787cc6563a87795e82a074cb9e0e3c2c67e92f0fa434d35760db71","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"1404209572787cc6563a87795e82a074cb9e0e3c2c67e92f0fa434d35760db71","first_computed_at":"2026-05-17T23:42:42.422130Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:42:42.422130Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"jCkAnChzEOFdvH+yJNRR40MsKeQTqvqIobjWZLRdFN8rU4KXdb3fMcW+9HDHx1e10q0lYMyNdUTvfECpGQNIDw==","signature_status":"signed_v1","signed_at":"2026-05-17T23:42:42.422672Z","signed_message":"canonical_sha256_bytes"},"source_id":"1902.00245","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:dc63e5ac17f21eb7a7dbd6a62dfbf4542580c9f09731481202e95e00de684ca1","sha256:092138c48815c2a5b6aa62a793b98011dd855d74cf2575e5239d934eed8ce5e3"],"state_sha256":"38c9441d6186ded1c2d5cfd7a165ab6d4fa5f679a0e379e78341cb4ad44d636b"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"RR28p7uV6fdkiiMSzMM4BO2fvYCJX1AwS8bp21DXo6shQI+0r3flDkH5iGjgIOoLJA1jyVIXaVebAKxQCrAEAQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-30T05:52:13.774109Z","bundle_sha256":"69247e5e0b8f6ccc9b0fd6b73eb88fc58424b4435a24d2d09db6d1f6c6f92163"}}