{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2023:RLEAZWBEEWAXFN32WPFBKHGKV2","short_pith_number":"pith:RLEAZWBE","schema_version":"1.0","canonical_sha256":"8ac80cd824258172b77ab3ca151ccaae85de5b7922afcead4241bb4252a29592","source":{"kind":"arxiv","id":"2303.05825","version":4},"attestation_state":"computed","paper":{"title":"A squared smoothing Newton method for semidefinite programming","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Defeng Sun, Kim-Chuan Toh, Ling Liang","submitted_at":"2023-03-10T10:01:00Z","abstract_excerpt":"This paper proposes a squared smoothing Newton method via the Huber smoothing function for solving semidefinite programming problems (SDPs). We first study the fundamental properties of the matrix-valued mapping defined upon the Huber function. Using these results and existing ones in the literature, we then conduct rigorous convergence analysis and establish convergence properties for the proposed algorithm. In particular, we show that the proposed method is well-defined and admits global convergence. Moreover, under suitable regularity conditions, i.e., the primal and dual constraint nondege"},"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":"2303.05825","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2023-03-10T10:01:00Z","cross_cats_sorted":[],"title_canon_sha256":"383b42f11b32c59b90732f0c4b792938679f4c4d8ac37f5dfcb213ac3ffb1a44","abstract_canon_sha256":"005b92af4192bfe8161ceadd3c0f9872fdc31c14792d8eecc09766869a161f91"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T09:17:10.055107Z","signature_b64":"GJIc+L9yZZklfK+1wz4PrOulaEQTXKMI70F42e4CDBvuhOlSpMnFjBDW3p9lWLUoqg+FD7LuX99vCjycf7CHDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"8ac80cd824258172b77ab3ca151ccaae85de5b7922afcead4241bb4252a29592","last_reissued_at":"2026-07-05T09:17:10.054610Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T09:17:10.054610Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A squared smoothing Newton method for semidefinite programming","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Defeng Sun, Kim-Chuan Toh, Ling Liang","submitted_at":"2023-03-10T10:01:00Z","abstract_excerpt":"This paper proposes a squared smoothing Newton method via the Huber smoothing function for solving semidefinite programming problems (SDPs). We first study the fundamental properties of the matrix-valued mapping defined upon the Huber function. Using these results and existing ones in the literature, we then conduct rigorous convergence analysis and establish convergence properties for the proposed algorithm. In particular, we show that the proposed method is well-defined and admits global convergence. Moreover, under suitable regularity conditions, i.e., the primal and dual constraint nondege"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2303.05825","kind":"arxiv","version":4},"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/2303.05825/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":"2303.05825","created_at":"2026-07-05T09:17:10.054671+00:00"},{"alias_kind":"arxiv_version","alias_value":"2303.05825v4","created_at":"2026-07-05T09:17:10.054671+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2303.05825","created_at":"2026-07-05T09:17:10.054671+00:00"},{"alias_kind":"pith_short_12","alias_value":"RLEAZWBEEWAX","created_at":"2026-07-05T09:17:10.054671+00:00"},{"alias_kind":"pith_short_16","alias_value":"RLEAZWBEEWAXFN32","created_at":"2026-07-05T09:17:10.054671+00:00"},{"alias_kind":"pith_short_8","alias_value":"RLEAZWBE","created_at":"2026-07-05T09:17:10.054671+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/RLEAZWBEEWAXFN32WPFBKHGKV2","json":"https://pith.science/pith/RLEAZWBEEWAXFN32WPFBKHGKV2.json","graph_json":"https://pith.science/api/pith-number/RLEAZWBEEWAXFN32WPFBKHGKV2/graph.json","events_json":"https://pith.science/api/pith-number/RLEAZWBEEWAXFN32WPFBKHGKV2/events.json","paper":"https://pith.science/paper/RLEAZWBE"},"agent_actions":{"view_html":"https://pith.science/pith/RLEAZWBEEWAXFN32WPFBKHGKV2","download_json":"https://pith.science/pith/RLEAZWBEEWAXFN32WPFBKHGKV2.json","view_paper":"https://pith.science/paper/RLEAZWBE","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2303.05825&json=true","fetch_graph":"https://pith.science/api/pith-number/RLEAZWBEEWAXFN32WPFBKHGKV2/graph.json","fetch_events":"https://pith.science/api/pith-number/RLEAZWBEEWAXFN32WPFBKHGKV2/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/RLEAZWBEEWAXFN32WPFBKHGKV2/action/timestamp_anchor","attest_storage":"https://pith.science/pith/RLEAZWBEEWAXFN32WPFBKHGKV2/action/storage_attestation","attest_author":"https://pith.science/pith/RLEAZWBEEWAXFN32WPFBKHGKV2/action/author_attestation","sign_citation":"https://pith.science/pith/RLEAZWBEEWAXFN32WPFBKHGKV2/action/citation_signature","submit_replication":"https://pith.science/pith/RLEAZWBEEWAXFN32WPFBKHGKV2/action/replication_record"}},"created_at":"2026-07-05T09:17:10.054671+00:00","updated_at":"2026-07-05T09:17:10.054671+00:00"}