{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2011:2R5KGNMWBLWGSSQMKCRUFW375D","short_pith_number":"pith:2R5KGNMW","canonical_record":{"source":{"id":"1102.2254","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2011-02-10T22:57:47Z","cross_cats_sorted":["cs.IT","math.IT"],"title_canon_sha256":"d2035d18aed47c1424d7bc7cd90fedc2661e04fc28c12d4eb4808993c3b186f0","abstract_canon_sha256":"c8722a8365547d9bf27d126e5590d58a57ad0a6a6257250c382658cbbc4c2d44"},"schema_version":"1.0"},"canonical_sha256":"d47aa335960aec694a0c50a342db7fe8c0c4c502d53be62931cb267f7f0a3cd2","source":{"kind":"arxiv","id":"1102.2254","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1102.2254","created_at":"2026-05-18T01:16:28Z"},{"alias_kind":"arxiv_version","alias_value":"1102.2254v2","created_at":"2026-05-18T01:16:28Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1102.2254","created_at":"2026-05-18T01:16:28Z"},{"alias_kind":"pith_short_12","alias_value":"2R5KGNMWBLWG","created_at":"2026-05-18T12:26:18Z"},{"alias_kind":"pith_short_16","alias_value":"2R5KGNMWBLWGSSQM","created_at":"2026-05-18T12:26:18Z"},{"alias_kind":"pith_short_8","alias_value":"2R5KGNMW","created_at":"2026-05-18T12:26:18Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2011:2R5KGNMWBLWGSSQMKCRUFW375D","target":"record","payload":{"canonical_record":{"source":{"id":"1102.2254","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2011-02-10T22:57:47Z","cross_cats_sorted":["cs.IT","math.IT"],"title_canon_sha256":"d2035d18aed47c1424d7bc7cd90fedc2661e04fc28c12d4eb4808993c3b186f0","abstract_canon_sha256":"c8722a8365547d9bf27d126e5590d58a57ad0a6a6257250c382658cbbc4c2d44"},"schema_version":"1.0"},"canonical_sha256":"d47aa335960aec694a0c50a342db7fe8c0c4c502d53be62931cb267f7f0a3cd2","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:16:28.026789Z","signature_b64":"RfeytSDfkG20+tHMgEdYmMgMsctp53D4sHzdqwPV9kxfeRuwq00IZnCJMfuJ+391ALNxjyOKzhJAHo1ihsTYAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"d47aa335960aec694a0c50a342db7fe8c0c4c502d53be62931cb267f7f0a3cd2","last_reissued_at":"2026-05-18T01:16:28.026355Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:16:28.026355Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1102.2254","source_version":2,"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-18T01:16:28Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"8km0mXp+dH8OgkrMvMUl/EIwNSLkEMuZg9m2B0UZ7X1Md5/vkRyhyF1sippkwbXB7hrb8f93YZs44rb4z4tuDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T02:18:11.689287Z"},"content_sha256":"4eebfc9d726278f02826af078b35e4cf20b9d0ac74ddc48e24b933f57ee7e635","schema_version":"1.0","event_id":"sha256:4eebfc9d726278f02826af078b35e4cf20b9d0ac74ddc48e24b933f57ee7e635"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2011:2R5KGNMWBLWGSSQMKCRUFW375D","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Matrix completion with column manipulation: Near-optimal sample-robustness-rank tradeoffs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.IT","math.IT"],"primary_cat":"stat.ML","authors_text":"Constantine Caramanis, Huan Xu, Sujay Sanghavi, Yudong Chen","submitted_at":"2011-02-10T22:57:47Z","abstract_excerpt":"This paper considers the problem of matrix completion when some number of the columns are completely and arbitrarily corrupted, potentially by a malicious adversary. It is well-known that standard algorithms for matrix completion can return arbitrarily poor results, if even a single column is corrupted. One direct application comes from robust collaborative filtering. Here, some number of users are so-called manipulators who try to skew the predictions of the algorithm by calibrating their inputs to the system. In this paper, we develop an efficient algorithm for this problem based on a combin"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1102.2254","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"},"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-18T01:16:28Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"sNZYRgXFWKZc3MS0MGaEJpIa3pd8v2rpPSBIwJg798UtWji93G3OuRDexVOWwGJupgEDTVAjDxA/qOabNzIsDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T02:18:11.690071Z"},"content_sha256":"f215232687a5b1c316eeec2c20b31b26138c6997fc93c66be4b780bc706fe635","schema_version":"1.0","event_id":"sha256:f215232687a5b1c316eeec2c20b31b26138c6997fc93c66be4b780bc706fe635"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/2R5KGNMWBLWGSSQMKCRUFW375D/bundle.json","state_url":"https://pith.science/pith/2R5KGNMWBLWGSSQMKCRUFW375D/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/2R5KGNMWBLWGSSQMKCRUFW375D/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-05-27T02:18:11Z","links":{"resolver":"https://pith.science/pith/2R5KGNMWBLWGSSQMKCRUFW375D","bundle":"https://pith.science/pith/2R5KGNMWBLWGSSQMKCRUFW375D/bundle.json","state":"https://pith.science/pith/2R5KGNMWBLWGSSQMKCRUFW375D/state.json","well_known_bundle":"https://pith.science/.well-known/pith/2R5KGNMWBLWGSSQMKCRUFW375D/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2011:2R5KGNMWBLWGSSQMKCRUFW375D","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":"c8722a8365547d9bf27d126e5590d58a57ad0a6a6257250c382658cbbc4c2d44","cross_cats_sorted":["cs.IT","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2011-02-10T22:57:47Z","title_canon_sha256":"d2035d18aed47c1424d7bc7cd90fedc2661e04fc28c12d4eb4808993c3b186f0"},"schema_version":"1.0","source":{"id":"1102.2254","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1102.2254","created_at":"2026-05-18T01:16:28Z"},{"alias_kind":"arxiv_version","alias_value":"1102.2254v2","created_at":"2026-05-18T01:16:28Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1102.2254","created_at":"2026-05-18T01:16:28Z"},{"alias_kind":"pith_short_12","alias_value":"2R5KGNMWBLWG","created_at":"2026-05-18T12:26:18Z"},{"alias_kind":"pith_short_16","alias_value":"2R5KGNMWBLWGSSQM","created_at":"2026-05-18T12:26:18Z"},{"alias_kind":"pith_short_8","alias_value":"2R5KGNMW","created_at":"2026-05-18T12:26:18Z"}],"graph_snapshots":[{"event_id":"sha256:f215232687a5b1c316eeec2c20b31b26138c6997fc93c66be4b780bc706fe635","target":"graph","created_at":"2026-05-18T01:16:28Z","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":"This paper considers the problem of matrix completion when some number of the columns are completely and arbitrarily corrupted, potentially by a malicious adversary. It is well-known that standard algorithms for matrix completion can return arbitrarily poor results, if even a single column is corrupted. One direct application comes from robust collaborative filtering. Here, some number of users are so-called manipulators who try to skew the predictions of the algorithm by calibrating their inputs to the system. In this paper, we develop an efficient algorithm for this problem based on a combin","authors_text":"Constantine Caramanis, Huan Xu, Sujay Sanghavi, Yudong Chen","cross_cats":["cs.IT","math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2011-02-10T22:57:47Z","title":"Matrix completion with column manipulation: Near-optimal sample-robustness-rank tradeoffs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1102.2254","kind":"arxiv","version":2},"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:4eebfc9d726278f02826af078b35e4cf20b9d0ac74ddc48e24b933f57ee7e635","target":"record","created_at":"2026-05-18T01:16:28Z","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":"c8722a8365547d9bf27d126e5590d58a57ad0a6a6257250c382658cbbc4c2d44","cross_cats_sorted":["cs.IT","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2011-02-10T22:57:47Z","title_canon_sha256":"d2035d18aed47c1424d7bc7cd90fedc2661e04fc28c12d4eb4808993c3b186f0"},"schema_version":"1.0","source":{"id":"1102.2254","kind":"arxiv","version":2}},"canonical_sha256":"d47aa335960aec694a0c50a342db7fe8c0c4c502d53be62931cb267f7f0a3cd2","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"d47aa335960aec694a0c50a342db7fe8c0c4c502d53be62931cb267f7f0a3cd2","first_computed_at":"2026-05-18T01:16:28.026355Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:16:28.026355Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"RfeytSDfkG20+tHMgEdYmMgMsctp53D4sHzdqwPV9kxfeRuwq00IZnCJMfuJ+391ALNxjyOKzhJAHo1ihsTYAA==","signature_status":"signed_v1","signed_at":"2026-05-18T01:16:28.026789Z","signed_message":"canonical_sha256_bytes"},"source_id":"1102.2254","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:4eebfc9d726278f02826af078b35e4cf20b9d0ac74ddc48e24b933f57ee7e635","sha256:f215232687a5b1c316eeec2c20b31b26138c6997fc93c66be4b780bc706fe635"],"state_sha256":"251e096afd5c26d96c915804ac1026fce65cc8f5f678b77c0622a52d3f3efd00"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"4yi5xqxZJX9D31fZByA38ND+r0U9VBobfXRQUIxpVi3ulzZAMQMp+9jMwWw2vEuRkih+W4dK06mpXQhhJ6ClDw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-27T02:18:11.694107Z","bundle_sha256":"33beeb3f3ea4b127e856997df46ad074255aef706fbccd9ff3eeb2367d214892"}}