{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2026:GKEAZPBINH7T4UUPK6UIQXFMQX","short_pith_number":"pith:GKEAZPBI","schema_version":"1.0","canonical_sha256":"32880cbc2869ff3e528f57a8885cac85ebcb2eb648a652492e0704e9216efd5d","source":{"kind":"arxiv","id":"2604.04376","version":2},"attestation_state":"computed","paper":{"title":"Polynomial iteration complexity of a path-following smoothing Newton method for symmetric cone programming","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"A path-following smoothing Newton method achieves polynomial iteration complexity O(sqrt(ν) ln(1/ε)) for symmetric cone programming.","cross_cats":[],"primary_cat":"math.OC","authors_text":"Rui-Jin Zhang, Ruoyu Diao, Xin-Wei Liu, Yu-Hong Dai","submitted_at":"2026-04-06T02:53:16Z","abstract_excerpt":"It has long remained open whether smoothing Newton methods (SNMs) for symmetric cone programming (SCP) admit polynomial iteration complexity. A key difficulty lies in the lack of an analogue of the self-concordant convex framework underlying interior-point methods (IPMs). In this paper, inspired by Nemirovski's self-concordant convex-concave theory, we address this open problem by introducing a reduced barrier augmented Lagrangian (BAL) function. We prove that the reduced BAL function is self-concordant convex-concave and establish that the parameterized smooth system arising in SNMs coincides"},"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":true},"canonical_record":{"source":{"id":"2604.04376","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2026-04-06T02:53:16Z","cross_cats_sorted":[],"title_canon_sha256":"130a9e5dcdef542bf1e413a10db3edaa36b10bd8b175b7c9caedbfad00c84749","abstract_canon_sha256":"e57297513aad4cdae67ab4b99c7237aae80dd5d54eb950a4a58efdea9d5715e4"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-22T01:04:01.561305Z","signature_b64":"va9LYtqcRntn5jUsY2XzwfIaH7c/WkNXvJai9h6IQD4UQAUr5w43lMOsUkjqikLBP3O1y9f8DHxPycgkCgfHCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"32880cbc2869ff3e528f57a8885cac85ebcb2eb648a652492e0704e9216efd5d","last_reissued_at":"2026-05-22T01:04:01.560425Z","signature_status":"signed_v1","first_computed_at":"2026-05-22T01:04:01.560425Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Polynomial iteration complexity of a path-following smoothing Newton method for symmetric cone programming","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"A path-following smoothing Newton method achieves polynomial iteration complexity O(sqrt(ν) ln(1/ε)) for symmetric cone programming.","cross_cats":[],"primary_cat":"math.OC","authors_text":"Rui-Jin Zhang, Ruoyu Diao, Xin-Wei Liu, Yu-Hong Dai","submitted_at":"2026-04-06T02:53:16Z","abstract_excerpt":"It has long remained open whether smoothing Newton methods (SNMs) for symmetric cone programming (SCP) admit polynomial iteration complexity. A key difficulty lies in the lack of an analogue of the self-concordant convex framework underlying interior-point methods (IPMs). In this paper, inspired by Nemirovski's self-concordant convex-concave theory, we address this open problem by introducing a reduced barrier augmented Lagrangian (BAL) function. We prove that the reduced BAL function is self-concordant convex-concave and establish that the parameterized smooth system arising in SNMs coincides"},"claims":{"count":4,"items":[{"kind":"strongest_claim","text":"the method is proven to achieve an iteration complexity of O( sqrt(nu) ln(1/eps) ), matching the best-known short-step bound for IPMs.","source":"verdict.strongest_claim","status":"machine_extracted","claim_id":"C1","attestation":"unclaimed"},{"kind":"weakest_assumption","text":"The reduced SBAL function is self-concordant convex-concave, which extends the classical self-concordant theory beyond the convex setting and enables the central-path neighborhood analysis.","source":"verdict.weakest_assumption","status":"machine_extracted","claim_id":"C2","attestation":"unclaimed"},{"kind":"one_line_summary","text":"A path-following smoothing Newton method for symmetric cone programming achieves O(sqrt(nu) ln(1/eps)) iteration complexity via a newly introduced self-concordant convex-concave reduced SBAL function that induces a central path.","source":"verdict.one_line_summary","status":"machine_extracted","claim_id":"C3","attestation":"unclaimed"},{"kind":"headline","text":"A path-following smoothing Newton method achieves polynomial iteration complexity O(sqrt(ν) ln(1/ε)) for symmetric cone programming.","source":"verdict.pith_extraction.headline","status":"machine_extracted","claim_id":"C4","attestation":"unclaimed"}],"snapshot_sha256":"53fda3977b4e4070481e6abe11a123a1a824bcc7fa85e06321641d24d206a3b2"},"source":{"id":"2604.04376","kind":"arxiv","version":2},"verdict":{"id":"4c96c8ae-823d-404f-b7ab-3cfffda244d2","model_set":{"reader":"grok-4.3"},"created_at":"2026-05-10T20:16:36.853528Z","strongest_claim":"the method is proven to achieve an iteration complexity of O( sqrt(nu) ln(1/eps) ), matching the best-known short-step bound for IPMs.","one_line_summary":"A path-following smoothing Newton method for symmetric cone programming achieves O(sqrt(nu) ln(1/eps)) iteration complexity via a newly introduced self-concordant convex-concave reduced SBAL function that induces a central path.","pipeline_version":"pith-pipeline@v0.9.0","weakest_assumption":"The reduced SBAL function is self-concordant convex-concave, which extends the classical self-concordant theory beyond the convex setting and enables the central-path neighborhood analysis.","pith_extraction_headline":"A path-following smoothing Newton method achieves polynomial iteration complexity O(sqrt(ν) ln(1/ε)) for symmetric cone programming."},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2604.04376/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":2,"snapshot_sha256":"b0f9189361b3899c52f568f17b5c8dc5393a9a3eb09a6bfca0a3f94b1968b65a"},"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":"2604.04376","created_at":"2026-05-22T01:04:01.560527+00:00"},{"alias_kind":"arxiv_version","alias_value":"2604.04376v2","created_at":"2026-05-22T01:04:01.560527+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2604.04376","created_at":"2026-05-22T01:04:01.560527+00:00"},{"alias_kind":"pith_short_12","alias_value":"GKEAZPBINH7T","created_at":"2026-05-22T01:04:01.560527+00:00"},{"alias_kind":"pith_short_16","alias_value":"GKEAZPBINH7T4UUP","created_at":"2026-05-22T01:04:01.560527+00:00"},{"alias_kind":"pith_short_8","alias_value":"GKEAZPBI","created_at":"2026-05-22T01:04:01.560527+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":2,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/GKEAZPBINH7T4UUPK6UIQXFMQX","json":"https://pith.science/pith/GKEAZPBINH7T4UUPK6UIQXFMQX.json","graph_json":"https://pith.science/api/pith-number/GKEAZPBINH7T4UUPK6UIQXFMQX/graph.json","events_json":"https://pith.science/api/pith-number/GKEAZPBINH7T4UUPK6UIQXFMQX/events.json","paper":"https://pith.science/paper/GKEAZPBI"},"agent_actions":{"view_html":"https://pith.science/pith/GKEAZPBINH7T4UUPK6UIQXFMQX","download_json":"https://pith.science/pith/GKEAZPBINH7T4UUPK6UIQXFMQX.json","view_paper":"https://pith.science/paper/GKEAZPBI","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2604.04376&json=true","fetch_graph":"https://pith.science/api/pith-number/GKEAZPBINH7T4UUPK6UIQXFMQX/graph.json","fetch_events":"https://pith.science/api/pith-number/GKEAZPBINH7T4UUPK6UIQXFMQX/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/GKEAZPBINH7T4UUPK6UIQXFMQX/action/timestamp_anchor","attest_storage":"https://pith.science/pith/GKEAZPBINH7T4UUPK6UIQXFMQX/action/storage_attestation","attest_author":"https://pith.science/pith/GKEAZPBINH7T4UUPK6UIQXFMQX/action/author_attestation","sign_citation":"https://pith.science/pith/GKEAZPBINH7T4UUPK6UIQXFMQX/action/citation_signature","submit_replication":"https://pith.science/pith/GKEAZPBINH7T4UUPK6UIQXFMQX/action/replication_record"}},"created_at":"2026-05-22T01:04:01.560527+00:00","updated_at":"2026-05-22T01:04:01.560527+00:00"}