{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2026:GKEAZPBINH7T4UUPK6UIQXFMQX","short_pith_number":"pith:GKEAZPBI","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"},"canonical_sha256":"32880cbc2869ff3e528f57a8885cac85ebcb2eb648a652492e0704e9216efd5d","source":{"kind":"arxiv","id":"2604.04376","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2604.04376","created_at":"2026-05-22T01:04:01Z"},{"alias_kind":"arxiv_version","alias_value":"2604.04376v2","created_at":"2026-05-22T01:04:01Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2604.04376","created_at":"2026-05-22T01:04:01Z"},{"alias_kind":"pith_short_12","alias_value":"GKEAZPBINH7T","created_at":"2026-05-22T01:04:01Z"},{"alias_kind":"pith_short_16","alias_value":"GKEAZPBINH7T4UUP","created_at":"2026-05-22T01:04:01Z"},{"alias_kind":"pith_short_8","alias_value":"GKEAZPBI","created_at":"2026-05-22T01:04:01Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2026:GKEAZPBINH7T4UUPK6UIQXFMQX","target":"record","payload":{"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"},"canonical_sha256":"32880cbc2869ff3e528f57a8885cac85ebcb2eb648a652492e0704e9216efd5d","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"},"source_kind":"arxiv","source_id":"2604.04376","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-22T01:04:01Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"cwaP8BoLL7/hwSfJnKEGtuJIa6WXl7VMWewvhCT4e29GDTVinXOlUjC0fragJYdsBdKIy/fF9fG5JamipYWoCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-07T07:16:04.448304Z"},"content_sha256":"2a582e8798fd7fefa8b989d3fb4d166dadbf17201c4b8cdfe36ed781d927405c","schema_version":"1.0","event_id":"sha256:2a582e8798fd7fefa8b989d3fb4d166dadbf17201c4b8cdfe36ed781d927405c"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2026:GKEAZPBINH7T4UUPK6UIQXFMQX","target":"graph","payload":{"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"},"verdict_id":"4c96c8ae-823d-404f-b7ab-3cfffda244d2"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-22T01:04:01Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"5U6hslKM6E/o5N4bDKp+Buyvr4l+pf4Qt0IZsoB59NJT7TobteVAbRrmeEhfQ2VQSWbgde+hCO+nWCFNh8CrBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-07T07:16:04.449254Z"},"content_sha256":"b0013c3622361e2b9a9fc9f84253fc106175050f23e57fad4e0ef7431b8a4728","schema_version":"1.0","event_id":"sha256:b0013c3622361e2b9a9fc9f84253fc106175050f23e57fad4e0ef7431b8a4728"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/GKEAZPBINH7T4UUPK6UIQXFMQX/bundle.json","state_url":"https://pith.science/pith/GKEAZPBINH7T4UUPK6UIQXFMQX/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/GKEAZPBINH7T4UUPK6UIQXFMQX/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-07T07:16:04Z","links":{"resolver":"https://pith.science/pith/GKEAZPBINH7T4UUPK6UIQXFMQX","bundle":"https://pith.science/pith/GKEAZPBINH7T4UUPK6UIQXFMQX/bundle.json","state":"https://pith.science/pith/GKEAZPBINH7T4UUPK6UIQXFMQX/state.json","well_known_bundle":"https://pith.science/.well-known/pith/GKEAZPBINH7T4UUPK6UIQXFMQX/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2026:GKEAZPBINH7T4UUPK6UIQXFMQX","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":"e57297513aad4cdae67ab4b99c7237aae80dd5d54eb950a4a58efdea9d5715e4","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2026-04-06T02:53:16Z","title_canon_sha256":"130a9e5dcdef542bf1e413a10db3edaa36b10bd8b175b7c9caedbfad00c84749"},"schema_version":"1.0","source":{"id":"2604.04376","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2604.04376","created_at":"2026-05-22T01:04:01Z"},{"alias_kind":"arxiv_version","alias_value":"2604.04376v2","created_at":"2026-05-22T01:04:01Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2604.04376","created_at":"2026-05-22T01:04:01Z"},{"alias_kind":"pith_short_12","alias_value":"GKEAZPBINH7T","created_at":"2026-05-22T01:04:01Z"},{"alias_kind":"pith_short_16","alias_value":"GKEAZPBINH7T4UUP","created_at":"2026-05-22T01:04:01Z"},{"alias_kind":"pith_short_8","alias_value":"GKEAZPBI","created_at":"2026-05-22T01:04:01Z"}],"graph_snapshots":[{"event_id":"sha256:b0013c3622361e2b9a9fc9f84253fc106175050f23e57fad4e0ef7431b8a4728","target":"graph","created_at":"2026-05-22T01:04:01Z","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":4,"items":[{"attestation":"unclaimed","claim_id":"C1","kind":"strongest_claim","source":"verdict.strongest_claim","status":"machine_extracted","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."},{"attestation":"unclaimed","claim_id":"C2","kind":"weakest_assumption","source":"verdict.weakest_assumption","status":"machine_extracted","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."},{"attestation":"unclaimed","claim_id":"C3","kind":"one_line_summary","source":"verdict.one_line_summary","status":"machine_extracted","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."},{"attestation":"unclaimed","claim_id":"C4","kind":"headline","source":"verdict.pith_extraction.headline","status":"machine_extracted","text":"A path-following smoothing Newton method achieves polynomial iteration complexity O(sqrt(ν) ln(1/ε)) for symmetric cone programming."}],"snapshot_sha256":"53fda3977b4e4070481e6abe11a123a1a824bcc7fa85e06321641d24d206a3b2"},"formal_canon":{"evidence_count":2,"snapshot_sha256":"b0f9189361b3899c52f568f17b5c8dc5393a9a3eb09a6bfca0a3f94b1968b65a"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2604.04376/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"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","authors_text":"Rui-Jin Zhang, Ruoyu Diao, Xin-Wei Liu, Yu-Hong Dai","cross_cats":[],"headline":"A path-following smoothing Newton method achieves polynomial iteration complexity O(sqrt(ν) ln(1/ε)) for symmetric cone programming.","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2026-04-06T02:53:16Z","title":"Polynomial iteration complexity of a path-following smoothing Newton method for symmetric cone programming"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2604.04376","kind":"arxiv","version":2},"verdict":{"created_at":"2026-05-10T20:16:36.853528Z","id":"4c96c8ae-823d-404f-b7ab-3cfffda244d2","model_set":{"reader":"grok-4.3"},"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","pith_extraction_headline":"A path-following smoothing Newton method achieves polynomial iteration complexity O(sqrt(ν) ln(1/ε)) for symmetric cone programming.","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.","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."}},"verdict_id":"4c96c8ae-823d-404f-b7ab-3cfffda244d2"}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:2a582e8798fd7fefa8b989d3fb4d166dadbf17201c4b8cdfe36ed781d927405c","target":"record","created_at":"2026-05-22T01:04:01Z","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":"e57297513aad4cdae67ab4b99c7237aae80dd5d54eb950a4a58efdea9d5715e4","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2026-04-06T02:53:16Z","title_canon_sha256":"130a9e5dcdef542bf1e413a10db3edaa36b10bd8b175b7c9caedbfad00c84749"},"schema_version":"1.0","source":{"id":"2604.04376","kind":"arxiv","version":2}},"canonical_sha256":"32880cbc2869ff3e528f57a8885cac85ebcb2eb648a652492e0704e9216efd5d","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"32880cbc2869ff3e528f57a8885cac85ebcb2eb648a652492e0704e9216efd5d","first_computed_at":"2026-05-22T01:04:01.560425Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-22T01:04:01.560425Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"va9LYtqcRntn5jUsY2XzwfIaH7c/WkNXvJai9h6IQD4UQAUr5w43lMOsUkjqikLBP3O1y9f8DHxPycgkCgfHCg==","signature_status":"signed_v1","signed_at":"2026-05-22T01:04:01.561305Z","signed_message":"canonical_sha256_bytes"},"source_id":"2604.04376","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:2a582e8798fd7fefa8b989d3fb4d166dadbf17201c4b8cdfe36ed781d927405c","sha256:b0013c3622361e2b9a9fc9f84253fc106175050f23e57fad4e0ef7431b8a4728"],"state_sha256":"0f628f90199a3227d79f85af39daeed540e5c4b71b2dce30aacf5fa2a4915dc5"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ZyGw9Ko8YZUTF+h/UXG7d9X5IPDrZUAahcvrosFN6SMsK37EHwHRzPaYb5pHeD0bwP1syMWEbPmznJw7azcNDA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-07T07:16:04.452396Z","bundle_sha256":"bb33ebf44a767f22f766e9451978bed4e40638112b4b8c2159d4bf209db18831"}}