{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2024:WMAMKZMF2BG3TX4KFYU4SRXGDO","short_pith_number":"pith:WMAMKZMF","schema_version":"1.0","canonical_sha256":"b300c56585d04db9df8a2e29c946e61ba787ff0e4050fec8062fe49e85b497bd","source":{"kind":"arxiv","id":"2409.14957","version":2},"attestation_state":"computed","paper":{"title":"A single-loop proximal-conditional-gradient penalty method","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Hao Zhang, Liaoyuan Zeng, Ting Kei Pong","submitted_at":"2024-09-23T12:19:17Z","abstract_excerpt":"We consider the problem of minimizing a convex separable objective (as a separable sum of two proper closed convex functions $f$ and $g$) over a linear coupling constraint. We assume that $f$ can be decomposed as the sum of a smooth part having H\\\"older continuous gradient (with exponent $\\mu\\in(0,1]$) and a nonsmooth part that admits efficient proximal mapping computations, while $g$ can be decomposed as the sum of a smooth part having H\\\"older continuous gradient (with exponent $\\nu\\in(0,1]$) and a nonsmooth part that admits efficient linear oracles. Motivated by the recent works [1,49], we "},"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":"2409.14957","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2024-09-23T12:19:17Z","cross_cats_sorted":[],"title_canon_sha256":"76a41fcb3e6c1116d2b6385e30a73024073a6db85ce0a58951f781b140065169","abstract_canon_sha256":"971a313dc9b64e7a1b5baebbd4920e39d37b3d920d371da3f62ea60fd977ad36"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T11:43:57.487049Z","signature_b64":"VGjDVKVVGbvUljYypLClKXNUMMClg+s9hc9BXS/T3OlIMjpdiK71CWf4B230pDgL8Sa4A+Hk+DvrnH7pvSiWCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"b300c56585d04db9df8a2e29c946e61ba787ff0e4050fec8062fe49e85b497bd","last_reissued_at":"2026-07-05T11:43:57.486536Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T11:43:57.486536Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A single-loop proximal-conditional-gradient penalty method","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Hao Zhang, Liaoyuan Zeng, Ting Kei Pong","submitted_at":"2024-09-23T12:19:17Z","abstract_excerpt":"We consider the problem of minimizing a convex separable objective (as a separable sum of two proper closed convex functions $f$ and $g$) over a linear coupling constraint. We assume that $f$ can be decomposed as the sum of a smooth part having H\\\"older continuous gradient (with exponent $\\mu\\in(0,1]$) and a nonsmooth part that admits efficient proximal mapping computations, while $g$ can be decomposed as the sum of a smooth part having H\\\"older continuous gradient (with exponent $\\nu\\in(0,1]$) and a nonsmooth part that admits efficient linear oracles. Motivated by the recent works [1,49], we "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2409.14957","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/2409.14957/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":"2409.14957","created_at":"2026-07-05T11:43:57.486593+00:00"},{"alias_kind":"arxiv_version","alias_value":"2409.14957v2","created_at":"2026-07-05T11:43:57.486593+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2409.14957","created_at":"2026-07-05T11:43:57.486593+00:00"},{"alias_kind":"pith_short_12","alias_value":"WMAMKZMF2BG3","created_at":"2026-07-05T11:43:57.486593+00:00"},{"alias_kind":"pith_short_16","alias_value":"WMAMKZMF2BG3TX4K","created_at":"2026-07-05T11:43:57.486593+00:00"},{"alias_kind":"pith_short_8","alias_value":"WMAMKZMF","created_at":"2026-07-05T11:43:57.486593+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/WMAMKZMF2BG3TX4KFYU4SRXGDO","json":"https://pith.science/pith/WMAMKZMF2BG3TX4KFYU4SRXGDO.json","graph_json":"https://pith.science/api/pith-number/WMAMKZMF2BG3TX4KFYU4SRXGDO/graph.json","events_json":"https://pith.science/api/pith-number/WMAMKZMF2BG3TX4KFYU4SRXGDO/events.json","paper":"https://pith.science/paper/WMAMKZMF"},"agent_actions":{"view_html":"https://pith.science/pith/WMAMKZMF2BG3TX4KFYU4SRXGDO","download_json":"https://pith.science/pith/WMAMKZMF2BG3TX4KFYU4SRXGDO.json","view_paper":"https://pith.science/paper/WMAMKZMF","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2409.14957&json=true","fetch_graph":"https://pith.science/api/pith-number/WMAMKZMF2BG3TX4KFYU4SRXGDO/graph.json","fetch_events":"https://pith.science/api/pith-number/WMAMKZMF2BG3TX4KFYU4SRXGDO/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/WMAMKZMF2BG3TX4KFYU4SRXGDO/action/timestamp_anchor","attest_storage":"https://pith.science/pith/WMAMKZMF2BG3TX4KFYU4SRXGDO/action/storage_attestation","attest_author":"https://pith.science/pith/WMAMKZMF2BG3TX4KFYU4SRXGDO/action/author_attestation","sign_citation":"https://pith.science/pith/WMAMKZMF2BG3TX4KFYU4SRXGDO/action/citation_signature","submit_replication":"https://pith.science/pith/WMAMKZMF2BG3TX4KFYU4SRXGDO/action/replication_record"}},"created_at":"2026-07-05T11:43:57.486593+00:00","updated_at":"2026-07-05T11:43:57.486593+00:00"}