{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:XQC74C4BWWDACDZ3PK54XNDQAF","short_pith_number":"pith:XQC74C4B","canonical_record":{"source":{"id":"1705.09040","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2017-05-25T04:26:30Z","cross_cats_sorted":[],"title_canon_sha256":"2c50b27c269635be92d0e7a99c3e7cf0f523c2699ab527b6f76726f1c421057e","abstract_canon_sha256":"e6a1dffd2a636dcb3151b9f69b6b01c9467913588f6e5c361999d8316a86358f"},"schema_version":"1.0"},"canonical_sha256":"bc05fe0b81b586010f3b7abbcbb470016531bfaed2d9cb5ebd68972cff996318","source":{"kind":"arxiv","id":"1705.09040","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1705.09040","created_at":"2026-05-18T00:38:08Z"},{"alias_kind":"arxiv_version","alias_value":"1705.09040v2","created_at":"2026-05-18T00:38:08Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1705.09040","created_at":"2026-05-18T00:38:08Z"},{"alias_kind":"pith_short_12","alias_value":"XQC74C4BWWDA","created_at":"2026-05-18T12:31:56Z"},{"alias_kind":"pith_short_16","alias_value":"XQC74C4BWWDACDZ3","created_at":"2026-05-18T12:31:56Z"},{"alias_kind":"pith_short_8","alias_value":"XQC74C4B","created_at":"2026-05-18T12:31:56Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:XQC74C4BWWDACDZ3PK54XNDQAF","target":"record","payload":{"canonical_record":{"source":{"id":"1705.09040","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2017-05-25T04:26:30Z","cross_cats_sorted":[],"title_canon_sha256":"2c50b27c269635be92d0e7a99c3e7cf0f523c2699ab527b6f76726f1c421057e","abstract_canon_sha256":"e6a1dffd2a636dcb3151b9f69b6b01c9467913588f6e5c361999d8316a86358f"},"schema_version":"1.0"},"canonical_sha256":"bc05fe0b81b586010f3b7abbcbb470016531bfaed2d9cb5ebd68972cff996318","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:38:08.543721Z","signature_b64":"+BmaUQ/WXCayPAHE3gqaZdm2OnGnJEGYhfRakpqChhjLoWVUBFtjOWxCwxIwsYy5yxGSD5plZl/JRlCXNA+kCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"bc05fe0b81b586010f3b7abbcbb470016531bfaed2d9cb5ebd68972cff996318","last_reissued_at":"2026-05-18T00:38:08.543235Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:38:08.543235Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1705.09040","source_version":2,"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:38:08Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"omQzxg3K/Ha4cElFX/h7sSibnebL80OlBDjyyWeqTJgnHkzC36d8FJP1VJE/J4YMLCGq37chV1r++D8vVi4vBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T20:09:43.567640Z"},"content_sha256":"054f3086d7900d690302d8ea5e5efbf15e2521230ad97a0bcbd6eaa77fff574b","schema_version":"1.0","event_id":"sha256:054f3086d7900d690302d8ea5e5efbf15e2521230ad97a0bcbd6eaa77fff574b"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:XQC74C4BWWDACDZ3PK54XNDQAF","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"A Conic Integer Programming Approach to Constrained Assortment Optimization under the Mixed Multinomial Logit Model","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Alper Atamturk, Alper Sen, Philip Kaminsky","submitted_at":"2017-05-25T04:26:30Z","abstract_excerpt":"We consider the constrained assortment optimization problem under the mixed multinomial logit model. Even moderately sized instances of this problem are challenging to solve directly using standard mixed-integer linear optimization formulations. This has motivated recent research exploring customized optimization strategies and approximation techniques. In contrast, we develop a novel conic quadratic mixed-integer formulation. This new formulation, together with McCormick inequalities exploiting the capacity constraints, enables the solution of large instances using commercial optimization sof"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1705.09040","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":""},"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:38:08Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"G7TdvBKFSq9LWgkvYWhgvjRmXP/MJVbSBmpN5gpLi8u2qJDgQXnApcyZM3YPZoWBEeb769tuVpFAB/Ugv2XFCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T20:09:43.568395Z"},"content_sha256":"9c5019a35ff63a5978f3d53d556f9497c53bbde80034ff5a7c1e3019504b072e","schema_version":"1.0","event_id":"sha256:9c5019a35ff63a5978f3d53d556f9497c53bbde80034ff5a7c1e3019504b072e"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/XQC74C4BWWDACDZ3PK54XNDQAF/bundle.json","state_url":"https://pith.science/pith/XQC74C4BWWDACDZ3PK54XNDQAF/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/XQC74C4BWWDACDZ3PK54XNDQAF/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-05-31T20:09:43Z","links":{"resolver":"https://pith.science/pith/XQC74C4BWWDACDZ3PK54XNDQAF","bundle":"https://pith.science/pith/XQC74C4BWWDACDZ3PK54XNDQAF/bundle.json","state":"https://pith.science/pith/XQC74C4BWWDACDZ3PK54XNDQAF/state.json","well_known_bundle":"https://pith.science/.well-known/pith/XQC74C4BWWDACDZ3PK54XNDQAF/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:XQC74C4BWWDACDZ3PK54XNDQAF","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":"e6a1dffd2a636dcb3151b9f69b6b01c9467913588f6e5c361999d8316a86358f","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2017-05-25T04:26:30Z","title_canon_sha256":"2c50b27c269635be92d0e7a99c3e7cf0f523c2699ab527b6f76726f1c421057e"},"schema_version":"1.0","source":{"id":"1705.09040","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1705.09040","created_at":"2026-05-18T00:38:08Z"},{"alias_kind":"arxiv_version","alias_value":"1705.09040v2","created_at":"2026-05-18T00:38:08Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1705.09040","created_at":"2026-05-18T00:38:08Z"},{"alias_kind":"pith_short_12","alias_value":"XQC74C4BWWDA","created_at":"2026-05-18T12:31:56Z"},{"alias_kind":"pith_short_16","alias_value":"XQC74C4BWWDACDZ3","created_at":"2026-05-18T12:31:56Z"},{"alias_kind":"pith_short_8","alias_value":"XQC74C4B","created_at":"2026-05-18T12:31:56Z"}],"graph_snapshots":[{"event_id":"sha256:9c5019a35ff63a5978f3d53d556f9497c53bbde80034ff5a7c1e3019504b072e","target":"graph","created_at":"2026-05-18T00:38:08Z","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 consider the constrained assortment optimization problem under the mixed multinomial logit model. Even moderately sized instances of this problem are challenging to solve directly using standard mixed-integer linear optimization formulations. This has motivated recent research exploring customized optimization strategies and approximation techniques. In contrast, we develop a novel conic quadratic mixed-integer formulation. This new formulation, together with McCormick inequalities exploiting the capacity constraints, enables the solution of large instances using commercial optimization sof","authors_text":"Alper Atamturk, Alper Sen, Philip Kaminsky","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2017-05-25T04:26:30Z","title":"A Conic Integer Programming Approach to Constrained Assortment Optimization under the Mixed Multinomial Logit Model"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1705.09040","kind":"arxiv","version":2},"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:054f3086d7900d690302d8ea5e5efbf15e2521230ad97a0bcbd6eaa77fff574b","target":"record","created_at":"2026-05-18T00:38:08Z","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":"e6a1dffd2a636dcb3151b9f69b6b01c9467913588f6e5c361999d8316a86358f","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2017-05-25T04:26:30Z","title_canon_sha256":"2c50b27c269635be92d0e7a99c3e7cf0f523c2699ab527b6f76726f1c421057e"},"schema_version":"1.0","source":{"id":"1705.09040","kind":"arxiv","version":2}},"canonical_sha256":"bc05fe0b81b586010f3b7abbcbb470016531bfaed2d9cb5ebd68972cff996318","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"bc05fe0b81b586010f3b7abbcbb470016531bfaed2d9cb5ebd68972cff996318","first_computed_at":"2026-05-18T00:38:08.543235Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:38:08.543235Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"+BmaUQ/WXCayPAHE3gqaZdm2OnGnJEGYhfRakpqChhjLoWVUBFtjOWxCwxIwsYy5yxGSD5plZl/JRlCXNA+kCQ==","signature_status":"signed_v1","signed_at":"2026-05-18T00:38:08.543721Z","signed_message":"canonical_sha256_bytes"},"source_id":"1705.09040","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:054f3086d7900d690302d8ea5e5efbf15e2521230ad97a0bcbd6eaa77fff574b","sha256:9c5019a35ff63a5978f3d53d556f9497c53bbde80034ff5a7c1e3019504b072e"],"state_sha256":"3a0e338f0a072e154d1edfa5b5fa280a86034ebc21153cb74cf1e49ef606c249"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"m1S8JtLDH6xeqW+Dxc31QAYABRIPu78kDn1N9lbUdqW8u5+I8SEFF7bPouSYP/A3s9bh92MLxp6j+MCB9i6KAA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-31T20:09:43.573000Z","bundle_sha256":"383fce327cf76d0f38033f67669f0a82198a5eb73de63524768e347af4504ab6"}}