{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2024:3YR5LAVQU7JPAEHS43ENI2ZMDX","short_pith_number":"pith:3YR5LAVQ","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"},"canonical_sha256":"de23d582b0a7d2f010f2e6c8d46b2c1df61428391dbea4adaa0d58deae14d330","source":{"kind":"arxiv","id":"2406.08711","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2406.08711","created_at":"2026-07-05T11:27:49Z"},{"alias_kind":"arxiv_version","alias_value":"2406.08711v2","created_at":"2026-07-05T11:27:49Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2406.08711","created_at":"2026-07-05T11:27:49Z"},{"alias_kind":"pith_short_12","alias_value":"3YR5LAVQU7JP","created_at":"2026-07-05T11:27:49Z"},{"alias_kind":"pith_short_16","alias_value":"3YR5LAVQU7JPAEHS","created_at":"2026-07-05T11:27:49Z"},{"alias_kind":"pith_short_8","alias_value":"3YR5LAVQ","created_at":"2026-07-05T11:27:49Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2024:3YR5LAVQU7JPAEHS43ENI2ZMDX","target":"record","payload":{"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"},"canonical_sha256":"de23d582b0a7d2f010f2e6c8d46b2c1df61428391dbea4adaa0d58deae14d330","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"},"source_kind":"arxiv","source_id":"2406.08711","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-07-05T11:27:49Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"iEQ81r1LUq25/bCHkm5ywvPUVRKIKifQkZXw3uEau7+8MMgrbW7uT4135OFeo10DQMxe0ysaD6QR1IDecxkuDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-01T07:40:30.061426Z"},"content_sha256":"3af1858e985b1dcbb0cf56640b6d9a86715ef176c41c9394ae1d4297fa5921fe","schema_version":"1.0","event_id":"sha256:3af1858e985b1dcbb0cf56640b6d9a86715ef176c41c9394ae1d4297fa5921fe"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2024:3YR5LAVQU7JPAEHS43ENI2ZMDX","target":"graph","payload":{"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"},"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-07-05T11:27:49Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"rEAtjDttQ3gaftx+YK65oLPEF4Q2iWFpRU3mTvkMcFVwHuTmC9OoFLcc0PuI5NwybJMoqjbC9ICVx42N2jN7CA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-01T07:40:30.061913Z"},"content_sha256":"ed23db2aa49153c7c61ecd5245c34033368aabe8b53340c74352dc8c994a90a0","schema_version":"1.0","event_id":"sha256:ed23db2aa49153c7c61ecd5245c34033368aabe8b53340c74352dc8c994a90a0"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/3YR5LAVQU7JPAEHS43ENI2ZMDX/bundle.json","state_url":"https://pith.science/pith/3YR5LAVQU7JPAEHS43ENI2ZMDX/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/3YR5LAVQU7JPAEHS43ENI2ZMDX/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-08-01T07:40:30Z","links":{"resolver":"https://pith.science/pith/3YR5LAVQU7JPAEHS43ENI2ZMDX","bundle":"https://pith.science/pith/3YR5LAVQU7JPAEHS43ENI2ZMDX/bundle.json","state":"https://pith.science/pith/3YR5LAVQU7JPAEHS43ENI2ZMDX/state.json","well_known_bundle":"https://pith.science/.well-known/pith/3YR5LAVQU7JPAEHS43ENI2ZMDX/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2024:3YR5LAVQU7JPAEHS43ENI2ZMDX","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":"424e2093e9b9d5320c0ff65be7c7de11799ed2622e3434c05803da9816531e92","cross_cats_sorted":["cs.GT"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DS","submitted_at":"2024-06-13T00:25:36Z","title_canon_sha256":"c1d63d6a2eca5bc017de82c3088161be3f992aa3aa8cee6dbfbca51656b0c75c"},"schema_version":"1.0","source":{"id":"2406.08711","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2406.08711","created_at":"2026-07-05T11:27:49Z"},{"alias_kind":"arxiv_version","alias_value":"2406.08711v2","created_at":"2026-07-05T11:27:49Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2406.08711","created_at":"2026-07-05T11:27:49Z"},{"alias_kind":"pith_short_12","alias_value":"3YR5LAVQU7JP","created_at":"2026-07-05T11:27:49Z"},{"alias_kind":"pith_short_16","alias_value":"3YR5LAVQU7JPAEHS","created_at":"2026-07-05T11:27:49Z"},{"alias_kind":"pith_short_8","alias_value":"3YR5LAVQ","created_at":"2026-07-05T11:27:49Z"}],"graph_snapshots":[{"event_id":"sha256:ed23db2aa49153c7c61ecd5245c34033368aabe8b53340c74352dc8c994a90a0","target":"graph","created_at":"2026-07-05T11:27:49Z","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"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2406.08711/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"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 ","authors_text":"Bo Waggoner, Robin Bowers","cross_cats":["cs.GT"],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DS","submitted_at":"2024-06-13T00:25:36Z","title":"Matching with Nested and Bundled Pandora Boxes"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2406.08711","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:3af1858e985b1dcbb0cf56640b6d9a86715ef176c41c9394ae1d4297fa5921fe","target":"record","created_at":"2026-07-05T11:27:49Z","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":"424e2093e9b9d5320c0ff65be7c7de11799ed2622e3434c05803da9816531e92","cross_cats_sorted":["cs.GT"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DS","submitted_at":"2024-06-13T00:25:36Z","title_canon_sha256":"c1d63d6a2eca5bc017de82c3088161be3f992aa3aa8cee6dbfbca51656b0c75c"},"schema_version":"1.0","source":{"id":"2406.08711","kind":"arxiv","version":2}},"canonical_sha256":"de23d582b0a7d2f010f2e6c8d46b2c1df61428391dbea4adaa0d58deae14d330","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"de23d582b0a7d2f010f2e6c8d46b2c1df61428391dbea4adaa0d58deae14d330","first_computed_at":"2026-07-05T11:27:49.167272Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T11:27:49.167272Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"aRp0u8KbxdKD+Ca6ilG7DF7DhF5nkM1ZSwCMzd44+R23RM72XCzdgqYUB3EukZoWbR0MllSYS1F0vL/7RtAjBA==","signature_status":"signed_v1","signed_at":"2026-07-05T11:27:49.167790Z","signed_message":"canonical_sha256_bytes"},"source_id":"2406.08711","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:3af1858e985b1dcbb0cf56640b6d9a86715ef176c41c9394ae1d4297fa5921fe","sha256:ed23db2aa49153c7c61ecd5245c34033368aabe8b53340c74352dc8c994a90a0"],"state_sha256":"2d286b52ccb61d47801cbe475a9cceeac38de4e6fa9e906c0d9285561c19dc35"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Ip+GFfemhFgB+nONSoj2oB2vvZ3UHzlIAAF2zV/vzeu4mNizi0RlUXLy8eTRZiG71zuPqmcbD1Tk1GCeWzWACg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-01T07:40:30.066005Z","bundle_sha256":"6c2edc437c2b8aa4f4f60f44860b589afa8263b16c661b80532610cc3cabccad"}}