{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2019:EKHQBLWG25D54OVZQSV2RSY76G","short_pith_number":"pith:EKHQBLWG","canonical_record":{"source":{"id":"1907.11705","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2019-07-27T09:52:26Z","cross_cats_sorted":["cs.IT","math.IT","math.OC"],"title_canon_sha256":"da511051608d4d1b8acb994875460be0aa35a68c61c4752611b4ab1b26284ee1","abstract_canon_sha256":"79546ccf7381b832ea5f080650abe5eedaec3732c475a91641456b9f7e92be68"},"schema_version":"1.0"},"canonical_sha256":"228f00aec6d747de3ab984aba8cb1ff18f1fdf9a57a7e1d0e4a07cb5057c4f34","source":{"kind":"arxiv","id":"1907.11705","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1907.11705","created_at":"2026-05-17T23:39:23Z"},{"alias_kind":"arxiv_version","alias_value":"1907.11705v1","created_at":"2026-05-17T23:39:23Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1907.11705","created_at":"2026-05-17T23:39:23Z"},{"alias_kind":"pith_short_12","alias_value":"EKHQBLWG25D5","created_at":"2026-05-18T12:33:15Z"},{"alias_kind":"pith_short_16","alias_value":"EKHQBLWG25D54OVZ","created_at":"2026-05-18T12:33:15Z"},{"alias_kind":"pith_short_8","alias_value":"EKHQBLWG","created_at":"2026-05-18T12:33:15Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2019:EKHQBLWG25D54OVZQSV2RSY76G","target":"record","payload":{"canonical_record":{"source":{"id":"1907.11705","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2019-07-27T09:52:26Z","cross_cats_sorted":["cs.IT","math.IT","math.OC"],"title_canon_sha256":"da511051608d4d1b8acb994875460be0aa35a68c61c4752611b4ab1b26284ee1","abstract_canon_sha256":"79546ccf7381b832ea5f080650abe5eedaec3732c475a91641456b9f7e92be68"},"schema_version":"1.0"},"canonical_sha256":"228f00aec6d747de3ab984aba8cb1ff18f1fdf9a57a7e1d0e4a07cb5057c4f34","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:39:23.319154Z","signature_b64":"xyEf2uFWFQLTROYhfNKYDrj/TBUdn6pxQmkgF38pTb2dINAsmWqkT1nib0+dtSNZdV4i3cRacUjk/qSyDHEmAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"228f00aec6d747de3ab984aba8cb1ff18f1fdf9a57a7e1d0e4a07cb5057c4f34","last_reissued_at":"2026-05-17T23:39:23.318630Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:39:23.318630Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1907.11705","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-17T23:39:23Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"fR7HdiA2q3lXv9hEy8rz7Tc+m1gmGfMWpzUYrEsQVQjL7OEviet1DTcolpOIr+zPDKdi49HIRH0p+gXO4ho0Bg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-02T23:37:43.270125Z"},"content_sha256":"6db44563f9575e4b342ecf10b33fa6b0df60ba795d64b30c1682f6331b757315","schema_version":"1.0","event_id":"sha256:6db44563f9575e4b342ecf10b33fa6b0df60ba795d64b30c1682f6331b757315"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2019:EKHQBLWG25D54OVZQSV2RSY76G","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Low-Rank Matrix Completion: A Contemporary Survey","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.IT","math.IT","math.OC"],"primary_cat":"cs.DS","authors_text":"Byonghyo Shim, Junhan Kim, Luong Trung Nguyen","submitted_at":"2019-07-27T09:52:26Z","abstract_excerpt":"As a paradigm to recover unknown entries of a matrix from partial observations, low-rank matrix completion (LRMC) has generated a great deal of interest. Over the years, there have been lots of works on this topic but it might not be easy to grasp the essential knowledge from these studies. This is mainly because many of these works are highly theoretical or a proposal of new LRMC technique. In this paper, we give a contemporary survey on LRMC. In order to provide better view, insight, and understanding of potentials and limitations of LRMC, we present early scattered results in a structured a"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1907.11705","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-17T23:39:23Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"bHfF43OEJF+DffGunHoLwvcbCVTzckWBeAsmNHQehi+lnOye4fJp/dZNqWv0e3jMtM63P0DMD3GZtuOs8tcMCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-02T23:37:43.270489Z"},"content_sha256":"3dc6da948f675c00fc63be9c5680f6af30e16ab5cc299d2fc079d8de171c9a0b","schema_version":"1.0","event_id":"sha256:3dc6da948f675c00fc63be9c5680f6af30e16ab5cc299d2fc079d8de171c9a0b"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/EKHQBLWG25D54OVZQSV2RSY76G/bundle.json","state_url":"https://pith.science/pith/EKHQBLWG25D54OVZQSV2RSY76G/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/EKHQBLWG25D54OVZQSV2RSY76G/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-02T23:37:43Z","links":{"resolver":"https://pith.science/pith/EKHQBLWG25D54OVZQSV2RSY76G","bundle":"https://pith.science/pith/EKHQBLWG25D54OVZQSV2RSY76G/bundle.json","state":"https://pith.science/pith/EKHQBLWG25D54OVZQSV2RSY76G/state.json","well_known_bundle":"https://pith.science/.well-known/pith/EKHQBLWG25D54OVZQSV2RSY76G/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2019:EKHQBLWG25D54OVZQSV2RSY76G","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":"79546ccf7381b832ea5f080650abe5eedaec3732c475a91641456b9f7e92be68","cross_cats_sorted":["cs.IT","math.IT","math.OC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2019-07-27T09:52:26Z","title_canon_sha256":"da511051608d4d1b8acb994875460be0aa35a68c61c4752611b4ab1b26284ee1"},"schema_version":"1.0","source":{"id":"1907.11705","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1907.11705","created_at":"2026-05-17T23:39:23Z"},{"alias_kind":"arxiv_version","alias_value":"1907.11705v1","created_at":"2026-05-17T23:39:23Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1907.11705","created_at":"2026-05-17T23:39:23Z"},{"alias_kind":"pith_short_12","alias_value":"EKHQBLWG25D5","created_at":"2026-05-18T12:33:15Z"},{"alias_kind":"pith_short_16","alias_value":"EKHQBLWG25D54OVZ","created_at":"2026-05-18T12:33:15Z"},{"alias_kind":"pith_short_8","alias_value":"EKHQBLWG","created_at":"2026-05-18T12:33:15Z"}],"graph_snapshots":[{"event_id":"sha256:3dc6da948f675c00fc63be9c5680f6af30e16ab5cc299d2fc079d8de171c9a0b","target":"graph","created_at":"2026-05-17T23:39:23Z","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":"As a paradigm to recover unknown entries of a matrix from partial observations, low-rank matrix completion (LRMC) has generated a great deal of interest. Over the years, there have been lots of works on this topic but it might not be easy to grasp the essential knowledge from these studies. This is mainly because many of these works are highly theoretical or a proposal of new LRMC technique. In this paper, we give a contemporary survey on LRMC. In order to provide better view, insight, and understanding of potentials and limitations of LRMC, we present early scattered results in a structured a","authors_text":"Byonghyo Shim, Junhan Kim, Luong Trung Nguyen","cross_cats":["cs.IT","math.IT","math.OC"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2019-07-27T09:52:26Z","title":"Low-Rank Matrix Completion: A Contemporary Survey"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1907.11705","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:6db44563f9575e4b342ecf10b33fa6b0df60ba795d64b30c1682f6331b757315","target":"record","created_at":"2026-05-17T23:39:23Z","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":"79546ccf7381b832ea5f080650abe5eedaec3732c475a91641456b9f7e92be68","cross_cats_sorted":["cs.IT","math.IT","math.OC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2019-07-27T09:52:26Z","title_canon_sha256":"da511051608d4d1b8acb994875460be0aa35a68c61c4752611b4ab1b26284ee1"},"schema_version":"1.0","source":{"id":"1907.11705","kind":"arxiv","version":1}},"canonical_sha256":"228f00aec6d747de3ab984aba8cb1ff18f1fdf9a57a7e1d0e4a07cb5057c4f34","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"228f00aec6d747de3ab984aba8cb1ff18f1fdf9a57a7e1d0e4a07cb5057c4f34","first_computed_at":"2026-05-17T23:39:23.318630Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:39:23.318630Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"xyEf2uFWFQLTROYhfNKYDrj/TBUdn6pxQmkgF38pTb2dINAsmWqkT1nib0+dtSNZdV4i3cRacUjk/qSyDHEmAg==","signature_status":"signed_v1","signed_at":"2026-05-17T23:39:23.319154Z","signed_message":"canonical_sha256_bytes"},"source_id":"1907.11705","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:6db44563f9575e4b342ecf10b33fa6b0df60ba795d64b30c1682f6331b757315","sha256:3dc6da948f675c00fc63be9c5680f6af30e16ab5cc299d2fc079d8de171c9a0b"],"state_sha256":"2de192a8a64e9c52da0290921d4f662564b3e6e3ca80e4e7a39e7bdf065bcc97"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"eV2NgnoBP+N2H7TsVQttFjs99Js4LFHm1JhdvLXR9bQEtXwmJH9OFUYtfjZ6L77YknBos34hX57Ua8dhmNAhAw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-02T23:37:43.272557Z","bundle_sha256":"87dfc3b1f96abb7e35015009185559148f59c0fbc16bb442d818b4773c3b9a90"}}