{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:5APDSX46PACYPXPJRMET73NWQL","short_pith_number":"pith:5APDSX46","schema_version":"1.0","canonical_sha256":"e81e395f9e780587dde98b093fedb682cf8a6472acfbe711437b191fca0d8236","source":{"kind":"arxiv","id":"1603.09014","version":1},"attestation_state":"computed","paper":{"title":"A combinatorial algorithm for constrained assortment optimization under nested logit model","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Tian Xie","submitted_at":"2016-03-30T01:37:20Z","abstract_excerpt":"We consider the assortment optimization problem with disjoint-cardinality constraints under two-level nested logit model. To solve this problem, we first identify a candidate set with $O(mn^2)$ assortments and show that at least one optimal assortment is included in this set. Based on this observation, a fast algorithm, which runs in $O(m n^2 \\log mn)$ time, is proposed to find an optimal assortment."},"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":"1603.09014","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2016-03-30T01:37:20Z","cross_cats_sorted":[],"title_canon_sha256":"5bcd5493a8c1ceaff9e63cdda58046845699217a48c8d29df7f026285c448603","abstract_canon_sha256":"348332db0669fffa552cb210e8eff7da979f85c9220709eb3bb15b78e708e512"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:18:03.997949Z","signature_b64":"gyY5rNTuFPynrHhKkvHuDMWracFMRTHVCMYNBBEyg7y3U6Ty46VZXjEPjiRmd+sOSW3NV7fkvaeEwU2KqO3CCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"e81e395f9e780587dde98b093fedb682cf8a6472acfbe711437b191fca0d8236","last_reissued_at":"2026-05-18T01:18:03.997462Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:18:03.997462Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A combinatorial algorithm for constrained assortment optimization under nested logit model","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Tian Xie","submitted_at":"2016-03-30T01:37:20Z","abstract_excerpt":"We consider the assortment optimization problem with disjoint-cardinality constraints under two-level nested logit model. To solve this problem, we first identify a candidate set with $O(mn^2)$ assortments and show that at least one optimal assortment is included in this set. Based on this observation, a fast algorithm, which runs in $O(m n^2 \\log mn)$ time, is proposed to find an optimal assortment."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1603.09014","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":"1603.09014","created_at":"2026-05-18T01:18:03.997535+00:00"},{"alias_kind":"arxiv_version","alias_value":"1603.09014v1","created_at":"2026-05-18T01:18:03.997535+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1603.09014","created_at":"2026-05-18T01:18:03.997535+00:00"},{"alias_kind":"pith_short_12","alias_value":"5APDSX46PACY","created_at":"2026-05-18T12:29:58.707656+00:00"},{"alias_kind":"pith_short_16","alias_value":"5APDSX46PACYPXPJ","created_at":"2026-05-18T12:29:58.707656+00:00"},{"alias_kind":"pith_short_8","alias_value":"5APDSX46","created_at":"2026-05-18T12:29:58.707656+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/5APDSX46PACYPXPJRMET73NWQL","json":"https://pith.science/pith/5APDSX46PACYPXPJRMET73NWQL.json","graph_json":"https://pith.science/api/pith-number/5APDSX46PACYPXPJRMET73NWQL/graph.json","events_json":"https://pith.science/api/pith-number/5APDSX46PACYPXPJRMET73NWQL/events.json","paper":"https://pith.science/paper/5APDSX46"},"agent_actions":{"view_html":"https://pith.science/pith/5APDSX46PACYPXPJRMET73NWQL","download_json":"https://pith.science/pith/5APDSX46PACYPXPJRMET73NWQL.json","view_paper":"https://pith.science/paper/5APDSX46","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1603.09014&json=true","fetch_graph":"https://pith.science/api/pith-number/5APDSX46PACYPXPJRMET73NWQL/graph.json","fetch_events":"https://pith.science/api/pith-number/5APDSX46PACYPXPJRMET73NWQL/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/5APDSX46PACYPXPJRMET73NWQL/action/timestamp_anchor","attest_storage":"https://pith.science/pith/5APDSX46PACYPXPJRMET73NWQL/action/storage_attestation","attest_author":"https://pith.science/pith/5APDSX46PACYPXPJRMET73NWQL/action/author_attestation","sign_citation":"https://pith.science/pith/5APDSX46PACYPXPJRMET73NWQL/action/citation_signature","submit_replication":"https://pith.science/pith/5APDSX46PACYPXPJRMET73NWQL/action/replication_record"}},"created_at":"2026-05-18T01:18:03.997535+00:00","updated_at":"2026-05-18T01:18:03.997535+00:00"}