{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2026:W7MEQOPXMRQBRAAPWS32HSY2ND","short_pith_number":"pith:W7MEQOPX","schema_version":"1.0","canonical_sha256":"b7d84839f7646018800fb4b7a3cb1a68dff5c65c362ce9a03187e4d1eab49ce0","source":{"kind":"arxiv","id":"2605.23550","version":1},"attestation_state":"computed","paper":{"title":"RA-DCA: A Randomized Active-Set DCA for Directional Stationarity in Max-Structured DC Programs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI","cs.NA","math.NA"],"primary_cat":"math.OC","authors_text":"Yi-Shuai Niu","submitted_at":"2026-05-22T12:16:58Z","abstract_excerpt":"We study nonsmooth difference-of-convex programs whose subtracted convex term is a finite maximum of smooth convex functions. In this setting, standard DCA iterations may converge to critical points that are not directionally stationary, whereas exact active-vertex screening can be expensive when active sets are large or combinatorial. We propose RA-DCA, a vertex-first randomized active-set DCA that projects active gradients onto sampled directions, checks a sampled vertex residual, and uses a small linear program only as a low-residual convex-combination fallback. The method preserves the des"},"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":"2605.23550","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2026-05-22T12:16:58Z","cross_cats_sorted":["cs.AI","cs.NA","math.NA"],"title_canon_sha256":"5c0899b5ce1af5297be0dd1b6f0074a628dd2f60c74bd9c083ef556cd7af4aec","abstract_canon_sha256":"559fe5ddde32785d95fc75ff00cc4a197001190f5043401204b53601ccc5de2a"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-25T02:02:00.467990Z","signature_b64":"vDOmYfr6ReXP8YRwzDYs6cWBgG27ScWscywGIwSJH4k4qowvPRgloCAB99ID9hU/FR1InXtRc8Vggut15IoICA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"b7d84839f7646018800fb4b7a3cb1a68dff5c65c362ce9a03187e4d1eab49ce0","last_reissued_at":"2026-05-25T02:02:00.467051Z","signature_status":"signed_v1","first_computed_at":"2026-05-25T02:02:00.467051Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"RA-DCA: A Randomized Active-Set DCA for Directional Stationarity in Max-Structured DC Programs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI","cs.NA","math.NA"],"primary_cat":"math.OC","authors_text":"Yi-Shuai Niu","submitted_at":"2026-05-22T12:16:58Z","abstract_excerpt":"We study nonsmooth difference-of-convex programs whose subtracted convex term is a finite maximum of smooth convex functions. In this setting, standard DCA iterations may converge to critical points that are not directionally stationary, whereas exact active-vertex screening can be expensive when active sets are large or combinatorial. We propose RA-DCA, a vertex-first randomized active-set DCA that projects active gradients onto sampled directions, checks a sampled vertex residual, and uses a small linear program only as a low-residual convex-combination fallback. The method preserves the des"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2605.23550","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/2605.23550/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":"2605.23550","created_at":"2026-05-25T02:02:00.467169+00:00"},{"alias_kind":"arxiv_version","alias_value":"2605.23550v1","created_at":"2026-05-25T02:02:00.467169+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2605.23550","created_at":"2026-05-25T02:02:00.467169+00:00"},{"alias_kind":"pith_short_12","alias_value":"W7MEQOPXMRQB","created_at":"2026-05-25T02:02:00.467169+00:00"},{"alias_kind":"pith_short_16","alias_value":"W7MEQOPXMRQBRAAP","created_at":"2026-05-25T02:02:00.467169+00:00"},{"alias_kind":"pith_short_8","alias_value":"W7MEQOPX","created_at":"2026-05-25T02:02:00.467169+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/W7MEQOPXMRQBRAAPWS32HSY2ND","json":"https://pith.science/pith/W7MEQOPXMRQBRAAPWS32HSY2ND.json","graph_json":"https://pith.science/api/pith-number/W7MEQOPXMRQBRAAPWS32HSY2ND/graph.json","events_json":"https://pith.science/api/pith-number/W7MEQOPXMRQBRAAPWS32HSY2ND/events.json","paper":"https://pith.science/paper/W7MEQOPX"},"agent_actions":{"view_html":"https://pith.science/pith/W7MEQOPXMRQBRAAPWS32HSY2ND","download_json":"https://pith.science/pith/W7MEQOPXMRQBRAAPWS32HSY2ND.json","view_paper":"https://pith.science/paper/W7MEQOPX","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2605.23550&json=true","fetch_graph":"https://pith.science/api/pith-number/W7MEQOPXMRQBRAAPWS32HSY2ND/graph.json","fetch_events":"https://pith.science/api/pith-number/W7MEQOPXMRQBRAAPWS32HSY2ND/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/W7MEQOPXMRQBRAAPWS32HSY2ND/action/timestamp_anchor","attest_storage":"https://pith.science/pith/W7MEQOPXMRQBRAAPWS32HSY2ND/action/storage_attestation","attest_author":"https://pith.science/pith/W7MEQOPXMRQBRAAPWS32HSY2ND/action/author_attestation","sign_citation":"https://pith.science/pith/W7MEQOPXMRQBRAAPWS32HSY2ND/action/citation_signature","submit_replication":"https://pith.science/pith/W7MEQOPXMRQBRAAPWS32HSY2ND/action/replication_record"}},"created_at":"2026-05-25T02:02:00.467169+00:00","updated_at":"2026-05-25T02:02:00.467169+00:00"}