{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2019:QNEUPY2GAIFA5NIS6NIZAGJY4X","short_pith_number":"pith:QNEUPY2G","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"},"canonical_sha256":"834947e346020a0eb512f351901938e5c4de9e3e147d98556a8855446a96c881","source":{"kind":"arxiv","id":"1908.01138","version":4},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1908.01138","created_at":"2026-07-05T04:45:08Z"},{"alias_kind":"arxiv_version","alias_value":"1908.01138v4","created_at":"2026-07-05T04:45:08Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1908.01138","created_at":"2026-07-05T04:45:08Z"},{"alias_kind":"pith_short_12","alias_value":"QNEUPY2GAIFA","created_at":"2026-07-05T04:45:08Z"},{"alias_kind":"pith_short_16","alias_value":"QNEUPY2GAIFA5NIS","created_at":"2026-07-05T04:45:08Z"},{"alias_kind":"pith_short_8","alias_value":"QNEUPY2G","created_at":"2026-07-05T04:45:08Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2019:QNEUPY2GAIFA5NIS6NIZAGJY4X","target":"record","payload":{"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"},"canonical_sha256":"834947e346020a0eb512f351901938e5c4de9e3e147d98556a8855446a96c881","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"},"source_kind":"arxiv","source_id":"1908.01138","source_version":4,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-07-05T04:45:08Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"o1xkjZ8cfWW84oSh8/WNZ+36NgkH0A3xtbCPPMrsGfPbv5P8ZaX4eedd6CzmlcaKYH4zg8QE1olgOW45CTuJAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-16T05:01:59.585585Z"},"content_sha256":"a29755a94aed928e9aea792ca08945763cf9d33d17f59e5190f6d92a6b9b00f1","schema_version":"1.0","event_id":"sha256:a29755a94aed928e9aea792ca08945763cf9d33d17f59e5190f6d92a6b9b00f1"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2019:QNEUPY2GAIFA5NIS6NIZAGJY4X","target":"graph","payload":{"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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-07-05T04:45:08Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"EZLl7BlH9MpoqEiSpf0qEQhp89FM6U919D/0UtRAyt2M3Bbk7RThWa2f98TPqGqb4q189uK0u7gpED3uwSyWDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-16T05:01:59.586097Z"},"content_sha256":"1b86c1870d752d7187d66d25e73a7dc4c9f6705ba41ce452772c2c181c5a2686","schema_version":"1.0","event_id":"sha256:1b86c1870d752d7187d66d25e73a7dc4c9f6705ba41ce452772c2c181c5a2686"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/QNEUPY2GAIFA5NIS6NIZAGJY4X/bundle.json","state_url":"https://pith.science/pith/QNEUPY2GAIFA5NIS6NIZAGJY4X/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/QNEUPY2GAIFA5NIS6NIZAGJY4X/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-08-16T05:01:59Z","links":{"resolver":"https://pith.science/pith/QNEUPY2GAIFA5NIS6NIZAGJY4X","bundle":"https://pith.science/pith/QNEUPY2GAIFA5NIS6NIZAGJY4X/bundle.json","state":"https://pith.science/pith/QNEUPY2GAIFA5NIS6NIZAGJY4X/state.json","well_known_bundle":"https://pith.science/.well-known/pith/QNEUPY2GAIFA5NIS6NIZAGJY4X/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2019:QNEUPY2GAIFA5NIS6NIZAGJY4X","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"c5c8db276e0783ef04a190214b03a748e55a8ed4c9bbb88354a51ace75f773f2","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2019-08-03T09:35:37Z","title_canon_sha256":"3cca17839bf2ea96ce805b74ff0b78081d613ece9c84b729680515c94c3b870a"},"schema_version":"1.0","source":{"id":"1908.01138","kind":"arxiv","version":4}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1908.01138","created_at":"2026-07-05T04:45:08Z"},{"alias_kind":"arxiv_version","alias_value":"1908.01138v4","created_at":"2026-07-05T04:45:08Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1908.01138","created_at":"2026-07-05T04:45:08Z"},{"alias_kind":"pith_short_12","alias_value":"QNEUPY2GAIFA","created_at":"2026-07-05T04:45:08Z"},{"alias_kind":"pith_short_16","alias_value":"QNEUPY2GAIFA5NIS","created_at":"2026-07-05T04:45:08Z"},{"alias_kind":"pith_short_8","alias_value":"QNEUPY2G","created_at":"2026-07-05T04:45:08Z"}],"graph_snapshots":[{"event_id":"sha256:1b86c1870d752d7187d66d25e73a7dc4c9f6705ba41ce452772c2c181c5a2686","target":"graph","created_at":"2026-07-05T04:45:08Z","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":[],"endpoint":"/pith/1908.01138/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"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","authors_text":"Francisco J. Arag\\'on Artacho, Phan T. Vuong, Rub\\'en Campoy","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2019-08-03T09:35:37Z","title":"The Boosted DC Algorithm for linearly constrained DC programming"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1908.01138","kind":"arxiv","version":4},"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:a29755a94aed928e9aea792ca08945763cf9d33d17f59e5190f6d92a6b9b00f1","target":"record","created_at":"2026-07-05T04:45:08Z","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":"c5c8db276e0783ef04a190214b03a748e55a8ed4c9bbb88354a51ace75f773f2","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2019-08-03T09:35:37Z","title_canon_sha256":"3cca17839bf2ea96ce805b74ff0b78081d613ece9c84b729680515c94c3b870a"},"schema_version":"1.0","source":{"id":"1908.01138","kind":"arxiv","version":4}},"canonical_sha256":"834947e346020a0eb512f351901938e5c4de9e3e147d98556a8855446a96c881","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"834947e346020a0eb512f351901938e5c4de9e3e147d98556a8855446a96c881","first_computed_at":"2026-07-05T04:45:08.733389Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T04:45:08.733389Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"B+l6AJIim3uBLvhl6calPjLo4KPnHhiBqxEWu/2s8OFYPrRlnMWUcrfpGeGSM+g4bqzVx2PRxRVGeTx0xzMZAQ==","signature_status":"signed_v1","signed_at":"2026-07-05T04:45:08.733997Z","signed_message":"canonical_sha256_bytes"},"source_id":"1908.01138","source_kind":"arxiv","source_version":4}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:a29755a94aed928e9aea792ca08945763cf9d33d17f59e5190f6d92a6b9b00f1","sha256:1b86c1870d752d7187d66d25e73a7dc4c9f6705ba41ce452772c2c181c5a2686"],"state_sha256":"c3887b19b5988f212a0e3f8a1c7279aa85607201849ff5b37ba31a734ebcc73c"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"P756Gc0yPxWbq8saG7Iu8TFEnYEgoQ9HiotOXe7ihsObXgWTkO3wfcAcNMmGk3LWHlkqe3+ZFc0jM+u2LylwCQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-16T05:01:59.590908Z","bundle_sha256":"1511105a671c274cc19eb009dffc6c833e15092847a8f1eda77a89e3f00bb274"}}