{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:7MUHTWWBPYOW7WGLKFYPRWNEIZ","short_pith_number":"pith:7MUHTWWB","canonical_record":{"source":{"id":"1512.07638","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2015-12-23T21:05:16Z","cross_cats_sorted":["math.OC","stat.ML"],"title_canon_sha256":"089cbd551def94408eba52dfa2425e36886a490b1e713aeddc1c06a0ac8f91dc","abstract_canon_sha256":"37ff7ee2c0937c8eab7c693c68ed679710ac2e1d67f2f07f39f7b132464351fd"},"schema_version":"1.0"},"canonical_sha256":"fb2879dac17e1d6fd8cb5170f8d9a44643ebfd1e9bf783aeb2a534012e48ebc8","source":{"kind":"arxiv","id":"1512.07638","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1512.07638","created_at":"2026-05-18T00:54:42Z"},{"alias_kind":"arxiv_version","alias_value":"1512.07638v2","created_at":"2026-05-18T00:54:42Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1512.07638","created_at":"2026-05-18T00:54:42Z"},{"alias_kind":"pith_short_12","alias_value":"7MUHTWWBPYOW","created_at":"2026-05-18T12:29:10Z"},{"alias_kind":"pith_short_16","alias_value":"7MUHTWWBPYOW7WGL","created_at":"2026-05-18T12:29:10Z"},{"alias_kind":"pith_short_8","alias_value":"7MUHTWWB","created_at":"2026-05-18T12:29:10Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:7MUHTWWBPYOW7WGLKFYPRWNEIZ","target":"record","payload":{"canonical_record":{"source":{"id":"1512.07638","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2015-12-23T21:05:16Z","cross_cats_sorted":["math.OC","stat.ML"],"title_canon_sha256":"089cbd551def94408eba52dfa2425e36886a490b1e713aeddc1c06a0ac8f91dc","abstract_canon_sha256":"37ff7ee2c0937c8eab7c693c68ed679710ac2e1d67f2f07f39f7b132464351fd"},"schema_version":"1.0"},"canonical_sha256":"fb2879dac17e1d6fd8cb5170f8d9a44643ebfd1e9bf783aeb2a534012e48ebc8","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:54:42.783721Z","signature_b64":"e1nA4WYlYLtJWZDGFVVrAvnA0cz5SU713+U9MWTqaG7HDIFQj8p7LaCs5oNulSsi012lJImbOTnZbJAlA0zBCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"fb2879dac17e1d6fd8cb5170f8d9a44643ebfd1e9bf783aeb2a534012e48ebc8","last_reissued_at":"2026-05-18T00:54:42.783310Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:54:42.783310Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1512.07638","source_version":2,"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:54:42Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"rns7dLgxWJf6NX4qMgipewRMrwY2rKx+b1vJV02auaiPn1N/qaEUXHXlJ14+FbFWpTlSKfRSJ6u0xBoN2/MCBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T23:00:30.850717Z"},"content_sha256":"289e3dd3f8ebcade6fc3a1249b3292ff385b063bafa49c6f2a94f78b4c4f997b","schema_version":"1.0","event_id":"sha256:289e3dd3f8ebcade6fc3a1249b3292ff385b063bafa49c6f2a94f78b4c4f997b"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:7MUHTWWBPYOW7WGLKFYPRWNEIZ","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Satisficing in multi-armed bandit problems","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.OC","stat.ML"],"primary_cat":"cs.LG","authors_text":"Naomi Ehrich Leonard, Paul Reverdy, Vaibhav Srivastava","submitted_at":"2015-12-23T21:05:16Z","abstract_excerpt":"Satisficing is a relaxation of maximizing and allows for less risky decision making in the face of uncertainty. We propose two sets of satisficing objectives for the multi-armed bandit problem, where the objective is to achieve reward-based decision-making performance above a given threshold. We show that these new problems are equivalent to various standard multi-armed bandit problems with maximizing objectives and use the equivalence to find bounds on performance. The different objectives can result in qualitatively different behavior; for example, agents explore their options continually in"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1512.07638","kind":"arxiv","version":2},"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:54:42Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ihHe8uAJIvEdaT8e+Nk4j/WF+VPO4EDX/nH1TQVmhuo9Ep8AEDdnhv92fuc3gVAIUB+tL8ziIWADNIop/0e1Bg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T23:00:30.851064Z"},"content_sha256":"c663d0790ace653b7739f29aea4b22bbb9b1adf8c537cd5f7ea91d6aabc6bde8","schema_version":"1.0","event_id":"sha256:c663d0790ace653b7739f29aea4b22bbb9b1adf8c537cd5f7ea91d6aabc6bde8"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/7MUHTWWBPYOW7WGLKFYPRWNEIZ/bundle.json","state_url":"https://pith.science/pith/7MUHTWWBPYOW7WGLKFYPRWNEIZ/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/7MUHTWWBPYOW7WGLKFYPRWNEIZ/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-28T23:00:30Z","links":{"resolver":"https://pith.science/pith/7MUHTWWBPYOW7WGLKFYPRWNEIZ","bundle":"https://pith.science/pith/7MUHTWWBPYOW7WGLKFYPRWNEIZ/bundle.json","state":"https://pith.science/pith/7MUHTWWBPYOW7WGLKFYPRWNEIZ/state.json","well_known_bundle":"https://pith.science/.well-known/pith/7MUHTWWBPYOW7WGLKFYPRWNEIZ/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:7MUHTWWBPYOW7WGLKFYPRWNEIZ","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":"37ff7ee2c0937c8eab7c693c68ed679710ac2e1d67f2f07f39f7b132464351fd","cross_cats_sorted":["math.OC","stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2015-12-23T21:05:16Z","title_canon_sha256":"089cbd551def94408eba52dfa2425e36886a490b1e713aeddc1c06a0ac8f91dc"},"schema_version":"1.0","source":{"id":"1512.07638","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1512.07638","created_at":"2026-05-18T00:54:42Z"},{"alias_kind":"arxiv_version","alias_value":"1512.07638v2","created_at":"2026-05-18T00:54:42Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1512.07638","created_at":"2026-05-18T00:54:42Z"},{"alias_kind":"pith_short_12","alias_value":"7MUHTWWBPYOW","created_at":"2026-05-18T12:29:10Z"},{"alias_kind":"pith_short_16","alias_value":"7MUHTWWBPYOW7WGL","created_at":"2026-05-18T12:29:10Z"},{"alias_kind":"pith_short_8","alias_value":"7MUHTWWB","created_at":"2026-05-18T12:29:10Z"}],"graph_snapshots":[{"event_id":"sha256:c663d0790ace653b7739f29aea4b22bbb9b1adf8c537cd5f7ea91d6aabc6bde8","target":"graph","created_at":"2026-05-18T00:54: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":"Satisficing is a relaxation of maximizing and allows for less risky decision making in the face of uncertainty. We propose two sets of satisficing objectives for the multi-armed bandit problem, where the objective is to achieve reward-based decision-making performance above a given threshold. We show that these new problems are equivalent to various standard multi-armed bandit problems with maximizing objectives and use the equivalence to find bounds on performance. The different objectives can result in qualitatively different behavior; for example, agents explore their options continually in","authors_text":"Naomi Ehrich Leonard, Paul Reverdy, Vaibhav Srivastava","cross_cats":["math.OC","stat.ML"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2015-12-23T21:05:16Z","title":"Satisficing in multi-armed bandit problems"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1512.07638","kind":"arxiv","version":2},"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:289e3dd3f8ebcade6fc3a1249b3292ff385b063bafa49c6f2a94f78b4c4f997b","target":"record","created_at":"2026-05-18T00:54: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":"37ff7ee2c0937c8eab7c693c68ed679710ac2e1d67f2f07f39f7b132464351fd","cross_cats_sorted":["math.OC","stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2015-12-23T21:05:16Z","title_canon_sha256":"089cbd551def94408eba52dfa2425e36886a490b1e713aeddc1c06a0ac8f91dc"},"schema_version":"1.0","source":{"id":"1512.07638","kind":"arxiv","version":2}},"canonical_sha256":"fb2879dac17e1d6fd8cb5170f8d9a44643ebfd1e9bf783aeb2a534012e48ebc8","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"fb2879dac17e1d6fd8cb5170f8d9a44643ebfd1e9bf783aeb2a534012e48ebc8","first_computed_at":"2026-05-18T00:54:42.783310Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:54:42.783310Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"e1nA4WYlYLtJWZDGFVVrAvnA0cz5SU713+U9MWTqaG7HDIFQj8p7LaCs5oNulSsi012lJImbOTnZbJAlA0zBCg==","signature_status":"signed_v1","signed_at":"2026-05-18T00:54:42.783721Z","signed_message":"canonical_sha256_bytes"},"source_id":"1512.07638","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:289e3dd3f8ebcade6fc3a1249b3292ff385b063bafa49c6f2a94f78b4c4f997b","sha256:c663d0790ace653b7739f29aea4b22bbb9b1adf8c537cd5f7ea91d6aabc6bde8"],"state_sha256":"75f443d5a19b5eef6618484b77517b0814fde6db506d41d7c12abd2db7654dfb"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"K642uEHvrcv9qdXl7wATY6cpMvV22JqFu5b4cX2yt6GjKBUYAdoCc33jvulZidEXAF2JhD/mcYu7sthlpyQPDA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-28T23:00:30.853074Z","bundle_sha256":"e65ae318447a9fa50ed505882583ee4f33ff9993f722d9df621f6d029b58b405"}}