{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2024:RQXEHWJ4VKQ3QPPRYZ4MPGUIRE","short_pith_number":"pith:RQXEHWJ4","schema_version":"1.0","canonical_sha256":"8c2e43d93caaa1b83df1c678c79a8889310675ba0e8f8650bebd0eeadc6d8fcb","source":{"kind":"arxiv","id":"2412.03860","version":2},"attestation_state":"computed","paper":{"title":"Combinatorial Selection with Costly Information","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Amit Harlev, Dimitris Christou, Shuchi Chawla, Ziv Scully","submitted_at":"2024-12-05T04:12:20Z","abstract_excerpt":"We consider a class of optimization problems over stochastic variables where the algorithm can learn information about the value of any variable through a series of costly steps; we model this information acquisition process as a Markov Decision Process (MDP). The algorithm's goal is to minimize the cost of its solution plus the cost of information acquisition, or alternately, maximize the value of its solution minus the cost of information acquisition. Such bandit superprocesses have been studied previously but solutions are known only for fairly restrictive special cases.\n  We develop a fram"},"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":"2412.03860","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2024-12-05T04:12:20Z","cross_cats_sorted":[],"title_canon_sha256":"ace0fedca34a29f62fff3b751dbc88f0013e7c04dc2eeed7f599b1091936a925","abstract_canon_sha256":"a2e9d32a2d4a46d8ac42096e0f1fa81d3c06fc014e995ff911893dfae99d89d6"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T11:42:24.453265Z","signature_b64":"MIFathkUoLMwrYxQlGhZZ9TA0P6TOVf5RrlFi0K7OSXOOR/F/Cx295gzieLlIsDQbXeAB8NLiFkLhY0DGCmqDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"8c2e43d93caaa1b83df1c678c79a8889310675ba0e8f8650bebd0eeadc6d8fcb","last_reissued_at":"2026-07-05T11:42:24.452826Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T11:42:24.452826Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Combinatorial Selection with Costly Information","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Amit Harlev, Dimitris Christou, Shuchi Chawla, Ziv Scully","submitted_at":"2024-12-05T04:12:20Z","abstract_excerpt":"We consider a class of optimization problems over stochastic variables where the algorithm can learn information about the value of any variable through a series of costly steps; we model this information acquisition process as a Markov Decision Process (MDP). The algorithm's goal is to minimize the cost of its solution plus the cost of information acquisition, or alternately, maximize the value of its solution minus the cost of information acquisition. Such bandit superprocesses have been studied previously but solutions are known only for fairly restrictive special cases.\n  We develop a fram"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2412.03860","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2412.03860/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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":"2412.03860","created_at":"2026-07-05T11:42:24.452883+00:00"},{"alias_kind":"arxiv_version","alias_value":"2412.03860v2","created_at":"2026-07-05T11:42:24.452883+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2412.03860","created_at":"2026-07-05T11:42:24.452883+00:00"},{"alias_kind":"pith_short_12","alias_value":"RQXEHWJ4VKQ3","created_at":"2026-07-05T11:42:24.452883+00:00"},{"alias_kind":"pith_short_16","alias_value":"RQXEHWJ4VKQ3QPPR","created_at":"2026-07-05T11:42:24.452883+00:00"},{"alias_kind":"pith_short_8","alias_value":"RQXEHWJ4","created_at":"2026-07-05T11:42:24.452883+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2502.00228","citing_title":"Markovian Pandora's box","ref_index":17,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/RQXEHWJ4VKQ3QPPRYZ4MPGUIRE","json":"https://pith.science/pith/RQXEHWJ4VKQ3QPPRYZ4MPGUIRE.json","graph_json":"https://pith.science/api/pith-number/RQXEHWJ4VKQ3QPPRYZ4MPGUIRE/graph.json","events_json":"https://pith.science/api/pith-number/RQXEHWJ4VKQ3QPPRYZ4MPGUIRE/events.json","paper":"https://pith.science/paper/RQXEHWJ4"},"agent_actions":{"view_html":"https://pith.science/pith/RQXEHWJ4VKQ3QPPRYZ4MPGUIRE","download_json":"https://pith.science/pith/RQXEHWJ4VKQ3QPPRYZ4MPGUIRE.json","view_paper":"https://pith.science/paper/RQXEHWJ4","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2412.03860&json=true","fetch_graph":"https://pith.science/api/pith-number/RQXEHWJ4VKQ3QPPRYZ4MPGUIRE/graph.json","fetch_events":"https://pith.science/api/pith-number/RQXEHWJ4VKQ3QPPRYZ4MPGUIRE/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/RQXEHWJ4VKQ3QPPRYZ4MPGUIRE/action/timestamp_anchor","attest_storage":"https://pith.science/pith/RQXEHWJ4VKQ3QPPRYZ4MPGUIRE/action/storage_attestation","attest_author":"https://pith.science/pith/RQXEHWJ4VKQ3QPPRYZ4MPGUIRE/action/author_attestation","sign_citation":"https://pith.science/pith/RQXEHWJ4VKQ3QPPRYZ4MPGUIRE/action/citation_signature","submit_replication":"https://pith.science/pith/RQXEHWJ4VKQ3QPPRYZ4MPGUIRE/action/replication_record"}},"created_at":"2026-07-05T11:42:24.452883+00:00","updated_at":"2026-07-05T11:42:24.452883+00:00"}