{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2021:2QTSXS7E2WKNIFDRKM7OSTJYGT","short_pith_number":"pith:2QTSXS7E","schema_version":"1.0","canonical_sha256":"d4272bcbe4d594d41471533ee94d3834fc209489a5db79e2c7975351f8b471d6","source":{"kind":"arxiv","id":"2105.12389","version":1},"attestation_state":"computed","paper":{"title":"An inexact proximal DC algorithm with sieving strategy for rank constrained least squares semidefinite programming","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Bo Yu, Mingcai Ding, Xiaoliang Song","submitted_at":"2021-05-26T08:23:04Z","abstract_excerpt":"In this paper, the optimization problem of the supervised distance preserving projection (SDPP) for data dimension reduction (DR) is considered, which is equivalent to a rank constrained least squares semidefinite programming (RCLSSDP). In order to overcome the difficulties caused by rank constraint, the difference-of-convex (DC) regularization strategy was employed, then the RCLSSDP is transferred into a series of least squares semidefinite programming with DC regularization (DCLSSDP). An inexact proximal DC algorithm with sieving strategy (s-iPDCA) is proposed for solving the DCLSSDP, whose "},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"canonical_record":{"source":{"id":"2105.12389","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.OC","submitted_at":"2021-05-26T08:23:04Z","cross_cats_sorted":[],"title_canon_sha256":"af129fcf4279e67741279ce9ba1afd2da8ea26904f477db1be3e71efb9f910d5","abstract_canon_sha256":"33215a85a54d0868f47249ba9581cef47b34ebe999f8f279b3756d70194075f0"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T02:43:38.337604Z","signature_b64":"vFZHv6OQXhEMbcGMeI6S4B3mvS2MEj7J718nmWdMl32gfPgq/ZItXrOBWy1S8ktd4grsvDqeGMy5hg0apTqnCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"d4272bcbe4d594d41471533ee94d3834fc209489a5db79e2c7975351f8b471d6","last_reissued_at":"2026-07-05T02:43:38.337144Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T02:43:38.337144Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"An inexact proximal DC algorithm with sieving strategy for rank constrained least squares semidefinite programming","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Bo Yu, Mingcai Ding, Xiaoliang Song","submitted_at":"2021-05-26T08:23:04Z","abstract_excerpt":"In this paper, the optimization problem of the supervised distance preserving projection (SDPP) for data dimension reduction (DR) is considered, which is equivalent to a rank constrained least squares semidefinite programming (RCLSSDP). In order to overcome the difficulties caused by rank constraint, the difference-of-convex (DC) regularization strategy was employed, then the RCLSSDP is transferred into a series of least squares semidefinite programming with DC regularization (DCLSSDP). An inexact proximal DC algorithm with sieving strategy (s-iPDCA) is proposed for solving the DCLSSDP, whose "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2105.12389","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/2105.12389/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"},"aliases":[{"alias_kind":"arxiv","alias_value":"2105.12389","created_at":"2026-07-05T02:43:38.337209+00:00"},{"alias_kind":"arxiv_version","alias_value":"2105.12389v1","created_at":"2026-07-05T02:43:38.337209+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2105.12389","created_at":"2026-07-05T02:43:38.337209+00:00"},{"alias_kind":"pith_short_12","alias_value":"2QTSXS7E2WKN","created_at":"2026-07-05T02:43:38.337209+00:00"},{"alias_kind":"pith_short_16","alias_value":"2QTSXS7E2WKNIFDR","created_at":"2026-07-05T02:43:38.337209+00:00"},{"alias_kind":"pith_short_8","alias_value":"2QTSXS7E","created_at":"2026-07-05T02:43:38.337209+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/2QTSXS7E2WKNIFDRKM7OSTJYGT","json":"https://pith.science/pith/2QTSXS7E2WKNIFDRKM7OSTJYGT.json","graph_json":"https://pith.science/api/pith-number/2QTSXS7E2WKNIFDRKM7OSTJYGT/graph.json","events_json":"https://pith.science/api/pith-number/2QTSXS7E2WKNIFDRKM7OSTJYGT/events.json","paper":"https://pith.science/paper/2QTSXS7E"},"agent_actions":{"view_html":"https://pith.science/pith/2QTSXS7E2WKNIFDRKM7OSTJYGT","download_json":"https://pith.science/pith/2QTSXS7E2WKNIFDRKM7OSTJYGT.json","view_paper":"https://pith.science/paper/2QTSXS7E","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2105.12389&json=true","fetch_graph":"https://pith.science/api/pith-number/2QTSXS7E2WKNIFDRKM7OSTJYGT/graph.json","fetch_events":"https://pith.science/api/pith-number/2QTSXS7E2WKNIFDRKM7OSTJYGT/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/2QTSXS7E2WKNIFDRKM7OSTJYGT/action/timestamp_anchor","attest_storage":"https://pith.science/pith/2QTSXS7E2WKNIFDRKM7OSTJYGT/action/storage_attestation","attest_author":"https://pith.science/pith/2QTSXS7E2WKNIFDRKM7OSTJYGT/action/author_attestation","sign_citation":"https://pith.science/pith/2QTSXS7E2WKNIFDRKM7OSTJYGT/action/citation_signature","submit_replication":"https://pith.science/pith/2QTSXS7E2WKNIFDRKM7OSTJYGT/action/replication_record"}},"created_at":"2026-07-05T02:43:38.337209+00:00","updated_at":"2026-07-05T02:43:38.337209+00:00"}