{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2021:WCUTAT5Q7JRY42DIUTPBFXOZNX","short_pith_number":"pith:WCUTAT5Q","canonical_record":{"source":{"id":"2112.05010","kind":"arxiv","version":4},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.OC","submitted_at":"2021-12-09T16:08:23Z","cross_cats_sorted":[],"title_canon_sha256":"d74c5483718a731b4f462e1010b00ac0b0ae27c9b46de73516d90ae11946c14d","abstract_canon_sha256":"2ec05d348476e22cee0bc5025bb9a38bf059ef0175886bb880234e712b0f1c3c"},"schema_version":"1.0"},"canonical_sha256":"b0a9304fb0fa638e6868a4de12ddd96dc3ee34c802b795f7defb705e33b71ee2","source":{"kind":"arxiv","id":"2112.05010","version":4},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2112.05010","created_at":"2026-07-05T07:49:27Z"},{"alias_kind":"arxiv_version","alias_value":"2112.05010v4","created_at":"2026-07-05T07:49:27Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2112.05010","created_at":"2026-07-05T07:49:27Z"},{"alias_kind":"pith_short_12","alias_value":"WCUTAT5Q7JRY","created_at":"2026-07-05T07:49:27Z"},{"alias_kind":"pith_short_16","alias_value":"WCUTAT5Q7JRY42DI","created_at":"2026-07-05T07:49:27Z"},{"alias_kind":"pith_short_8","alias_value":"WCUTAT5Q","created_at":"2026-07-05T07:49:27Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2021:WCUTAT5Q7JRY42DIUTPBFXOZNX","target":"record","payload":{"canonical_record":{"source":{"id":"2112.05010","kind":"arxiv","version":4},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.OC","submitted_at":"2021-12-09T16:08:23Z","cross_cats_sorted":[],"title_canon_sha256":"d74c5483718a731b4f462e1010b00ac0b0ae27c9b46de73516d90ae11946c14d","abstract_canon_sha256":"2ec05d348476e22cee0bc5025bb9a38bf059ef0175886bb880234e712b0f1c3c"},"schema_version":"1.0"},"canonical_sha256":"b0a9304fb0fa638e6868a4de12ddd96dc3ee34c802b795f7defb705e33b71ee2","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T07:49:27.996034Z","signature_b64":"MkSv0RiFBP3m2V5IetjKV9Yy39LxOGSWx/NvsuBF/UfAEvQ8yKqHXYgnGj2O440lt6z4rJnQGALXiQDQwHz7Cg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"b0a9304fb0fa638e6868a4de12ddd96dc3ee34c802b795f7defb705e33b71ee2","last_reissued_at":"2026-07-05T07:49:27.995551Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T07:49:27.995551Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2112.05010","source_version":4,"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-07-05T07:49:27Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"eJqH5Y8MhJy1MOw3M9nF4tFzIGpxBJvG+DWjEuPx14mOK7Qv7HtTbBSGDYudYKrdBX1wYdQr7H5MEQ6Z0io7Bw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-23T07:04:02.687794Z"},"content_sha256":"71dc7b2719f8a7a4d71c7143b1567b6c2d47fd49345cc37231b2586c472cf0a4","schema_version":"1.0","event_id":"sha256:71dc7b2719f8a7a4d71c7143b1567b6c2d47fd49345cc37231b2586c472cf0a4"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2021:WCUTAT5Q7JRY42DIUTPBFXOZNX","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"The Value of Robust Assortment Optimization Under Ranking-based Choice Models","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Bradley Sturt","submitted_at":"2021-12-09T16:08:23Z","abstract_excerpt":"We study a class of robust assortment optimization problems that was proposed by Farias, Jagabathula, and Shah (2013). The goal in these problems is to find an assortment that maximizes a firm's worst-case expected revenue under all ranking-based choice models that are consistent with the historical sales data generated by the firm's past assortments. We establish for various settings that these robust optimization problems can either be solved in polynomial-time or can be reformulated as compact mixed-integer optimization problems. To establish our results, we prove that optimal assortments f"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2112.05010","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2112.05010/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"},"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-07-05T07:49:27Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"6aIPVJc2UVcRfuROgn1iDAyixqubgm5Rwtk3UTWsMMpLUaoYL39521hKGghC6sA/MlAKfwpoBAL96wJkI1WtAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-23T07:04:02.688130Z"},"content_sha256":"e444cdaafaa6e32ab98fb406698ec79f3d9822c84ef38f2ecabcd617d2c45851","schema_version":"1.0","event_id":"sha256:e444cdaafaa6e32ab98fb406698ec79f3d9822c84ef38f2ecabcd617d2c45851"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/WCUTAT5Q7JRY42DIUTPBFXOZNX/bundle.json","state_url":"https://pith.science/pith/WCUTAT5Q7JRY42DIUTPBFXOZNX/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/WCUTAT5Q7JRY42DIUTPBFXOZNX/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-08-23T07:04:02Z","links":{"resolver":"https://pith.science/pith/WCUTAT5Q7JRY42DIUTPBFXOZNX","bundle":"https://pith.science/pith/WCUTAT5Q7JRY42DIUTPBFXOZNX/bundle.json","state":"https://pith.science/pith/WCUTAT5Q7JRY42DIUTPBFXOZNX/state.json","well_known_bundle":"https://pith.science/.well-known/pith/WCUTAT5Q7JRY42DIUTPBFXOZNX/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2021:WCUTAT5Q7JRY42DIUTPBFXOZNX","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":"2ec05d348476e22cee0bc5025bb9a38bf059ef0175886bb880234e712b0f1c3c","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.OC","submitted_at":"2021-12-09T16:08:23Z","title_canon_sha256":"d74c5483718a731b4f462e1010b00ac0b0ae27c9b46de73516d90ae11946c14d"},"schema_version":"1.0","source":{"id":"2112.05010","kind":"arxiv","version":4}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2112.05010","created_at":"2026-07-05T07:49:27Z"},{"alias_kind":"arxiv_version","alias_value":"2112.05010v4","created_at":"2026-07-05T07:49:27Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2112.05010","created_at":"2026-07-05T07:49:27Z"},{"alias_kind":"pith_short_12","alias_value":"WCUTAT5Q7JRY","created_at":"2026-07-05T07:49:27Z"},{"alias_kind":"pith_short_16","alias_value":"WCUTAT5Q7JRY42DI","created_at":"2026-07-05T07:49:27Z"},{"alias_kind":"pith_short_8","alias_value":"WCUTAT5Q","created_at":"2026-07-05T07:49:27Z"}],"graph_snapshots":[{"event_id":"sha256:e444cdaafaa6e32ab98fb406698ec79f3d9822c84ef38f2ecabcd617d2c45851","target":"graph","created_at":"2026-07-05T07:49:27Z","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"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2112.05010/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"We study a class of robust assortment optimization problems that was proposed by Farias, Jagabathula, and Shah (2013). The goal in these problems is to find an assortment that maximizes a firm's worst-case expected revenue under all ranking-based choice models that are consistent with the historical sales data generated by the firm's past assortments. We establish for various settings that these robust optimization problems can either be solved in polynomial-time or can be reformulated as compact mixed-integer optimization problems. To establish our results, we prove that optimal assortments f","authors_text":"Bradley Sturt","cross_cats":[],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.OC","submitted_at":"2021-12-09T16:08:23Z","title":"The Value of Robust Assortment Optimization Under Ranking-based Choice Models"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2112.05010","kind":"arxiv","version":4},"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:71dc7b2719f8a7a4d71c7143b1567b6c2d47fd49345cc37231b2586c472cf0a4","target":"record","created_at":"2026-07-05T07:49:27Z","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":"2ec05d348476e22cee0bc5025bb9a38bf059ef0175886bb880234e712b0f1c3c","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.OC","submitted_at":"2021-12-09T16:08:23Z","title_canon_sha256":"d74c5483718a731b4f462e1010b00ac0b0ae27c9b46de73516d90ae11946c14d"},"schema_version":"1.0","source":{"id":"2112.05010","kind":"arxiv","version":4}},"canonical_sha256":"b0a9304fb0fa638e6868a4de12ddd96dc3ee34c802b795f7defb705e33b71ee2","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"b0a9304fb0fa638e6868a4de12ddd96dc3ee34c802b795f7defb705e33b71ee2","first_computed_at":"2026-07-05T07:49:27.995551Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T07:49:27.995551Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"MkSv0RiFBP3m2V5IetjKV9Yy39LxOGSWx/NvsuBF/UfAEvQ8yKqHXYgnGj2O440lt6z4rJnQGALXiQDQwHz7Cg==","signature_status":"signed_v1","signed_at":"2026-07-05T07:49:27.996034Z","signed_message":"canonical_sha256_bytes"},"source_id":"2112.05010","source_kind":"arxiv","source_version":4}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:71dc7b2719f8a7a4d71c7143b1567b6c2d47fd49345cc37231b2586c472cf0a4","sha256:e444cdaafaa6e32ab98fb406698ec79f3d9822c84ef38f2ecabcd617d2c45851"],"state_sha256":"a2161e5a4a4ae9aa9d453e54d3f707a4a78c2d80b92d3960c7e06a03a3bbb017"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"3ozGYX02GSIyi2IlINJF0OwowvWnHCIawKwvLtPcxuARihT7n0EMPPqzj1aOv5wLxpHELTVXTb9BQEL2DquXDg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-23T07:04:02.691455Z","bundle_sha256":"532e7bfe0b99c022c5823381db43afe7258be88ce6beced75c50c6867c749f0d"}}