{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2022:EQKYAMFRRTYDOXR36RZ5VJEJ5S","short_pith_number":"pith:EQKYAMFR","schema_version":"1.0","canonical_sha256":"24158030b18cf0375e3bf473daa489ecac459fbc3c543e0f115cb2b4bbe50095","source":{"kind":"arxiv","id":"2212.12623","version":2},"attestation_state":"computed","paper":{"title":"The Simple Economics of Optimal Bundling","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"econ.TH","authors_text":"Frank Yang","submitted_at":"2022-12-24T01:00:15Z","abstract_excerpt":"We study optimal bundling when consumers differ in one dimension. We introduce a partial order on the set of bundles defined by (i) set inclusion and (ii) sales volumes (if sold alone and priced optimally). We show that if the undominated bundles with respect to this partial order are nested, then nested bundling (tiered pricing) is optimal. We characterize which nested menu is optimal: Selling a given menu of nested bundles is optimal if a smaller bundle in (out of) the menu sells more (less) than a bigger bundle in the menu. We present three applications of these insights: the first two conn"},"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":"2212.12623","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"econ.TH","submitted_at":"2022-12-24T01:00:15Z","cross_cats_sorted":[],"title_canon_sha256":"953213351ace6cbe0fd4e28ed89bc8fece2c842e72370e7d2834483f141a3e8b","abstract_canon_sha256":"16ddf57a5e97afc1a8059fa2db9399ca945d1430c604fcfba74e28858aff3519"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T05:59:05.850009Z","signature_b64":"jPuTRT1zDT2P8rSz9zcXNwQzf0vBfNm7pVwgJm1bcLgGStK9/ZB/y9LujasUCJ1yyIc5nrzW3ZLPyGCXHhAiBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"24158030b18cf0375e3bf473daa489ecac459fbc3c543e0f115cb2b4bbe50095","last_reissued_at":"2026-07-05T05:59:05.849571Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T05:59:05.849571Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"The Simple Economics of Optimal Bundling","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"econ.TH","authors_text":"Frank Yang","submitted_at":"2022-12-24T01:00:15Z","abstract_excerpt":"We study optimal bundling when consumers differ in one dimension. We introduce a partial order on the set of bundles defined by (i) set inclusion and (ii) sales volumes (if sold alone and priced optimally). We show that if the undominated bundles with respect to this partial order are nested, then nested bundling (tiered pricing) is optimal. We characterize which nested menu is optimal: Selling a given menu of nested bundles is optimal if a smaller bundle in (out of) the menu sells more (less) than a bigger bundle in the menu. We present three applications of these insights: the first two conn"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2212.12623","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/2212.12623/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":"2212.12623","created_at":"2026-07-05T05:59:05.849628+00:00"},{"alias_kind":"arxiv_version","alias_value":"2212.12623v2","created_at":"2026-07-05T05:59:05.849628+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2212.12623","created_at":"2026-07-05T05:59:05.849628+00:00"},{"alias_kind":"pith_short_12","alias_value":"EQKYAMFRRTYD","created_at":"2026-07-05T05:59:05.849628+00:00"},{"alias_kind":"pith_short_16","alias_value":"EQKYAMFRRTYDOXR3","created_at":"2026-07-05T05:59:05.849628+00:00"},{"alias_kind":"pith_short_8","alias_value":"EQKYAMFR","created_at":"2026-07-05T05:59:05.849628+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2506.09291","citing_title":"Competition Complexity in Multi-Item Auctions: Beyond VCG and Regularity","ref_index":50,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/EQKYAMFRRTYDOXR36RZ5VJEJ5S","json":"https://pith.science/pith/EQKYAMFRRTYDOXR36RZ5VJEJ5S.json","graph_json":"https://pith.science/api/pith-number/EQKYAMFRRTYDOXR36RZ5VJEJ5S/graph.json","events_json":"https://pith.science/api/pith-number/EQKYAMFRRTYDOXR36RZ5VJEJ5S/events.json","paper":"https://pith.science/paper/EQKYAMFR"},"agent_actions":{"view_html":"https://pith.science/pith/EQKYAMFRRTYDOXR36RZ5VJEJ5S","download_json":"https://pith.science/pith/EQKYAMFRRTYDOXR36RZ5VJEJ5S.json","view_paper":"https://pith.science/paper/EQKYAMFR","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2212.12623&json=true","fetch_graph":"https://pith.science/api/pith-number/EQKYAMFRRTYDOXR36RZ5VJEJ5S/graph.json","fetch_events":"https://pith.science/api/pith-number/EQKYAMFRRTYDOXR36RZ5VJEJ5S/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/EQKYAMFRRTYDOXR36RZ5VJEJ5S/action/timestamp_anchor","attest_storage":"https://pith.science/pith/EQKYAMFRRTYDOXR36RZ5VJEJ5S/action/storage_attestation","attest_author":"https://pith.science/pith/EQKYAMFRRTYDOXR36RZ5VJEJ5S/action/author_attestation","sign_citation":"https://pith.science/pith/EQKYAMFRRTYDOXR36RZ5VJEJ5S/action/citation_signature","submit_replication":"https://pith.science/pith/EQKYAMFRRTYDOXR36RZ5VJEJ5S/action/replication_record"}},"created_at":"2026-07-05T05:59:05.849628+00:00","updated_at":"2026-07-05T05:59:05.849628+00:00"}