{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2025:RCDNEFE7BXWRILLL52M3RWIAOA","short_pith_number":"pith:RCDNEFE7","schema_version":"1.0","canonical_sha256":"8886d2149f0ded142d6bee99b8d90070007fa597460a59a8d2b2560abc2ba9ed","source":{"kind":"arxiv","id":"2505.10800","version":1},"attestation_state":"computed","paper":{"title":"Contractive difference-of-convex algorithms","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Michael Th. Rassias, Qiao-Li Dong, Songnian He","submitted_at":"2025-05-16T02:38:37Z","abstract_excerpt":"The difference-of-convex algorithm (DCA) and its variants are the most popular methods to solve the difference-of-convex optimization problem. Each iteration of them is reduced to a convex optimization problem, which generally needs to be solved by iterative methods such as proximal gradient algorithm. However, these algorithms essentially belong to some iterative methods of fixed point problems of averaged mappings, and their convergence speed is generally slow. Furthermore, there is seldom research on the termination rule of these iterative algorithms solving the subproblem of DCA. To overco"},"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":"2505.10800","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2025-05-16T02:38:37Z","cross_cats_sorted":[],"title_canon_sha256":"00693eda9b455b3907ac0ebfe166552a0bf0993e78a2de05a4f2c5ee87b24f95","abstract_canon_sha256":"9d7ce2b058b46c1830ad2dcae5046b188e597c2af1ddd12cb1176c3ba4698fd3"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T11:04:05.949045Z","signature_b64":"HrW/mvleM58jPMuonXAH1/1np7kXo3ayc0G8EZPzBCTqAOxT38QiTguuJIIKAY11Wz3GAxlMOcFH77/hIzD9Ag==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"8886d2149f0ded142d6bee99b8d90070007fa597460a59a8d2b2560abc2ba9ed","last_reissued_at":"2026-07-05T11:04:05.948553Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T11:04:05.948553Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Contractive difference-of-convex algorithms","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Michael Th. Rassias, Qiao-Li Dong, Songnian He","submitted_at":"2025-05-16T02:38:37Z","abstract_excerpt":"The difference-of-convex algorithm (DCA) and its variants are the most popular methods to solve the difference-of-convex optimization problem. Each iteration of them is reduced to a convex optimization problem, which generally needs to be solved by iterative methods such as proximal gradient algorithm. However, these algorithms essentially belong to some iterative methods of fixed point problems of averaged mappings, and their convergence speed is generally slow. Furthermore, there is seldom research on the termination rule of these iterative algorithms solving the subproblem of DCA. To overco"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2505.10800","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/2505.10800/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":"2505.10800","created_at":"2026-07-05T11:04:05.948618+00:00"},{"alias_kind":"arxiv_version","alias_value":"2505.10800v1","created_at":"2026-07-05T11:04:05.948618+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2505.10800","created_at":"2026-07-05T11:04:05.948618+00:00"},{"alias_kind":"pith_short_12","alias_value":"RCDNEFE7BXWR","created_at":"2026-07-05T11:04:05.948618+00:00"},{"alias_kind":"pith_short_16","alias_value":"RCDNEFE7BXWRILLL","created_at":"2026-07-05T11:04:05.948618+00:00"},{"alias_kind":"pith_short_8","alias_value":"RCDNEFE7","created_at":"2026-07-05T11:04:05.948618+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/RCDNEFE7BXWRILLL52M3RWIAOA","json":"https://pith.science/pith/RCDNEFE7BXWRILLL52M3RWIAOA.json","graph_json":"https://pith.science/api/pith-number/RCDNEFE7BXWRILLL52M3RWIAOA/graph.json","events_json":"https://pith.science/api/pith-number/RCDNEFE7BXWRILLL52M3RWIAOA/events.json","paper":"https://pith.science/paper/RCDNEFE7"},"agent_actions":{"view_html":"https://pith.science/pith/RCDNEFE7BXWRILLL52M3RWIAOA","download_json":"https://pith.science/pith/RCDNEFE7BXWRILLL52M3RWIAOA.json","view_paper":"https://pith.science/paper/RCDNEFE7","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2505.10800&json=true","fetch_graph":"https://pith.science/api/pith-number/RCDNEFE7BXWRILLL52M3RWIAOA/graph.json","fetch_events":"https://pith.science/api/pith-number/RCDNEFE7BXWRILLL52M3RWIAOA/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/RCDNEFE7BXWRILLL52M3RWIAOA/action/timestamp_anchor","attest_storage":"https://pith.science/pith/RCDNEFE7BXWRILLL52M3RWIAOA/action/storage_attestation","attest_author":"https://pith.science/pith/RCDNEFE7BXWRILLL52M3RWIAOA/action/author_attestation","sign_citation":"https://pith.science/pith/RCDNEFE7BXWRILLL52M3RWIAOA/action/citation_signature","submit_replication":"https://pith.science/pith/RCDNEFE7BXWRILLL52M3RWIAOA/action/replication_record"}},"created_at":"2026-07-05T11:04:05.948618+00:00","updated_at":"2026-07-05T11:04:05.948618+00:00"}