{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2026:SUADJKTM4GDIQCT243JC2L34MP","short_pith_number":"pith:SUADJKTM","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"},"canonical_sha256":"950034aa6ce186880a7ae6d22d2f7c63f0eb911e4a58662a22146ca7b3d40544","source":{"kind":"arxiv","id":"2601.20443","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2601.20443","created_at":"2026-07-23T00:23:37Z"},{"alias_kind":"arxiv_version","alias_value":"2601.20443v2","created_at":"2026-07-23T00:23:37Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2601.20443","created_at":"2026-07-23T00:23:37Z"},{"alias_kind":"pith_short_12","alias_value":"SUADJKTM4GDI","created_at":"2026-07-23T00:23:37Z"},{"alias_kind":"pith_short_16","alias_value":"SUADJKTM4GDIQCT2","created_at":"2026-07-23T00:23:37Z"},{"alias_kind":"pith_short_8","alias_value":"SUADJKTM","created_at":"2026-07-23T00:23:37Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2026:SUADJKTM4GDIQCT243JC2L34MP","target":"record","payload":{"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"},"canonical_sha256":"950034aa6ce186880a7ae6d22d2f7c63f0eb911e4a58662a22146ca7b3d40544","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"},"source_kind":"arxiv","source_id":"2601.20443","source_version":2,"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-23T00:23:37Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"C7GwrLWL0q/icuWVN8Pfxj7TJSTrS65h04JdXVBEFVbd6jzW2lfNrABCaO0feDw3Rfw0LJXP0NrUP29KpCh2AQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-19T12:33:50.697512Z"},"content_sha256":"098c80d93051d8c346a35dcc8d1437be981fe1bdb9920fc54889757c8a44c2cd","schema_version":"1.0","event_id":"sha256:098c80d93051d8c346a35dcc8d1437be981fe1bdb9920fc54889757c8a44c2cd"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2026:SUADJKTM4GDIQCT243JC2L34MP","target":"graph","payload":{"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"},"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-23T00:23:37Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ybrtK0p/Doeea5QP4+uUQrmkbt4ebnzjh+LaT6RY4TOVIEdzQDtj9FTpd2InvFX58Py4YZi4qAnYHY9QQ+RgAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-19T12:33:50.698023Z"},"content_sha256":"36b1f5514613a37433b1fa805dfe11b2fdd0a7e26221fd80e8a213a5ffcf1a35","schema_version":"1.0","event_id":"sha256:36b1f5514613a37433b1fa805dfe11b2fdd0a7e26221fd80e8a213a5ffcf1a35"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/SUADJKTM4GDIQCT243JC2L34MP/bundle.json","state_url":"https://pith.science/pith/SUADJKTM4GDIQCT243JC2L34MP/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/SUADJKTM4GDIQCT243JC2L34MP/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-19T12:33:50Z","links":{"resolver":"https://pith.science/pith/SUADJKTM4GDIQCT243JC2L34MP","bundle":"https://pith.science/pith/SUADJKTM4GDIQCT243JC2L34MP/bundle.json","state":"https://pith.science/pith/SUADJKTM4GDIQCT243JC2L34MP/state.json","well_known_bundle":"https://pith.science/.well-known/pith/SUADJKTM4GDIQCT243JC2L34MP/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2026:SUADJKTM4GDIQCT243JC2L34MP","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":"469a625da5dd3f3d373a742d4841c0762c7aa67c7ac38e05c278e5ab017e1f78","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2026-01-28T09:57:29Z","title_canon_sha256":"a626c7766ba2aec1c31af7ca98ececf112ab58a3c8b4abd2dee2eb8b554c45bb"},"schema_version":"1.0","source":{"id":"2601.20443","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2601.20443","created_at":"2026-07-23T00:23:37Z"},{"alias_kind":"arxiv_version","alias_value":"2601.20443v2","created_at":"2026-07-23T00:23:37Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2601.20443","created_at":"2026-07-23T00:23:37Z"},{"alias_kind":"pith_short_12","alias_value":"SUADJKTM4GDI","created_at":"2026-07-23T00:23:37Z"},{"alias_kind":"pith_short_16","alias_value":"SUADJKTM4GDIQCT2","created_at":"2026-07-23T00:23:37Z"},{"alias_kind":"pith_short_8","alias_value":"SUADJKTM","created_at":"2026-07-23T00:23:37Z"}],"graph_snapshots":[{"event_id":"sha256:36b1f5514613a37433b1fa805dfe11b2fdd0a7e26221fd80e8a213a5ffcf1a35","target":"graph","created_at":"2026-07-23T00:23:37Z","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/2601.20443/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"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 ","authors_text":"Shota Takahashi","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2026-01-28T09:57:29Z","title":"Adaptive Conditional Gradient Sliding: Projection-Free and Line-Search-Free Acceleration"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2601.20443","kind":"arxiv","version":2},"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:098c80d93051d8c346a35dcc8d1437be981fe1bdb9920fc54889757c8a44c2cd","target":"record","created_at":"2026-07-23T00:23:37Z","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":"469a625da5dd3f3d373a742d4841c0762c7aa67c7ac38e05c278e5ab017e1f78","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2026-01-28T09:57:29Z","title_canon_sha256":"a626c7766ba2aec1c31af7ca98ececf112ab58a3c8b4abd2dee2eb8b554c45bb"},"schema_version":"1.0","source":{"id":"2601.20443","kind":"arxiv","version":2}},"canonical_sha256":"950034aa6ce186880a7ae6d22d2f7c63f0eb911e4a58662a22146ca7b3d40544","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"950034aa6ce186880a7ae6d22d2f7c63f0eb911e4a58662a22146ca7b3d40544","first_computed_at":"2026-07-23T00:23:37.985905Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-23T00:23:37.985905Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"7eb6t4q2+f6d3dJ69+/jHmCbwVrbOydC9DnJpstdX430AocrV+v21aGhPc5cEOz5zyD2ubu1NRoQa8oaXQKFCg==","signature_status":"signed_v1","signed_at":"2026-07-23T00:23:37.986918Z","signed_message":"canonical_sha256_bytes"},"source_id":"2601.20443","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:098c80d93051d8c346a35dcc8d1437be981fe1bdb9920fc54889757c8a44c2cd","sha256:36b1f5514613a37433b1fa805dfe11b2fdd0a7e26221fd80e8a213a5ffcf1a35"],"state_sha256":"6302c51ef8d93512bb62eeb059572eb690ef09cbdcd89aaac452d478d4fd7fae"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"kM4Fe3flmCpXLRAORoJ4207Bv3Z52PX+xVmmgCm5/XaaRvqMq6wN2amrTYS64jR1ErUy3cDFQocjr0gau21LDw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-19T12:33:50.702052Z","bundle_sha256":"396e3337c672988f5dd0c9b29e98ffb04f4137e832deea3fecbea9c5c96785cd"}}