{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:6JS6JQY6DB2HAU5I674UVBDW2A","short_pith_number":"pith:6JS6JQY6","schema_version":"1.0","canonical_sha256":"f265e4c31e18747053a8f7f94a8476d00ba9ab6373f10d7d5f1f68559ce1db99","source":{"kind":"arxiv","id":"1610.05604","version":3},"attestation_state":"computed","paper":{"title":"Dynamic Assortment Personalization in High Dimensions","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.OC","stat.ME"],"primary_cat":"stat.ML","authors_text":"Madeleine Udell, Nathan Kallus","submitted_at":"2016-10-18T13:32:36Z","abstract_excerpt":"We study the problem of dynamic assortment personalization with large, heterogeneous populations and wide arrays of products, and demonstrate the importance of structural priors for effective, efficient large-scale personalization. Assortment personalization is the problem of choosing, for each individual (type), a best assortment of products, ads, or other offerings (items) so as to maximize revenue. This problem is central to revenue management in e-commerce and online advertising where both items and types can number in the millions.\n  We formulate the dynamic assortment personalization pro"},"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":"1610.05604","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2016-10-18T13:32:36Z","cross_cats_sorted":["math.OC","stat.ME"],"title_canon_sha256":"d3db3393e23b157a812ccd1cd79e4fbb54fc5a47940c5b43836125651db1934c","abstract_canon_sha256":"47c2aebfaecd1f75c1fd15f0c26f4a7bcf3928058bf3789de465e2522363fbfa"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:47:12.924908Z","signature_b64":"5tgVPpa+ZNc8L54ZcCZ33gkG4tB/+4RnX0a8dvu2CZxUposXIQuNuVAaVZ2odNebQP5mGEbCLh7E0Wldch0DCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"f265e4c31e18747053a8f7f94a8476d00ba9ab6373f10d7d5f1f68559ce1db99","last_reissued_at":"2026-05-17T23:47:12.924507Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:47:12.924507Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Dynamic Assortment Personalization in High Dimensions","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.OC","stat.ME"],"primary_cat":"stat.ML","authors_text":"Madeleine Udell, Nathan Kallus","submitted_at":"2016-10-18T13:32:36Z","abstract_excerpt":"We study the problem of dynamic assortment personalization with large, heterogeneous populations and wide arrays of products, and demonstrate the importance of structural priors for effective, efficient large-scale personalization. Assortment personalization is the problem of choosing, for each individual (type), a best assortment of products, ads, or other offerings (items) so as to maximize revenue. This problem is central to revenue management in e-commerce and online advertising where both items and types can number in the millions.\n  We formulate the dynamic assortment personalization pro"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1610.05604","kind":"arxiv","version":3},"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":"1610.05604","created_at":"2026-05-17T23:47:12.924582+00:00"},{"alias_kind":"arxiv_version","alias_value":"1610.05604v3","created_at":"2026-05-17T23:47:12.924582+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1610.05604","created_at":"2026-05-17T23:47:12.924582+00:00"},{"alias_kind":"pith_short_12","alias_value":"6JS6JQY6DB2H","created_at":"2026-05-18T12:30:01.593930+00:00"},{"alias_kind":"pith_short_16","alias_value":"6JS6JQY6DB2HAU5I","created_at":"2026-05-18T12:30:01.593930+00:00"},{"alias_kind":"pith_short_8","alias_value":"6JS6JQY6","created_at":"2026-05-18T12:30:01.593930+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/6JS6JQY6DB2HAU5I674UVBDW2A","json":"https://pith.science/pith/6JS6JQY6DB2HAU5I674UVBDW2A.json","graph_json":"https://pith.science/api/pith-number/6JS6JQY6DB2HAU5I674UVBDW2A/graph.json","events_json":"https://pith.science/api/pith-number/6JS6JQY6DB2HAU5I674UVBDW2A/events.json","paper":"https://pith.science/paper/6JS6JQY6"},"agent_actions":{"view_html":"https://pith.science/pith/6JS6JQY6DB2HAU5I674UVBDW2A","download_json":"https://pith.science/pith/6JS6JQY6DB2HAU5I674UVBDW2A.json","view_paper":"https://pith.science/paper/6JS6JQY6","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1610.05604&json=true","fetch_graph":"https://pith.science/api/pith-number/6JS6JQY6DB2HAU5I674UVBDW2A/graph.json","fetch_events":"https://pith.science/api/pith-number/6JS6JQY6DB2HAU5I674UVBDW2A/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/6JS6JQY6DB2HAU5I674UVBDW2A/action/timestamp_anchor","attest_storage":"https://pith.science/pith/6JS6JQY6DB2HAU5I674UVBDW2A/action/storage_attestation","attest_author":"https://pith.science/pith/6JS6JQY6DB2HAU5I674UVBDW2A/action/author_attestation","sign_citation":"https://pith.science/pith/6JS6JQY6DB2HAU5I674UVBDW2A/action/citation_signature","submit_replication":"https://pith.science/pith/6JS6JQY6DB2HAU5I674UVBDW2A/action/replication_record"}},"created_at":"2026-05-17T23:47:12.924582+00:00","updated_at":"2026-05-17T23:47:12.924582+00:00"}