{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:JWQZSTMCBRUOSJEW2ZRAANRD2O","short_pith_number":"pith:JWQZSTMC","canonical_record":{"source":{"id":"1807.02150","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IR","submitted_at":"2018-07-05T18:48:56Z","cross_cats_sorted":["cs.LG","stat.ML"],"title_canon_sha256":"e383fe59f53d4301cd2f1bc88e3ec6da9fe127df486453a42f6ac7d7c8a1e02b","abstract_canon_sha256":"cbf81369a27dfd4601203100703ef849260975ffc136f9b286a612148ddce131"},"schema_version":"1.0"},"canonical_sha256":"4da1994d820c68e92496d662003623d3801267a60e675d808992ddd7019d0616","source":{"kind":"arxiv","id":"1807.02150","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1807.02150","created_at":"2026-05-18T00:11:22Z"},{"alias_kind":"arxiv_version","alias_value":"1807.02150v1","created_at":"2026-05-18T00:11:22Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1807.02150","created_at":"2026-05-18T00:11:22Z"},{"alias_kind":"pith_short_12","alias_value":"JWQZSTMCBRUO","created_at":"2026-05-18T12:32:33Z"},{"alias_kind":"pith_short_16","alias_value":"JWQZSTMCBRUOSJEW","created_at":"2026-05-18T12:32:33Z"},{"alias_kind":"pith_short_8","alias_value":"JWQZSTMC","created_at":"2026-05-18T12:32:33Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:JWQZSTMCBRUOSJEW2ZRAANRD2O","target":"record","payload":{"canonical_record":{"source":{"id":"1807.02150","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IR","submitted_at":"2018-07-05T18:48:56Z","cross_cats_sorted":["cs.LG","stat.ML"],"title_canon_sha256":"e383fe59f53d4301cd2f1bc88e3ec6da9fe127df486453a42f6ac7d7c8a1e02b","abstract_canon_sha256":"cbf81369a27dfd4601203100703ef849260975ffc136f9b286a612148ddce131"},"schema_version":"1.0"},"canonical_sha256":"4da1994d820c68e92496d662003623d3801267a60e675d808992ddd7019d0616","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:11:22.973345Z","signature_b64":"Oxt6vtCmj1m9aKIm/AofQmsWRhvDFVOpHRoeoa1i8uj6m9GQapSu/GWm4lquOWUKCdeezdGMptfOQeHD7uiEBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"4da1994d820c68e92496d662003623d3801267a60e675d808992ddd7019d0616","last_reissued_at":"2026-05-18T00:11:22.972647Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:11:22.972647Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1807.02150","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:11:22Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"OvvTKIh6epHPaBzpmRJrVnONnHktdJ67YPbSUpQID75dUNYqCv7UUcKly6E80cDXnVA71Qm9TcLMEFZAL+puCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-02T04:21:49.578540Z"},"content_sha256":"3157d1bad1ae98aa9ef009d4f1defbc0f420e39da5762cd85e22c8974c4cf0b3","schema_version":"1.0","event_id":"sha256:3157d1bad1ae98aa9ef009d4f1defbc0f420e39da5762cd85e22c8974c4cf0b3"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:JWQZSTMCBRUOSJEW2ZRAANRD2O","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Scalable Recommender Systems through Recursive Evidence Chains","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG","stat.ML"],"primary_cat":"cs.IR","authors_text":"Calvin Luo, David Duvenaud, Elias Tragas, Kevin Luk, Maxime Gazeau","submitted_at":"2018-07-05T18:48:56Z","abstract_excerpt":"Recommender systems can be formulated as a matrix completion problem, predicting ratings from user and item parameter vectors. Optimizing these parameters by subsampling data becomes difficult as the number of users and items grows. We develop a novel approach to generate all latent variables on demand from the ratings matrix itself and a fixed pool of parameters. We estimate missing ratings using chains of evidence that link them to a small set of prototypical users and items. Our model automatically addresses the cold-start and online learning problems by combining information across both us"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1807.02150","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:11:22Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"V5IhWiqhPI8kf8AqZUH9wpFWgWXrod5T293bMJQ78EOB7yevaUi8SIdr+QkJSm0te4Z4dVr+0j+vt2j9yVmyDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-02T04:21:49.578888Z"},"content_sha256":"98f428012aa5c15b0b4ebb6330f9151135b2cf1676b13d6617a60835ef2b1833","schema_version":"1.0","event_id":"sha256:98f428012aa5c15b0b4ebb6330f9151135b2cf1676b13d6617a60835ef2b1833"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/JWQZSTMCBRUOSJEW2ZRAANRD2O/bundle.json","state_url":"https://pith.science/pith/JWQZSTMCBRUOSJEW2ZRAANRD2O/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/JWQZSTMCBRUOSJEW2ZRAANRD2O/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-02T04:21:49Z","links":{"resolver":"https://pith.science/pith/JWQZSTMCBRUOSJEW2ZRAANRD2O","bundle":"https://pith.science/pith/JWQZSTMCBRUOSJEW2ZRAANRD2O/bundle.json","state":"https://pith.science/pith/JWQZSTMCBRUOSJEW2ZRAANRD2O/state.json","well_known_bundle":"https://pith.science/.well-known/pith/JWQZSTMCBRUOSJEW2ZRAANRD2O/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:JWQZSTMCBRUOSJEW2ZRAANRD2O","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":"cbf81369a27dfd4601203100703ef849260975ffc136f9b286a612148ddce131","cross_cats_sorted":["cs.LG","stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IR","submitted_at":"2018-07-05T18:48:56Z","title_canon_sha256":"e383fe59f53d4301cd2f1bc88e3ec6da9fe127df486453a42f6ac7d7c8a1e02b"},"schema_version":"1.0","source":{"id":"1807.02150","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1807.02150","created_at":"2026-05-18T00:11:22Z"},{"alias_kind":"arxiv_version","alias_value":"1807.02150v1","created_at":"2026-05-18T00:11:22Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1807.02150","created_at":"2026-05-18T00:11:22Z"},{"alias_kind":"pith_short_12","alias_value":"JWQZSTMCBRUO","created_at":"2026-05-18T12:32:33Z"},{"alias_kind":"pith_short_16","alias_value":"JWQZSTMCBRUOSJEW","created_at":"2026-05-18T12:32:33Z"},{"alias_kind":"pith_short_8","alias_value":"JWQZSTMC","created_at":"2026-05-18T12:32:33Z"}],"graph_snapshots":[{"event_id":"sha256:98f428012aa5c15b0b4ebb6330f9151135b2cf1676b13d6617a60835ef2b1833","target":"graph","created_at":"2026-05-18T00:11:22Z","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":"Recommender systems can be formulated as a matrix completion problem, predicting ratings from user and item parameter vectors. Optimizing these parameters by subsampling data becomes difficult as the number of users and items grows. We develop a novel approach to generate all latent variables on demand from the ratings matrix itself and a fixed pool of parameters. We estimate missing ratings using chains of evidence that link them to a small set of prototypical users and items. Our model automatically addresses the cold-start and online learning problems by combining information across both us","authors_text":"Calvin Luo, David Duvenaud, Elias Tragas, Kevin Luk, Maxime Gazeau","cross_cats":["cs.LG","stat.ML"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IR","submitted_at":"2018-07-05T18:48:56Z","title":"Scalable Recommender Systems through Recursive Evidence Chains"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1807.02150","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:3157d1bad1ae98aa9ef009d4f1defbc0f420e39da5762cd85e22c8974c4cf0b3","target":"record","created_at":"2026-05-18T00:11:22Z","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":"cbf81369a27dfd4601203100703ef849260975ffc136f9b286a612148ddce131","cross_cats_sorted":["cs.LG","stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IR","submitted_at":"2018-07-05T18:48:56Z","title_canon_sha256":"e383fe59f53d4301cd2f1bc88e3ec6da9fe127df486453a42f6ac7d7c8a1e02b"},"schema_version":"1.0","source":{"id":"1807.02150","kind":"arxiv","version":1}},"canonical_sha256":"4da1994d820c68e92496d662003623d3801267a60e675d808992ddd7019d0616","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"4da1994d820c68e92496d662003623d3801267a60e675d808992ddd7019d0616","first_computed_at":"2026-05-18T00:11:22.972647Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:11:22.972647Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"Oxt6vtCmj1m9aKIm/AofQmsWRhvDFVOpHRoeoa1i8uj6m9GQapSu/GWm4lquOWUKCdeezdGMptfOQeHD7uiEBw==","signature_status":"signed_v1","signed_at":"2026-05-18T00:11:22.973345Z","signed_message":"canonical_sha256_bytes"},"source_id":"1807.02150","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:3157d1bad1ae98aa9ef009d4f1defbc0f420e39da5762cd85e22c8974c4cf0b3","sha256:98f428012aa5c15b0b4ebb6330f9151135b2cf1676b13d6617a60835ef2b1833"],"state_sha256":"c25ca69f074330bf3c32d0f47d2477b2540f41412404e584413efc1918f1944a"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"lQ4euxI2K/S5EUn5n0SA0vASkVhRkS2e/mu26AdZieivL31UNOjIcVELQNzUNzgTosLvaiapsCd+FrB9TS/kBg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-02T04:21:49.580935Z","bundle_sha256":"a74ca5c82101fa7ed9095c303422b9679312f47e70e304fe3874be1a9069ef0f"}}