{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2026:SUADJKTM4GDIQCT243JC2L34MP","short_pith_number":"pith:SUADJKTM","schema_version":"1.0","canonical_sha256":"950034aa6ce186880a7ae6d22d2f7c63f0eb911e4a58662a22146ca7b3d40544","source":{"kind":"arxiv","id":"2601.20443","version":2},"attestation_state":"computed","paper":{"title":"Adaptive Conditional Gradient Sliding: Projection-Free and Line-Search-Free Acceleration","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Shota Takahashi","submitted_at":"2026-01-28T09:57:29Z","abstract_excerpt":"We study convex optimization problems over a compact convex set where projections are expensive but a linear minimization oracle (LMO) is available. We propose the adaptive conditional gradient sliding method (AdCGS), a projection-free and line-search-free method that retains Nesterov's acceleration with adaptive stepsizes based on local Lipschitz estimates. AdCGS combines an accelerated outer scheme with an LMO-based inner routine. It reuses gradients across multiple LMO calls to reduce gradient evaluations, while controlling the subproblem inexactness via a prescribed accuracy level coupled "},"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":"2601.20443","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2026-01-28T09:57:29Z","cross_cats_sorted":[],"title_canon_sha256":"a626c7766ba2aec1c31af7ca98ececf112ab58a3c8b4abd2dee2eb8b554c45bb","abstract_canon_sha256":"469a625da5dd3f3d373a742d4841c0762c7aa67c7ac38e05c278e5ab017e1f78"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-23T00:23:37.986918Z","signature_b64":"7eb6t4q2+f6d3dJ69+/jHmCbwVrbOydC9DnJpstdX430AocrV+v21aGhPc5cEOz5zyD2ubu1NRoQa8oaXQKFCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"950034aa6ce186880a7ae6d22d2f7c63f0eb911e4a58662a22146ca7b3d40544","last_reissued_at":"2026-07-23T00:23:37.985905Z","signature_status":"signed_v1","first_computed_at":"2026-07-23T00:23:37.985905Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Adaptive Conditional Gradient Sliding: Projection-Free and Line-Search-Free Acceleration","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Shota Takahashi","submitted_at":"2026-01-28T09:57:29Z","abstract_excerpt":"We study convex optimization problems over a compact convex set where projections are expensive but a linear minimization oracle (LMO) is available. We propose the adaptive conditional gradient sliding method (AdCGS), a projection-free and line-search-free method that retains Nesterov's acceleration with adaptive stepsizes based on local Lipschitz estimates. AdCGS combines an accelerated outer scheme with an LMO-based inner routine. It reuses gradients across multiple LMO calls to reduce gradient evaluations, while controlling the subproblem inexactness via a prescribed accuracy level coupled "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2601.20443","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/2601.20443/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":"2601.20443","created_at":"2026-07-23T00:23:37.986350+00:00"},{"alias_kind":"arxiv_version","alias_value":"2601.20443v2","created_at":"2026-07-23T00:23:37.986350+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2601.20443","created_at":"2026-07-23T00:23:37.986350+00:00"},{"alias_kind":"pith_short_12","alias_value":"SUADJKTM4GDI","created_at":"2026-07-23T00:23:37.986350+00:00"},{"alias_kind":"pith_short_16","alias_value":"SUADJKTM4GDIQCT2","created_at":"2026-07-23T00:23:37.986350+00:00"},{"alias_kind":"pith_short_8","alias_value":"SUADJKTM","created_at":"2026-07-23T00:23:37.986350+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/SUADJKTM4GDIQCT243JC2L34MP","json":"https://pith.science/pith/SUADJKTM4GDIQCT243JC2L34MP.json","graph_json":"https://pith.science/api/pith-number/SUADJKTM4GDIQCT243JC2L34MP/graph.json","events_json":"https://pith.science/api/pith-number/SUADJKTM4GDIQCT243JC2L34MP/events.json","paper":"https://pith.science/paper/SUADJKTM"},"agent_actions":{"view_html":"https://pith.science/pith/SUADJKTM4GDIQCT243JC2L34MP","download_json":"https://pith.science/pith/SUADJKTM4GDIQCT243JC2L34MP.json","view_paper":"https://pith.science/paper/SUADJKTM","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2601.20443&json=true","fetch_graph":"https://pith.science/api/pith-number/SUADJKTM4GDIQCT243JC2L34MP/graph.json","fetch_events":"https://pith.science/api/pith-number/SUADJKTM4GDIQCT243JC2L34MP/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/SUADJKTM4GDIQCT243JC2L34MP/action/timestamp_anchor","attest_storage":"https://pith.science/pith/SUADJKTM4GDIQCT243JC2L34MP/action/storage_attestation","attest_author":"https://pith.science/pith/SUADJKTM4GDIQCT243JC2L34MP/action/author_attestation","sign_citation":"https://pith.science/pith/SUADJKTM4GDIQCT243JC2L34MP/action/citation_signature","submit_replication":"https://pith.science/pith/SUADJKTM4GDIQCT243JC2L34MP/action/replication_record"}},"created_at":"2026-07-23T00:23:37.986350+00:00","updated_at":"2026-07-23T00:23:37.986350+00:00"}