{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:BU5DMI3SQGJHTJ2QX2WXQT43HN","short_pith_number":"pith:BU5DMI3S","canonical_record":{"source":{"id":"1802.08401","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IR","submitted_at":"2018-02-23T06:08:28Z","cross_cats_sorted":[],"title_canon_sha256":"f95e25d0c6aeb46c5658f976699f88eb5efc6a283c0992c0d77e1aedf9729eeb","abstract_canon_sha256":"f012c31596215ec1f398629330441fee12967e8db3b2a2908a1ffa33381a56db"},"schema_version":"1.0"},"canonical_sha256":"0d3a362372819279a750bead784f9b3b627d962badbc2b96a3bb261f321ca3c9","source":{"kind":"arxiv","id":"1802.08401","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1802.08401","created_at":"2026-05-18T00:22:43Z"},{"alias_kind":"arxiv_version","alias_value":"1802.08401v1","created_at":"2026-05-18T00:22:43Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1802.08401","created_at":"2026-05-18T00:22:43Z"},{"alias_kind":"pith_short_12","alias_value":"BU5DMI3SQGJH","created_at":"2026-05-18T12:32:16Z"},{"alias_kind":"pith_short_16","alias_value":"BU5DMI3SQGJHTJ2Q","created_at":"2026-05-18T12:32:16Z"},{"alias_kind":"pith_short_8","alias_value":"BU5DMI3S","created_at":"2026-05-18T12:32:16Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:BU5DMI3SQGJHTJ2QX2WXQT43HN","target":"record","payload":{"canonical_record":{"source":{"id":"1802.08401","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IR","submitted_at":"2018-02-23T06:08:28Z","cross_cats_sorted":[],"title_canon_sha256":"f95e25d0c6aeb46c5658f976699f88eb5efc6a283c0992c0d77e1aedf9729eeb","abstract_canon_sha256":"f012c31596215ec1f398629330441fee12967e8db3b2a2908a1ffa33381a56db"},"schema_version":"1.0"},"canonical_sha256":"0d3a362372819279a750bead784f9b3b627d962badbc2b96a3bb261f321ca3c9","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:22:43.823898Z","signature_b64":"+cXkvQ4svXf7D9oF3W3nR/ek0Ur3+kvmzxcjh2AMYKkAMl2X1E8AojHgMDrAntDfWPUdbXRLapEDzISulvfgAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"0d3a362372819279a750bead784f9b3b627d962badbc2b96a3bb261f321ca3c9","last_reissued_at":"2026-05-18T00:22:43.823433Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:22:43.823433Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1802.08401","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-18T00:22:43Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"o9JgZ/kXxv4JaWvTMlH1Led143Rz69ZktaRhy4MAJzyaZN5Lmg+iUAm6LOfh3uDGlKJEU3kd05NrM5F5IjRHCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-25T21:53:21.623026Z"},"content_sha256":"81a5c6903175977adab0aa5355de8ed74ee7a8d2590d39607fccf5864099700c","schema_version":"1.0","event_id":"sha256:81a5c6903175977adab0aa5355de8ed74ee7a8d2590d39607fccf5864099700c"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:BU5DMI3SQGJHTJ2QX2WXQT43HN","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Novel Approaches to Accelerating the Convergence Rate of Markov Decision Process for Search Result Diversification","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.IR","authors_text":"Feng Liu, Huifeng Guo, Ruiming Tang, Xiuqiang He, Xutao Li, Yunming Ye","submitted_at":"2018-02-23T06:08:28Z","abstract_excerpt":"Recently, some studies have utilized the Markov Decision Process for diversifying (MDP-DIV) the search results in information retrieval. Though promising performances can be delivered, MDP-DIV suffers from a very slow convergence, which hinders its usability in real applications. In this paper, we aim to promote the performance of MDP-DIV by speeding up the convergence rate without much accuracy sacrifice. The slow convergence is incurred by two main reasons: the large action space and data scarcity. On the one hand, the sequential decision making at each position needs to evaluate the query-d"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1802.08401","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-18T00:22:43Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"uf9VmN4t2/nbm1yQP6/QueHg4AWNa7udpwS35W9b/5KEUSR15v5sfzTxlovlEBco7l0K22NrBdNY3GnzlszrBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-25T21:53:21.623412Z"},"content_sha256":"85a6bcfc199946d21e0ec5aafa220ecfe7514bf49683eeb78c10b24dbd29f22d","schema_version":"1.0","event_id":"sha256:85a6bcfc199946d21e0ec5aafa220ecfe7514bf49683eeb78c10b24dbd29f22d"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/BU5DMI3SQGJHTJ2QX2WXQT43HN/bundle.json","state_url":"https://pith.science/pith/BU5DMI3SQGJHTJ2QX2WXQT43HN/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/BU5DMI3SQGJHTJ2QX2WXQT43HN/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-25T21:53:21Z","links":{"resolver":"https://pith.science/pith/BU5DMI3SQGJHTJ2QX2WXQT43HN","bundle":"https://pith.science/pith/BU5DMI3SQGJHTJ2QX2WXQT43HN/bundle.json","state":"https://pith.science/pith/BU5DMI3SQGJHTJ2QX2WXQT43HN/state.json","well_known_bundle":"https://pith.science/.well-known/pith/BU5DMI3SQGJHTJ2QX2WXQT43HN/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:BU5DMI3SQGJHTJ2QX2WXQT43HN","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":"f012c31596215ec1f398629330441fee12967e8db3b2a2908a1ffa33381a56db","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IR","submitted_at":"2018-02-23T06:08:28Z","title_canon_sha256":"f95e25d0c6aeb46c5658f976699f88eb5efc6a283c0992c0d77e1aedf9729eeb"},"schema_version":"1.0","source":{"id":"1802.08401","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1802.08401","created_at":"2026-05-18T00:22:43Z"},{"alias_kind":"arxiv_version","alias_value":"1802.08401v1","created_at":"2026-05-18T00:22:43Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1802.08401","created_at":"2026-05-18T00:22:43Z"},{"alias_kind":"pith_short_12","alias_value":"BU5DMI3SQGJH","created_at":"2026-05-18T12:32:16Z"},{"alias_kind":"pith_short_16","alias_value":"BU5DMI3SQGJHTJ2Q","created_at":"2026-05-18T12:32:16Z"},{"alias_kind":"pith_short_8","alias_value":"BU5DMI3S","created_at":"2026-05-18T12:32:16Z"}],"graph_snapshots":[{"event_id":"sha256:85a6bcfc199946d21e0ec5aafa220ecfe7514bf49683eeb78c10b24dbd29f22d","target":"graph","created_at":"2026-05-18T00:22:43Z","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":"Recently, some studies have utilized the Markov Decision Process for diversifying (MDP-DIV) the search results in information retrieval. Though promising performances can be delivered, MDP-DIV suffers from a very slow convergence, which hinders its usability in real applications. In this paper, we aim to promote the performance of MDP-DIV by speeding up the convergence rate without much accuracy sacrifice. The slow convergence is incurred by two main reasons: the large action space and data scarcity. On the one hand, the sequential decision making at each position needs to evaluate the query-d","authors_text":"Feng Liu, Huifeng Guo, Ruiming Tang, Xiuqiang He, Xutao Li, Yunming Ye","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IR","submitted_at":"2018-02-23T06:08:28Z","title":"Novel Approaches to Accelerating the Convergence Rate of Markov Decision Process for Search Result Diversification"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1802.08401","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:81a5c6903175977adab0aa5355de8ed74ee7a8d2590d39607fccf5864099700c","target":"record","created_at":"2026-05-18T00:22:43Z","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":"f012c31596215ec1f398629330441fee12967e8db3b2a2908a1ffa33381a56db","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IR","submitted_at":"2018-02-23T06:08:28Z","title_canon_sha256":"f95e25d0c6aeb46c5658f976699f88eb5efc6a283c0992c0d77e1aedf9729eeb"},"schema_version":"1.0","source":{"id":"1802.08401","kind":"arxiv","version":1}},"canonical_sha256":"0d3a362372819279a750bead784f9b3b627d962badbc2b96a3bb261f321ca3c9","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"0d3a362372819279a750bead784f9b3b627d962badbc2b96a3bb261f321ca3c9","first_computed_at":"2026-05-18T00:22:43.823433Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:22:43.823433Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"+cXkvQ4svXf7D9oF3W3nR/ek0Ur3+kvmzxcjh2AMYKkAMl2X1E8AojHgMDrAntDfWPUdbXRLapEDzISulvfgAw==","signature_status":"signed_v1","signed_at":"2026-05-18T00:22:43.823898Z","signed_message":"canonical_sha256_bytes"},"source_id":"1802.08401","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:81a5c6903175977adab0aa5355de8ed74ee7a8d2590d39607fccf5864099700c","sha256:85a6bcfc199946d21e0ec5aafa220ecfe7514bf49683eeb78c10b24dbd29f22d"],"state_sha256":"705f3f4a1b13d5d0b996d079ec6fa99093a5b851f6e018573280082ccff76dd9"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"45bM50iAJKO4IW2G5bMOpo+11q/eLJzFK8oN+hyNn25JmrPfI7RiXNYpn4TUHTKEBNL976yvZD61Vjp8CDhvDA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-25T21:53:21.626527Z","bundle_sha256":"355fcbe2fdd5fb9ce04522ef941789a7c038b7e66b42f1d64f5a9a121a6a80f6"}}