{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:SKJWVF7WA34XE4P4WWJPP6SZ43","short_pith_number":"pith:SKJWVF7W","schema_version":"1.0","canonical_sha256":"92936a97f606f97271fcb592f7fa59e6f639494d3510dd0b0c790c6a16031a90","source":{"kind":"arxiv","id":"1607.02526","version":4},"attestation_state":"computed","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"},"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":"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"},"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"},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1607.02526","created_at":"2026-05-18T00:24:45.290534+00:00"},{"alias_kind":"arxiv_version","alias_value":"1607.02526v4","created_at":"2026-05-18T00:24:45.290534+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1607.02526","created_at":"2026-05-18T00:24:45.290534+00:00"},{"alias_kind":"pith_short_12","alias_value":"SKJWVF7WA34X","created_at":"2026-05-18T12:30:44.179134+00:00"},{"alias_kind":"pith_short_16","alias_value":"SKJWVF7WA34XE4P4","created_at":"2026-05-18T12:30:44.179134+00:00"},{"alias_kind":"pith_short_8","alias_value":"SKJWVF7W","created_at":"2026-05-18T12:30:44.179134+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/SKJWVF7WA34XE4P4WWJPP6SZ43","json":"https://pith.science/pith/SKJWVF7WA34XE4P4WWJPP6SZ43.json","graph_json":"https://pith.science/api/pith-number/SKJWVF7WA34XE4P4WWJPP6SZ43/graph.json","events_json":"https://pith.science/api/pith-number/SKJWVF7WA34XE4P4WWJPP6SZ43/events.json","paper":"https://pith.science/paper/SKJWVF7W"},"agent_actions":{"view_html":"https://pith.science/pith/SKJWVF7WA34XE4P4WWJPP6SZ43","download_json":"https://pith.science/pith/SKJWVF7WA34XE4P4WWJPP6SZ43.json","view_paper":"https://pith.science/paper/SKJWVF7W","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1607.02526&json=true","fetch_graph":"https://pith.science/api/pith-number/SKJWVF7WA34XE4P4WWJPP6SZ43/graph.json","fetch_events":"https://pith.science/api/pith-number/SKJWVF7WA34XE4P4WWJPP6SZ43/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/SKJWVF7WA34XE4P4WWJPP6SZ43/action/timestamp_anchor","attest_storage":"https://pith.science/pith/SKJWVF7WA34XE4P4WWJPP6SZ43/action/storage_attestation","attest_author":"https://pith.science/pith/SKJWVF7WA34XE4P4WWJPP6SZ43/action/author_attestation","sign_citation":"https://pith.science/pith/SKJWVF7WA34XE4P4WWJPP6SZ43/action/citation_signature","submit_replication":"https://pith.science/pith/SKJWVF7WA34XE4P4WWJPP6SZ43/action/replication_record"}},"created_at":"2026-05-18T00:24:45.290534+00:00","updated_at":"2026-05-18T00:24:45.290534+00:00"}