{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:IT3M6ZEIDB3IW7NXK4GO6QIPS7","short_pith_number":"pith:IT3M6ZEI","schema_version":"1.0","canonical_sha256":"44f6cf648818768b7db7570cef410f97d7d5b3563214225e7fff6bfba6aa2907","source":{"kind":"arxiv","id":"1707.06055","version":1},"attestation_state":"computed","paper":{"title":"Recommendation via matrix completion using Kolmogorov complexity","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.IT","math.IT"],"primary_cat":"cs.IR","authors_text":"Carlos Caleiro, Guilherme Ramos, Joao Saude, Soummya Kar","submitted_at":"2017-07-19T12:55:10Z","abstract_excerpt":"A usual way to model a recommendation system is as a matrix completion problem. There are several matrix completion methods, typically using optimization approaches or collaborative filtering. Most approaches assume that the matrix is either low rank, or that there are a small number of latent variables that encode the full problem. Here, we propose a novel matrix completion algorithm for recommendation systems, without any assumptions on the rank and that is model free, i.e., the entries are not assumed to be a function of some latent variables. Instead, we use a technique akin to information"},"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":"1707.06055","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IR","submitted_at":"2017-07-19T12:55:10Z","cross_cats_sorted":["cs.IT","math.IT"],"title_canon_sha256":"3cccd21254a00baf9c642ad44330d287ac1cf6b52f3d49838256c1e2859bd413","abstract_canon_sha256":"97b39e20875fd591f052dbe24c7ccb303d1f73e1fe75c49990d872d6e3dd0ec4"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:39:57.697704Z","signature_b64":"nvnwflEq42cUPiRX+DpDJj9UN8ztMT9jkmyLO6tZXwFc0oHK23Xr8m7zrySiLqjeciHNoFPHecr17mNiR6EEBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"44f6cf648818768b7db7570cef410f97d7d5b3563214225e7fff6bfba6aa2907","last_reissued_at":"2026-05-18T00:39:57.697096Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:39:57.697096Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Recommendation via matrix completion using Kolmogorov complexity","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.IT","math.IT"],"primary_cat":"cs.IR","authors_text":"Carlos Caleiro, Guilherme Ramos, Joao Saude, Soummya Kar","submitted_at":"2017-07-19T12:55:10Z","abstract_excerpt":"A usual way to model a recommendation system is as a matrix completion problem. There are several matrix completion methods, typically using optimization approaches or collaborative filtering. Most approaches assume that the matrix is either low rank, or that there are a small number of latent variables that encode the full problem. Here, we propose a novel matrix completion algorithm for recommendation systems, without any assumptions on the rank and that is model free, i.e., the entries are not assumed to be a function of some latent variables. Instead, we use a technique akin to information"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1707.06055","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":"1707.06055","created_at":"2026-05-18T00:39:57.697203+00:00"},{"alias_kind":"arxiv_version","alias_value":"1707.06055v1","created_at":"2026-05-18T00:39:57.697203+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1707.06055","created_at":"2026-05-18T00:39:57.697203+00:00"},{"alias_kind":"pith_short_12","alias_value":"IT3M6ZEIDB3I","created_at":"2026-05-18T12:31:21.493067+00:00"},{"alias_kind":"pith_short_16","alias_value":"IT3M6ZEIDB3IW7NX","created_at":"2026-05-18T12:31:21.493067+00:00"},{"alias_kind":"pith_short_8","alias_value":"IT3M6ZEI","created_at":"2026-05-18T12:31:21.493067+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/IT3M6ZEIDB3IW7NXK4GO6QIPS7","json":"https://pith.science/pith/IT3M6ZEIDB3IW7NXK4GO6QIPS7.json","graph_json":"https://pith.science/api/pith-number/IT3M6ZEIDB3IW7NXK4GO6QIPS7/graph.json","events_json":"https://pith.science/api/pith-number/IT3M6ZEIDB3IW7NXK4GO6QIPS7/events.json","paper":"https://pith.science/paper/IT3M6ZEI"},"agent_actions":{"view_html":"https://pith.science/pith/IT3M6ZEIDB3IW7NXK4GO6QIPS7","download_json":"https://pith.science/pith/IT3M6ZEIDB3IW7NXK4GO6QIPS7.json","view_paper":"https://pith.science/paper/IT3M6ZEI","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1707.06055&json=true","fetch_graph":"https://pith.science/api/pith-number/IT3M6ZEIDB3IW7NXK4GO6QIPS7/graph.json","fetch_events":"https://pith.science/api/pith-number/IT3M6ZEIDB3IW7NXK4GO6QIPS7/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/IT3M6ZEIDB3IW7NXK4GO6QIPS7/action/timestamp_anchor","attest_storage":"https://pith.science/pith/IT3M6ZEIDB3IW7NXK4GO6QIPS7/action/storage_attestation","attest_author":"https://pith.science/pith/IT3M6ZEIDB3IW7NXK4GO6QIPS7/action/author_attestation","sign_citation":"https://pith.science/pith/IT3M6ZEIDB3IW7NXK4GO6QIPS7/action/citation_signature","submit_replication":"https://pith.science/pith/IT3M6ZEIDB3IW7NXK4GO6QIPS7/action/replication_record"}},"created_at":"2026-05-18T00:39:57.697203+00:00","updated_at":"2026-05-18T00:39:57.697203+00:00"}