{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:LEIMPUPSDNY4BUQZ5XD67YHURK","short_pith_number":"pith:LEIMPUPS","canonical_record":{"source":{"id":"1712.01628","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2017-12-05T14:06:44Z","cross_cats_sorted":["cs.CV","cs.LG","math.IT"],"title_canon_sha256":"7fbf81f43947ebbaa00f4ce74e8c466302e1781594f1ae9ba4c1c993257452ea","abstract_canon_sha256":"dc7f50f07cd3d51ff22e246762c3955a6b9db05c2f0916c09bb1677b48c6bae3"},"schema_version":"1.0"},"canonical_sha256":"5910c7d1f21b71c0d219edc7efe0f48a987835729b2a4a43549b7c63b6db020e","source":{"kind":"arxiv","id":"1712.01628","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1712.01628","created_at":"2026-05-18T00:21:21Z"},{"alias_kind":"arxiv_version","alias_value":"1712.01628v1","created_at":"2026-05-18T00:21:21Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1712.01628","created_at":"2026-05-18T00:21:21Z"},{"alias_kind":"pith_short_12","alias_value":"LEIMPUPSDNY4","created_at":"2026-05-18T12:31:28Z"},{"alias_kind":"pith_short_16","alias_value":"LEIMPUPSDNY4BUQZ","created_at":"2026-05-18T12:31:28Z"},{"alias_kind":"pith_short_8","alias_value":"LEIMPUPS","created_at":"2026-05-18T12:31:28Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:LEIMPUPSDNY4BUQZ5XD67YHURK","target":"record","payload":{"canonical_record":{"source":{"id":"1712.01628","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2017-12-05T14:06:44Z","cross_cats_sorted":["cs.CV","cs.LG","math.IT"],"title_canon_sha256":"7fbf81f43947ebbaa00f4ce74e8c466302e1781594f1ae9ba4c1c993257452ea","abstract_canon_sha256":"dc7f50f07cd3d51ff22e246762c3955a6b9db05c2f0916c09bb1677b48c6bae3"},"schema_version":"1.0"},"canonical_sha256":"5910c7d1f21b71c0d219edc7efe0f48a987835729b2a4a43549b7c63b6db020e","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:21:21.199301Z","signature_b64":"A7hbQNTy0/qosvf17xIJuPhzvxHj9yQUCdi8/wN2Z3HZUW2cmgMExFCRdRwWEKKsi73ct7/fG96MTZuH3O1fDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"5910c7d1f21b71c0d219edc7efe0f48a987835729b2a4a43549b7c63b6db020e","last_reissued_at":"2026-05-18T00:21:21.197248Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:21:21.197248Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1712.01628","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:21:21Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"XpH8qO10kQhWj5+fvmkEvQ/lJlnJw4+k7qjg8h5YTjdic5P+sejtA7oyWFA94fX7usjk6G4nbVYeXvQ2FOUiBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-06T23:45:27.719581Z"},"content_sha256":"78855d5fc805d1c691da0f5f75a7a47e014e30dd34f15d271a49bea70aa80f10","schema_version":"1.0","event_id":"sha256:78855d5fc805d1c691da0f5f75a7a47e014e30dd34f15d271a49bea70aa80f10"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:LEIMPUPSDNY4BUQZ5XD67YHURK","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"On Deterministic Sampling Patterns for Robust Low-Rank Matrix Completion","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CV","cs.LG","math.IT"],"primary_cat":"cs.IT","authors_text":"Morteza Ashraphijuo, Vaneet Aggarwal, Xiaodong Wang","submitted_at":"2017-12-05T14:06:44Z","abstract_excerpt":"In this letter, we study the deterministic sampling patterns for the completion of low rank matrix, when corrupted with a sparse noise, also known as robust matrix completion. We extend the recent results on the deterministic sampling patterns in the absence of noise based on the geometric analysis on the Grassmannian manifold. A special case where each column has a certain number of noisy entries is considered, where our probabilistic analysis performs very efficiently. Furthermore, assuming that the rank of the original matrix is not given, we provide an analysis to determine if the rank of "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1712.01628","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:21:21Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"gjfLLH6lcZgd5zsAAlv4xkpoVOGO9pU3IlRqZ9jax9nU5AUmTGz3i7PzvI7QsN24H/Zs4InQF8/euE+hqourCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-06T23:45:27.720188Z"},"content_sha256":"29e010768e2eddd6c262f5846e1a26d16b73cb25f9c2dcd084ce6bf942890ddf","schema_version":"1.0","event_id":"sha256:29e010768e2eddd6c262f5846e1a26d16b73cb25f9c2dcd084ce6bf942890ddf"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/LEIMPUPSDNY4BUQZ5XD67YHURK/bundle.json","state_url":"https://pith.science/pith/LEIMPUPSDNY4BUQZ5XD67YHURK/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/LEIMPUPSDNY4BUQZ5XD67YHURK/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-06T23:45:27Z","links":{"resolver":"https://pith.science/pith/LEIMPUPSDNY4BUQZ5XD67YHURK","bundle":"https://pith.science/pith/LEIMPUPSDNY4BUQZ5XD67YHURK/bundle.json","state":"https://pith.science/pith/LEIMPUPSDNY4BUQZ5XD67YHURK/state.json","well_known_bundle":"https://pith.science/.well-known/pith/LEIMPUPSDNY4BUQZ5XD67YHURK/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:LEIMPUPSDNY4BUQZ5XD67YHURK","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":"dc7f50f07cd3d51ff22e246762c3955a6b9db05c2f0916c09bb1677b48c6bae3","cross_cats_sorted":["cs.CV","cs.LG","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2017-12-05T14:06:44Z","title_canon_sha256":"7fbf81f43947ebbaa00f4ce74e8c466302e1781594f1ae9ba4c1c993257452ea"},"schema_version":"1.0","source":{"id":"1712.01628","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1712.01628","created_at":"2026-05-18T00:21:21Z"},{"alias_kind":"arxiv_version","alias_value":"1712.01628v1","created_at":"2026-05-18T00:21:21Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1712.01628","created_at":"2026-05-18T00:21:21Z"},{"alias_kind":"pith_short_12","alias_value":"LEIMPUPSDNY4","created_at":"2026-05-18T12:31:28Z"},{"alias_kind":"pith_short_16","alias_value":"LEIMPUPSDNY4BUQZ","created_at":"2026-05-18T12:31:28Z"},{"alias_kind":"pith_short_8","alias_value":"LEIMPUPS","created_at":"2026-05-18T12:31:28Z"}],"graph_snapshots":[{"event_id":"sha256:29e010768e2eddd6c262f5846e1a26d16b73cb25f9c2dcd084ce6bf942890ddf","target":"graph","created_at":"2026-05-18T00:21:21Z","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":"In this letter, we study the deterministic sampling patterns for the completion of low rank matrix, when corrupted with a sparse noise, also known as robust matrix completion. We extend the recent results on the deterministic sampling patterns in the absence of noise based on the geometric analysis on the Grassmannian manifold. A special case where each column has a certain number of noisy entries is considered, where our probabilistic analysis performs very efficiently. Furthermore, assuming that the rank of the original matrix is not given, we provide an analysis to determine if the rank of ","authors_text":"Morteza Ashraphijuo, Vaneet Aggarwal, Xiaodong Wang","cross_cats":["cs.CV","cs.LG","math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2017-12-05T14:06:44Z","title":"On Deterministic Sampling Patterns for Robust Low-Rank Matrix Completion"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1712.01628","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:78855d5fc805d1c691da0f5f75a7a47e014e30dd34f15d271a49bea70aa80f10","target":"record","created_at":"2026-05-18T00:21:21Z","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":"dc7f50f07cd3d51ff22e246762c3955a6b9db05c2f0916c09bb1677b48c6bae3","cross_cats_sorted":["cs.CV","cs.LG","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2017-12-05T14:06:44Z","title_canon_sha256":"7fbf81f43947ebbaa00f4ce74e8c466302e1781594f1ae9ba4c1c993257452ea"},"schema_version":"1.0","source":{"id":"1712.01628","kind":"arxiv","version":1}},"canonical_sha256":"5910c7d1f21b71c0d219edc7efe0f48a987835729b2a4a43549b7c63b6db020e","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"5910c7d1f21b71c0d219edc7efe0f48a987835729b2a4a43549b7c63b6db020e","first_computed_at":"2026-05-18T00:21:21.197248Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:21:21.197248Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"A7hbQNTy0/qosvf17xIJuPhzvxHj9yQUCdi8/wN2Z3HZUW2cmgMExFCRdRwWEKKsi73ct7/fG96MTZuH3O1fDQ==","signature_status":"signed_v1","signed_at":"2026-05-18T00:21:21.199301Z","signed_message":"canonical_sha256_bytes"},"source_id":"1712.01628","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:78855d5fc805d1c691da0f5f75a7a47e014e30dd34f15d271a49bea70aa80f10","sha256:29e010768e2eddd6c262f5846e1a26d16b73cb25f9c2dcd084ce6bf942890ddf"],"state_sha256":"8ddb05152edd181a5a0eb5e382ae8fdfc8f7eb92572d1a15833d66f508e6eb34"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"pJIKGl2IuLW/giAscYqkkoj138YQl2v9bacoFi+S8EKZ8Y6QZLTgNOdBxbgNQFVU3h4fodHLCSRL9t7EmeoHAw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-06T23:45:27.723850Z","bundle_sha256":"1531ac2d82038a8cfb26bd779ccaea5b90b2f7b8f5844f0c228c99893ee7ed0e"}}