{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2023:VVAGBWCMUJNCBUARZXOXERIE7X","short_pith_number":"pith:VVAGBWCM","canonical_record":{"source":{"id":"2312.07908","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.OC","submitted_at":"2023-12-13T05:37:15Z","cross_cats_sorted":[],"title_canon_sha256":"81dbafc504938f29abb8da0fde8e2cb3ced59ccc369c5c4c94dd97e2925a30b7","abstract_canon_sha256":"aa9bc0f1bcd0b020936b2d1c6673e841e17d4af431da00400b10614cee190670"},"schema_version":"1.0"},"canonical_sha256":"ad4060d84ca25a20d011cddd724504fdeddfabb8793a3e419009f0c7e9506194","source":{"kind":"arxiv","id":"2312.07908","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2312.07908","created_at":"2026-07-05T07:23:38Z"},{"alias_kind":"arxiv_version","alias_value":"2312.07908v1","created_at":"2026-07-05T07:23:38Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2312.07908","created_at":"2026-07-05T07:23:38Z"},{"alias_kind":"pith_short_12","alias_value":"VVAGBWCMUJNC","created_at":"2026-07-05T07:23:38Z"},{"alias_kind":"pith_short_16","alias_value":"VVAGBWCMUJNCBUAR","created_at":"2026-07-05T07:23:38Z"},{"alias_kind":"pith_short_8","alias_value":"VVAGBWCM","created_at":"2026-07-05T07:23:38Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2023:VVAGBWCMUJNCBUARZXOXERIE7X","target":"record","payload":{"canonical_record":{"source":{"id":"2312.07908","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.OC","submitted_at":"2023-12-13T05:37:15Z","cross_cats_sorted":[],"title_canon_sha256":"81dbafc504938f29abb8da0fde8e2cb3ced59ccc369c5c4c94dd97e2925a30b7","abstract_canon_sha256":"aa9bc0f1bcd0b020936b2d1c6673e841e17d4af431da00400b10614cee190670"},"schema_version":"1.0"},"canonical_sha256":"ad4060d84ca25a20d011cddd724504fdeddfabb8793a3e419009f0c7e9506194","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T07:23:38.971078Z","signature_b64":"95w3LaCqlH3ffiFwMnZ62t5ebRyFR8r1D9ozWZw+LSckgj8mPUmuxKvPH3mPw67Fd+eoNc0h40ZmWtR1h8FuCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"ad4060d84ca25a20d011cddd724504fdeddfabb8793a3e419009f0c7e9506194","last_reissued_at":"2026-07-05T07:23:38.970584Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T07:23:38.970584Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2312.07908","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-05T07:23:38Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"838WLEy6ZlvSU7bJ6ih77t1lYYTZs+HJ0RqinbwvXeJFygFYTQYTKLMO37jFtE5WjHaCbutdCksO3HsvK0TLBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-14T07:14:21.545273Z"},"content_sha256":"9a06fc88f98a4d071793f0547b1ae9754171e30995b1294e27d8fd0300066175","schema_version":"1.0","event_id":"sha256:9a06fc88f98a4d071793f0547b1ae9754171e30995b1294e27d8fd0300066175"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2023:VVAGBWCMUJNCBUARZXOXERIE7X","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"A feasible method for general convex low-rank SDP problems","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Kim-Chuan Toh, Tianyun Tang","submitted_at":"2023-12-13T05:37:15Z","abstract_excerpt":"In this work, we consider the low rank decomposition (SDPR) of general convex semidefinite programming problems (SDP) that contain both a positive semidefinite matrix and a nonnegative vector as variables. We develop a rank-support-adaptive feasible method to solve (SDPR) based on Riemannian optimization. The method is able to escape from a saddle point to ensure its convergence to a global optimal solution for generic constraint vectors. We prove its global convergence and local linear convergence without assuming that the objective function is twice differentiable. Due to the special structu"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2312.07908","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/2312.07908/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-05T07:23:38Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"/Osb+Bg5Ll5gefEe8dNM1KIlIUeEiOI/6WaBJk7dXFrxibY82ooKJjnv1Vl/4cYnezuMyYDUxm01ucta/E0fDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-14T07:14:21.546137Z"},"content_sha256":"6c179f82e5d8cd6745fb265087a91f7c7656ba00125eee38b45a591b33cf1a25","schema_version":"1.0","event_id":"sha256:6c179f82e5d8cd6745fb265087a91f7c7656ba00125eee38b45a591b33cf1a25"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/VVAGBWCMUJNCBUARZXOXERIE7X/bundle.json","state_url":"https://pith.science/pith/VVAGBWCMUJNCBUARZXOXERIE7X/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/VVAGBWCMUJNCBUARZXOXERIE7X/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-14T07:14:21Z","links":{"resolver":"https://pith.science/pith/VVAGBWCMUJNCBUARZXOXERIE7X","bundle":"https://pith.science/pith/VVAGBWCMUJNCBUARZXOXERIE7X/bundle.json","state":"https://pith.science/pith/VVAGBWCMUJNCBUARZXOXERIE7X/state.json","well_known_bundle":"https://pith.science/.well-known/pith/VVAGBWCMUJNCBUARZXOXERIE7X/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2023:VVAGBWCMUJNCBUARZXOXERIE7X","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":"aa9bc0f1bcd0b020936b2d1c6673e841e17d4af431da00400b10614cee190670","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.OC","submitted_at":"2023-12-13T05:37:15Z","title_canon_sha256":"81dbafc504938f29abb8da0fde8e2cb3ced59ccc369c5c4c94dd97e2925a30b7"},"schema_version":"1.0","source":{"id":"2312.07908","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2312.07908","created_at":"2026-07-05T07:23:38Z"},{"alias_kind":"arxiv_version","alias_value":"2312.07908v1","created_at":"2026-07-05T07:23:38Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2312.07908","created_at":"2026-07-05T07:23:38Z"},{"alias_kind":"pith_short_12","alias_value":"VVAGBWCMUJNC","created_at":"2026-07-05T07:23:38Z"},{"alias_kind":"pith_short_16","alias_value":"VVAGBWCMUJNCBUAR","created_at":"2026-07-05T07:23:38Z"},{"alias_kind":"pith_short_8","alias_value":"VVAGBWCM","created_at":"2026-07-05T07:23:38Z"}],"graph_snapshots":[{"event_id":"sha256:6c179f82e5d8cd6745fb265087a91f7c7656ba00125eee38b45a591b33cf1a25","target":"graph","created_at":"2026-07-05T07:23:38Z","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/2312.07908/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"In this work, we consider the low rank decomposition (SDPR) of general convex semidefinite programming problems (SDP) that contain both a positive semidefinite matrix and a nonnegative vector as variables. We develop a rank-support-adaptive feasible method to solve (SDPR) based on Riemannian optimization. The method is able to escape from a saddle point to ensure its convergence to a global optimal solution for generic constraint vectors. We prove its global convergence and local linear convergence without assuming that the objective function is twice differentiable. Due to the special structu","authors_text":"Kim-Chuan Toh, Tianyun Tang","cross_cats":[],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.OC","submitted_at":"2023-12-13T05:37:15Z","title":"A feasible method for general convex low-rank SDP problems"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2312.07908","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:9a06fc88f98a4d071793f0547b1ae9754171e30995b1294e27d8fd0300066175","target":"record","created_at":"2026-07-05T07:23:38Z","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":"aa9bc0f1bcd0b020936b2d1c6673e841e17d4af431da00400b10614cee190670","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.OC","submitted_at":"2023-12-13T05:37:15Z","title_canon_sha256":"81dbafc504938f29abb8da0fde8e2cb3ced59ccc369c5c4c94dd97e2925a30b7"},"schema_version":"1.0","source":{"id":"2312.07908","kind":"arxiv","version":1}},"canonical_sha256":"ad4060d84ca25a20d011cddd724504fdeddfabb8793a3e419009f0c7e9506194","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"ad4060d84ca25a20d011cddd724504fdeddfabb8793a3e419009f0c7e9506194","first_computed_at":"2026-07-05T07:23:38.970584Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T07:23:38.970584Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"95w3LaCqlH3ffiFwMnZ62t5ebRyFR8r1D9ozWZw+LSckgj8mPUmuxKvPH3mPw67Fd+eoNc0h40ZmWtR1h8FuCw==","signature_status":"signed_v1","signed_at":"2026-07-05T07:23:38.971078Z","signed_message":"canonical_sha256_bytes"},"source_id":"2312.07908","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:9a06fc88f98a4d071793f0547b1ae9754171e30995b1294e27d8fd0300066175","sha256:6c179f82e5d8cd6745fb265087a91f7c7656ba00125eee38b45a591b33cf1a25"],"state_sha256":"5cd0e0a1f146daa4d1d4516ff3115f8651b3119263273cf03329794b44e37f4f"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"35NLFN3T8PmvU/mNoGMGLDuSax2MP7yScsRMjU+c9XOe05P2WLJdtag+airHMgnX3+0Fh6eVASQv6WxGKK5vBg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-14T07:14:21.551814Z","bundle_sha256":"d15503703cff4c32e93414560f7e6a6df5fbcd38f99e6f2ec2feedd7ac51dbfd"}}