{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:QYYAKOQN7W5FD5C6OVAAIHXJCL","short_pith_number":"pith:QYYAKOQN","canonical_record":{"source":{"id":"1612.01720","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2016-12-06T09:35:07Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"7ba957a9c5266b0453844b26ec57da3b2dcf25c06991d8b0fd2aa65f1c5b8329","abstract_canon_sha256":"2d443a99afbd3e19d0acb8860568284b4899d3bff62112a95320ee8a7a7f2913"},"schema_version":"1.0"},"canonical_sha256":"8630053a0dfdba51f45e7540041ee912e08b3e2347efb862305ad4232168e117","source":{"kind":"arxiv","id":"1612.01720","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1612.01720","created_at":"2026-05-18T00:21:29Z"},{"alias_kind":"arxiv_version","alias_value":"1612.01720v3","created_at":"2026-05-18T00:21:29Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1612.01720","created_at":"2026-05-18T00:21:29Z"},{"alias_kind":"pith_short_12","alias_value":"QYYAKOQN7W5F","created_at":"2026-05-18T12:30:41Z"},{"alias_kind":"pith_short_16","alias_value":"QYYAKOQN7W5FD5C6","created_at":"2026-05-18T12:30:41Z"},{"alias_kind":"pith_short_8","alias_value":"QYYAKOQN","created_at":"2026-05-18T12:30:41Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:QYYAKOQN7W5FD5C6OVAAIHXJCL","target":"record","payload":{"canonical_record":{"source":{"id":"1612.01720","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2016-12-06T09:35:07Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"7ba957a9c5266b0453844b26ec57da3b2dcf25c06991d8b0fd2aa65f1c5b8329","abstract_canon_sha256":"2d443a99afbd3e19d0acb8860568284b4899d3bff62112a95320ee8a7a7f2913"},"schema_version":"1.0"},"canonical_sha256":"8630053a0dfdba51f45e7540041ee912e08b3e2347efb862305ad4232168e117","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:21:29.030076Z","signature_b64":"sShliQwalIftO74iMkhruKglI137g/cYXRP+6vLtC31uD7mNWcCvYUJ9PkhEHKXIU+QgEFDjmDrYz9JSwwVtAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"8630053a0dfdba51f45e7540041ee912e08b3e2347efb862305ad4232168e117","last_reissued_at":"2026-05-18T00:21:29.029516Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:21:29.029516Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1612.01720","source_version":3,"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:29Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"KRY4mhXZieAgs9DzoroQJjf2s7DX+ODIIRkQfdfccoivKVfNE+aClAxJy3CzDyM7zBq3Pe+lqcpzTMgsaGCICw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T13:27:40.089669Z"},"content_sha256":"6ac57ea613f51454bc6d9b2a468a646f301572a5c6118bf84b13a91a80c7f74d","schema_version":"1.0","event_id":"sha256:6ac57ea613f51454bc6d9b2a468a646f301572a5c6118bf84b13a91a80c7f74d"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:QYYAKOQN7W5FD5C6OVAAIHXJCL","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Weighted Matrix Completion and Recovery with Prior Subspace Information","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Armin Eftekhari, Dehui Yang, Michael B. Wakin","submitted_at":"2016-12-06T09:35:07Z","abstract_excerpt":"An incoherent low-rank matrix can be efficiently reconstructed after observing a few of its entries at random, and then solving a convex program that minimizes the nuclear norm. In many applications, in addition to these entries, potentially valuable prior knowledge about the column and row spaces of the matrix is also available to the practitioner. In this paper, we incorporate this prior knowledge in matrix completion---by minimizing a weighted nuclear norm---and precisely quantify any improvements. In particular, we find in theory that reliable prior knowledge reduces the sample complexity "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1612.01720","kind":"arxiv","version":3},"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:29Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"eaqBTZRRdwXjlVzNhZ1r6iOigi99tGnPp2pwc3OxJehHWDU0s3qLtEA7P3OBAX2WO8WpetJ6mS8/SkQFRRNrAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T13:27:40.090052Z"},"content_sha256":"0bf351d3b128098dfcb72dbe0f69d15c673defe3960602963dc0c9b883ae7fae","schema_version":"1.0","event_id":"sha256:0bf351d3b128098dfcb72dbe0f69d15c673defe3960602963dc0c9b883ae7fae"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/QYYAKOQN7W5FD5C6OVAAIHXJCL/bundle.json","state_url":"https://pith.science/pith/QYYAKOQN7W5FD5C6OVAAIHXJCL/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/QYYAKOQN7W5FD5C6OVAAIHXJCL/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-30T13:27:40Z","links":{"resolver":"https://pith.science/pith/QYYAKOQN7W5FD5C6OVAAIHXJCL","bundle":"https://pith.science/pith/QYYAKOQN7W5FD5C6OVAAIHXJCL/bundle.json","state":"https://pith.science/pith/QYYAKOQN7W5FD5C6OVAAIHXJCL/state.json","well_known_bundle":"https://pith.science/.well-known/pith/QYYAKOQN7W5FD5C6OVAAIHXJCL/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:QYYAKOQN7W5FD5C6OVAAIHXJCL","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":"2d443a99afbd3e19d0acb8860568284b4899d3bff62112a95320ee8a7a7f2913","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2016-12-06T09:35:07Z","title_canon_sha256":"7ba957a9c5266b0453844b26ec57da3b2dcf25c06991d8b0fd2aa65f1c5b8329"},"schema_version":"1.0","source":{"id":"1612.01720","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1612.01720","created_at":"2026-05-18T00:21:29Z"},{"alias_kind":"arxiv_version","alias_value":"1612.01720v3","created_at":"2026-05-18T00:21:29Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1612.01720","created_at":"2026-05-18T00:21:29Z"},{"alias_kind":"pith_short_12","alias_value":"QYYAKOQN7W5F","created_at":"2026-05-18T12:30:41Z"},{"alias_kind":"pith_short_16","alias_value":"QYYAKOQN7W5FD5C6","created_at":"2026-05-18T12:30:41Z"},{"alias_kind":"pith_short_8","alias_value":"QYYAKOQN","created_at":"2026-05-18T12:30:41Z"}],"graph_snapshots":[{"event_id":"sha256:0bf351d3b128098dfcb72dbe0f69d15c673defe3960602963dc0c9b883ae7fae","target":"graph","created_at":"2026-05-18T00:21:29Z","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":"An incoherent low-rank matrix can be efficiently reconstructed after observing a few of its entries at random, and then solving a convex program that minimizes the nuclear norm. In many applications, in addition to these entries, potentially valuable prior knowledge about the column and row spaces of the matrix is also available to the practitioner. In this paper, we incorporate this prior knowledge in matrix completion---by minimizing a weighted nuclear norm---and precisely quantify any improvements. In particular, we find in theory that reliable prior knowledge reduces the sample complexity ","authors_text":"Armin Eftekhari, Dehui Yang, Michael B. Wakin","cross_cats":["math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2016-12-06T09:35:07Z","title":"Weighted Matrix Completion and Recovery with Prior Subspace Information"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1612.01720","kind":"arxiv","version":3},"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:6ac57ea613f51454bc6d9b2a468a646f301572a5c6118bf84b13a91a80c7f74d","target":"record","created_at":"2026-05-18T00:21:29Z","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":"2d443a99afbd3e19d0acb8860568284b4899d3bff62112a95320ee8a7a7f2913","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2016-12-06T09:35:07Z","title_canon_sha256":"7ba957a9c5266b0453844b26ec57da3b2dcf25c06991d8b0fd2aa65f1c5b8329"},"schema_version":"1.0","source":{"id":"1612.01720","kind":"arxiv","version":3}},"canonical_sha256":"8630053a0dfdba51f45e7540041ee912e08b3e2347efb862305ad4232168e117","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"8630053a0dfdba51f45e7540041ee912e08b3e2347efb862305ad4232168e117","first_computed_at":"2026-05-18T00:21:29.029516Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:21:29.029516Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"sShliQwalIftO74iMkhruKglI137g/cYXRP+6vLtC31uD7mNWcCvYUJ9PkhEHKXIU+QgEFDjmDrYz9JSwwVtAA==","signature_status":"signed_v1","signed_at":"2026-05-18T00:21:29.030076Z","signed_message":"canonical_sha256_bytes"},"source_id":"1612.01720","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:6ac57ea613f51454bc6d9b2a468a646f301572a5c6118bf84b13a91a80c7f74d","sha256:0bf351d3b128098dfcb72dbe0f69d15c673defe3960602963dc0c9b883ae7fae"],"state_sha256":"2ef7ba471809683b679aded969be48ac1bb1cd39224335bcc868fce882d2afd5"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ngPTf//unlDYSuC4QxL4HPKcJ8u8zPHOTAAu1iylf/ck0KapUnFMI4COriuQsA9uoV+jDgeUskffYKJaent1AA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-30T13:27:40.092237Z","bundle_sha256":"fe6c7402d179d38c1f323ac13c435506cbbc4c77d75e3d699ed46b834652aa75"}}