{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2025:2FAL7C5PERKHTFDW5BJ2WYXADX","short_pith_number":"pith:2FAL7C5P","schema_version":"1.0","canonical_sha256":"d140bf8baf2454799476e853ab62e01dcf9fb312c6265c799f5bdb475e76136f","source":{"kind":"arxiv","id":"2507.17545","version":2},"attestation_state":"computed","paper":{"title":"Scalable DC Optimization via Adaptive Frank-Wolfe Algorithms","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG"],"primary_cat":"math.OC","authors_text":"Sebastian Pokutta","submitted_at":"2025-07-23T14:22:42Z","abstract_excerpt":"We consider the problem of minimizing a difference of (smooth) convex functions over a compact convex feasible region $P$, i.e., $\\min_{x \\in P} f(x) - g(x)$, with smooth $f$ and Lipschitz continuous $g$. This computational study builds upon and complements the framework of Maskan et al. [2025] by integrating advanced Frank-Wolfe variants to reduce computational overhead. We empirically show that constrained DC problems can be efficiently solved using a combination of the Blended Pairwise Conditional Gradients (BPCG) algorithm [Tsuji et al., 2022] with warm-starting and the adaptive error boun"},"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":"2507.17545","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2025-07-23T14:22:42Z","cross_cats_sorted":["cs.LG"],"title_canon_sha256":"b97b88a262aba2755ae0661c97d3a5d48663723dbd8e78c15230fd989e09ee17","abstract_canon_sha256":"d15035d52c769238cf89bd08d15aa2d58fadc3ac59b7ef41b8f222186d5a3cb8"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T11:47:26.645034Z","signature_b64":"cU4nY1meyzstGi7tpx5+c+EDJ76AJesBEO54+tIsdGnMxV74YPJwQa2nNfoAL4W05xugpb/0TYkaTqoD9rFaDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"d140bf8baf2454799476e853ab62e01dcf9fb312c6265c799f5bdb475e76136f","last_reissued_at":"2026-07-05T11:47:26.644510Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T11:47:26.644510Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Scalable DC Optimization via Adaptive Frank-Wolfe Algorithms","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG"],"primary_cat":"math.OC","authors_text":"Sebastian Pokutta","submitted_at":"2025-07-23T14:22:42Z","abstract_excerpt":"We consider the problem of minimizing a difference of (smooth) convex functions over a compact convex feasible region $P$, i.e., $\\min_{x \\in P} f(x) - g(x)$, with smooth $f$ and Lipschitz continuous $g$. This computational study builds upon and complements the framework of Maskan et al. [2025] by integrating advanced Frank-Wolfe variants to reduce computational overhead. We empirically show that constrained DC problems can be efficiently solved using a combination of the Blended Pairwise Conditional Gradients (BPCG) algorithm [Tsuji et al., 2022] with warm-starting and the adaptive error boun"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2507.17545","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2507.17545/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":"2507.17545","created_at":"2026-07-05T11:47:26.644572+00:00"},{"alias_kind":"arxiv_version","alias_value":"2507.17545v2","created_at":"2026-07-05T11:47:26.644572+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2507.17545","created_at":"2026-07-05T11:47:26.644572+00:00"},{"alias_kind":"pith_short_12","alias_value":"2FAL7C5PERKH","created_at":"2026-07-05T11:47:26.644572+00:00"},{"alias_kind":"pith_short_16","alias_value":"2FAL7C5PERKHTFDW","created_at":"2026-07-05T11:47:26.644572+00:00"},{"alias_kind":"pith_short_8","alias_value":"2FAL7C5P","created_at":"2026-07-05T11:47:26.644572+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":2,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2606.03559","citing_title":"Analytical Evaluation of DCA Convergence Properties for Minimizing Prediction Functions of Gaussian RBF Support Vector Regression","ref_index":20,"is_internal_anchor":false},{"citing_arxiv_id":"2512.17417","citing_title":"Graph Isomorphism: Mixed-Integer Convex Optimization from First-Order Methods","ref_index":34,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/2FAL7C5PERKHTFDW5BJ2WYXADX","json":"https://pith.science/pith/2FAL7C5PERKHTFDW5BJ2WYXADX.json","graph_json":"https://pith.science/api/pith-number/2FAL7C5PERKHTFDW5BJ2WYXADX/graph.json","events_json":"https://pith.science/api/pith-number/2FAL7C5PERKHTFDW5BJ2WYXADX/events.json","paper":"https://pith.science/paper/2FAL7C5P"},"agent_actions":{"view_html":"https://pith.science/pith/2FAL7C5PERKHTFDW5BJ2WYXADX","download_json":"https://pith.science/pith/2FAL7C5PERKHTFDW5BJ2WYXADX.json","view_paper":"https://pith.science/paper/2FAL7C5P","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2507.17545&json=true","fetch_graph":"https://pith.science/api/pith-number/2FAL7C5PERKHTFDW5BJ2WYXADX/graph.json","fetch_events":"https://pith.science/api/pith-number/2FAL7C5PERKHTFDW5BJ2WYXADX/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/2FAL7C5PERKHTFDW5BJ2WYXADX/action/timestamp_anchor","attest_storage":"https://pith.science/pith/2FAL7C5PERKHTFDW5BJ2WYXADX/action/storage_attestation","attest_author":"https://pith.science/pith/2FAL7C5PERKHTFDW5BJ2WYXADX/action/author_attestation","sign_citation":"https://pith.science/pith/2FAL7C5PERKHTFDW5BJ2WYXADX/action/citation_signature","submit_replication":"https://pith.science/pith/2FAL7C5PERKHTFDW5BJ2WYXADX/action/replication_record"}},"created_at":"2026-07-05T11:47:26.644572+00:00","updated_at":"2026-07-05T11:47:26.644572+00:00"}