{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2024:3YR5LAVQU7JPAEHS43ENI2ZMDX","short_pith_number":"pith:3YR5LAVQ","schema_version":"1.0","canonical_sha256":"de23d582b0a7d2f010f2e6c8d46b2c1df61428391dbea4adaa0d58deae14d330","source":{"kind":"arxiv","id":"2406.08711","version":2},"attestation_state":"computed","paper":{"title":"Matching with Nested and Bundled Pandora Boxes","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.GT"],"primary_cat":"cs.DS","authors_text":"Bo Waggoner, Robin Bowers","submitted_at":"2024-06-13T00:25:36Z","abstract_excerpt":"We consider max-weighted matching with costs for learning the weights, modeled as a \"Pandora's Box\" on each endpoint of an edge. Each vertex has an initially-unknown value for being matched to a neighbor, and an algorithm must pay some cost to observe this value. The goal is to maximize the total matched value minus costs. Our model is inspired by two-sided settings, such as matching employees to employers. Importantly for such settings, we allow for negative values which cause existing approaches to fail.\n  We first prove upper bounds for algorithms in two natural classes. Any algorithm that "},"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":"2406.08711","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DS","submitted_at":"2024-06-13T00:25:36Z","cross_cats_sorted":["cs.GT"],"title_canon_sha256":"c1d63d6a2eca5bc017de82c3088161be3f992aa3aa8cee6dbfbca51656b0c75c","abstract_canon_sha256":"424e2093e9b9d5320c0ff65be7c7de11799ed2622e3434c05803da9816531e92"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T11:27:49.167790Z","signature_b64":"aRp0u8KbxdKD+Ca6ilG7DF7DhF5nkM1ZSwCMzd44+R23RM72XCzdgqYUB3EukZoWbR0MllSYS1F0vL/7RtAjBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"de23d582b0a7d2f010f2e6c8d46b2c1df61428391dbea4adaa0d58deae14d330","last_reissued_at":"2026-07-05T11:27:49.167272Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T11:27:49.167272Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Matching with Nested and Bundled Pandora Boxes","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.GT"],"primary_cat":"cs.DS","authors_text":"Bo Waggoner, Robin Bowers","submitted_at":"2024-06-13T00:25:36Z","abstract_excerpt":"We consider max-weighted matching with costs for learning the weights, modeled as a \"Pandora's Box\" on each endpoint of an edge. Each vertex has an initially-unknown value for being matched to a neighbor, and an algorithm must pay some cost to observe this value. The goal is to maximize the total matched value minus costs. Our model is inspired by two-sided settings, such as matching employees to employers. Importantly for such settings, we allow for negative values which cause existing approaches to fail.\n  We first prove upper bounds for algorithms in two natural classes. Any algorithm that "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2406.08711","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/2406.08711/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":"2406.08711","created_at":"2026-07-05T11:27:49.167333+00:00"},{"alias_kind":"arxiv_version","alias_value":"2406.08711v2","created_at":"2026-07-05T11:27:49.167333+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2406.08711","created_at":"2026-07-05T11:27:49.167333+00:00"},{"alias_kind":"pith_short_12","alias_value":"3YR5LAVQU7JP","created_at":"2026-07-05T11:27:49.167333+00:00"},{"alias_kind":"pith_short_16","alias_value":"3YR5LAVQU7JPAEHS","created_at":"2026-07-05T11:27:49.167333+00:00"},{"alias_kind":"pith_short_8","alias_value":"3YR5LAVQ","created_at":"2026-07-05T11:27:49.167333+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2506.07162","citing_title":"Delegation with Costly Inspection","ref_index":8,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/3YR5LAVQU7JPAEHS43ENI2ZMDX","json":"https://pith.science/pith/3YR5LAVQU7JPAEHS43ENI2ZMDX.json","graph_json":"https://pith.science/api/pith-number/3YR5LAVQU7JPAEHS43ENI2ZMDX/graph.json","events_json":"https://pith.science/api/pith-number/3YR5LAVQU7JPAEHS43ENI2ZMDX/events.json","paper":"https://pith.science/paper/3YR5LAVQ"},"agent_actions":{"view_html":"https://pith.science/pith/3YR5LAVQU7JPAEHS43ENI2ZMDX","download_json":"https://pith.science/pith/3YR5LAVQU7JPAEHS43ENI2ZMDX.json","view_paper":"https://pith.science/paper/3YR5LAVQ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2406.08711&json=true","fetch_graph":"https://pith.science/api/pith-number/3YR5LAVQU7JPAEHS43ENI2ZMDX/graph.json","fetch_events":"https://pith.science/api/pith-number/3YR5LAVQU7JPAEHS43ENI2ZMDX/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/3YR5LAVQU7JPAEHS43ENI2ZMDX/action/timestamp_anchor","attest_storage":"https://pith.science/pith/3YR5LAVQU7JPAEHS43ENI2ZMDX/action/storage_attestation","attest_author":"https://pith.science/pith/3YR5LAVQU7JPAEHS43ENI2ZMDX/action/author_attestation","sign_citation":"https://pith.science/pith/3YR5LAVQU7JPAEHS43ENI2ZMDX/action/citation_signature","submit_replication":"https://pith.science/pith/3YR5LAVQU7JPAEHS43ENI2ZMDX/action/replication_record"}},"created_at":"2026-07-05T11:27:49.167333+00:00","updated_at":"2026-07-05T11:27:49.167333+00:00"}