{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2019:QNEUPY2GAIFA5NIS6NIZAGJY4X","short_pith_number":"pith:QNEUPY2G","schema_version":"1.0","canonical_sha256":"834947e346020a0eb512f351901938e5c4de9e3e147d98556a8855446a96c881","source":{"kind":"arxiv","id":"1908.01138","version":4},"attestation_state":"computed","paper":{"title":"The Boosted DC Algorithm for linearly constrained DC programming","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Francisco J. Arag\\'on Artacho, Phan T. Vuong, Rub\\'en Campoy","submitted_at":"2019-08-03T09:35:37Z","abstract_excerpt":"The Boosted Difference of Convex functions Algorithm (BDCA) has been recently introduced to accelerate the performance of the classical Difference of Convex functions Algorithm (DCA). This acceleration is achieved thanks to an extrapolation step from the point computed by DCA via a line search procedure. In this work, we propose an extension of BDCA that can be applied to difference of convex functions programs with linear constraints, and prove that every cluster point of the sequence generated by this algorithm is a Karush--Kuhn-Tucker point of the problem if the feasible set has a Slater po"},"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":"1908.01138","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2019-08-03T09:35:37Z","cross_cats_sorted":[],"title_canon_sha256":"3cca17839bf2ea96ce805b74ff0b78081d613ece9c84b729680515c94c3b870a","abstract_canon_sha256":"c5c8db276e0783ef04a190214b03a748e55a8ed4c9bbb88354a51ace75f773f2"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T04:45:08.733997Z","signature_b64":"B+l6AJIim3uBLvhl6calPjLo4KPnHhiBqxEWu/2s8OFYPrRlnMWUcrfpGeGSM+g4bqzVx2PRxRVGeTx0xzMZAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"834947e346020a0eb512f351901938e5c4de9e3e147d98556a8855446a96c881","last_reissued_at":"2026-07-05T04:45:08.733389Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T04:45:08.733389Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"The Boosted DC Algorithm for linearly constrained DC programming","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Francisco J. Arag\\'on Artacho, Phan T. Vuong, Rub\\'en Campoy","submitted_at":"2019-08-03T09:35:37Z","abstract_excerpt":"The Boosted Difference of Convex functions Algorithm (BDCA) has been recently introduced to accelerate the performance of the classical Difference of Convex functions Algorithm (DCA). This acceleration is achieved thanks to an extrapolation step from the point computed by DCA via a line search procedure. In this work, we propose an extension of BDCA that can be applied to difference of convex functions programs with linear constraints, and prove that every cluster point of the sequence generated by this algorithm is a Karush--Kuhn-Tucker point of the problem if the feasible set has a Slater po"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1908.01138","kind":"arxiv","version":4},"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/1908.01138/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":"1908.01138","created_at":"2026-07-05T04:45:08.733454+00:00"},{"alias_kind":"arxiv_version","alias_value":"1908.01138v4","created_at":"2026-07-05T04:45:08.733454+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1908.01138","created_at":"2026-07-05T04:45:08.733454+00:00"},{"alias_kind":"pith_short_12","alias_value":"QNEUPY2GAIFA","created_at":"2026-07-05T04:45:08.733454+00:00"},{"alias_kind":"pith_short_16","alias_value":"QNEUPY2GAIFA5NIS","created_at":"2026-07-05T04:45:08.733454+00:00"},{"alias_kind":"pith_short_8","alias_value":"QNEUPY2G","created_at":"2026-07-05T04:45:08.733454+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/QNEUPY2GAIFA5NIS6NIZAGJY4X","json":"https://pith.science/pith/QNEUPY2GAIFA5NIS6NIZAGJY4X.json","graph_json":"https://pith.science/api/pith-number/QNEUPY2GAIFA5NIS6NIZAGJY4X/graph.json","events_json":"https://pith.science/api/pith-number/QNEUPY2GAIFA5NIS6NIZAGJY4X/events.json","paper":"https://pith.science/paper/QNEUPY2G"},"agent_actions":{"view_html":"https://pith.science/pith/QNEUPY2GAIFA5NIS6NIZAGJY4X","download_json":"https://pith.science/pith/QNEUPY2GAIFA5NIS6NIZAGJY4X.json","view_paper":"https://pith.science/paper/QNEUPY2G","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1908.01138&json=true","fetch_graph":"https://pith.science/api/pith-number/QNEUPY2GAIFA5NIS6NIZAGJY4X/graph.json","fetch_events":"https://pith.science/api/pith-number/QNEUPY2GAIFA5NIS6NIZAGJY4X/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/QNEUPY2GAIFA5NIS6NIZAGJY4X/action/timestamp_anchor","attest_storage":"https://pith.science/pith/QNEUPY2GAIFA5NIS6NIZAGJY4X/action/storage_attestation","attest_author":"https://pith.science/pith/QNEUPY2GAIFA5NIS6NIZAGJY4X/action/author_attestation","sign_citation":"https://pith.science/pith/QNEUPY2GAIFA5NIS6NIZAGJY4X/action/citation_signature","submit_replication":"https://pith.science/pith/QNEUPY2GAIFA5NIS6NIZAGJY4X/action/replication_record"}},"created_at":"2026-07-05T04:45:08.733454+00:00","updated_at":"2026-07-05T04:45:08.733454+00:00"}