{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2021:NVCIEDXON25BI5JMSZRCW5R2X6","short_pith_number":"pith:NVCIEDXO","schema_version":"1.0","canonical_sha256":"6d44820eee6eba14752c96622b763abf9cd0a686655a6ecae2fad44ad8c1f73c","source":{"kind":"arxiv","id":"2108.12976","version":4},"attestation_state":"computed","paper":{"title":"Approximating Pandora's Box with Correlations","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG"],"primary_cat":"cs.DS","authors_text":"Christos Tzamos, Evangelia Gergatsouli, Jeremy McMahan, Shuchi Chawla","submitted_at":"2021-08-30T03:32:16Z","abstract_excerpt":"We revisit the classic Pandora's Box (PB) problem under correlated distributions on the box values. Recent work of arXiv:1911.01632 obtained constant approximate algorithms for a restricted class of policies for the problem that visit boxes in a fixed order. In this work, we study the complexity of approximating the optimal policy which may adaptively choose which box to visit next based on the values seen so far.\n  Our main result establishes an approximation-preserving equivalence of PB to the well studied Uniform Decision Tree (UDT) problem from stochastic optimization and a variant of the "},"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":"2108.12976","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2021-08-30T03:32:16Z","cross_cats_sorted":["cs.LG"],"title_canon_sha256":"1d999407dadbf1c8029a9506f45a656d0a339fa029f8b4c1131db2390ea0b5e8","abstract_canon_sha256":"a10158a13daf321dda43e6ad2a8a9202cb99ffaee6f118b13e765b50676ec986"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T06:33:31.703740Z","signature_b64":"t7aI7OVApDYCTm7kT5DP6jhcg+QCFUBU/Rlb5SmUlMhDWYWB5xsArvt9cGu0Ws1MJqwrmidEUcbHtWiKUPpHDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"6d44820eee6eba14752c96622b763abf9cd0a686655a6ecae2fad44ad8c1f73c","last_reissued_at":"2026-07-05T06:33:31.703278Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T06:33:31.703278Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Approximating Pandora's Box with Correlations","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG"],"primary_cat":"cs.DS","authors_text":"Christos Tzamos, Evangelia Gergatsouli, Jeremy McMahan, Shuchi Chawla","submitted_at":"2021-08-30T03:32:16Z","abstract_excerpt":"We revisit the classic Pandora's Box (PB) problem under correlated distributions on the box values. Recent work of arXiv:1911.01632 obtained constant approximate algorithms for a restricted class of policies for the problem that visit boxes in a fixed order. In this work, we study the complexity of approximating the optimal policy which may adaptively choose which box to visit next based on the values seen so far.\n  Our main result establishes an approximation-preserving equivalence of PB to the well studied Uniform Decision Tree (UDT) problem from stochastic optimization and a variant of the "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2108.12976","kind":"arxiv","version":4},"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/2108.12976/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":"2108.12976","created_at":"2026-07-05T06:33:31.703342+00:00"},{"alias_kind":"arxiv_version","alias_value":"2108.12976v4","created_at":"2026-07-05T06:33:31.703342+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2108.12976","created_at":"2026-07-05T06:33:31.703342+00:00"},{"alias_kind":"pith_short_12","alias_value":"NVCIEDXON25B","created_at":"2026-07-05T06:33:31.703342+00:00"},{"alias_kind":"pith_short_16","alias_value":"NVCIEDXON25BI5JM","created_at":"2026-07-05T06:33:31.703342+00:00"},{"alias_kind":"pith_short_8","alias_value":"NVCIEDXO","created_at":"2026-07-05T06:33:31.703342+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2604.02611","citing_title":"Stochastic Function Certification with Correlations","ref_index":12,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/NVCIEDXON25BI5JMSZRCW5R2X6","json":"https://pith.science/pith/NVCIEDXON25BI5JMSZRCW5R2X6.json","graph_json":"https://pith.science/api/pith-number/NVCIEDXON25BI5JMSZRCW5R2X6/graph.json","events_json":"https://pith.science/api/pith-number/NVCIEDXON25BI5JMSZRCW5R2X6/events.json","paper":"https://pith.science/paper/NVCIEDXO"},"agent_actions":{"view_html":"https://pith.science/pith/NVCIEDXON25BI5JMSZRCW5R2X6","download_json":"https://pith.science/pith/NVCIEDXON25BI5JMSZRCW5R2X6.json","view_paper":"https://pith.science/paper/NVCIEDXO","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2108.12976&json=true","fetch_graph":"https://pith.science/api/pith-number/NVCIEDXON25BI5JMSZRCW5R2X6/graph.json","fetch_events":"https://pith.science/api/pith-number/NVCIEDXON25BI5JMSZRCW5R2X6/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/NVCIEDXON25BI5JMSZRCW5R2X6/action/timestamp_anchor","attest_storage":"https://pith.science/pith/NVCIEDXON25BI5JMSZRCW5R2X6/action/storage_attestation","attest_author":"https://pith.science/pith/NVCIEDXON25BI5JMSZRCW5R2X6/action/author_attestation","sign_citation":"https://pith.science/pith/NVCIEDXON25BI5JMSZRCW5R2X6/action/citation_signature","submit_replication":"https://pith.science/pith/NVCIEDXON25BI5JMSZRCW5R2X6/action/replication_record"}},"created_at":"2026-07-05T06:33:31.703342+00:00","updated_at":"2026-07-05T06:33:31.703342+00:00"}