{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2007:D54MWF6PL2QAWSMVIQFTZPP6PR","short_pith_number":"pith:D54MWF6P","canonical_record":{"source":{"id":"0706.4138","kind":"arxiv","version":1},"metadata":{"license":"","primary_cat":"math.OC","submitted_at":"2007-06-28T04:54:42Z","cross_cats_sorted":["math.ST","stat.TH"],"title_canon_sha256":"9147ee5d4ed76981d87c35274ab54e07c7f457c7b1fbecc674dc7130f43f20cc","abstract_canon_sha256":"506cb935e074ddca310123f707826d2921d654b593aeee0c8deb868c0dfc4970"},"schema_version":"1.0"},"canonical_sha256":"1f78cb17cf5ea00b4995440b3cbdfe7c6158cf71d395f4a4188b6d2831fdceb8","source":{"kind":"arxiv","id":"0706.4138","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"0706.4138","created_at":"2026-05-18T04:42:34Z"},{"alias_kind":"arxiv_version","alias_value":"0706.4138v1","created_at":"2026-05-18T04:42:34Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.0706.4138","created_at":"2026-05-18T04:42:34Z"},{"alias_kind":"pith_short_12","alias_value":"D54MWF6PL2QA","created_at":"2026-05-18T12:25:55Z"},{"alias_kind":"pith_short_16","alias_value":"D54MWF6PL2QAWSMV","created_at":"2026-05-18T12:25:55Z"},{"alias_kind":"pith_short_8","alias_value":"D54MWF6P","created_at":"2026-05-18T12:25:55Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2007:D54MWF6PL2QAWSMVIQFTZPP6PR","target":"record","payload":{"canonical_record":{"source":{"id":"0706.4138","kind":"arxiv","version":1},"metadata":{"license":"","primary_cat":"math.OC","submitted_at":"2007-06-28T04:54:42Z","cross_cats_sorted":["math.ST","stat.TH"],"title_canon_sha256":"9147ee5d4ed76981d87c35274ab54e07c7f457c7b1fbecc674dc7130f43f20cc","abstract_canon_sha256":"506cb935e074ddca310123f707826d2921d654b593aeee0c8deb868c0dfc4970"},"schema_version":"1.0"},"canonical_sha256":"1f78cb17cf5ea00b4995440b3cbdfe7c6158cf71d395f4a4188b6d2831fdceb8","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:42:34.642983Z","signature_b64":"VGOLPF7UedEGXjv7gm3y3nApawxIcfQQ3ASESaEd9ocuxVyC9JYnWxfnNbpPWFfSMZHvGFDQA1tB1pd3/+JPAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"1f78cb17cf5ea00b4995440b3cbdfe7c6158cf71d395f4a4188b6d2831fdceb8","last_reissued_at":"2026-05-18T04:42:34.642556Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:42:34.642556Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"0706.4138","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-18T04:42:34Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"+VTU672HjPn+hW9O5Ix3OrYSz4KASLlzPuz6zjWqx2BRcuUy6ovplx2SZlkpbWnIWGBI9JuEByTsObmwjRSVCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T10:39:10.133427Z"},"content_sha256":"18bbce2bfb8abd8eb5f6b39375375fe867769444b1c709ea0ba9cc76c77284bc","schema_version":"1.0","event_id":"sha256:18bbce2bfb8abd8eb5f6b39375375fe867769444b1c709ea0ba9cc76c77284bc"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2007:D54MWF6PL2QAWSMVIQFTZPP6PR","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Guaranteed Minimum-Rank Solutions of Linear Matrix Equations via Nuclear Norm Minimization","license":"","headline":"","cross_cats":["math.ST","stat.TH"],"primary_cat":"math.OC","authors_text":"Benjamin Recht, Maryam Fazel, Pablo A. Parrilo","submitted_at":"2007-06-28T04:54:42Z","abstract_excerpt":"The affine rank minimization problem consists of finding a matrix of minimum rank that satisfies a given system of linear equality constraints. Such problems have appeared in the literature of a diverse set of fields including system identification and control, Euclidean embedding, and collaborative filtering. Although specific instances can often be solved with specialized algorithms, the general affine rank minimization problem is NP-hard. In this paper, we show that if a certain restricted isometry property holds for the linear transformation defining the constraints, the minimum rank solut"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"0706.4138","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-18T04:42:34Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"UGzPu3HVQI5W/GDgPxJ3y0sc+SMwsHwZp12prsyRxsQUUG9imqQPVEfH/nNB6/fHVVcF7jfOv1NToav80uumCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T10:39:10.133784Z"},"content_sha256":"26db1a01201833cfcaff2d6216a0a3b1f6ea3f697cf60326e35a91a3f227cd12","schema_version":"1.0","event_id":"sha256:26db1a01201833cfcaff2d6216a0a3b1f6ea3f697cf60326e35a91a3f227cd12"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/D54MWF6PL2QAWSMVIQFTZPP6PR/bundle.json","state_url":"https://pith.science/pith/D54MWF6PL2QAWSMVIQFTZPP6PR/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/D54MWF6PL2QAWSMVIQFTZPP6PR/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-30T10:39:10Z","links":{"resolver":"https://pith.science/pith/D54MWF6PL2QAWSMVIQFTZPP6PR","bundle":"https://pith.science/pith/D54MWF6PL2QAWSMVIQFTZPP6PR/bundle.json","state":"https://pith.science/pith/D54MWF6PL2QAWSMVIQFTZPP6PR/state.json","well_known_bundle":"https://pith.science/.well-known/pith/D54MWF6PL2QAWSMVIQFTZPP6PR/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2007:D54MWF6PL2QAWSMVIQFTZPP6PR","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":"506cb935e074ddca310123f707826d2921d654b593aeee0c8deb868c0dfc4970","cross_cats_sorted":["math.ST","stat.TH"],"license":"","primary_cat":"math.OC","submitted_at":"2007-06-28T04:54:42Z","title_canon_sha256":"9147ee5d4ed76981d87c35274ab54e07c7f457c7b1fbecc674dc7130f43f20cc"},"schema_version":"1.0","source":{"id":"0706.4138","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"0706.4138","created_at":"2026-05-18T04:42:34Z"},{"alias_kind":"arxiv_version","alias_value":"0706.4138v1","created_at":"2026-05-18T04:42:34Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.0706.4138","created_at":"2026-05-18T04:42:34Z"},{"alias_kind":"pith_short_12","alias_value":"D54MWF6PL2QA","created_at":"2026-05-18T12:25:55Z"},{"alias_kind":"pith_short_16","alias_value":"D54MWF6PL2QAWSMV","created_at":"2026-05-18T12:25:55Z"},{"alias_kind":"pith_short_8","alias_value":"D54MWF6P","created_at":"2026-05-18T12:25:55Z"}],"graph_snapshots":[{"event_id":"sha256:26db1a01201833cfcaff2d6216a0a3b1f6ea3f697cf60326e35a91a3f227cd12","target":"graph","created_at":"2026-05-18T04:42:34Z","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":"The affine rank minimization problem consists of finding a matrix of minimum rank that satisfies a given system of linear equality constraints. Such problems have appeared in the literature of a diverse set of fields including system identification and control, Euclidean embedding, and collaborative filtering. Although specific instances can often be solved with specialized algorithms, the general affine rank minimization problem is NP-hard. In this paper, we show that if a certain restricted isometry property holds for the linear transformation defining the constraints, the minimum rank solut","authors_text":"Benjamin Recht, Maryam Fazel, Pablo A. Parrilo","cross_cats":["math.ST","stat.TH"],"headline":"","license":"","primary_cat":"math.OC","submitted_at":"2007-06-28T04:54:42Z","title":"Guaranteed Minimum-Rank Solutions of Linear Matrix Equations via Nuclear Norm Minimization"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"0706.4138","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:18bbce2bfb8abd8eb5f6b39375375fe867769444b1c709ea0ba9cc76c77284bc","target":"record","created_at":"2026-05-18T04:42:34Z","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":"506cb935e074ddca310123f707826d2921d654b593aeee0c8deb868c0dfc4970","cross_cats_sorted":["math.ST","stat.TH"],"license":"","primary_cat":"math.OC","submitted_at":"2007-06-28T04:54:42Z","title_canon_sha256":"9147ee5d4ed76981d87c35274ab54e07c7f457c7b1fbecc674dc7130f43f20cc"},"schema_version":"1.0","source":{"id":"0706.4138","kind":"arxiv","version":1}},"canonical_sha256":"1f78cb17cf5ea00b4995440b3cbdfe7c6158cf71d395f4a4188b6d2831fdceb8","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"1f78cb17cf5ea00b4995440b3cbdfe7c6158cf71d395f4a4188b6d2831fdceb8","first_computed_at":"2026-05-18T04:42:34.642556Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T04:42:34.642556Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"VGOLPF7UedEGXjv7gm3y3nApawxIcfQQ3ASESaEd9ocuxVyC9JYnWxfnNbpPWFfSMZHvGFDQA1tB1pd3/+JPAw==","signature_status":"signed_v1","signed_at":"2026-05-18T04:42:34.642983Z","signed_message":"canonical_sha256_bytes"},"source_id":"0706.4138","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:18bbce2bfb8abd8eb5f6b39375375fe867769444b1c709ea0ba9cc76c77284bc","sha256:26db1a01201833cfcaff2d6216a0a3b1f6ea3f697cf60326e35a91a3f227cd12"],"state_sha256":"1bfd6549372fb9d4a133f60bd03d8b02d0573c5990e8f793340b7db244c343aa"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ofgTvnfE2RLcFy88+Z1e+94Z+ppbxArjZfOSzjDDINhSqLi4/ye02vHNOXoMJHnpqLq3eeTa2/k1+xWr44AgAA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-30T10:39:10.137327Z","bundle_sha256":"e0809db4faae8e69a884e210ef857294847cc2886aea8cc336488e363d8a9e72"}}