{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:WSZP5DKU6JVR4VDRZY24EVLSMV","short_pith_number":"pith:WSZP5DKU","schema_version":"1.0","canonical_sha256":"b4b2fe8d54f26b1e5471ce35c25572657ee663351838e05df66a241ef6186b7c","source":{"kind":"arxiv","id":"1610.04850","version":1},"attestation_state":"computed","paper":{"title":"Efficient Rectangular Maximal-Volume Algorithm for Rating Elicitation in Collaborative Filtering","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI"],"primary_cat":"cs.IR","authors_text":"Alexander Fonarev, Alexander Mikhalev, Gleb Gusev, Ivan Oseledets, Pavel Serdyukov","submitted_at":"2016-10-16T12:50:37Z","abstract_excerpt":"Cold start problem in Collaborative Filtering can be solved by asking new users to rate a small seed set of representative items or by asking representative users to rate a new item. The question is how to build a seed set that can give enough preference information for making good recommendations. One of the most successful approaches, called Representative Based Matrix Factorization, is based on Maxvol algorithm. Unfortunately, this approach has one important limitation --- a seed set of a particular size requires a rating matrix factorization of fixed rank that should coincide with that siz"},"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.04850","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IR","submitted_at":"2016-10-16T12:50:37Z","cross_cats_sorted":["cs.AI"],"title_canon_sha256":"9fc76c6e5235bb58ac32915d2eabcb9647bd42d56bf32b2211da19a8d63d8ca2","abstract_canon_sha256":"f7605c3ae18a716f1f5d91ea15d2493bb4233b63a3882a8dbb0142f450bb41fb"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:02:06.902702Z","signature_b64":"uOjT27jws5aO9dCUajpznJHyRGURtkV87qJKhrqdWtR5j0b0SYyBw7jrCoRq93WgQ9/VNUZx5Hjiypkbcz1OCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"b4b2fe8d54f26b1e5471ce35c25572657ee663351838e05df66a241ef6186b7c","last_reissued_at":"2026-05-18T01:02:06.901887Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:02:06.901887Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Efficient Rectangular Maximal-Volume Algorithm for Rating Elicitation in Collaborative Filtering","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI"],"primary_cat":"cs.IR","authors_text":"Alexander Fonarev, Alexander Mikhalev, Gleb Gusev, Ivan Oseledets, Pavel Serdyukov","submitted_at":"2016-10-16T12:50:37Z","abstract_excerpt":"Cold start problem in Collaborative Filtering can be solved by asking new users to rate a small seed set of representative items or by asking representative users to rate a new item. The question is how to build a seed set that can give enough preference information for making good recommendations. One of the most successful approaches, called Representative Based Matrix Factorization, is based on Maxvol algorithm. Unfortunately, this approach has one important limitation --- a seed set of a particular size requires a rating matrix factorization of fixed rank that should coincide with that siz"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1610.04850","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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1610.04850","created_at":"2026-05-18T01:02:06.902032+00:00"},{"alias_kind":"arxiv_version","alias_value":"1610.04850v1","created_at":"2026-05-18T01:02:06.902032+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1610.04850","created_at":"2026-05-18T01:02:06.902032+00:00"},{"alias_kind":"pith_short_12","alias_value":"WSZP5DKU6JVR","created_at":"2026-05-18T12:30:51.357362+00:00"},{"alias_kind":"pith_short_16","alias_value":"WSZP5DKU6JVR4VDR","created_at":"2026-05-18T12:30:51.357362+00:00"},{"alias_kind":"pith_short_8","alias_value":"WSZP5DKU","created_at":"2026-05-18T12:30:51.357362+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/WSZP5DKU6JVR4VDRZY24EVLSMV","json":"https://pith.science/pith/WSZP5DKU6JVR4VDRZY24EVLSMV.json","graph_json":"https://pith.science/api/pith-number/WSZP5DKU6JVR4VDRZY24EVLSMV/graph.json","events_json":"https://pith.science/api/pith-number/WSZP5DKU6JVR4VDRZY24EVLSMV/events.json","paper":"https://pith.science/paper/WSZP5DKU"},"agent_actions":{"view_html":"https://pith.science/pith/WSZP5DKU6JVR4VDRZY24EVLSMV","download_json":"https://pith.science/pith/WSZP5DKU6JVR4VDRZY24EVLSMV.json","view_paper":"https://pith.science/paper/WSZP5DKU","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1610.04850&json=true","fetch_graph":"https://pith.science/api/pith-number/WSZP5DKU6JVR4VDRZY24EVLSMV/graph.json","fetch_events":"https://pith.science/api/pith-number/WSZP5DKU6JVR4VDRZY24EVLSMV/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/WSZP5DKU6JVR4VDRZY24EVLSMV/action/timestamp_anchor","attest_storage":"https://pith.science/pith/WSZP5DKU6JVR4VDRZY24EVLSMV/action/storage_attestation","attest_author":"https://pith.science/pith/WSZP5DKU6JVR4VDRZY24EVLSMV/action/author_attestation","sign_citation":"https://pith.science/pith/WSZP5DKU6JVR4VDRZY24EVLSMV/action/citation_signature","submit_replication":"https://pith.science/pith/WSZP5DKU6JVR4VDRZY24EVLSMV/action/replication_record"}},"created_at":"2026-05-18T01:02:06.902032+00:00","updated_at":"2026-05-18T01:02:06.902032+00:00"}