{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2014:WIJPGMPMQYAHLVQSOHVB35VDZY","short_pith_number":"pith:WIJPGMPM","canonical_record":{"source":{"id":"1404.1377","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2014-04-04T20:00:30Z","cross_cats_sorted":["math.NA","stat.ML"],"title_canon_sha256":"d619340106dd01e879ea9bb0c4749b73dee59e5e55f72babc35093a35e580c6a","abstract_canon_sha256":"95b6f00e1afb53f5466f20299ac4c9ab89f27f7505df93a11567116b78b6b6f7"},"schema_version":"1.0"},"canonical_sha256":"b212f331ec860075d61271ea1df6a3ce1e5b7db74c0372f9dc1b05bee80d5ff2","source":{"kind":"arxiv","id":"1404.1377","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1404.1377","created_at":"2026-05-18T02:54:06Z"},{"alias_kind":"arxiv_version","alias_value":"1404.1377v2","created_at":"2026-05-18T02:54:06Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1404.1377","created_at":"2026-05-18T02:54:06Z"},{"alias_kind":"pith_short_12","alias_value":"WIJPGMPMQYAH","created_at":"2026-05-18T12:28:54Z"},{"alias_kind":"pith_short_16","alias_value":"WIJPGMPMQYAHLVQS","created_at":"2026-05-18T12:28:54Z"},{"alias_kind":"pith_short_8","alias_value":"WIJPGMPM","created_at":"2026-05-18T12:28:54Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2014:WIJPGMPMQYAHLVQSOHVB35VDZY","target":"record","payload":{"canonical_record":{"source":{"id":"1404.1377","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2014-04-04T20:00:30Z","cross_cats_sorted":["math.NA","stat.ML"],"title_canon_sha256":"d619340106dd01e879ea9bb0c4749b73dee59e5e55f72babc35093a35e580c6a","abstract_canon_sha256":"95b6f00e1afb53f5466f20299ac4c9ab89f27f7505df93a11567116b78b6b6f7"},"schema_version":"1.0"},"canonical_sha256":"b212f331ec860075d61271ea1df6a3ce1e5b7db74c0372f9dc1b05bee80d5ff2","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:54:06.462255Z","signature_b64":"Q6NAIZUOYLbY68crps84U6PLMR6i+6ZhtgdZOVvNhd5D5+U+bLDP/EuiuiwEOhQ4H9/Ns3aTopzIWstyYL04Ag==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"b212f331ec860075d61271ea1df6a3ce1e5b7db74c0372f9dc1b05bee80d5ff2","last_reissued_at":"2026-05-18T02:54:06.461542Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:54:06.461542Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1404.1377","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-18T02:54:06Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"AtQohv1x9wSOkUAP4su5dLvwrQaNgjanVh8JtSknpHDBs/hioXPONRY42b1OTqS9Na5bjqkfAZOjwmNdvg19Cw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-06T21:21:41.668761Z"},"content_sha256":"096851c933ece77a38c6f02dab412ae85e54216a8a57c9bec608bf93b04dbf51","schema_version":"1.0","event_id":"sha256:096851c933ece77a38c6f02dab412ae85e54216a8a57c9bec608bf93b04dbf51"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2014:WIJPGMPMQYAHLVQSOHVB35VDZY","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Orthogonal Rank-One Matrix Pursuit for Low Rank Matrix Completion","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.NA","stat.ML"],"primary_cat":"cs.LG","authors_text":"Hasan Davulcu, Jieping Ye, Ming-Jun Lai, Wei Fan, Zhaosong Lu, Zheng Wang","submitted_at":"2014-04-04T20:00:30Z","abstract_excerpt":"In this paper, we propose an efficient and scalable low rank matrix completion algorithm. The key idea is to extend orthogonal matching pursuit method from the vector case to the matrix case. We further propose an economic version of our algorithm by introducing a novel weight updating rule to reduce the time and storage complexity. Both versions are computationally inexpensive for each matrix pursuit iteration, and find satisfactory results in a few iterations. Another advantage of our proposed algorithm is that it has only one tunable parameter, which is the rank. It is easy to understand an"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1404.1377","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-18T02:54:06Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"BUPdqvdHIf83FjjDKEkLiUGbcPKdNfgLeZXpLYGxK64YZh7eWO7ER7K9FHTzHifZZtUpaeMlvudyUJ5wGPJGCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-06T21:21:41.669441Z"},"content_sha256":"548407200ec661010185860f365b93f5ea3eb780a0d53971cbd28497c714f061","schema_version":"1.0","event_id":"sha256:548407200ec661010185860f365b93f5ea3eb780a0d53971cbd28497c714f061"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/WIJPGMPMQYAHLVQSOHVB35VDZY/bundle.json","state_url":"https://pith.science/pith/WIJPGMPMQYAHLVQSOHVB35VDZY/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/WIJPGMPMQYAHLVQSOHVB35VDZY/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-06T21:21:41Z","links":{"resolver":"https://pith.science/pith/WIJPGMPMQYAHLVQSOHVB35VDZY","bundle":"https://pith.science/pith/WIJPGMPMQYAHLVQSOHVB35VDZY/bundle.json","state":"https://pith.science/pith/WIJPGMPMQYAHLVQSOHVB35VDZY/state.json","well_known_bundle":"https://pith.science/.well-known/pith/WIJPGMPMQYAHLVQSOHVB35VDZY/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:WIJPGMPMQYAHLVQSOHVB35VDZY","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":"95b6f00e1afb53f5466f20299ac4c9ab89f27f7505df93a11567116b78b6b6f7","cross_cats_sorted":["math.NA","stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2014-04-04T20:00:30Z","title_canon_sha256":"d619340106dd01e879ea9bb0c4749b73dee59e5e55f72babc35093a35e580c6a"},"schema_version":"1.0","source":{"id":"1404.1377","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1404.1377","created_at":"2026-05-18T02:54:06Z"},{"alias_kind":"arxiv_version","alias_value":"1404.1377v2","created_at":"2026-05-18T02:54:06Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1404.1377","created_at":"2026-05-18T02:54:06Z"},{"alias_kind":"pith_short_12","alias_value":"WIJPGMPMQYAH","created_at":"2026-05-18T12:28:54Z"},{"alias_kind":"pith_short_16","alias_value":"WIJPGMPMQYAHLVQS","created_at":"2026-05-18T12:28:54Z"},{"alias_kind":"pith_short_8","alias_value":"WIJPGMPM","created_at":"2026-05-18T12:28:54Z"}],"graph_snapshots":[{"event_id":"sha256:548407200ec661010185860f365b93f5ea3eb780a0d53971cbd28497c714f061","target":"graph","created_at":"2026-05-18T02:54:06Z","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 paper, we propose an efficient and scalable low rank matrix completion algorithm. The key idea is to extend orthogonal matching pursuit method from the vector case to the matrix case. We further propose an economic version of our algorithm by introducing a novel weight updating rule to reduce the time and storage complexity. Both versions are computationally inexpensive for each matrix pursuit iteration, and find satisfactory results in a few iterations. Another advantage of our proposed algorithm is that it has only one tunable parameter, which is the rank. It is easy to understand an","authors_text":"Hasan Davulcu, Jieping Ye, Ming-Jun Lai, Wei Fan, Zhaosong Lu, Zheng Wang","cross_cats":["math.NA","stat.ML"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2014-04-04T20:00:30Z","title":"Orthogonal Rank-One Matrix Pursuit for Low Rank Matrix Completion"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1404.1377","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:096851c933ece77a38c6f02dab412ae85e54216a8a57c9bec608bf93b04dbf51","target":"record","created_at":"2026-05-18T02:54:06Z","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":"95b6f00e1afb53f5466f20299ac4c9ab89f27f7505df93a11567116b78b6b6f7","cross_cats_sorted":["math.NA","stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2014-04-04T20:00:30Z","title_canon_sha256":"d619340106dd01e879ea9bb0c4749b73dee59e5e55f72babc35093a35e580c6a"},"schema_version":"1.0","source":{"id":"1404.1377","kind":"arxiv","version":2}},"canonical_sha256":"b212f331ec860075d61271ea1df6a3ce1e5b7db74c0372f9dc1b05bee80d5ff2","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"b212f331ec860075d61271ea1df6a3ce1e5b7db74c0372f9dc1b05bee80d5ff2","first_computed_at":"2026-05-18T02:54:06.461542Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:54:06.461542Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"Q6NAIZUOYLbY68crps84U6PLMR6i+6ZhtgdZOVvNhd5D5+U+bLDP/EuiuiwEOhQ4H9/Ns3aTopzIWstyYL04Ag==","signature_status":"signed_v1","signed_at":"2026-05-18T02:54:06.462255Z","signed_message":"canonical_sha256_bytes"},"source_id":"1404.1377","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:096851c933ece77a38c6f02dab412ae85e54216a8a57c9bec608bf93b04dbf51","sha256:548407200ec661010185860f365b93f5ea3eb780a0d53971cbd28497c714f061"],"state_sha256":"98e7f58f6c1a45a9e593c4cea42812122c0e6235e105b7d1a2d44a567f11c31c"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"XrQ1QJyDbuqfdhJ4CcqfuqGRo0npkKW1J+hxtRkC1B+CKBiZE1lPMwlvOxbTC74GX5CxRs578277T9ECxDGgAA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-06T21:21:41.672782Z","bundle_sha256":"fb6b09de7b9d1641f72f3c1ae283f8fd82d1fb695f86c84c30ad53f3e6a9d23a"}}