{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:DTSKSYCWRKSTFWXK46FA52Q3O7","short_pith_number":"pith:DTSKSYCW","schema_version":"1.0","canonical_sha256":"1ce4a960568aa532daeae78a0eea1b77f2748544fcf086ae8dd419bdcb78376c","source":{"kind":"arxiv","id":"1511.01796","version":1},"attestation_state":"computed","paper":{"title":"Computing B-Stationary Points of Nonsmooth DC Programs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Alberth Alvarado, Jong-Shi Pang, Meisam Razaviyayn","submitted_at":"2015-11-05T16:00:04Z","abstract_excerpt":"Motivated by a class of applied problems arising from physical layer based security in a digital communication system, in particular, by a secrecy sum-rate maximization problem, this paper studies a nonsmooth, difference-of-convex (dc) minimization problem. The contributions of this paper are: (i) clarify several kinds of stationary solutions and their relations; (ii) develop and establish the convergence of a novel algorithm for computing a d-stationary solution of a problem with a convex feasible set that is arguably the sharpest kind among the various stationary solutions; (iii) extend the "},"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":"1511.01796","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2015-11-05T16:00:04Z","cross_cats_sorted":[],"title_canon_sha256":"b58832c72ecbe543b570781d9073d65d4e15032dfdb8888ac68e969ab5f7f32c","abstract_canon_sha256":"17fa0ade772f1bd81cb71e6ac84397984c7ea3eb78b91b0f08e4bc442abfc3f7"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:27:39.784710Z","signature_b64":"0LklVTahCW6jcCKJWkqjx1aEHH7J4kiI+4k+JOXYdFftalHSveoOBMLUNzJWm8uhOIXNr4iMaNBu5TKqN8Q9AA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"1ce4a960568aa532daeae78a0eea1b77f2748544fcf086ae8dd419bdcb78376c","last_reissued_at":"2026-05-18T01:27:39.784132Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:27:39.784132Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Computing B-Stationary Points of Nonsmooth DC Programs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Alberth Alvarado, Jong-Shi Pang, Meisam Razaviyayn","submitted_at":"2015-11-05T16:00:04Z","abstract_excerpt":"Motivated by a class of applied problems arising from physical layer based security in a digital communication system, in particular, by a secrecy sum-rate maximization problem, this paper studies a nonsmooth, difference-of-convex (dc) minimization problem. The contributions of this paper are: (i) clarify several kinds of stationary solutions and their relations; (ii) develop and establish the convergence of a novel algorithm for computing a d-stationary solution of a problem with a convex feasible set that is arguably the sharpest kind among the various stationary solutions; (iii) extend the "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1511.01796","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":""},"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":"1511.01796","created_at":"2026-05-18T01:27:39.784211+00:00"},{"alias_kind":"arxiv_version","alias_value":"1511.01796v1","created_at":"2026-05-18T01:27:39.784211+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1511.01796","created_at":"2026-05-18T01:27:39.784211+00:00"},{"alias_kind":"pith_short_12","alias_value":"DTSKSYCWRKST","created_at":"2026-05-18T12:29:17.054201+00:00"},{"alias_kind":"pith_short_16","alias_value":"DTSKSYCWRKSTFWXK","created_at":"2026-05-18T12:29:17.054201+00:00"},{"alias_kind":"pith_short_8","alias_value":"DTSKSYCW","created_at":"2026-05-18T12:29:17.054201+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/DTSKSYCWRKSTFWXK46FA52Q3O7","json":"https://pith.science/pith/DTSKSYCWRKSTFWXK46FA52Q3O7.json","graph_json":"https://pith.science/api/pith-number/DTSKSYCWRKSTFWXK46FA52Q3O7/graph.json","events_json":"https://pith.science/api/pith-number/DTSKSYCWRKSTFWXK46FA52Q3O7/events.json","paper":"https://pith.science/paper/DTSKSYCW"},"agent_actions":{"view_html":"https://pith.science/pith/DTSKSYCWRKSTFWXK46FA52Q3O7","download_json":"https://pith.science/pith/DTSKSYCWRKSTFWXK46FA52Q3O7.json","view_paper":"https://pith.science/paper/DTSKSYCW","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1511.01796&json=true","fetch_graph":"https://pith.science/api/pith-number/DTSKSYCWRKSTFWXK46FA52Q3O7/graph.json","fetch_events":"https://pith.science/api/pith-number/DTSKSYCWRKSTFWXK46FA52Q3O7/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/DTSKSYCWRKSTFWXK46FA52Q3O7/action/timestamp_anchor","attest_storage":"https://pith.science/pith/DTSKSYCWRKSTFWXK46FA52Q3O7/action/storage_attestation","attest_author":"https://pith.science/pith/DTSKSYCWRKSTFWXK46FA52Q3O7/action/author_attestation","sign_citation":"https://pith.science/pith/DTSKSYCWRKSTFWXK46FA52Q3O7/action/citation_signature","submit_replication":"https://pith.science/pith/DTSKSYCWRKSTFWXK46FA52Q3O7/action/replication_record"}},"created_at":"2026-05-18T01:27:39.784211+00:00","updated_at":"2026-05-18T01:27:39.784211+00:00"}