{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2008:ULSBTZJHJ2KGGY2IOERYDSIDPB","short_pith_number":"pith:ULSBTZJH","canonical_record":{"source":{"id":"0805.4471","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2008-05-29T05:29:56Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"a82750c6f51beadf51e331d8feb3d4d494c78389fc709b0894807330b965e608","abstract_canon_sha256":"d92c4bf75ecd47fcb6a6741314db36a22a3c9fc90cdd01858bda7a163157b902"},"schema_version":"1.0"},"canonical_sha256":"a2e419e5274e94636348712381c9037856acd5b1651a3025ff5c5917f19fbb26","source":{"kind":"arxiv","id":"0805.4471","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"0805.4471","created_at":"2026-07-04T15:11:52Z"},{"alias_kind":"arxiv_version","alias_value":"0805.4471v1","created_at":"2026-07-04T15:11:52Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.0805.4471","created_at":"2026-07-04T15:11:52Z"},{"alias_kind":"pith_short_12","alias_value":"ULSBTZJHJ2KG","created_at":"2026-07-04T15:11:52Z"},{"alias_kind":"pith_short_16","alias_value":"ULSBTZJHJ2KGGY2I","created_at":"2026-07-04T15:11:52Z"},{"alias_kind":"pith_short_8","alias_value":"ULSBTZJH","created_at":"2026-07-04T15:11:52Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2008:ULSBTZJHJ2KGGY2IOERYDSIDPB","target":"record","payload":{"canonical_record":{"source":{"id":"0805.4471","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2008-05-29T05:29:56Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"a82750c6f51beadf51e331d8feb3d4d494c78389fc709b0894807330b965e608","abstract_canon_sha256":"d92c4bf75ecd47fcb6a6741314db36a22a3c9fc90cdd01858bda7a163157b902"},"schema_version":"1.0"},"canonical_sha256":"a2e419e5274e94636348712381c9037856acd5b1651a3025ff5c5917f19fbb26","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-04T15:11:52.167134Z","signature_b64":"JC4eVKGKTnpc5qGi8RU47MEUgFfrYx+FzCL0d++o8TawZT5g317qSux6tmQKdsLsohgUxsevGECg2hKu/7yhDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"a2e419e5274e94636348712381c9037856acd5b1651a3025ff5c5917f19fbb26","last_reissued_at":"2026-07-04T15:11:52.166680Z","signature_status":"signed_v1","first_computed_at":"2026-07-04T15:11:52.166680Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"0805.4471","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-07-04T15:11:52Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"wrQ+SDP4j8n8rLTQvrxVPvWpfKkHrjncjDZWEENUTuX3AHU9ddsPlA7HrE6JyxHKK3KnH8Rcp7mDSS+zZJ3+Bw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-10T11:40:01.206889Z"},"content_sha256":"5e2d3494b299c312a0fafa6ab2525dc79dac25db5be196ae418ccadf327c85fe","schema_version":"1.0","event_id":"sha256:5e2d3494b299c312a0fafa6ab2525dc79dac25db5be196ae418ccadf327c85fe"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2008:ULSBTZJHJ2KGGY2IOERYDSIDPB","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Exact Matrix Completion via Convex Optimization","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Benjamin Recht, Emmanuel J. Candes","submitted_at":"2008-05-29T05:29:56Z","abstract_excerpt":"We consider a problem of considerable practical interest: the recovery of a data matrix from a sampling of its entries. Suppose that we observe m entries selected uniformly at random from a matrix M. Can we complete the matrix and recover the entries that we have not seen?\n  We show that one can perfectly recover most low-rank matrices from what appears to be an incomplete set of entries. We prove that if the number m of sampled entries obeys m >= C n^{1.2} r log n for some positive numerical constant C, then with very high probability, most n by n matrices of rank r can be perfectly recovered"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"0805.4471","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/0805.4471/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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-07-04T15:11:52Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"BvgObchhgNBXiTvejAaEDkzOC1afId7UFP3j+sUnJz+yle/3y2hIB9tJw4JYp2BoDQYlibBhI8SwYof2IaxnAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-10T11:40:01.207268Z"},"content_sha256":"b6fef1c1ea361af322298ea28816d71db83f783c0d7fe1cae44c0be1381407c4","schema_version":"1.0","event_id":"sha256:b6fef1c1ea361af322298ea28816d71db83f783c0d7fe1cae44c0be1381407c4"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/ULSBTZJHJ2KGGY2IOERYDSIDPB/bundle.json","state_url":"https://pith.science/pith/ULSBTZJHJ2KGGY2IOERYDSIDPB/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/ULSBTZJHJ2KGGY2IOERYDSIDPB/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-07-10T11:40:01Z","links":{"resolver":"https://pith.science/pith/ULSBTZJHJ2KGGY2IOERYDSIDPB","bundle":"https://pith.science/pith/ULSBTZJHJ2KGGY2IOERYDSIDPB/bundle.json","state":"https://pith.science/pith/ULSBTZJHJ2KGGY2IOERYDSIDPB/state.json","well_known_bundle":"https://pith.science/.well-known/pith/ULSBTZJHJ2KGGY2IOERYDSIDPB/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2008:ULSBTZJHJ2KGGY2IOERYDSIDPB","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":"d92c4bf75ecd47fcb6a6741314db36a22a3c9fc90cdd01858bda7a163157b902","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2008-05-29T05:29:56Z","title_canon_sha256":"a82750c6f51beadf51e331d8feb3d4d494c78389fc709b0894807330b965e608"},"schema_version":"1.0","source":{"id":"0805.4471","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"0805.4471","created_at":"2026-07-04T15:11:52Z"},{"alias_kind":"arxiv_version","alias_value":"0805.4471v1","created_at":"2026-07-04T15:11:52Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.0805.4471","created_at":"2026-07-04T15:11:52Z"},{"alias_kind":"pith_short_12","alias_value":"ULSBTZJHJ2KG","created_at":"2026-07-04T15:11:52Z"},{"alias_kind":"pith_short_16","alias_value":"ULSBTZJHJ2KGGY2I","created_at":"2026-07-04T15:11:52Z"},{"alias_kind":"pith_short_8","alias_value":"ULSBTZJH","created_at":"2026-07-04T15:11:52Z"}],"graph_snapshots":[{"event_id":"sha256:b6fef1c1ea361af322298ea28816d71db83f783c0d7fe1cae44c0be1381407c4","target":"graph","created_at":"2026-07-04T15:11:52Z","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"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/0805.4471/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"We consider a problem of considerable practical interest: the recovery of a data matrix from a sampling of its entries. Suppose that we observe m entries selected uniformly at random from a matrix M. Can we complete the matrix and recover the entries that we have not seen?\n  We show that one can perfectly recover most low-rank matrices from what appears to be an incomplete set of entries. We prove that if the number m of sampled entries obeys m >= C n^{1.2} r log n for some positive numerical constant C, then with very high probability, most n by n matrices of rank r can be perfectly recovered","authors_text":"Benjamin Recht, Emmanuel J. Candes","cross_cats":["math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2008-05-29T05:29:56Z","title":"Exact Matrix Completion via Convex Optimization"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"0805.4471","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:5e2d3494b299c312a0fafa6ab2525dc79dac25db5be196ae418ccadf327c85fe","target":"record","created_at":"2026-07-04T15:11:52Z","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":"d92c4bf75ecd47fcb6a6741314db36a22a3c9fc90cdd01858bda7a163157b902","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2008-05-29T05:29:56Z","title_canon_sha256":"a82750c6f51beadf51e331d8feb3d4d494c78389fc709b0894807330b965e608"},"schema_version":"1.0","source":{"id":"0805.4471","kind":"arxiv","version":1}},"canonical_sha256":"a2e419e5274e94636348712381c9037856acd5b1651a3025ff5c5917f19fbb26","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"a2e419e5274e94636348712381c9037856acd5b1651a3025ff5c5917f19fbb26","first_computed_at":"2026-07-04T15:11:52.166680Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-04T15:11:52.166680Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"JC4eVKGKTnpc5qGi8RU47MEUgFfrYx+FzCL0d++o8TawZT5g317qSux6tmQKdsLsohgUxsevGECg2hKu/7yhDQ==","signature_status":"signed_v1","signed_at":"2026-07-04T15:11:52.167134Z","signed_message":"canonical_sha256_bytes"},"source_id":"0805.4471","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:5e2d3494b299c312a0fafa6ab2525dc79dac25db5be196ae418ccadf327c85fe","sha256:b6fef1c1ea361af322298ea28816d71db83f783c0d7fe1cae44c0be1381407c4"],"state_sha256":"cfe17fe2a7463e968262d9d3bf8b84f719b99b4f0e77e3abf53ea1b9624d24e5"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Loc7HGhFiDwynHwMeDr/bTr7ppyfdaLIjLiIaMVL//yk0fMaduS/fR0ona4fSIHhVmMGD6L8uIhJ9S9BAhfnDg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-07-10T11:40:01.209313Z","bundle_sha256":"94bbe425db331d9d52c91cc116185a2bd82c45b260f1e031459c017bf7d8bc74"}}