{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2008:7X62ZAGAOGOG6S3JMKHJ6RWMR2","short_pith_number":"pith:7X62ZAGA","schema_version":"1.0","canonical_sha256":"fdfdac80c0719c6f4b69628e9f46cc8eae47f786f332fda439c16a5213efe65b","source":{"kind":"arxiv","id":"0805.2630","version":2},"attestation_state":"computed","paper":{"title":"Sequential Design of Experiments via Linear Programming","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Kamesh Munagala, Sudipto Guha","submitted_at":"2008-05-17T22:48:22Z","abstract_excerpt":"The celebrated multi-armed bandit problem in decision theory models the basic trade-off between exploration, or learning about the state of a system, and exploitation, or utilizing the system. In this paper we study the variant of the multi-armed bandit problem where the exploration phase involves costly experiments and occurs before the exploitation phase; and where each play of an arm during the exploration phase updates a prior belief about the arm. The problem of finding an inexpensive exploration strategy to optimize a certain exploitation objective is NP-Hard even when a single play reve"},"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":"0805.2630","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2008-05-17T22:48:22Z","cross_cats_sorted":[],"title_canon_sha256":"70722f71716d1bdddbf8c82414da359dda6985ae7c73fb0afc34168a6efaac94","abstract_canon_sha256":"a571f29b47ba9209013c1272bfe179c5342e21eceb78816232e4c78e3ee4df3f"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:20:45.823858Z","signature_b64":"55HQ8mmmpU71lR4+W+uoS/B81MUO4IWeHFREspA1f/kwUqBXsnJB7yLRe3jSsgxXo8lFtMxdBbrhtoShzZfuDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"fdfdac80c0719c6f4b69628e9f46cc8eae47f786f332fda439c16a5213efe65b","last_reissued_at":"2026-05-18T03:20:45.823334Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:20:45.823334Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Sequential Design of Experiments via Linear Programming","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Kamesh Munagala, Sudipto Guha","submitted_at":"2008-05-17T22:48:22Z","abstract_excerpt":"The celebrated multi-armed bandit problem in decision theory models the basic trade-off between exploration, or learning about the state of a system, and exploitation, or utilizing the system. In this paper we study the variant of the multi-armed bandit problem where the exploration phase involves costly experiments and occurs before the exploitation phase; and where each play of an arm during the exploration phase updates a prior belief about the arm. The problem of finding an inexpensive exploration strategy to optimize a certain exploitation objective is NP-Hard even when a single play reve"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"0805.2630","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"},"aliases":[{"alias_kind":"arxiv","alias_value":"0805.2630","created_at":"2026-05-18T03:20:45.823417+00:00"},{"alias_kind":"arxiv_version","alias_value":"0805.2630v2","created_at":"2026-05-18T03:20:45.823417+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.0805.2630","created_at":"2026-05-18T03:20:45.823417+00:00"},{"alias_kind":"pith_short_12","alias_value":"7X62ZAGAOGOG","created_at":"2026-05-18T12:25:56.245647+00:00"},{"alias_kind":"pith_short_16","alias_value":"7X62ZAGAOGOG6S3J","created_at":"2026-05-18T12:25:56.245647+00:00"},{"alias_kind":"pith_short_8","alias_value":"7X62ZAGA","created_at":"2026-05-18T12:25:56.245647+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/7X62ZAGAOGOG6S3JMKHJ6RWMR2","json":"https://pith.science/pith/7X62ZAGAOGOG6S3JMKHJ6RWMR2.json","graph_json":"https://pith.science/api/pith-number/7X62ZAGAOGOG6S3JMKHJ6RWMR2/graph.json","events_json":"https://pith.science/api/pith-number/7X62ZAGAOGOG6S3JMKHJ6RWMR2/events.json","paper":"https://pith.science/paper/7X62ZAGA"},"agent_actions":{"view_html":"https://pith.science/pith/7X62ZAGAOGOG6S3JMKHJ6RWMR2","download_json":"https://pith.science/pith/7X62ZAGAOGOG6S3JMKHJ6RWMR2.json","view_paper":"https://pith.science/paper/7X62ZAGA","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=0805.2630&json=true","fetch_graph":"https://pith.science/api/pith-number/7X62ZAGAOGOG6S3JMKHJ6RWMR2/graph.json","fetch_events":"https://pith.science/api/pith-number/7X62ZAGAOGOG6S3JMKHJ6RWMR2/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/7X62ZAGAOGOG6S3JMKHJ6RWMR2/action/timestamp_anchor","attest_storage":"https://pith.science/pith/7X62ZAGAOGOG6S3JMKHJ6RWMR2/action/storage_attestation","attest_author":"https://pith.science/pith/7X62ZAGAOGOG6S3JMKHJ6RWMR2/action/author_attestation","sign_citation":"https://pith.science/pith/7X62ZAGAOGOG6S3JMKHJ6RWMR2/action/citation_signature","submit_replication":"https://pith.science/pith/7X62ZAGAOGOG6S3JMKHJ6RWMR2/action/replication_record"}},"created_at":"2026-05-18T03:20:45.823417+00:00","updated_at":"2026-05-18T03:20:45.823417+00:00"}