{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:DK53GNYZ7N6HHHOP2ZY26RXTMD","short_pith_number":"pith:DK53GNYZ","canonical_record":{"source":{"id":"1801.01708","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2018-01-05T11:00:46Z","cross_cats_sorted":["cs.IR","stat.ML"],"title_canon_sha256":"ff8e3bba7427e9290bf3cef3025c0ef2b8929afe3be3a947cc1ddf014d6dcf4b","abstract_canon_sha256":"7802f74de6583f45893fdf5501bc40eb5517b6c970592f60053a3d91904ea8d0"},"schema_version":"1.0"},"canonical_sha256":"1abbb33719fb7c739dcfd671af46f360dbe65fb162c9a3d564a8a59a07bccdac","source":{"kind":"arxiv","id":"1801.01708","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1801.01708","created_at":"2026-05-18T00:26:41Z"},{"alias_kind":"arxiv_version","alias_value":"1801.01708v1","created_at":"2026-05-18T00:26:41Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1801.01708","created_at":"2026-05-18T00:26:41Z"},{"alias_kind":"pith_short_12","alias_value":"DK53GNYZ7N6H","created_at":"2026-05-18T12:32:19Z"},{"alias_kind":"pith_short_16","alias_value":"DK53GNYZ7N6HHHOP","created_at":"2026-05-18T12:32:19Z"},{"alias_kind":"pith_short_8","alias_value":"DK53GNYZ","created_at":"2026-05-18T12:32:19Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:DK53GNYZ7N6HHHOP2ZY26RXTMD","target":"record","payload":{"canonical_record":{"source":{"id":"1801.01708","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2018-01-05T11:00:46Z","cross_cats_sorted":["cs.IR","stat.ML"],"title_canon_sha256":"ff8e3bba7427e9290bf3cef3025c0ef2b8929afe3be3a947cc1ddf014d6dcf4b","abstract_canon_sha256":"7802f74de6583f45893fdf5501bc40eb5517b6c970592f60053a3d91904ea8d0"},"schema_version":"1.0"},"canonical_sha256":"1abbb33719fb7c739dcfd671af46f360dbe65fb162c9a3d564a8a59a07bccdac","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:26:41.294125Z","signature_b64":"m2qlvIv7XRs7/eG6J1GgKacq+SCmszo9vbjTim4wPbTo+PNhk09+5vDfCiu/JfM0HCDQ7SS7XdY5b3QEochNBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"1abbb33719fb7c739dcfd671af46f360dbe65fb162c9a3d564a8a59a07bccdac","last_reissued_at":"2026-05-18T00:26:41.293655Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:26:41.293655Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1801.01708","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:26:41Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"eTnkc76kLS+oyrv+lxEiF3Yw4qKaYVOgZbs0yufiMXFy6qu/oUa5HU5QMfbUGbr1RQkf1o7ambncNSbSzBJKDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-01T04:20:49.271080Z"},"content_sha256":"307dfc181f6f2f8c21773d0342b24a4a5ccdb9ad03fa8466c1ad7ebcaba3dd12","schema_version":"1.0","event_id":"sha256:307dfc181f6f2f8c21773d0342b24a4a5ccdb9ad03fa8466c1ad7ebcaba3dd12"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:DK53GNYZ7N6HHHOP2ZY26RXTMD","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Negative Binomial Matrix Factorization for Recommender Systems","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.IR","stat.ML"],"primary_cat":"cs.LG","authors_text":"C\\'edric F\\'evotte, Olivier Gouvert, Thomas Oberlin","submitted_at":"2018-01-05T11:00:46Z","abstract_excerpt":"We introduce negative binomial matrix factorization (NBMF), a matrix factorization technique specially designed for analyzing over-dispersed count data. It can be viewed as an extension of Poisson matrix factorization (PF) perturbed by a multiplicative term which models exposure. This term brings a degree of freedom for controlling the dispersion, making NBMF more robust to outliers. We show that NBMF allows to skip traditional pre-processing stages, such as binarization, which lead to loss of information. Two estimation approaches are presented: maximum likelihood and variational Bayes infere"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1801.01708","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:26:41Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"BQirAPh1owiN2kvco/Y9Lwdipc/MSDseUgFSn/za3JPfZBkY8QQNbGjXiJpVf3Hq5FX3B3udNm/ywtplsbX0AQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-01T04:20:49.271458Z"},"content_sha256":"678fe6524478c7549709a84bbbadd6399114799b797e09bf67992a3405392c20","schema_version":"1.0","event_id":"sha256:678fe6524478c7549709a84bbbadd6399114799b797e09bf67992a3405392c20"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/DK53GNYZ7N6HHHOP2ZY26RXTMD/bundle.json","state_url":"https://pith.science/pith/DK53GNYZ7N6HHHOP2ZY26RXTMD/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/DK53GNYZ7N6HHHOP2ZY26RXTMD/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-01T04:20:49Z","links":{"resolver":"https://pith.science/pith/DK53GNYZ7N6HHHOP2ZY26RXTMD","bundle":"https://pith.science/pith/DK53GNYZ7N6HHHOP2ZY26RXTMD/bundle.json","state":"https://pith.science/pith/DK53GNYZ7N6HHHOP2ZY26RXTMD/state.json","well_known_bundle":"https://pith.science/.well-known/pith/DK53GNYZ7N6HHHOP2ZY26RXTMD/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:DK53GNYZ7N6HHHOP2ZY26RXTMD","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":"7802f74de6583f45893fdf5501bc40eb5517b6c970592f60053a3d91904ea8d0","cross_cats_sorted":["cs.IR","stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2018-01-05T11:00:46Z","title_canon_sha256":"ff8e3bba7427e9290bf3cef3025c0ef2b8929afe3be3a947cc1ddf014d6dcf4b"},"schema_version":"1.0","source":{"id":"1801.01708","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1801.01708","created_at":"2026-05-18T00:26:41Z"},{"alias_kind":"arxiv_version","alias_value":"1801.01708v1","created_at":"2026-05-18T00:26:41Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1801.01708","created_at":"2026-05-18T00:26:41Z"},{"alias_kind":"pith_short_12","alias_value":"DK53GNYZ7N6H","created_at":"2026-05-18T12:32:19Z"},{"alias_kind":"pith_short_16","alias_value":"DK53GNYZ7N6HHHOP","created_at":"2026-05-18T12:32:19Z"},{"alias_kind":"pith_short_8","alias_value":"DK53GNYZ","created_at":"2026-05-18T12:32:19Z"}],"graph_snapshots":[{"event_id":"sha256:678fe6524478c7549709a84bbbadd6399114799b797e09bf67992a3405392c20","target":"graph","created_at":"2026-05-18T00:26:41Z","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 introduce negative binomial matrix factorization (NBMF), a matrix factorization technique specially designed for analyzing over-dispersed count data. It can be viewed as an extension of Poisson matrix factorization (PF) perturbed by a multiplicative term which models exposure. This term brings a degree of freedom for controlling the dispersion, making NBMF more robust to outliers. We show that NBMF allows to skip traditional pre-processing stages, such as binarization, which lead to loss of information. Two estimation approaches are presented: maximum likelihood and variational Bayes infere","authors_text":"C\\'edric F\\'evotte, Olivier Gouvert, Thomas Oberlin","cross_cats":["cs.IR","stat.ML"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2018-01-05T11:00:46Z","title":"Negative Binomial Matrix Factorization for Recommender Systems"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1801.01708","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:307dfc181f6f2f8c21773d0342b24a4a5ccdb9ad03fa8466c1ad7ebcaba3dd12","target":"record","created_at":"2026-05-18T00:26:41Z","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":"7802f74de6583f45893fdf5501bc40eb5517b6c970592f60053a3d91904ea8d0","cross_cats_sorted":["cs.IR","stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2018-01-05T11:00:46Z","title_canon_sha256":"ff8e3bba7427e9290bf3cef3025c0ef2b8929afe3be3a947cc1ddf014d6dcf4b"},"schema_version":"1.0","source":{"id":"1801.01708","kind":"arxiv","version":1}},"canonical_sha256":"1abbb33719fb7c739dcfd671af46f360dbe65fb162c9a3d564a8a59a07bccdac","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"1abbb33719fb7c739dcfd671af46f360dbe65fb162c9a3d564a8a59a07bccdac","first_computed_at":"2026-05-18T00:26:41.293655Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:26:41.293655Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"m2qlvIv7XRs7/eG6J1GgKacq+SCmszo9vbjTim4wPbTo+PNhk09+5vDfCiu/JfM0HCDQ7SS7XdY5b3QEochNBg==","signature_status":"signed_v1","signed_at":"2026-05-18T00:26:41.294125Z","signed_message":"canonical_sha256_bytes"},"source_id":"1801.01708","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:307dfc181f6f2f8c21773d0342b24a4a5ccdb9ad03fa8466c1ad7ebcaba3dd12","sha256:678fe6524478c7549709a84bbbadd6399114799b797e09bf67992a3405392c20"],"state_sha256":"3e67c77da96677e6f8eddb3f37bfbf34c3dc87cecc5c100e49ec6da5cd54b09d"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"QOscAs27pFG4day6/ukaAAHoUp79iIrttVjllAH3TY93Lr3p/0bOkKGJfk2b1xSJlmmWGLG9+yZ+AR3DNRCPAw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-01T04:20:49.273991Z","bundle_sha256":"12a3fb360bfd981de06c8d0c4ee4a9bf086529aae625b49c8131e5f09f69c730"}}