{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:6JS6JQY6DB2HAU5I674UVBDW2A","short_pith_number":"pith:6JS6JQY6","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"},"canonical_sha256":"f265e4c31e18747053a8f7f94a8476d00ba9ab6373f10d7d5f1f68559ce1db99","source":{"kind":"arxiv","id":"1610.05604","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1610.05604","created_at":"2026-05-17T23:47:12Z"},{"alias_kind":"arxiv_version","alias_value":"1610.05604v3","created_at":"2026-05-17T23:47:12Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1610.05604","created_at":"2026-05-17T23:47:12Z"},{"alias_kind":"pith_short_12","alias_value":"6JS6JQY6DB2H","created_at":"2026-05-18T12:30:01Z"},{"alias_kind":"pith_short_16","alias_value":"6JS6JQY6DB2HAU5I","created_at":"2026-05-18T12:30:01Z"},{"alias_kind":"pith_short_8","alias_value":"6JS6JQY6","created_at":"2026-05-18T12:30:01Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:6JS6JQY6DB2HAU5I674UVBDW2A","target":"record","payload":{"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"},"canonical_sha256":"f265e4c31e18747053a8f7f94a8476d00ba9ab6373f10d7d5f1f68559ce1db99","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"},"source_kind":"arxiv","source_id":"1610.05604","source_version":3,"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-17T23:47:12Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"yW3hERiL5XAoRRdMbaYKifh5Qo0fJ8WQkfpgzqOrqcR/ZIJprjHg0Vm1F+35nb1hGN5xVXbPuIzyX0ST7+asBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-02T01:20:00.434737Z"},"content_sha256":"e5ba40b5b4a1791f866239f4e139892ecb509a21cbeb190284be4c408d304745","schema_version":"1.0","event_id":"sha256:e5ba40b5b4a1791f866239f4e139892ecb509a21cbeb190284be4c408d304745"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:6JS6JQY6DB2HAU5I674UVBDW2A","target":"graph","payload":{"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"},"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-17T23:47:12Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"RiDoqc0HfIeFPZECrKiMm0avmS47XngRMBKsnw3eu7E6IzsTQ0nofOGKMDUBeeWDSKcaFxCFPmeRmuZJazZDDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-02T01:20:00.435084Z"},"content_sha256":"1e7ba266c642b4b7422459cc2461bb50544cede65ad7a43f597fb2ea1795b31a","schema_version":"1.0","event_id":"sha256:1e7ba266c642b4b7422459cc2461bb50544cede65ad7a43f597fb2ea1795b31a"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/6JS6JQY6DB2HAU5I674UVBDW2A/bundle.json","state_url":"https://pith.science/pith/6JS6JQY6DB2HAU5I674UVBDW2A/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/6JS6JQY6DB2HAU5I674UVBDW2A/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-06-02T01:20:00Z","links":{"resolver":"https://pith.science/pith/6JS6JQY6DB2HAU5I674UVBDW2A","bundle":"https://pith.science/pith/6JS6JQY6DB2HAU5I674UVBDW2A/bundle.json","state":"https://pith.science/pith/6JS6JQY6DB2HAU5I674UVBDW2A/state.json","well_known_bundle":"https://pith.science/.well-known/pith/6JS6JQY6DB2HAU5I674UVBDW2A/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:6JS6JQY6DB2HAU5I674UVBDW2A","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":"47c2aebfaecd1f75c1fd15f0c26f4a7bcf3928058bf3789de465e2522363fbfa","cross_cats_sorted":["math.OC","stat.ME"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2016-10-18T13:32:36Z","title_canon_sha256":"d3db3393e23b157a812ccd1cd79e4fbb54fc5a47940c5b43836125651db1934c"},"schema_version":"1.0","source":{"id":"1610.05604","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1610.05604","created_at":"2026-05-17T23:47:12Z"},{"alias_kind":"arxiv_version","alias_value":"1610.05604v3","created_at":"2026-05-17T23:47:12Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1610.05604","created_at":"2026-05-17T23:47:12Z"},{"alias_kind":"pith_short_12","alias_value":"6JS6JQY6DB2H","created_at":"2026-05-18T12:30:01Z"},{"alias_kind":"pith_short_16","alias_value":"6JS6JQY6DB2HAU5I","created_at":"2026-05-18T12:30:01Z"},{"alias_kind":"pith_short_8","alias_value":"6JS6JQY6","created_at":"2026-05-18T12:30:01Z"}],"graph_snapshots":[{"event_id":"sha256:1e7ba266c642b4b7422459cc2461bb50544cede65ad7a43f597fb2ea1795b31a","target":"graph","created_at":"2026-05-17T23:47:12Z","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 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","authors_text":"Madeleine Udell, Nathan Kallus","cross_cats":["math.OC","stat.ME"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2016-10-18T13:32:36Z","title":"Dynamic Assortment Personalization in High Dimensions"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1610.05604","kind":"arxiv","version":3},"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:e5ba40b5b4a1791f866239f4e139892ecb509a21cbeb190284be4c408d304745","target":"record","created_at":"2026-05-17T23:47:12Z","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":"47c2aebfaecd1f75c1fd15f0c26f4a7bcf3928058bf3789de465e2522363fbfa","cross_cats_sorted":["math.OC","stat.ME"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2016-10-18T13:32:36Z","title_canon_sha256":"d3db3393e23b157a812ccd1cd79e4fbb54fc5a47940c5b43836125651db1934c"},"schema_version":"1.0","source":{"id":"1610.05604","kind":"arxiv","version":3}},"canonical_sha256":"f265e4c31e18747053a8f7f94a8476d00ba9ab6373f10d7d5f1f68559ce1db99","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"f265e4c31e18747053a8f7f94a8476d00ba9ab6373f10d7d5f1f68559ce1db99","first_computed_at":"2026-05-17T23:47:12.924507Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:47:12.924507Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"5tgVPpa+ZNc8L54ZcCZ33gkG4tB/+4RnX0a8dvu2CZxUposXIQuNuVAaVZ2odNebQP5mGEbCLh7E0Wldch0DCA==","signature_status":"signed_v1","signed_at":"2026-05-17T23:47:12.924908Z","signed_message":"canonical_sha256_bytes"},"source_id":"1610.05604","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:e5ba40b5b4a1791f866239f4e139892ecb509a21cbeb190284be4c408d304745","sha256:1e7ba266c642b4b7422459cc2461bb50544cede65ad7a43f597fb2ea1795b31a"],"state_sha256":"5e5af546e9ebafe8f4cc696b7a09bfd84d700d1a6cf2a3fdcc3b149780e30bc9"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"/ZK6SiDxYH/FkGoqMIE8JOw8Pw+qvFe/ydY3aPELP9NkSu/AUbvZ6JcfqU4PvkpNU+OVJ4ldugC4L6KkyJI0DA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-02T01:20:00.437022Z","bundle_sha256":"2fcf3247520566205f6e8ba48ed04a9c4561529da891a3c672a78686505ec6f7"}}