{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2009:AMKE52EFQ63A6SMGIFANCJTDX7","short_pith_number":"pith:AMKE52EF","canonical_record":{"source":{"id":"0903.4742","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2009-03-27T07:52:06Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"caa689a560c3c34822f695a76d40d5b767d0ba424e2424275dcf6842053403b3","abstract_canon_sha256":"76c8062af7dca85b03d1cea8fa517df3f5d61f30196f95d1646654c523394e1d"},"schema_version":"1.0"},"canonical_sha256":"03144ee88587b60f49864140d12663bffb29bd84eeeb90fb58fc00485f03fe09","source":{"kind":"arxiv","id":"0903.4742","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"0903.4742","created_at":"2026-07-04T15:40:15Z"},{"alias_kind":"arxiv_version","alias_value":"0903.4742v1","created_at":"2026-07-04T15:40:15Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.0903.4742","created_at":"2026-07-04T15:40:15Z"},{"alias_kind":"pith_short_12","alias_value":"AMKE52EFQ63A","created_at":"2026-07-04T15:40:15Z"},{"alias_kind":"pith_short_16","alias_value":"AMKE52EFQ63A6SMG","created_at":"2026-07-04T15:40:15Z"},{"alias_kind":"pith_short_8","alias_value":"AMKE52EF","created_at":"2026-07-04T15:40:15Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2009:AMKE52EFQ63A6SMGIFANCJTDX7","target":"record","payload":{"canonical_record":{"source":{"id":"0903.4742","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2009-03-27T07:52:06Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"caa689a560c3c34822f695a76d40d5b767d0ba424e2424275dcf6842053403b3","abstract_canon_sha256":"76c8062af7dca85b03d1cea8fa517df3f5d61f30196f95d1646654c523394e1d"},"schema_version":"1.0"},"canonical_sha256":"03144ee88587b60f49864140d12663bffb29bd84eeeb90fb58fc00485f03fe09","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-04T15:40:15.676966Z","signature_b64":"tlVBPKE0xNqYJSCYe0adGW850IEN3DQzyDpp7mniuEoX0dg6z45sx9ZjBibbUqQM5XSmEGL3XmeIzbxMqQFNCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"03144ee88587b60f49864140d12663bffb29bd84eeeb90fb58fc00485f03fe09","last_reissued_at":"2026-07-04T15:40:15.676538Z","signature_status":"signed_v1","first_computed_at":"2026-07-04T15:40:15.676538Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"0903.4742","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:40:15Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"3+hISPMwMYx9LnJrgXcnUZIe9SsEIlatUFUSRQcGxmEPF9FUPNTdV1bHnUz+Z9bPjLtJ9p0DgA1Vo00mjnfiCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-10T04:15:10.827916Z"},"content_sha256":"b7e90adaa5a82dcdb1e7b902a0183861b699bc83d94cea388cac99d9c6c1fbfe","schema_version":"1.0","event_id":"sha256:b7e90adaa5a82dcdb1e7b902a0183861b699bc83d94cea388cac99d9c6c1fbfe"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2009:AMKE52EFQ63A6SMGIFANCJTDX7","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Guaranteed Minimum Rank Approximation from Linear Observations by Nuclear Norm Minimization with an Ellipsoidal Constraint","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Kiryung Lee, Yoram Bresler","submitted_at":"2009-03-27T07:52:06Z","abstract_excerpt":"The rank minimization problem is to find the lowest-rank matrix in a given set. Nuclear norm minimization has been proposed as an convex relaxation of rank minimization. Recht, Fazel, and Parrilo have shown that nuclear norm minimization subject to an affine constraint is equivalent to rank minimization under a certain condition given in terms of the rank-restricted isometry property. However, in the presence of measurement noise, or with only approximately low rank generative model, the appropriate constraint set is an ellipsoid rather than an affine space. There exist polynomial-time algorit"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"0903.4742","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/0903.4742/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:40:15Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"oF64so4Fsy73m2EYLL7BpILJpJgyTm5xwzWXY8HR16LC4h1pKsGmuBUSYHVKwgfUP9Bkh8chz7idCFmL591XAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-10T04:15:10.828711Z"},"content_sha256":"e36b2011b84187dc9a026abc2ba3e735c5d7bc96fb2d22d27c6537f2ee2c3e50","schema_version":"1.0","event_id":"sha256:e36b2011b84187dc9a026abc2ba3e735c5d7bc96fb2d22d27c6537f2ee2c3e50"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/AMKE52EFQ63A6SMGIFANCJTDX7/bundle.json","state_url":"https://pith.science/pith/AMKE52EFQ63A6SMGIFANCJTDX7/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/AMKE52EFQ63A6SMGIFANCJTDX7/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-08-10T04:15:10Z","links":{"resolver":"https://pith.science/pith/AMKE52EFQ63A6SMGIFANCJTDX7","bundle":"https://pith.science/pith/AMKE52EFQ63A6SMGIFANCJTDX7/bundle.json","state":"https://pith.science/pith/AMKE52EFQ63A6SMGIFANCJTDX7/state.json","well_known_bundle":"https://pith.science/.well-known/pith/AMKE52EFQ63A6SMGIFANCJTDX7/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2009:AMKE52EFQ63A6SMGIFANCJTDX7","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":"76c8062af7dca85b03d1cea8fa517df3f5d61f30196f95d1646654c523394e1d","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2009-03-27T07:52:06Z","title_canon_sha256":"caa689a560c3c34822f695a76d40d5b767d0ba424e2424275dcf6842053403b3"},"schema_version":"1.0","source":{"id":"0903.4742","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"0903.4742","created_at":"2026-07-04T15:40:15Z"},{"alias_kind":"arxiv_version","alias_value":"0903.4742v1","created_at":"2026-07-04T15:40:15Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.0903.4742","created_at":"2026-07-04T15:40:15Z"},{"alias_kind":"pith_short_12","alias_value":"AMKE52EFQ63A","created_at":"2026-07-04T15:40:15Z"},{"alias_kind":"pith_short_16","alias_value":"AMKE52EFQ63A6SMG","created_at":"2026-07-04T15:40:15Z"},{"alias_kind":"pith_short_8","alias_value":"AMKE52EF","created_at":"2026-07-04T15:40:15Z"}],"graph_snapshots":[{"event_id":"sha256:e36b2011b84187dc9a026abc2ba3e735c5d7bc96fb2d22d27c6537f2ee2c3e50","target":"graph","created_at":"2026-07-04T15:40:15Z","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/0903.4742/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"The rank minimization problem is to find the lowest-rank matrix in a given set. Nuclear norm minimization has been proposed as an convex relaxation of rank minimization. Recht, Fazel, and Parrilo have shown that nuclear norm minimization subject to an affine constraint is equivalent to rank minimization under a certain condition given in terms of the rank-restricted isometry property. However, in the presence of measurement noise, or with only approximately low rank generative model, the appropriate constraint set is an ellipsoid rather than an affine space. There exist polynomial-time algorit","authors_text":"Kiryung Lee, Yoram Bresler","cross_cats":["math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2009-03-27T07:52:06Z","title":"Guaranteed Minimum Rank Approximation from Linear Observations by Nuclear Norm Minimization with an Ellipsoidal Constraint"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"0903.4742","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:b7e90adaa5a82dcdb1e7b902a0183861b699bc83d94cea388cac99d9c6c1fbfe","target":"record","created_at":"2026-07-04T15:40:15Z","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":"76c8062af7dca85b03d1cea8fa517df3f5d61f30196f95d1646654c523394e1d","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2009-03-27T07:52:06Z","title_canon_sha256":"caa689a560c3c34822f695a76d40d5b767d0ba424e2424275dcf6842053403b3"},"schema_version":"1.0","source":{"id":"0903.4742","kind":"arxiv","version":1}},"canonical_sha256":"03144ee88587b60f49864140d12663bffb29bd84eeeb90fb58fc00485f03fe09","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"03144ee88587b60f49864140d12663bffb29bd84eeeb90fb58fc00485f03fe09","first_computed_at":"2026-07-04T15:40:15.676538Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-04T15:40:15.676538Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"tlVBPKE0xNqYJSCYe0adGW850IEN3DQzyDpp7mniuEoX0dg6z45sx9ZjBibbUqQM5XSmEGL3XmeIzbxMqQFNCQ==","signature_status":"signed_v1","signed_at":"2026-07-04T15:40:15.676966Z","signed_message":"canonical_sha256_bytes"},"source_id":"0903.4742","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:b7e90adaa5a82dcdb1e7b902a0183861b699bc83d94cea388cac99d9c6c1fbfe","sha256:e36b2011b84187dc9a026abc2ba3e735c5d7bc96fb2d22d27c6537f2ee2c3e50"],"state_sha256":"bcddad08c0428524a4f292ad58d09a44bfda226c059d05f0aff651f62fb5ff7e"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"BqhZjamfFP2SrtfulQmwRo7afjy8uC2VmzJuOUJuBOiaKEcfYHCiWkPQWkIT4VERz+ReqDgi3MgEWwwcwGzfCg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-10T04:15:10.838381Z","bundle_sha256":"32548bfc2c76163d9240efa3f0113e9291398f919c8d7140210d1ddaff57b82e"}}