{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:ZUPLFSR32HORFHRIFRATGWDWVJ","short_pith_number":"pith:ZUPLFSR3","canonical_record":{"source":{"id":"1701.07483","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ME","submitted_at":"2017-01-25T20:47:40Z","cross_cats_sorted":["cs.LG","stat.AP","stat.ML"],"title_canon_sha256":"3d204f769bc89e9cb1d8f2c91280b2ec37e01314849f3681a15962afcb862410","abstract_canon_sha256":"c8250da8616696b785479a77d742a4f980c3cb9adc2926ada56450abebe582d3"},"schema_version":"1.0"},"canonical_sha256":"cd1eb2ca3bd1dd129e282c41335876aa4b53c378169ea5dcdf8c1b6d6994e038","source":{"kind":"arxiv","id":"1701.07483","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1701.07483","created_at":"2026-05-18T00:52:03Z"},{"alias_kind":"arxiv_version","alias_value":"1701.07483v1","created_at":"2026-05-18T00:52:03Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1701.07483","created_at":"2026-05-18T00:52:03Z"},{"alias_kind":"pith_short_12","alias_value":"ZUPLFSR32HOR","created_at":"2026-05-18T12:31:59Z"},{"alias_kind":"pith_short_16","alias_value":"ZUPLFSR32HORFHRI","created_at":"2026-05-18T12:31:59Z"},{"alias_kind":"pith_short_8","alias_value":"ZUPLFSR3","created_at":"2026-05-18T12:31:59Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:ZUPLFSR32HORFHRIFRATGWDWVJ","target":"record","payload":{"canonical_record":{"source":{"id":"1701.07483","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ME","submitted_at":"2017-01-25T20:47:40Z","cross_cats_sorted":["cs.LG","stat.AP","stat.ML"],"title_canon_sha256":"3d204f769bc89e9cb1d8f2c91280b2ec37e01314849f3681a15962afcb862410","abstract_canon_sha256":"c8250da8616696b785479a77d742a4f980c3cb9adc2926ada56450abebe582d3"},"schema_version":"1.0"},"canonical_sha256":"cd1eb2ca3bd1dd129e282c41335876aa4b53c378169ea5dcdf8c1b6d6994e038","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:52:03.374868Z","signature_b64":"N47gP+nVakGgKfLH79BDeoxChXsdmkncwxy7+RtaB5pd3PcFR4b3WjDoR3vmNK4bl1ld2OyBmB5Zm/x+oIHgAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"cd1eb2ca3bd1dd129e282c41335876aa4b53c378169ea5dcdf8c1b6d6994e038","last_reissued_at":"2026-05-18T00:52:03.374390Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:52:03.374390Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1701.07483","source_version":1,"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:52:03Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"OMW1/SsLhr4KFaJTLsTC2ISxIzOVRUuaHGswIGzlvc3KM1ar90I77+MbDUYoa9XSiYfHcq7fbFhyNOazbz3PDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-01T21:12:33.452987Z"},"content_sha256":"de9bd84f3ba7b2e6b0c3790817b1149da756e7a7fecfe9dffeb1837e43ff3f14","schema_version":"1.0","event_id":"sha256:de9bd84f3ba7b2e6b0c3790817b1149da756e7a7fecfe9dffeb1837e43ff3f14"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:ZUPLFSR32HORFHRIFRATGWDWVJ","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"A Model-based Projection Technique for Segmenting Customers","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG","stat.AP","stat.ML"],"primary_cat":"stat.ME","authors_text":"Ashwin Venkataraman, Lakshminarayanan Subramanian, Srikanth Jagabathula","submitted_at":"2017-01-25T20:47:40Z","abstract_excerpt":"We consider the problem of segmenting a large population of customers into non-overlapping groups with similar preferences, using diverse preference observations such as purchases, ratings, clicks, etc. over subsets of items. We focus on the setting where the universe of items is large (ranging from thousands to millions) and unstructured (lacking well-defined attributes) and each customer provides observations for only a few items. These data characteristics limit the applicability of existing techniques in marketing and machine learning. To overcome these limitations, we propose a model-base"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1701.07483","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"},"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:52:03Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"oCX/WXIBcGAm1zkONet2sUwpaeqQAL242RfVHi70F9xGyhaNq7EQ0pmk2Ja1Oe+cGZsSy3J1hRPn4OWU8G0yAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-01T21:12:33.453351Z"},"content_sha256":"f37c0c694a4efc04b9139161f48e2a9234a6cc2643132ee3e69c000ce8ddd78c","schema_version":"1.0","event_id":"sha256:f37c0c694a4efc04b9139161f48e2a9234a6cc2643132ee3e69c000ce8ddd78c"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/ZUPLFSR32HORFHRIFRATGWDWVJ/bundle.json","state_url":"https://pith.science/pith/ZUPLFSR32HORFHRIFRATGWDWVJ/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/ZUPLFSR32HORFHRIFRATGWDWVJ/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-01T21:12:33Z","links":{"resolver":"https://pith.science/pith/ZUPLFSR32HORFHRIFRATGWDWVJ","bundle":"https://pith.science/pith/ZUPLFSR32HORFHRIFRATGWDWVJ/bundle.json","state":"https://pith.science/pith/ZUPLFSR32HORFHRIFRATGWDWVJ/state.json","well_known_bundle":"https://pith.science/.well-known/pith/ZUPLFSR32HORFHRIFRATGWDWVJ/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:ZUPLFSR32HORFHRIFRATGWDWVJ","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":"c8250da8616696b785479a77d742a4f980c3cb9adc2926ada56450abebe582d3","cross_cats_sorted":["cs.LG","stat.AP","stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ME","submitted_at":"2017-01-25T20:47:40Z","title_canon_sha256":"3d204f769bc89e9cb1d8f2c91280b2ec37e01314849f3681a15962afcb862410"},"schema_version":"1.0","source":{"id":"1701.07483","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1701.07483","created_at":"2026-05-18T00:52:03Z"},{"alias_kind":"arxiv_version","alias_value":"1701.07483v1","created_at":"2026-05-18T00:52:03Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1701.07483","created_at":"2026-05-18T00:52:03Z"},{"alias_kind":"pith_short_12","alias_value":"ZUPLFSR32HOR","created_at":"2026-05-18T12:31:59Z"},{"alias_kind":"pith_short_16","alias_value":"ZUPLFSR32HORFHRI","created_at":"2026-05-18T12:31:59Z"},{"alias_kind":"pith_short_8","alias_value":"ZUPLFSR3","created_at":"2026-05-18T12:31:59Z"}],"graph_snapshots":[{"event_id":"sha256:f37c0c694a4efc04b9139161f48e2a9234a6cc2643132ee3e69c000ce8ddd78c","target":"graph","created_at":"2026-05-18T00:52:03Z","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 problem of segmenting a large population of customers into non-overlapping groups with similar preferences, using diverse preference observations such as purchases, ratings, clicks, etc. over subsets of items. We focus on the setting where the universe of items is large (ranging from thousands to millions) and unstructured (lacking well-defined attributes) and each customer provides observations for only a few items. These data characteristics limit the applicability of existing techniques in marketing and machine learning. To overcome these limitations, we propose a model-base","authors_text":"Ashwin Venkataraman, Lakshminarayanan Subramanian, Srikanth Jagabathula","cross_cats":["cs.LG","stat.AP","stat.ML"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ME","submitted_at":"2017-01-25T20:47:40Z","title":"A Model-based Projection Technique for Segmenting Customers"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1701.07483","kind":"arxiv","version":1},"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:de9bd84f3ba7b2e6b0c3790817b1149da756e7a7fecfe9dffeb1837e43ff3f14","target":"record","created_at":"2026-05-18T00:52:03Z","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":"c8250da8616696b785479a77d742a4f980c3cb9adc2926ada56450abebe582d3","cross_cats_sorted":["cs.LG","stat.AP","stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ME","submitted_at":"2017-01-25T20:47:40Z","title_canon_sha256":"3d204f769bc89e9cb1d8f2c91280b2ec37e01314849f3681a15962afcb862410"},"schema_version":"1.0","source":{"id":"1701.07483","kind":"arxiv","version":1}},"canonical_sha256":"cd1eb2ca3bd1dd129e282c41335876aa4b53c378169ea5dcdf8c1b6d6994e038","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"cd1eb2ca3bd1dd129e282c41335876aa4b53c378169ea5dcdf8c1b6d6994e038","first_computed_at":"2026-05-18T00:52:03.374390Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:52:03.374390Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"N47gP+nVakGgKfLH79BDeoxChXsdmkncwxy7+RtaB5pd3PcFR4b3WjDoR3vmNK4bl1ld2OyBmB5Zm/x+oIHgAA==","signature_status":"signed_v1","signed_at":"2026-05-18T00:52:03.374868Z","signed_message":"canonical_sha256_bytes"},"source_id":"1701.07483","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:de9bd84f3ba7b2e6b0c3790817b1149da756e7a7fecfe9dffeb1837e43ff3f14","sha256:f37c0c694a4efc04b9139161f48e2a9234a6cc2643132ee3e69c000ce8ddd78c"],"state_sha256":"74d967977b46518df83f7cc5eac97dea5dca9cc28aff89b04a6f2d3690d4a23c"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"IJoAVp7NTnYJiT4MDveIdP/2/gCnwXsh0xdAjh5LiFgOd8UcNmGCJI0AlHdveWtrljZibQ2rgpKadhRCnskWDw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-01T21:12:33.455356Z","bundle_sha256":"8d84734fd65cf22efbc31a8b61b950ea570177299ef2c761481be5a832b1ea7e"}}