{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2012:MOXXQC2W6VELBJFS6V7CBHVHDR","short_pith_number":"pith:MOXXQC2W","canonical_record":{"source":{"id":"1207.2440","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2012-07-10T18:41:04Z","cross_cats_sorted":["cs.CV","cs.IT","math.IT"],"title_canon_sha256":"c7f43816e3e967fecba12cc1e032a057ba76ab8633763668947339667db96c80","abstract_canon_sha256":"0ae0d6acd7e8faf8891b003a68432ba15a3742c3537792bd480f1240316860c6"},"schema_version":"1.0"},"canonical_sha256":"63af780b56f548b0a4b2f57e209ea71c7c037fd68db5106291535a93307df868","source":{"kind":"arxiv","id":"1207.2440","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1207.2440","created_at":"2026-05-18T03:51:24Z"},{"alias_kind":"arxiv_version","alias_value":"1207.2440v1","created_at":"2026-05-18T03:51:24Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1207.2440","created_at":"2026-05-18T03:51:24Z"},{"alias_kind":"pith_short_12","alias_value":"MOXXQC2W6VEL","created_at":"2026-05-18T12:27:14Z"},{"alias_kind":"pith_short_16","alias_value":"MOXXQC2W6VELBJFS","created_at":"2026-05-18T12:27:14Z"},{"alias_kind":"pith_short_8","alias_value":"MOXXQC2W","created_at":"2026-05-18T12:27:14Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2012:MOXXQC2W6VELBJFS6V7CBHVHDR","target":"record","payload":{"canonical_record":{"source":{"id":"1207.2440","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2012-07-10T18:41:04Z","cross_cats_sorted":["cs.CV","cs.IT","math.IT"],"title_canon_sha256":"c7f43816e3e967fecba12cc1e032a057ba76ab8633763668947339667db96c80","abstract_canon_sha256":"0ae0d6acd7e8faf8891b003a68432ba15a3742c3537792bd480f1240316860c6"},"schema_version":"1.0"},"canonical_sha256":"63af780b56f548b0a4b2f57e209ea71c7c037fd68db5106291535a93307df868","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:51:24.133087Z","signature_b64":"+1v7R6lspWZAUu2+nFEmi61ZewGf7DHqHSHhqkB2YjtXlB8ODe5KSDHX3t+Nh5fXlhENZb1ZJF/tQe7FHsgdAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"63af780b56f548b0a4b2f57e209ea71c7c037fd68db5106291535a93307df868","last_reissued_at":"2026-05-18T03:51:24.132434Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:51:24.132434Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1207.2440","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-18T03:51:24Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"eHfHLW4Q5P+SiUmznueVN4fWXc2LwGCqM/Kiaxvd6SJfP+7xr1dvixDXXCZM10mTigiW98XRrRL3HHcpvzdcCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T18:37:23.434478Z"},"content_sha256":"5e33dd5ec8dbeffa8f8d27f86d6c4f385148533db204f0b30217dcbfd1de957c","schema_version":"1.0","event_id":"sha256:5e33dd5ec8dbeffa8f8d27f86d6c4f385148533db204f0b30217dcbfd1de957c"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2012:MOXXQC2W6VELBJFS6V7CBHVHDR","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Non-Convex Rank Minimization via an Empirical Bayesian Approach","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CV","cs.IT","math.IT"],"primary_cat":"stat.ML","authors_text":"David Wipf","submitted_at":"2012-07-10T18:41:04Z","abstract_excerpt":"In many applications that require matrix solutions of minimal rank, the underlying cost function is non-convex leading to an intractable, NP-hard optimization problem. Consequently, the convex nuclear norm is frequently used as a surrogate penalty term for matrix rank. The problem is that in many practical scenarios there is no longer any guarantee that we can correctly estimate generative low-rank matrices of interest, theoretical special cases notwithstanding. Consequently, this paper proposes an alternative empirical Bayesian procedure build upon a variational approximation that, unlike the"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1207.2440","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-18T03:51:24Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"MsVVxKkXYEiPq6JnAEYjBwn8haMJaXhw7/nl5XTeqfwYSMhzHXzuZsFZDfBR2jHo2P4BzjZ5jj8uXMccTNf/DQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T18:37:23.435124Z"},"content_sha256":"df33b64012cebeb2f0f88d111918f5434aee3b917ef980cc23cf44afa73684a9","schema_version":"1.0","event_id":"sha256:df33b64012cebeb2f0f88d111918f5434aee3b917ef980cc23cf44afa73684a9"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/MOXXQC2W6VELBJFS6V7CBHVHDR/bundle.json","state_url":"https://pith.science/pith/MOXXQC2W6VELBJFS6V7CBHVHDR/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/MOXXQC2W6VELBJFS6V7CBHVHDR/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-26T18:37:23Z","links":{"resolver":"https://pith.science/pith/MOXXQC2W6VELBJFS6V7CBHVHDR","bundle":"https://pith.science/pith/MOXXQC2W6VELBJFS6V7CBHVHDR/bundle.json","state":"https://pith.science/pith/MOXXQC2W6VELBJFS6V7CBHVHDR/state.json","well_known_bundle":"https://pith.science/.well-known/pith/MOXXQC2W6VELBJFS6V7CBHVHDR/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2012:MOXXQC2W6VELBJFS6V7CBHVHDR","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":"0ae0d6acd7e8faf8891b003a68432ba15a3742c3537792bd480f1240316860c6","cross_cats_sorted":["cs.CV","cs.IT","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2012-07-10T18:41:04Z","title_canon_sha256":"c7f43816e3e967fecba12cc1e032a057ba76ab8633763668947339667db96c80"},"schema_version":"1.0","source":{"id":"1207.2440","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1207.2440","created_at":"2026-05-18T03:51:24Z"},{"alias_kind":"arxiv_version","alias_value":"1207.2440v1","created_at":"2026-05-18T03:51:24Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1207.2440","created_at":"2026-05-18T03:51:24Z"},{"alias_kind":"pith_short_12","alias_value":"MOXXQC2W6VEL","created_at":"2026-05-18T12:27:14Z"},{"alias_kind":"pith_short_16","alias_value":"MOXXQC2W6VELBJFS","created_at":"2026-05-18T12:27:14Z"},{"alias_kind":"pith_short_8","alias_value":"MOXXQC2W","created_at":"2026-05-18T12:27:14Z"}],"graph_snapshots":[{"event_id":"sha256:df33b64012cebeb2f0f88d111918f5434aee3b917ef980cc23cf44afa73684a9","target":"graph","created_at":"2026-05-18T03:51:24Z","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 many applications that require matrix solutions of minimal rank, the underlying cost function is non-convex leading to an intractable, NP-hard optimization problem. Consequently, the convex nuclear norm is frequently used as a surrogate penalty term for matrix rank. The problem is that in many practical scenarios there is no longer any guarantee that we can correctly estimate generative low-rank matrices of interest, theoretical special cases notwithstanding. Consequently, this paper proposes an alternative empirical Bayesian procedure build upon a variational approximation that, unlike the","authors_text":"David Wipf","cross_cats":["cs.CV","cs.IT","math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2012-07-10T18:41:04Z","title":"Non-Convex Rank Minimization via an Empirical Bayesian Approach"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1207.2440","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:5e33dd5ec8dbeffa8f8d27f86d6c4f385148533db204f0b30217dcbfd1de957c","target":"record","created_at":"2026-05-18T03:51:24Z","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":"0ae0d6acd7e8faf8891b003a68432ba15a3742c3537792bd480f1240316860c6","cross_cats_sorted":["cs.CV","cs.IT","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2012-07-10T18:41:04Z","title_canon_sha256":"c7f43816e3e967fecba12cc1e032a057ba76ab8633763668947339667db96c80"},"schema_version":"1.0","source":{"id":"1207.2440","kind":"arxiv","version":1}},"canonical_sha256":"63af780b56f548b0a4b2f57e209ea71c7c037fd68db5106291535a93307df868","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"63af780b56f548b0a4b2f57e209ea71c7c037fd68db5106291535a93307df868","first_computed_at":"2026-05-18T03:51:24.132434Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:51:24.132434Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"+1v7R6lspWZAUu2+nFEmi61ZewGf7DHqHSHhqkB2YjtXlB8ODe5KSDHX3t+Nh5fXlhENZb1ZJF/tQe7FHsgdAA==","signature_status":"signed_v1","signed_at":"2026-05-18T03:51:24.133087Z","signed_message":"canonical_sha256_bytes"},"source_id":"1207.2440","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:5e33dd5ec8dbeffa8f8d27f86d6c4f385148533db204f0b30217dcbfd1de957c","sha256:df33b64012cebeb2f0f88d111918f5434aee3b917ef980cc23cf44afa73684a9"],"state_sha256":"9a14b30d328dc43161457c5d4a96ec8ea834715534ef0a2365087202a2f857e0"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"LU5Avco2qgH3g9mvy/El4lCj/Ph9+AqhBsLk84uWGdTjcpnX/1Amr/VboXMKpE4XRZbi5uohN9F0sIS+PkR+Aw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-26T18:37:23.438504Z","bundle_sha256":"742b8e1ef1753650cbcfcb408ee1cde6b255819e91c62a5b2ff44bdf99bd5652"}}