{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2026:GEC63PDAX6UOJZG6ZPMM4EAXPG","merge_version":"pith-open-graph-merge-v1","event_count":3,"valid_event_count":3,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"2676f2aee1fdc8536fc58f2dab4006d167d1863dfbaae3e724e5ed5c505b4c32","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2026-05-15T10:53:21Z","title_canon_sha256":"4d4cebb135a18177918e26d269b2ed8725743b0239b77a76f99e47411a67f33d"},"schema_version":"1.0","source":{"id":"2605.15838","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2605.15838","created_at":"2026-05-20T00:01:21Z"},{"alias_kind":"arxiv_version","alias_value":"2605.15838v1","created_at":"2026-05-20T00:01:21Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2605.15838","created_at":"2026-05-20T00:01:21Z"},{"alias_kind":"pith_short_12","alias_value":"GEC63PDAX6UO","created_at":"2026-05-20T00:01:21Z"},{"alias_kind":"pith_short_16","alias_value":"GEC63PDAX6UOJZG6","created_at":"2026-05-20T00:01:21Z"},{"alias_kind":"pith_short_8","alias_value":"GEC63PDA","created_at":"2026-05-20T00:01:21Z"}],"graph_snapshots":[{"event_id":"sha256:700523f548483103a0caeb7d1929cc3116623b812b990c511be8501747996dbc","target":"graph","created_at":"2026-05-20T00:01:21Z","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":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"integrity":{"available":true,"clean":true,"detectors_run":[{"findings_count":0,"name":"ai_meta_artifact","ran_at":"2026-05-19T17:33:48.715483Z","status":"skipped","version":"1.0.0"},{"findings_count":0,"name":"claim_evidence","ran_at":"2026-05-19T17:21:55.848091Z","status":"completed","version":"1.0.0"}],"endpoint":"/pith/2605.15838/integrity.json","findings":[],"snapshot_sha256":"ebdaafcff48718306b80dcf830f27e43c4f777e8ab0b8032c3ebeadca698024c","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"We address the problem of computing stationary points for non-smooth, non-convex optimization problems. While this topic is well studied in the smooth setting, fewer algorithmic and theoretical results exist for the non-smooth case. Within Difference-of-Convex functions (DC) programming, the well-known DC Algorithm (DCA) is a standard method for computing critical points, whose definition depends on the chosen DC decomposition. More recently, some works have focused on computing directional stationary points - a stronger notion that does not depend on any particular DC decomposition - for spec","authors_text":"Hoai An Le Thi, Tao Pham Dinh, Van Ngai Huynh","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2026-05-15T10:53:21Z","title":"Finding directional stationary points of DC programs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2605.15838","kind":"arxiv","version":1},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:61e714eacf5b9a2100dd119aa12a5cdd2ed2c687cbfbc921d546f87368285cd0","target":"record","created_at":"2026-05-20T00:01:21Z","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":"2676f2aee1fdc8536fc58f2dab4006d167d1863dfbaae3e724e5ed5c505b4c32","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2026-05-15T10:53:21Z","title_canon_sha256":"4d4cebb135a18177918e26d269b2ed8725743b0239b77a76f99e47411a67f33d"},"schema_version":"1.0","source":{"id":"2605.15838","kind":"arxiv","version":1}},"canonical_sha256":"3105edbc60bfa8e4e4decbd8ce101779b07c5e04c8b13966f7e24ea41ede757e","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"3105edbc60bfa8e4e4decbd8ce101779b07c5e04c8b13966f7e24ea41ede757e","first_computed_at":"2026-05-20T00:01:21.030479Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-20T00:01:21.030479Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"R/b6MkJNXM2h4DKi8RUOFJvjun1EL027Gj1p+sIw7jBaCIKigWnog1ZOLO6kS+qSKwlR1AVlJG47qD/fH9HRBA==","signature_status":"signed_v1","signed_at":"2026-05-20T00:01:21.031306Z","signed_message":"canonical_sha256_bytes"},"source_id":"2605.15838","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:61e714eacf5b9a2100dd119aa12a5cdd2ed2c687cbfbc921d546f87368285cd0","sha256:700523f548483103a0caeb7d1929cc3116623b812b990c511be8501747996dbc","sha256:3d4509559a626728c9de27e028e8753657d7464404b4def1ac8b52659970f5ae"],"state_sha256":"41fa2cea5264d2fa33d14488c6196506dafc65a59401498297c55f1b1242c5a3"}