{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2014:W6FVUIT6Q4SDDAVEDIKE4HVZUN","short_pith_number":"pith:W6FVUIT6","schema_version":"1.0","canonical_sha256":"b78b5a227e87243182a41a144e1eb9a3605287a8042c9c5f94cd7bc65cc6dd0a","source":{"kind":"arxiv","id":"1407.7241","version":1},"attestation_state":"computed","paper":{"title":"Bandit problems with Levy processes","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.PR","authors_text":"Asaf Cohen, Eilon Solan","submitted_at":"2014-07-27T14:50:43Z","abstract_excerpt":"Bandit problems model the trade-off between exploration and exploitation in various decision problems. We study two-armed bandit problems in continuous time, where the risky arm can have two types: High or Low; both types yield stochastic payoffs generated by a Levy process. We show that the optimal strategy is a cut-off strategy and we provide an explicit expression for the cut-off and for the optimal payoff."},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"canonical_record":{"source":{"id":"1407.7241","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2014-07-27T14:50:43Z","cross_cats_sorted":[],"title_canon_sha256":"43a90ec8ab99a09c197712e88d99ac26c5de9eb9bf133d416329bf0e9986d998","abstract_canon_sha256":"0874558652e041a58a8fdcd24b1c3df509cb40e4567719d3eda8d12755a50bf1"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:34:59.660216Z","signature_b64":"5FSg+nIGb0TKeZqJI3BIBY2tFpVB0jkT27UmckNk6D9J0Ib7t/dPP+NXfF4il2vmmUhQYxgKfS3D5z9nchHlDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"b78b5a227e87243182a41a144e1eb9a3605287a8042c9c5f94cd7bc65cc6dd0a","last_reissued_at":"2026-05-18T01:34:59.659453Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:34:59.659453Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Bandit problems with Levy processes","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.PR","authors_text":"Asaf Cohen, Eilon Solan","submitted_at":"2014-07-27T14:50:43Z","abstract_excerpt":"Bandit problems model the trade-off between exploration and exploitation in various decision problems. We study two-armed bandit problems in continuous time, where the risky arm can have two types: High or Low; both types yield stochastic payoffs generated by a Levy process. We show that the optimal strategy is a cut-off strategy and we provide an explicit expression for the cut-off and for the optimal payoff."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1407.7241","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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1407.7241","created_at":"2026-05-18T01:34:59.659573+00:00"},{"alias_kind":"arxiv_version","alias_value":"1407.7241v1","created_at":"2026-05-18T01:34:59.659573+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1407.7241","created_at":"2026-05-18T01:34:59.659573+00:00"},{"alias_kind":"pith_short_12","alias_value":"W6FVUIT6Q4SD","created_at":"2026-05-18T12:28:54.890064+00:00"},{"alias_kind":"pith_short_16","alias_value":"W6FVUIT6Q4SDDAVE","created_at":"2026-05-18T12:28:54.890064+00:00"},{"alias_kind":"pith_short_8","alias_value":"W6FVUIT6","created_at":"2026-05-18T12:28:54.890064+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/W6FVUIT6Q4SDDAVEDIKE4HVZUN","json":"https://pith.science/pith/W6FVUIT6Q4SDDAVEDIKE4HVZUN.json","graph_json":"https://pith.science/api/pith-number/W6FVUIT6Q4SDDAVEDIKE4HVZUN/graph.json","events_json":"https://pith.science/api/pith-number/W6FVUIT6Q4SDDAVEDIKE4HVZUN/events.json","paper":"https://pith.science/paper/W6FVUIT6"},"agent_actions":{"view_html":"https://pith.science/pith/W6FVUIT6Q4SDDAVEDIKE4HVZUN","download_json":"https://pith.science/pith/W6FVUIT6Q4SDDAVEDIKE4HVZUN.json","view_paper":"https://pith.science/paper/W6FVUIT6","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1407.7241&json=true","fetch_graph":"https://pith.science/api/pith-number/W6FVUIT6Q4SDDAVEDIKE4HVZUN/graph.json","fetch_events":"https://pith.science/api/pith-number/W6FVUIT6Q4SDDAVEDIKE4HVZUN/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/W6FVUIT6Q4SDDAVEDIKE4HVZUN/action/timestamp_anchor","attest_storage":"https://pith.science/pith/W6FVUIT6Q4SDDAVEDIKE4HVZUN/action/storage_attestation","attest_author":"https://pith.science/pith/W6FVUIT6Q4SDDAVEDIKE4HVZUN/action/author_attestation","sign_citation":"https://pith.science/pith/W6FVUIT6Q4SDDAVEDIKE4HVZUN/action/citation_signature","submit_replication":"https://pith.science/pith/W6FVUIT6Q4SDDAVEDIKE4HVZUN/action/replication_record"}},"created_at":"2026-05-18T01:34:59.659573+00:00","updated_at":"2026-05-18T01:34:59.659573+00:00"}