{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:SKJWVF7WA34XE4P4WWJPP6SZ43","short_pith_number":"pith:SKJWVF7W","canonical_record":{"source":{"id":"1607.02526","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.GT","submitted_at":"2016-07-08T20:43:40Z","cross_cats_sorted":[],"title_canon_sha256":"5dd2f23fe051adf3685b9f035470bc3799110368dd67d582be4f2bac4344bb8b","abstract_canon_sha256":"ac1669a38b53cc53c42af79fb2b32100e7d0d063a57aa7bad6f8c4ac69b5f487"},"schema_version":"1.0"},"canonical_sha256":"92936a97f606f97271fcb592f7fa59e6f639494d3510dd0b0c790c6a16031a90","source":{"kind":"arxiv","id":"1607.02526","version":4},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1607.02526","created_at":"2026-05-18T00:24:45Z"},{"alias_kind":"arxiv_version","alias_value":"1607.02526v4","created_at":"2026-05-18T00:24:45Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1607.02526","created_at":"2026-05-18T00:24:45Z"},{"alias_kind":"pith_short_12","alias_value":"SKJWVF7WA34X","created_at":"2026-05-18T12:30:44Z"},{"alias_kind":"pith_short_16","alias_value":"SKJWVF7WA34XE4P4","created_at":"2026-05-18T12:30:44Z"},{"alias_kind":"pith_short_8","alias_value":"SKJWVF7W","created_at":"2026-05-18T12:30:44Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:SKJWVF7WA34XE4P4WWJPP6SZ43","target":"record","payload":{"canonical_record":{"source":{"id":"1607.02526","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.GT","submitted_at":"2016-07-08T20:43:40Z","cross_cats_sorted":[],"title_canon_sha256":"5dd2f23fe051adf3685b9f035470bc3799110368dd67d582be4f2bac4344bb8b","abstract_canon_sha256":"ac1669a38b53cc53c42af79fb2b32100e7d0d063a57aa7bad6f8c4ac69b5f487"},"schema_version":"1.0"},"canonical_sha256":"92936a97f606f97271fcb592f7fa59e6f639494d3510dd0b0c790c6a16031a90","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:24:45.291072Z","signature_b64":"S2ybZY4FylyC2KaNCHt2S4XHGBXGR0M99j0H79f6WqimZhBYeC2a1f2YO9xitjFbTNwOGUP6OLoqqUNL02wODg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"92936a97f606f97271fcb592f7fa59e6f639494d3510dd0b0c790c6a16031a90","last_reissued_at":"2026-05-18T00:24:45.290434Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:24:45.290434Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1607.02526","source_version":4,"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-05-18T00:24:45Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"QhAEJAT3TI8HGG/Ir8fWKI1v8otHxnD99ENCj5rxL5hLKlcZX8/LG9mO0Ehkr4/DRrtBfnIN69rrG7GI6XoSBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-21T22:33:52.195054Z"},"content_sha256":"5d1f6ab34dc33253059ba489bb695cd068c6253ec3b99aa08d68c53fa12eb868","schema_version":"1.0","event_id":"sha256:5d1f6ab34dc33253059ba489bb695cd068c6253ec3b99aa08d68c53fa12eb868"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:SKJWVF7WA34XE4P4WWJPP6SZ43","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Optimal Auction Design for Flexible Consumers","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.GT","authors_text":"Ashutosh Nayyar, Shiva Navabi","submitted_at":"2016-07-08T20:43:40Z","abstract_excerpt":"We study the problem of designing revenue-maximizing auctions for allocating multiple goods to flexible consumers. In our model, each consumer is interested in a subset of goods known as its flexibility set and wants to consume one good from this set. A consumer's flexibility set and its utility from consuming a good from its flexibility set are its private information. We focus on the case of nested flexibility sets --- each consumer's flexibility set can be one of $k$ nested sets. We provide several examples where such nested flexibility sets may arise. We characterize the allocation rule fo"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1607.02526","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":""},"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-05-18T00:24:45Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"RoXXFyslsKh5GtlN50GukcU13apICnCT36bLWLAQwVG8YOhdWdZdk9cDqTPcSuetMciWOXE0FXIzdPVAZBSdDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-21T22:33:52.195402Z"},"content_sha256":"40280de6e9de964ab4d25f0ef00427a3f3f72791e2607c2b1ff29b390ec3848f","schema_version":"1.0","event_id":"sha256:40280de6e9de964ab4d25f0ef00427a3f3f72791e2607c2b1ff29b390ec3848f"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/SKJWVF7WA34XE4P4WWJPP6SZ43/bundle.json","state_url":"https://pith.science/pith/SKJWVF7WA34XE4P4WWJPP6SZ43/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/SKJWVF7WA34XE4P4WWJPP6SZ43/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-06-21T22:33:52Z","links":{"resolver":"https://pith.science/pith/SKJWVF7WA34XE4P4WWJPP6SZ43","bundle":"https://pith.science/pith/SKJWVF7WA34XE4P4WWJPP6SZ43/bundle.json","state":"https://pith.science/pith/SKJWVF7WA34XE4P4WWJPP6SZ43/state.json","well_known_bundle":"https://pith.science/.well-known/pith/SKJWVF7WA34XE4P4WWJPP6SZ43/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:SKJWVF7WA34XE4P4WWJPP6SZ43","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":"ac1669a38b53cc53c42af79fb2b32100e7d0d063a57aa7bad6f8c4ac69b5f487","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.GT","submitted_at":"2016-07-08T20:43:40Z","title_canon_sha256":"5dd2f23fe051adf3685b9f035470bc3799110368dd67d582be4f2bac4344bb8b"},"schema_version":"1.0","source":{"id":"1607.02526","kind":"arxiv","version":4}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1607.02526","created_at":"2026-05-18T00:24:45Z"},{"alias_kind":"arxiv_version","alias_value":"1607.02526v4","created_at":"2026-05-18T00:24:45Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1607.02526","created_at":"2026-05-18T00:24:45Z"},{"alias_kind":"pith_short_12","alias_value":"SKJWVF7WA34X","created_at":"2026-05-18T12:30:44Z"},{"alias_kind":"pith_short_16","alias_value":"SKJWVF7WA34XE4P4","created_at":"2026-05-18T12:30:44Z"},{"alias_kind":"pith_short_8","alias_value":"SKJWVF7W","created_at":"2026-05-18T12:30:44Z"}],"graph_snapshots":[{"event_id":"sha256:40280de6e9de964ab4d25f0ef00427a3f3f72791e2607c2b1ff29b390ec3848f","target":"graph","created_at":"2026-05-18T00:24:45Z","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"},"paper":{"abstract_excerpt":"We study the problem of designing revenue-maximizing auctions for allocating multiple goods to flexible consumers. In our model, each consumer is interested in a subset of goods known as its flexibility set and wants to consume one good from this set. A consumer's flexibility set and its utility from consuming a good from its flexibility set are its private information. We focus on the case of nested flexibility sets --- each consumer's flexibility set can be one of $k$ nested sets. We provide several examples where such nested flexibility sets may arise. We characterize the allocation rule fo","authors_text":"Ashutosh Nayyar, Shiva Navabi","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.GT","submitted_at":"2016-07-08T20:43:40Z","title":"Optimal Auction Design for Flexible Consumers"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1607.02526","kind":"arxiv","version":4},"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:5d1f6ab34dc33253059ba489bb695cd068c6253ec3b99aa08d68c53fa12eb868","target":"record","created_at":"2026-05-18T00:24:45Z","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":"ac1669a38b53cc53c42af79fb2b32100e7d0d063a57aa7bad6f8c4ac69b5f487","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.GT","submitted_at":"2016-07-08T20:43:40Z","title_canon_sha256":"5dd2f23fe051adf3685b9f035470bc3799110368dd67d582be4f2bac4344bb8b"},"schema_version":"1.0","source":{"id":"1607.02526","kind":"arxiv","version":4}},"canonical_sha256":"92936a97f606f97271fcb592f7fa59e6f639494d3510dd0b0c790c6a16031a90","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"92936a97f606f97271fcb592f7fa59e6f639494d3510dd0b0c790c6a16031a90","first_computed_at":"2026-05-18T00:24:45.290434Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:24:45.290434Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"S2ybZY4FylyC2KaNCHt2S4XHGBXGR0M99j0H79f6WqimZhBYeC2a1f2YO9xitjFbTNwOGUP6OLoqqUNL02wODg==","signature_status":"signed_v1","signed_at":"2026-05-18T00:24:45.291072Z","signed_message":"canonical_sha256_bytes"},"source_id":"1607.02526","source_kind":"arxiv","source_version":4}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:5d1f6ab34dc33253059ba489bb695cd068c6253ec3b99aa08d68c53fa12eb868","sha256:40280de6e9de964ab4d25f0ef00427a3f3f72791e2607c2b1ff29b390ec3848f"],"state_sha256":"6711c27c0c189e14d273d445b9693859300f77119c82e88eef0ed630d8850b51"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"jHTEsqGEUnMPNW+g4HwoLjrbbPevwImYUknZ7baYgFXro8xaWUvsUnvHTtMf3PYQEq8rjmKPkbIYam3hH3f1AA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-21T22:33:52.197292Z","bundle_sha256":"0fb00f232d1258953637ee601b227d79205e3e981e993a0e504eb56f0cb03bdb"}}