{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:IT3M6ZEIDB3IW7NXK4GO6QIPS7","short_pith_number":"pith:IT3M6ZEI","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"},"canonical_sha256":"44f6cf648818768b7db7570cef410f97d7d5b3563214225e7fff6bfba6aa2907","source":{"kind":"arxiv","id":"1707.06055","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1707.06055","created_at":"2026-05-18T00:39:57Z"},{"alias_kind":"arxiv_version","alias_value":"1707.06055v1","created_at":"2026-05-18T00:39:57Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1707.06055","created_at":"2026-05-18T00:39:57Z"},{"alias_kind":"pith_short_12","alias_value":"IT3M6ZEIDB3I","created_at":"2026-05-18T12:31:21Z"},{"alias_kind":"pith_short_16","alias_value":"IT3M6ZEIDB3IW7NX","created_at":"2026-05-18T12:31:21Z"},{"alias_kind":"pith_short_8","alias_value":"IT3M6ZEI","created_at":"2026-05-18T12:31:21Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:IT3M6ZEIDB3IW7NXK4GO6QIPS7","target":"record","payload":{"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"},"canonical_sha256":"44f6cf648818768b7db7570cef410f97d7d5b3563214225e7fff6bfba6aa2907","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"},"source_kind":"arxiv","source_id":"1707.06055","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:39:57Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"yC3BNo1iVpLtSqDvIUC93RjISHzz7OtEx2Xm+4WcrZIlx3LgncLgcVk88S9HRdzgMNRtv4TybfsgrkqRDH1DBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-01T08:39:54.709620Z"},"content_sha256":"e17113a8414497675068c9e3c660bfbfdee34c3e55e25105cc8442a2e51fe5a4","schema_version":"1.0","event_id":"sha256:e17113a8414497675068c9e3c660bfbfdee34c3e55e25105cc8442a2e51fe5a4"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:IT3M6ZEIDB3IW7NXK4GO6QIPS7","target":"graph","payload":{"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"},"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:39:57Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"yAZz6Jt9hYVdRlrsfNeUEIH5OBSnhBlgc10KcfdB80dhetFt+5tuf/g4v/GxYlwPx14exs6aEzQbYD0WQEJEAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-01T08:39:54.710275Z"},"content_sha256":"39701b33c729a82623da7e02c0e65b711c99600ccca08d2448e3f60ea0cc0bd5","schema_version":"1.0","event_id":"sha256:39701b33c729a82623da7e02c0e65b711c99600ccca08d2448e3f60ea0cc0bd5"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/IT3M6ZEIDB3IW7NXK4GO6QIPS7/bundle.json","state_url":"https://pith.science/pith/IT3M6ZEIDB3IW7NXK4GO6QIPS7/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/IT3M6ZEIDB3IW7NXK4GO6QIPS7/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-01T08:39:54Z","links":{"resolver":"https://pith.science/pith/IT3M6ZEIDB3IW7NXK4GO6QIPS7","bundle":"https://pith.science/pith/IT3M6ZEIDB3IW7NXK4GO6QIPS7/bundle.json","state":"https://pith.science/pith/IT3M6ZEIDB3IW7NXK4GO6QIPS7/state.json","well_known_bundle":"https://pith.science/.well-known/pith/IT3M6ZEIDB3IW7NXK4GO6QIPS7/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:IT3M6ZEIDB3IW7NXK4GO6QIPS7","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":"97b39e20875fd591f052dbe24c7ccb303d1f73e1fe75c49990d872d6e3dd0ec4","cross_cats_sorted":["cs.IT","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IR","submitted_at":"2017-07-19T12:55:10Z","title_canon_sha256":"3cccd21254a00baf9c642ad44330d287ac1cf6b52f3d49838256c1e2859bd413"},"schema_version":"1.0","source":{"id":"1707.06055","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1707.06055","created_at":"2026-05-18T00:39:57Z"},{"alias_kind":"arxiv_version","alias_value":"1707.06055v1","created_at":"2026-05-18T00:39:57Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1707.06055","created_at":"2026-05-18T00:39:57Z"},{"alias_kind":"pith_short_12","alias_value":"IT3M6ZEIDB3I","created_at":"2026-05-18T12:31:21Z"},{"alias_kind":"pith_short_16","alias_value":"IT3M6ZEIDB3IW7NX","created_at":"2026-05-18T12:31:21Z"},{"alias_kind":"pith_short_8","alias_value":"IT3M6ZEI","created_at":"2026-05-18T12:31:21Z"}],"graph_snapshots":[{"event_id":"sha256:39701b33c729a82623da7e02c0e65b711c99600ccca08d2448e3f60ea0cc0bd5","target":"graph","created_at":"2026-05-18T00:39:57Z","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":"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","authors_text":"Carlos Caleiro, Guilherme Ramos, Joao Saude, Soummya Kar","cross_cats":["cs.IT","math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IR","submitted_at":"2017-07-19T12:55:10Z","title":"Recommendation via matrix completion using Kolmogorov complexity"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1707.06055","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:e17113a8414497675068c9e3c660bfbfdee34c3e55e25105cc8442a2e51fe5a4","target":"record","created_at":"2026-05-18T00:39:57Z","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":"97b39e20875fd591f052dbe24c7ccb303d1f73e1fe75c49990d872d6e3dd0ec4","cross_cats_sorted":["cs.IT","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IR","submitted_at":"2017-07-19T12:55:10Z","title_canon_sha256":"3cccd21254a00baf9c642ad44330d287ac1cf6b52f3d49838256c1e2859bd413"},"schema_version":"1.0","source":{"id":"1707.06055","kind":"arxiv","version":1}},"canonical_sha256":"44f6cf648818768b7db7570cef410f97d7d5b3563214225e7fff6bfba6aa2907","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"44f6cf648818768b7db7570cef410f97d7d5b3563214225e7fff6bfba6aa2907","first_computed_at":"2026-05-18T00:39:57.697096Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:39:57.697096Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"nvnwflEq42cUPiRX+DpDJj9UN8ztMT9jkmyLO6tZXwFc0oHK23Xr8m7zrySiLqjeciHNoFPHecr17mNiR6EEBQ==","signature_status":"signed_v1","signed_at":"2026-05-18T00:39:57.697704Z","signed_message":"canonical_sha256_bytes"},"source_id":"1707.06055","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:e17113a8414497675068c9e3c660bfbfdee34c3e55e25105cc8442a2e51fe5a4","sha256:39701b33c729a82623da7e02c0e65b711c99600ccca08d2448e3f60ea0cc0bd5"],"state_sha256":"463308538b3d9203dfd1c163428331e1d736d6ed1ef7a2bb919ecae2049113a9"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"MDkOohs6AHKIvSo6IlZkDM8dP9atCy8zTSJx8tU8UbZOssru/oM/QfwoluBcPM2iYRjRLgP4LWmBeUbJjnuQDg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-01T08:39:54.713297Z","bundle_sha256":"a7f60bd25b9d0948190117263a68d002802948a316e8071b6184723e4f775288"}}