{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:THUIC36KRXDDKQQZPBM75KZJQY","short_pith_number":"pith:THUIC36K","canonical_record":{"source":{"id":"1712.00524","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SY","submitted_at":"2017-12-02T00:07:14Z","cross_cats_sorted":[],"title_canon_sha256":"51609eebef92f69fda865ba206d83c02c6cf72cc8a8dcb0234a590abf60014dc","abstract_canon_sha256":"99e1ba4e6a57636752283da22a978925a42adfd87de810ca93c77083d7193457"},"schema_version":"1.0"},"canonical_sha256":"99e8816fca8dc63542197859feab29863d3bec4b01fb82c0beb11c5573a1befc","source":{"kind":"arxiv","id":"1712.00524","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1712.00524","created_at":"2026-05-18T00:29:05Z"},{"alias_kind":"arxiv_version","alias_value":"1712.00524v1","created_at":"2026-05-18T00:29:05Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1712.00524","created_at":"2026-05-18T00:29:05Z"},{"alias_kind":"pith_short_12","alias_value":"THUIC36KRXDD","created_at":"2026-05-18T12:31:46Z"},{"alias_kind":"pith_short_16","alias_value":"THUIC36KRXDDKQQZ","created_at":"2026-05-18T12:31:46Z"},{"alias_kind":"pith_short_8","alias_value":"THUIC36K","created_at":"2026-05-18T12:31:46Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:THUIC36KRXDDKQQZPBM75KZJQY","target":"record","payload":{"canonical_record":{"source":{"id":"1712.00524","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SY","submitted_at":"2017-12-02T00:07:14Z","cross_cats_sorted":[],"title_canon_sha256":"51609eebef92f69fda865ba206d83c02c6cf72cc8a8dcb0234a590abf60014dc","abstract_canon_sha256":"99e1ba4e6a57636752283da22a978925a42adfd87de810ca93c77083d7193457"},"schema_version":"1.0"},"canonical_sha256":"99e8816fca8dc63542197859feab29863d3bec4b01fb82c0beb11c5573a1befc","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:29:05.009136Z","signature_b64":"UiSCjFOHOqaqniwqn+XKbx0fsAsqYaJ2y2gFDxKQ12nsTO7/Q3sgW21aiuCmoTtxfzkeV07c+nPyY1xMIVYJDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"99e8816fca8dc63542197859feab29863d3bec4b01fb82c0beb11c5573a1befc","last_reissued_at":"2026-05-18T00:29:05.008430Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:29:05.008430Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1712.00524","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:29:05Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"2XqpPs2f/oxOeqJ0ApSlwTfvywq503g3xVOQ9zU0cuzj6rss9rkTJCMKltiIjagni/mDodds5gUJ9zaC7zCgAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T00:39:39.478840Z"},"content_sha256":"beebb45e9c9a8e7ca4ada2ebc333a4c3044f8c57813dd60d069569116cd8e435","schema_version":"1.0","event_id":"sha256:beebb45e9c9a8e7ca4ada2ebc333a4c3044f8c57813dd60d069569116cd8e435"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:THUIC36KRXDDKQQZPBM75KZJQY","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Multiple Stopping Time POMDPs: Structural Results & Application in Interactive Advertising in Social Media","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.SY","authors_text":"Anup Aprem, Sujay Bhatt, Vikram Krishnamurthy","submitted_at":"2017-12-02T00:07:14Z","abstract_excerpt":"This paper considers a multiple stopping time problem for a Markov chain observed in noise, where a decision maker chooses at most L stopping times to maximize a cumulative objective. We formulate the problem as a Partially Observed Markov Decision Process (POMDP) and derive structural results for the optimal multiple stopping policy. The main results are as follows: i) The optimal multiple stopping policy is shown to be characterized by threshold curves in the unit simplex of Bayesian Posteriors. ii) The stopping setsl (defined by the threshold curves) are shown to exhibit a nested structure."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1712.00524","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:29:05Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"LACXkgnuSP6lpsBTweGphEQd7SUmZK1mUulG9zp8paV4/1jB5Ru0pQhf/GQts8EsKk27OjYcnTi0GzRkI0hKBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T00:39:39.479262Z"},"content_sha256":"d3dd036bc6ef3880ab0149c78f416f60414e1cfe08a430601a8a22af726e5d2d","schema_version":"1.0","event_id":"sha256:d3dd036bc6ef3880ab0149c78f416f60414e1cfe08a430601a8a22af726e5d2d"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/THUIC36KRXDDKQQZPBM75KZJQY/bundle.json","state_url":"https://pith.science/pith/THUIC36KRXDDKQQZPBM75KZJQY/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/THUIC36KRXDDKQQZPBM75KZJQY/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-26T00:39:39Z","links":{"resolver":"https://pith.science/pith/THUIC36KRXDDKQQZPBM75KZJQY","bundle":"https://pith.science/pith/THUIC36KRXDDKQQZPBM75KZJQY/bundle.json","state":"https://pith.science/pith/THUIC36KRXDDKQQZPBM75KZJQY/state.json","well_known_bundle":"https://pith.science/.well-known/pith/THUIC36KRXDDKQQZPBM75KZJQY/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:THUIC36KRXDDKQQZPBM75KZJQY","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":"99e1ba4e6a57636752283da22a978925a42adfd87de810ca93c77083d7193457","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SY","submitted_at":"2017-12-02T00:07:14Z","title_canon_sha256":"51609eebef92f69fda865ba206d83c02c6cf72cc8a8dcb0234a590abf60014dc"},"schema_version":"1.0","source":{"id":"1712.00524","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1712.00524","created_at":"2026-05-18T00:29:05Z"},{"alias_kind":"arxiv_version","alias_value":"1712.00524v1","created_at":"2026-05-18T00:29:05Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1712.00524","created_at":"2026-05-18T00:29:05Z"},{"alias_kind":"pith_short_12","alias_value":"THUIC36KRXDD","created_at":"2026-05-18T12:31:46Z"},{"alias_kind":"pith_short_16","alias_value":"THUIC36KRXDDKQQZ","created_at":"2026-05-18T12:31:46Z"},{"alias_kind":"pith_short_8","alias_value":"THUIC36K","created_at":"2026-05-18T12:31:46Z"}],"graph_snapshots":[{"event_id":"sha256:d3dd036bc6ef3880ab0149c78f416f60414e1cfe08a430601a8a22af726e5d2d","target":"graph","created_at":"2026-05-18T00:29:05Z","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":"This paper considers a multiple stopping time problem for a Markov chain observed in noise, where a decision maker chooses at most L stopping times to maximize a cumulative objective. We formulate the problem as a Partially Observed Markov Decision Process (POMDP) and derive structural results for the optimal multiple stopping policy. The main results are as follows: i) The optimal multiple stopping policy is shown to be characterized by threshold curves in the unit simplex of Bayesian Posteriors. ii) The stopping setsl (defined by the threshold curves) are shown to exhibit a nested structure.","authors_text":"Anup Aprem, Sujay Bhatt, Vikram Krishnamurthy","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SY","submitted_at":"2017-12-02T00:07:14Z","title":"Multiple Stopping Time POMDPs: Structural Results & Application in Interactive Advertising in Social Media"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1712.00524","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:beebb45e9c9a8e7ca4ada2ebc333a4c3044f8c57813dd60d069569116cd8e435","target":"record","created_at":"2026-05-18T00:29:05Z","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":"99e1ba4e6a57636752283da22a978925a42adfd87de810ca93c77083d7193457","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SY","submitted_at":"2017-12-02T00:07:14Z","title_canon_sha256":"51609eebef92f69fda865ba206d83c02c6cf72cc8a8dcb0234a590abf60014dc"},"schema_version":"1.0","source":{"id":"1712.00524","kind":"arxiv","version":1}},"canonical_sha256":"99e8816fca8dc63542197859feab29863d3bec4b01fb82c0beb11c5573a1befc","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"99e8816fca8dc63542197859feab29863d3bec4b01fb82c0beb11c5573a1befc","first_computed_at":"2026-05-18T00:29:05.008430Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:29:05.008430Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"UiSCjFOHOqaqniwqn+XKbx0fsAsqYaJ2y2gFDxKQ12nsTO7/Q3sgW21aiuCmoTtxfzkeV07c+nPyY1xMIVYJDg==","signature_status":"signed_v1","signed_at":"2026-05-18T00:29:05.009136Z","signed_message":"canonical_sha256_bytes"},"source_id":"1712.00524","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:beebb45e9c9a8e7ca4ada2ebc333a4c3044f8c57813dd60d069569116cd8e435","sha256:d3dd036bc6ef3880ab0149c78f416f60414e1cfe08a430601a8a22af726e5d2d"],"state_sha256":"380c96abc1aa1bcdfa00623ca7e66b5f7827499eeecac3a5f2958904c5b9f0bd"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"9CnFltItVhniy3oc8EyurIbKmSNt56X4DV1RKABfTqX/N9XwT+yk7PWcH8azaMbuzRxt6W3HZMsBU7nptGfrBQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-26T00:39:39.481609Z","bundle_sha256":"d70020d048a5f5e61bcd5ba4ae4fefd9c9408be264387eee5f9f5cb6321732a5"}}