{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:AW6NJEZ3EOJ6C3JS2EGYQZ3SCJ","short_pith_number":"pith:AW6NJEZ3","schema_version":"1.0","canonical_sha256":"05bcd4933b2393e16d32d10d8867721276225843276b030df0d3f73f7f8b34d5","source":{"kind":"arxiv","id":"1612.06265","version":2},"attestation_state":"computed","paper":{"title":"A proximal difference-of-convex algorithm with extrapolation","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Bo Wen, Ting Kei Pong, Xiaojun Chen","submitted_at":"2016-12-19T16:59:37Z","abstract_excerpt":"We consider a class of difference-of-convex (DC) optimization problems whose objective is level-bounded and is the sum of a smooth convex function with Lipschitz gradient, a proper closed convex function and a continuous concave function. While this kind of problems can be solved by the classical difference-of-convex algorithm (DCA) [26], the difficulty of the subproblems of this algorithm depends heavily on the choice of DC decomposition. Simpler subproblems can be obtained by using a specific DC decomposition described in [27]. This decomposition has been proposed in numerous work such as [1"},"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":"1612.06265","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2016-12-19T16:59:37Z","cross_cats_sorted":[],"title_canon_sha256":"7d54e0800964e3c48f67fd8e4af55e2a75a3691659176903e48c8e33f9cbf865","abstract_canon_sha256":"1e560895904dace9cd2d8ea7d6f0e2867c96b1a0e772e57feafdc221e78515af"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:41:53.296256Z","signature_b64":"B/kZmn6iFhAQ0OSgYERZKajisaCe0nhkbqtaCIJr291yCPjsvtAjJf9WGJMmDPnb11VHQWKtiyLGzITXZ30zDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"05bcd4933b2393e16d32d10d8867721276225843276b030df0d3f73f7f8b34d5","last_reissued_at":"2026-05-18T00:41:53.295761Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:41:53.295761Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A proximal difference-of-convex algorithm with extrapolation","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Bo Wen, Ting Kei Pong, Xiaojun Chen","submitted_at":"2016-12-19T16:59:37Z","abstract_excerpt":"We consider a class of difference-of-convex (DC) optimization problems whose objective is level-bounded and is the sum of a smooth convex function with Lipschitz gradient, a proper closed convex function and a continuous concave function. While this kind of problems can be solved by the classical difference-of-convex algorithm (DCA) [26], the difficulty of the subproblems of this algorithm depends heavily on the choice of DC decomposition. Simpler subproblems can be obtained by using a specific DC decomposition described in [27]. This decomposition has been proposed in numerous work such as [1"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1612.06265","kind":"arxiv","version":2},"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":"1612.06265","created_at":"2026-05-18T00:41:53.295839+00:00"},{"alias_kind":"arxiv_version","alias_value":"1612.06265v2","created_at":"2026-05-18T00:41:53.295839+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1612.06265","created_at":"2026-05-18T00:41:53.295839+00:00"},{"alias_kind":"pith_short_12","alias_value":"AW6NJEZ3EOJ6","created_at":"2026-05-18T12:30:07.202191+00:00"},{"alias_kind":"pith_short_16","alias_value":"AW6NJEZ3EOJ6C3JS","created_at":"2026-05-18T12:30:07.202191+00:00"},{"alias_kind":"pith_short_8","alias_value":"AW6NJEZ3","created_at":"2026-05-18T12:30:07.202191+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/AW6NJEZ3EOJ6C3JS2EGYQZ3SCJ","json":"https://pith.science/pith/AW6NJEZ3EOJ6C3JS2EGYQZ3SCJ.json","graph_json":"https://pith.science/api/pith-number/AW6NJEZ3EOJ6C3JS2EGYQZ3SCJ/graph.json","events_json":"https://pith.science/api/pith-number/AW6NJEZ3EOJ6C3JS2EGYQZ3SCJ/events.json","paper":"https://pith.science/paper/AW6NJEZ3"},"agent_actions":{"view_html":"https://pith.science/pith/AW6NJEZ3EOJ6C3JS2EGYQZ3SCJ","download_json":"https://pith.science/pith/AW6NJEZ3EOJ6C3JS2EGYQZ3SCJ.json","view_paper":"https://pith.science/paper/AW6NJEZ3","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1612.06265&json=true","fetch_graph":"https://pith.science/api/pith-number/AW6NJEZ3EOJ6C3JS2EGYQZ3SCJ/graph.json","fetch_events":"https://pith.science/api/pith-number/AW6NJEZ3EOJ6C3JS2EGYQZ3SCJ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/AW6NJEZ3EOJ6C3JS2EGYQZ3SCJ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/AW6NJEZ3EOJ6C3JS2EGYQZ3SCJ/action/storage_attestation","attest_author":"https://pith.science/pith/AW6NJEZ3EOJ6C3JS2EGYQZ3SCJ/action/author_attestation","sign_citation":"https://pith.science/pith/AW6NJEZ3EOJ6C3JS2EGYQZ3SCJ/action/citation_signature","submit_replication":"https://pith.science/pith/AW6NJEZ3EOJ6C3JS2EGYQZ3SCJ/action/replication_record"}},"created_at":"2026-05-18T00:41:53.295839+00:00","updated_at":"2026-05-18T00:41:53.295839+00:00"}