{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2014:YKPXTGLLVFWAP4POLGPBUYCNLT","short_pith_number":"pith:YKPXTGLL","schema_version":"1.0","canonical_sha256":"c29f79996ba96c07f1ee599e1a604d5ce5c7b7b4d30ab269bbb5502ea61d0f80","source":{"kind":"arxiv","id":"1408.2467","version":2},"attestation_state":"computed","paper":{"title":"Matrix Completion under Interval Uncertainty","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI","cs.IR"],"primary_cat":"math.OC","authors_text":"Jakub Marecek, Martin Takac, Peter Richtarik","submitted_at":"2014-08-11T16:56:50Z","abstract_excerpt":"Matrix completion under interval uncertainty can be cast as matrix completion with element-wise box constraints. We present an efficient alternating-direction parallel coordinate-descent method for the problem. We show that the method outperforms any other known method on a benchmark in image in-painting in terms of signal-to-noise ratio, and that it provides high-quality solutions for an instance of collaborative filtering with 100,198,805 recommendations within 5 minutes."},"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":"1408.2467","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2014-08-11T16:56:50Z","cross_cats_sorted":["cs.AI","cs.IR"],"title_canon_sha256":"bb292efc63540a581d33f8cb053a16a6f8e3637df9a2d4a6bde747fa15126344","abstract_canon_sha256":"6a8cc82d596be8e11c1ff3158f19b77f3344a34c3aafe58fa00253d2f3c3fabe"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:23:09.830555Z","signature_b64":"TgimwgAz8Dw1r/fwxeUPPJh2axVLbljkd1HK6P9Kwqgidu+tCscqGjPjsEqNCBtwrP4poUnDM8vL+YW3vjdXDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"c29f79996ba96c07f1ee599e1a604d5ce5c7b7b4d30ab269bbb5502ea61d0f80","last_reissued_at":"2026-05-18T00:23:09.830045Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:23:09.830045Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Matrix Completion under Interval Uncertainty","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI","cs.IR"],"primary_cat":"math.OC","authors_text":"Jakub Marecek, Martin Takac, Peter Richtarik","submitted_at":"2014-08-11T16:56:50Z","abstract_excerpt":"Matrix completion under interval uncertainty can be cast as matrix completion with element-wise box constraints. We present an efficient alternating-direction parallel coordinate-descent method for the problem. We show that the method outperforms any other known method on a benchmark in image in-painting in terms of signal-to-noise ratio, and that it provides high-quality solutions for an instance of collaborative filtering with 100,198,805 recommendations within 5 minutes."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1408.2467","kind":"arxiv","version":2},"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":"1408.2467","created_at":"2026-05-18T00:23:09.830136+00:00"},{"alias_kind":"arxiv_version","alias_value":"1408.2467v2","created_at":"2026-05-18T00:23:09.830136+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1408.2467","created_at":"2026-05-18T00:23:09.830136+00:00"},{"alias_kind":"pith_short_12","alias_value":"YKPXTGLLVFWA","created_at":"2026-05-18T12:28:57.508820+00:00"},{"alias_kind":"pith_short_16","alias_value":"YKPXTGLLVFWAP4PO","created_at":"2026-05-18T12:28:57.508820+00:00"},{"alias_kind":"pith_short_8","alias_value":"YKPXTGLL","created_at":"2026-05-18T12:28:57.508820+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/YKPXTGLLVFWAP4POLGPBUYCNLT","json":"https://pith.science/pith/YKPXTGLLVFWAP4POLGPBUYCNLT.json","graph_json":"https://pith.science/api/pith-number/YKPXTGLLVFWAP4POLGPBUYCNLT/graph.json","events_json":"https://pith.science/api/pith-number/YKPXTGLLVFWAP4POLGPBUYCNLT/events.json","paper":"https://pith.science/paper/YKPXTGLL"},"agent_actions":{"view_html":"https://pith.science/pith/YKPXTGLLVFWAP4POLGPBUYCNLT","download_json":"https://pith.science/pith/YKPXTGLLVFWAP4POLGPBUYCNLT.json","view_paper":"https://pith.science/paper/YKPXTGLL","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1408.2467&json=true","fetch_graph":"https://pith.science/api/pith-number/YKPXTGLLVFWAP4POLGPBUYCNLT/graph.json","fetch_events":"https://pith.science/api/pith-number/YKPXTGLLVFWAP4POLGPBUYCNLT/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/YKPXTGLLVFWAP4POLGPBUYCNLT/action/timestamp_anchor","attest_storage":"https://pith.science/pith/YKPXTGLLVFWAP4POLGPBUYCNLT/action/storage_attestation","attest_author":"https://pith.science/pith/YKPXTGLLVFWAP4POLGPBUYCNLT/action/author_attestation","sign_citation":"https://pith.science/pith/YKPXTGLLVFWAP4POLGPBUYCNLT/action/citation_signature","submit_replication":"https://pith.science/pith/YKPXTGLLVFWAP4POLGPBUYCNLT/action/replication_record"}},"created_at":"2026-05-18T00:23:09.830136+00:00","updated_at":"2026-05-18T00:23:09.830136+00:00"}