{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2013:SHHMKNBAGYQ2U47N5SDX3SF6YP","short_pith_number":"pith:SHHMKNBA","canonical_record":{"source":{"id":"1303.5250","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IR","submitted_at":"2013-03-21T13:11:24Z","cross_cats_sorted":[],"title_canon_sha256":"83de8dc3b7d205d90fdb5a5b8b9af2913e901b4ccf9538725eac7f934cd845b5","abstract_canon_sha256":"de529b77dec190abe8499ba95001341297f52161d74e973b0925506f0e511df5"},"schema_version":"1.0"},"canonical_sha256":"91cec534203621aa73edec877dc8bec3c3810cb3361bd624b3bf7e2667552616","source":{"kind":"arxiv","id":"1303.5250","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1303.5250","created_at":"2026-05-18T03:30:13Z"},{"alias_kind":"arxiv_version","alias_value":"1303.5250v1","created_at":"2026-05-18T03:30:13Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1303.5250","created_at":"2026-05-18T03:30:13Z"},{"alias_kind":"pith_short_12","alias_value":"SHHMKNBAGYQ2","created_at":"2026-05-18T12:27:59Z"},{"alias_kind":"pith_short_16","alias_value":"SHHMKNBAGYQ2U47N","created_at":"2026-05-18T12:27:59Z"},{"alias_kind":"pith_short_8","alias_value":"SHHMKNBA","created_at":"2026-05-18T12:27:59Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2013:SHHMKNBAGYQ2U47N5SDX3SF6YP","target":"record","payload":{"canonical_record":{"source":{"id":"1303.5250","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IR","submitted_at":"2013-03-21T13:11:24Z","cross_cats_sorted":[],"title_canon_sha256":"83de8dc3b7d205d90fdb5a5b8b9af2913e901b4ccf9538725eac7f934cd845b5","abstract_canon_sha256":"de529b77dec190abe8499ba95001341297f52161d74e973b0925506f0e511df5"},"schema_version":"1.0"},"canonical_sha256":"91cec534203621aa73edec877dc8bec3c3810cb3361bd624b3bf7e2667552616","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:30:13.442300Z","signature_b64":"4Qjs8n3Afi6hsot9WMTCTipzrcXDKfJrRKM3nt86z52UTm3YJkcox5z4x19LwUbO19MGx3GYVGW2g/1muqp6Dw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"91cec534203621aa73edec877dc8bec3c3810cb3361bd624b3bf7e2667552616","last_reissued_at":"2026-05-18T03:30:13.441562Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:30:13.441562Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1303.5250","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-18T03:30:13Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"L1JCa2Qx3ToZxizWtADOWkjLfa/rU4/W4SL01VNAg9iDQJpa1pLwo7PiXelOZPJ8nEdQpwL1k/1x7kgoEaXoCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-09T18:29:13.930635Z"},"content_sha256":"552c12958a01925988cfb5323b67cb0e5603e02ae726aee8d8f02ada1f3cd6b9","schema_version":"1.0","event_id":"sha256:552c12958a01925988cfb5323b67cb0e5603e02ae726aee8d8f02ada1f3cd6b9"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2013:SHHMKNBAGYQ2U47N5SDX3SF6YP","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Iterative Expectation for Multi Period Information Retrieval","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.IR","authors_text":"Jun Wang, Marc Sloan","submitted_at":"2013-03-21T13:11:24Z","abstract_excerpt":"Many Information Retrieval (IR) models make use of offline statistical techniques to score documents for ranking over a single period, rather than use an online, dynamic system that is responsive to users over time. In this paper, we explicitly formulate a general Multi Period Information Retrieval problem, where we consider retrieval as a stochastic yet controllable process. The ranking action during the process continuously controls the retrieval system's dynamics, and an optimal ranking policy is found in order to maximise the overall users' satisfaction over the multiple periods as much as"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1303.5250","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-18T03:30:13Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"YMUoz3IsSM4QizIF02k2HYgqcZe5U9BsJvSutu3PjsJFMZk9bUSe6CARbObw5W+YgM1pNWJZeyOJCarmkI9cBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-09T18:29:13.931395Z"},"content_sha256":"9273a8bdf01ddf2701a99fe5e7ae420b4dfd2a7aa3343514bb80eb96f03e968b","schema_version":"1.0","event_id":"sha256:9273a8bdf01ddf2701a99fe5e7ae420b4dfd2a7aa3343514bb80eb96f03e968b"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/SHHMKNBAGYQ2U47N5SDX3SF6YP/bundle.json","state_url":"https://pith.science/pith/SHHMKNBAGYQ2U47N5SDX3SF6YP/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/SHHMKNBAGYQ2U47N5SDX3SF6YP/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-09T18:29:13Z","links":{"resolver":"https://pith.science/pith/SHHMKNBAGYQ2U47N5SDX3SF6YP","bundle":"https://pith.science/pith/SHHMKNBAGYQ2U47N5SDX3SF6YP/bundle.json","state":"https://pith.science/pith/SHHMKNBAGYQ2U47N5SDX3SF6YP/state.json","well_known_bundle":"https://pith.science/.well-known/pith/SHHMKNBAGYQ2U47N5SDX3SF6YP/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2013:SHHMKNBAGYQ2U47N5SDX3SF6YP","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":"de529b77dec190abe8499ba95001341297f52161d74e973b0925506f0e511df5","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IR","submitted_at":"2013-03-21T13:11:24Z","title_canon_sha256":"83de8dc3b7d205d90fdb5a5b8b9af2913e901b4ccf9538725eac7f934cd845b5"},"schema_version":"1.0","source":{"id":"1303.5250","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1303.5250","created_at":"2026-05-18T03:30:13Z"},{"alias_kind":"arxiv_version","alias_value":"1303.5250v1","created_at":"2026-05-18T03:30:13Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1303.5250","created_at":"2026-05-18T03:30:13Z"},{"alias_kind":"pith_short_12","alias_value":"SHHMKNBAGYQ2","created_at":"2026-05-18T12:27:59Z"},{"alias_kind":"pith_short_16","alias_value":"SHHMKNBAGYQ2U47N","created_at":"2026-05-18T12:27:59Z"},{"alias_kind":"pith_short_8","alias_value":"SHHMKNBA","created_at":"2026-05-18T12:27:59Z"}],"graph_snapshots":[{"event_id":"sha256:9273a8bdf01ddf2701a99fe5e7ae420b4dfd2a7aa3343514bb80eb96f03e968b","target":"graph","created_at":"2026-05-18T03:30:13Z","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":"Many Information Retrieval (IR) models make use of offline statistical techniques to score documents for ranking over a single period, rather than use an online, dynamic system that is responsive to users over time. In this paper, we explicitly formulate a general Multi Period Information Retrieval problem, where we consider retrieval as a stochastic yet controllable process. The ranking action during the process continuously controls the retrieval system's dynamics, and an optimal ranking policy is found in order to maximise the overall users' satisfaction over the multiple periods as much as","authors_text":"Jun Wang, Marc Sloan","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IR","submitted_at":"2013-03-21T13:11:24Z","title":"Iterative Expectation for Multi Period Information Retrieval"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1303.5250","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:552c12958a01925988cfb5323b67cb0e5603e02ae726aee8d8f02ada1f3cd6b9","target":"record","created_at":"2026-05-18T03:30:13Z","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":"de529b77dec190abe8499ba95001341297f52161d74e973b0925506f0e511df5","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IR","submitted_at":"2013-03-21T13:11:24Z","title_canon_sha256":"83de8dc3b7d205d90fdb5a5b8b9af2913e901b4ccf9538725eac7f934cd845b5"},"schema_version":"1.0","source":{"id":"1303.5250","kind":"arxiv","version":1}},"canonical_sha256":"91cec534203621aa73edec877dc8bec3c3810cb3361bd624b3bf7e2667552616","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"91cec534203621aa73edec877dc8bec3c3810cb3361bd624b3bf7e2667552616","first_computed_at":"2026-05-18T03:30:13.441562Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:30:13.441562Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"4Qjs8n3Afi6hsot9WMTCTipzrcXDKfJrRKM3nt86z52UTm3YJkcox5z4x19LwUbO19MGx3GYVGW2g/1muqp6Dw==","signature_status":"signed_v1","signed_at":"2026-05-18T03:30:13.442300Z","signed_message":"canonical_sha256_bytes"},"source_id":"1303.5250","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:552c12958a01925988cfb5323b67cb0e5603e02ae726aee8d8f02ada1f3cd6b9","sha256:9273a8bdf01ddf2701a99fe5e7ae420b4dfd2a7aa3343514bb80eb96f03e968b"],"state_sha256":"2f490f3b1c09c6f44d25747105c90d7e296838e56d1760b5761becc55dae6ad6"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"PfzwsMqYlnePPHqqz+0Q1CRSO0qGoAbP5csApkBMd/2iXT0DHXGX7HbIoFtb3jX920bXblZCmgopr/B3Fm06AQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-09T18:29:13.935231Z","bundle_sha256":"dc3f58866ed990e6b671ff64d09473d5325c35c475f6b424ce73ac5f7044c753"}}