{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:SF6JJSQWE3ETCJE5XMXRBHKZZH","short_pith_number":"pith:SF6JJSQW","canonical_record":{"source":{"id":"1701.03218","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2017-01-12T03:03:54Z","cross_cats_sorted":[],"title_canon_sha256":"003eefa06ca1bf2d019a6d5c87c0becb957b82d85d17368d3e963baa5d323fa9","abstract_canon_sha256":"526b3792b9a5ae9ce92866fd321f07669a11a090cb7d6cb0475e244e1af6a07f"},"schema_version":"1.0"},"canonical_sha256":"917c94ca1626c931249dbb2f109d59c9cf59209e6b29665b346b98787c012993","source":{"kind":"arxiv","id":"1701.03218","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1701.03218","created_at":"2026-05-18T00:24:36Z"},{"alias_kind":"arxiv_version","alias_value":"1701.03218v2","created_at":"2026-05-18T00:24:36Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1701.03218","created_at":"2026-05-18T00:24:36Z"},{"alias_kind":"pith_short_12","alias_value":"SF6JJSQWE3ET","created_at":"2026-05-18T12:31:43Z"},{"alias_kind":"pith_short_16","alias_value":"SF6JJSQWE3ETCJE5","created_at":"2026-05-18T12:31:43Z"},{"alias_kind":"pith_short_8","alias_value":"SF6JJSQW","created_at":"2026-05-18T12:31:43Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:SF6JJSQWE3ETCJE5XMXRBHKZZH","target":"record","payload":{"canonical_record":{"source":{"id":"1701.03218","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2017-01-12T03:03:54Z","cross_cats_sorted":[],"title_canon_sha256":"003eefa06ca1bf2d019a6d5c87c0becb957b82d85d17368d3e963baa5d323fa9","abstract_canon_sha256":"526b3792b9a5ae9ce92866fd321f07669a11a090cb7d6cb0475e244e1af6a07f"},"schema_version":"1.0"},"canonical_sha256":"917c94ca1626c931249dbb2f109d59c9cf59209e6b29665b346b98787c012993","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:24:36.110866Z","signature_b64":"Ms+4PJ+WMDzEdMW1lOSP3JsF/FVK5T70PfBRe65iWY4Ali3ttFTNEOOwv7U4nyeCfoixbBdyuKJJs8XsjdZ9Ag==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"917c94ca1626c931249dbb2f109d59c9cf59209e6b29665b346b98787c012993","last_reissued_at":"2026-05-18T00:24:36.110387Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:24:36.110387Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1701.03218","source_version":2,"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:24:36Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"TXNJdTSXJ7GcjVEWeUIxzvqdElQAKZJQi6G2eiQR3aGyOCm8JtPzujqQU1BGMD9zXnTEcy8JU0Y/tc/KO8NyBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-11T12:15:21.350717Z"},"content_sha256":"38c749302ba691d9621df399da654c88d8f986be8630e72445793fbcbd92e465","schema_version":"1.0","event_id":"sha256:38c749302ba691d9621df399da654c88d8f986be8630e72445793fbcbd92e465"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:SF6JJSQWE3ETCJE5XMXRBHKZZH","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"A Penalty Method for Rank Minimization Problems in Symmetric Matrices","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"John E. Mitchell, Xin Shen","submitted_at":"2017-01-12T03:03:54Z","abstract_excerpt":"The problem of minimizing the rank of a symmetric positive semidefinite matrix subject to constraints can be cast equivalently as a semidefinite program with complementarity constraints (SDCMPCC). The formulation requires two positive semidefinite matrices to be complementary. This is a continuous and nonconvex reformulation of the rank minimization problem. We investigate calmness of locally optimal solutions to the SDCMPCC formulation and hence show that any locally optimal solution is a KKT point.\n  We develop a penalty formulation of the problem. We present calmness results for locally opt"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1701.03218","kind":"arxiv","version":2},"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:24:36Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"5nYq19PQY9NtZRII2kwW24F6XxVV589l1cFyVqdP7Wrg4coN3MaLvArYEmHf06bQpA06tKnjzI1s7E3M0Gt1AQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-11T12:15:21.351072Z"},"content_sha256":"f0ce2cadceea0c8e1e63419e1459f834c3caac5ddf80fa862d182bcf7029aeff","schema_version":"1.0","event_id":"sha256:f0ce2cadceea0c8e1e63419e1459f834c3caac5ddf80fa862d182bcf7029aeff"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/SF6JJSQWE3ETCJE5XMXRBHKZZH/bundle.json","state_url":"https://pith.science/pith/SF6JJSQWE3ETCJE5XMXRBHKZZH/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/SF6JJSQWE3ETCJE5XMXRBHKZZH/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-06-11T12:15:21Z","links":{"resolver":"https://pith.science/pith/SF6JJSQWE3ETCJE5XMXRBHKZZH","bundle":"https://pith.science/pith/SF6JJSQWE3ETCJE5XMXRBHKZZH/bundle.json","state":"https://pith.science/pith/SF6JJSQWE3ETCJE5XMXRBHKZZH/state.json","well_known_bundle":"https://pith.science/.well-known/pith/SF6JJSQWE3ETCJE5XMXRBHKZZH/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:SF6JJSQWE3ETCJE5XMXRBHKZZH","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":"526b3792b9a5ae9ce92866fd321f07669a11a090cb7d6cb0475e244e1af6a07f","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2017-01-12T03:03:54Z","title_canon_sha256":"003eefa06ca1bf2d019a6d5c87c0becb957b82d85d17368d3e963baa5d323fa9"},"schema_version":"1.0","source":{"id":"1701.03218","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1701.03218","created_at":"2026-05-18T00:24:36Z"},{"alias_kind":"arxiv_version","alias_value":"1701.03218v2","created_at":"2026-05-18T00:24:36Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1701.03218","created_at":"2026-05-18T00:24:36Z"},{"alias_kind":"pith_short_12","alias_value":"SF6JJSQWE3ET","created_at":"2026-05-18T12:31:43Z"},{"alias_kind":"pith_short_16","alias_value":"SF6JJSQWE3ETCJE5","created_at":"2026-05-18T12:31:43Z"},{"alias_kind":"pith_short_8","alias_value":"SF6JJSQW","created_at":"2026-05-18T12:31:43Z"}],"graph_snapshots":[{"event_id":"sha256:f0ce2cadceea0c8e1e63419e1459f834c3caac5ddf80fa862d182bcf7029aeff","target":"graph","created_at":"2026-05-18T00:24:36Z","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 problem of minimizing the rank of a symmetric positive semidefinite matrix subject to constraints can be cast equivalently as a semidefinite program with complementarity constraints (SDCMPCC). The formulation requires two positive semidefinite matrices to be complementary. This is a continuous and nonconvex reformulation of the rank minimization problem. We investigate calmness of locally optimal solutions to the SDCMPCC formulation and hence show that any locally optimal solution is a KKT point.\n  We develop a penalty formulation of the problem. We present calmness results for locally opt","authors_text":"John E. Mitchell, Xin Shen","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2017-01-12T03:03:54Z","title":"A Penalty Method for Rank Minimization Problems in Symmetric Matrices"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1701.03218","kind":"arxiv","version":2},"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:38c749302ba691d9621df399da654c88d8f986be8630e72445793fbcbd92e465","target":"record","created_at":"2026-05-18T00:24:36Z","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":"526b3792b9a5ae9ce92866fd321f07669a11a090cb7d6cb0475e244e1af6a07f","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2017-01-12T03:03:54Z","title_canon_sha256":"003eefa06ca1bf2d019a6d5c87c0becb957b82d85d17368d3e963baa5d323fa9"},"schema_version":"1.0","source":{"id":"1701.03218","kind":"arxiv","version":2}},"canonical_sha256":"917c94ca1626c931249dbb2f109d59c9cf59209e6b29665b346b98787c012993","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"917c94ca1626c931249dbb2f109d59c9cf59209e6b29665b346b98787c012993","first_computed_at":"2026-05-18T00:24:36.110387Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:24:36.110387Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"Ms+4PJ+WMDzEdMW1lOSP3JsF/FVK5T70PfBRe65iWY4Ali3ttFTNEOOwv7U4nyeCfoixbBdyuKJJs8XsjdZ9Ag==","signature_status":"signed_v1","signed_at":"2026-05-18T00:24:36.110866Z","signed_message":"canonical_sha256_bytes"},"source_id":"1701.03218","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:38c749302ba691d9621df399da654c88d8f986be8630e72445793fbcbd92e465","sha256:f0ce2cadceea0c8e1e63419e1459f834c3caac5ddf80fa862d182bcf7029aeff"],"state_sha256":"46ac5c169f35cdff41b24e833f0b831b561ddadefac3d1309d5576f96b3fa0cf"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"86KrnNDTmbRuE+nmhVIf6Lj1IHtJa9UEjNpdcUE8XsdYREOXmhWlAMzr+bC60SEkJX/eyNAsGB8dVt+K55ncAQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-11T12:15:21.353044Z","bundle_sha256":"d2affb6768f5573d082b497019c61c013a950f76a1de7082460fa94bce96dc89"}}