{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:AD6PNNNIE52RXB5NQXZRBQ52BK","short_pith_number":"pith:AD6PNNNI","schema_version":"1.0","canonical_sha256":"00fcf6b5a827751b87ad85f310c3ba0aa19b78b016989b09082510d66a98c875","source":{"kind":"arxiv","id":"1810.09829","version":1},"attestation_state":"computed","paper":{"title":"Capacitated Assortment Optimization with Pricing under the Paired Combinatorial Logit Model","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Chuning Gao, Daihan Zhang, Rui Chen, Zhenghe Zhong","submitted_at":"2018-10-23T13:08:32Z","abstract_excerpt":"In this paper, we investigate the capacitated assortment optimization problem with pricing under the paired combinatorial logit model, whose goal is to identify the revenue-maximizing subset of products as well as their selling prices subject to a known capacity limit. We model customers' purchase behavior using the paired combinatorial logit model, which allows for covariance among any pair of products. We formulate this problem as a non-linear mixed integer program. Then, we propose a two-step approach to obtain the optimal solution based on solving a mixed integer program and Lambert-W func"},"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":"1810.09829","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2018-10-23T13:08:32Z","cross_cats_sorted":[],"title_canon_sha256":"dd162d229e86832d8f0d8b7cb99cef6a888b7638dae5a4430d629c707a149bdd","abstract_canon_sha256":"990832910fb478f4c3c45a2a4316e54bba7184b839f886f9740a24ca379671b5"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:02:29.270090Z","signature_b64":"sRnq+Z3Xm4KJeisM0YHJ0hPOJdJLw/zSi7Jr5CskxNq8NKkG4MnHP4BH8sAjBu6IDutpFjGR5se1FmF+GrdtDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"00fcf6b5a827751b87ad85f310c3ba0aa19b78b016989b09082510d66a98c875","last_reissued_at":"2026-05-18T00:02:29.269327Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:02:29.269327Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Capacitated Assortment Optimization with Pricing under the Paired Combinatorial Logit Model","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Chuning Gao, Daihan Zhang, Rui Chen, Zhenghe Zhong","submitted_at":"2018-10-23T13:08:32Z","abstract_excerpt":"In this paper, we investigate the capacitated assortment optimization problem with pricing under the paired combinatorial logit model, whose goal is to identify the revenue-maximizing subset of products as well as their selling prices subject to a known capacity limit. We model customers' purchase behavior using the paired combinatorial logit model, which allows for covariance among any pair of products. We formulate this problem as a non-linear mixed integer program. Then, we propose a two-step approach to obtain the optimal solution based on solving a mixed integer program and Lambert-W func"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1810.09829","kind":"arxiv","version":1},"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":"1810.09829","created_at":"2026-05-18T00:02:29.269447+00:00"},{"alias_kind":"arxiv_version","alias_value":"1810.09829v1","created_at":"2026-05-18T00:02:29.269447+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1810.09829","created_at":"2026-05-18T00:02:29.269447+00:00"},{"alias_kind":"pith_short_12","alias_value":"AD6PNNNIE52R","created_at":"2026-05-18T12:32:13.499390+00:00"},{"alias_kind":"pith_short_16","alias_value":"AD6PNNNIE52RXB5N","created_at":"2026-05-18T12:32:13.499390+00:00"},{"alias_kind":"pith_short_8","alias_value":"AD6PNNNI","created_at":"2026-05-18T12:32:13.499390+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/AD6PNNNIE52RXB5NQXZRBQ52BK","json":"https://pith.science/pith/AD6PNNNIE52RXB5NQXZRBQ52BK.json","graph_json":"https://pith.science/api/pith-number/AD6PNNNIE52RXB5NQXZRBQ52BK/graph.json","events_json":"https://pith.science/api/pith-number/AD6PNNNIE52RXB5NQXZRBQ52BK/events.json","paper":"https://pith.science/paper/AD6PNNNI"},"agent_actions":{"view_html":"https://pith.science/pith/AD6PNNNIE52RXB5NQXZRBQ52BK","download_json":"https://pith.science/pith/AD6PNNNIE52RXB5NQXZRBQ52BK.json","view_paper":"https://pith.science/paper/AD6PNNNI","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1810.09829&json=true","fetch_graph":"https://pith.science/api/pith-number/AD6PNNNIE52RXB5NQXZRBQ52BK/graph.json","fetch_events":"https://pith.science/api/pith-number/AD6PNNNIE52RXB5NQXZRBQ52BK/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/AD6PNNNIE52RXB5NQXZRBQ52BK/action/timestamp_anchor","attest_storage":"https://pith.science/pith/AD6PNNNIE52RXB5NQXZRBQ52BK/action/storage_attestation","attest_author":"https://pith.science/pith/AD6PNNNIE52RXB5NQXZRBQ52BK/action/author_attestation","sign_citation":"https://pith.science/pith/AD6PNNNIE52RXB5NQXZRBQ52BK/action/citation_signature","submit_replication":"https://pith.science/pith/AD6PNNNIE52RXB5NQXZRBQ52BK/action/replication_record"}},"created_at":"2026-05-18T00:02:29.269447+00:00","updated_at":"2026-05-18T00:02:29.269447+00:00"}