{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2013:RVKMCA4PBLGMTZONP7OTCO3K6T","short_pith_number":"pith:RVKMCA4P","schema_version":"1.0","canonical_sha256":"8d54c1038f0accc9e5cd7fdd313b6af4dd79f28880f4e5c79711c6721120dac8","source":{"kind":"arxiv","id":"1301.0465","version":3},"attestation_state":"computed","paper":{"title":"An Optimal Affine Invariant Smooth Minimization Algorithm","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Alexandre d'Aspremont, Crist\\'obal Guzm\\'an, Martin Jaggi","submitted_at":"2013-01-03T14:28:32Z","abstract_excerpt":"We formulate an affine invariant implementation of the accelerated first-order algorithm in Nesterov (1983). Its complexity bound is proportional to an affine invariant regularity constant defined with respect to the Minkowski gauge of the feasible set. We extend these results to more general problems, optimizing H\\\"older smooth functions using $p$-uniformly convex prox terms, and derive an algorithm whose complexity better fits the geometry of the feasible set and adapts to both the best H\\\"older smoothness parameter and the best gradient Lipschitz constant. Finally, we detail matching comple"},"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":"1301.0465","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2013-01-03T14:28:32Z","cross_cats_sorted":[],"title_canon_sha256":"92f9345de59db66b71d096714bccca7849a34cea79c0db2de46c1c6019fd68d4","abstract_canon_sha256":"4aabe3a85891a74e9db09ed23ae4afeb756a5495fa5db4c38243bb92306261be"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:56:36.404057Z","signature_b64":"kfgSOXYQN8uazd00bae1w3TkFP7tS5U9ql3wSXlTCp9Uoi95fPasJndBdrRkH5lSDQds+70HjT4RAhZXmROgCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"8d54c1038f0accc9e5cd7fdd313b6af4dd79f28880f4e5c79711c6721120dac8","last_reissued_at":"2026-05-18T00:56:36.403406Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:56:36.403406Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"An Optimal Affine Invariant Smooth Minimization Algorithm","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Alexandre d'Aspremont, Crist\\'obal Guzm\\'an, Martin Jaggi","submitted_at":"2013-01-03T14:28:32Z","abstract_excerpt":"We formulate an affine invariant implementation of the accelerated first-order algorithm in Nesterov (1983). Its complexity bound is proportional to an affine invariant regularity constant defined with respect to the Minkowski gauge of the feasible set. We extend these results to more general problems, optimizing H\\\"older smooth functions using $p$-uniformly convex prox terms, and derive an algorithm whose complexity better fits the geometry of the feasible set and adapts to both the best H\\\"older smoothness parameter and the best gradient Lipschitz constant. Finally, we detail matching comple"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1301.0465","kind":"arxiv","version":3},"verdict":{"id":null,"model_set":{},"created_at":null,"strongest_claim":"","one_line_summary":"","pipeline_version":null,"weakest_assumption":"","pith_extraction_headline":""},"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":"1301.0465","created_at":"2026-05-18T00:56:36.403507+00:00"},{"alias_kind":"arxiv_version","alias_value":"1301.0465v3","created_at":"2026-05-18T00:56:36.403507+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1301.0465","created_at":"2026-05-18T00:56:36.403507+00:00"},{"alias_kind":"pith_short_12","alias_value":"RVKMCA4PBLGM","created_at":"2026-05-18T12:27:59.945178+00:00"},{"alias_kind":"pith_short_16","alias_value":"RVKMCA4PBLGMTZON","created_at":"2026-05-18T12:27:59.945178+00:00"},{"alias_kind":"pith_short_8","alias_value":"RVKMCA4P","created_at":"2026-05-18T12:27:59.945178+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/RVKMCA4PBLGMTZONP7OTCO3K6T","json":"https://pith.science/pith/RVKMCA4PBLGMTZONP7OTCO3K6T.json","graph_json":"https://pith.science/api/pith-number/RVKMCA4PBLGMTZONP7OTCO3K6T/graph.json","events_json":"https://pith.science/api/pith-number/RVKMCA4PBLGMTZONP7OTCO3K6T/events.json","paper":"https://pith.science/paper/RVKMCA4P"},"agent_actions":{"view_html":"https://pith.science/pith/RVKMCA4PBLGMTZONP7OTCO3K6T","download_json":"https://pith.science/pith/RVKMCA4PBLGMTZONP7OTCO3K6T.json","view_paper":"https://pith.science/paper/RVKMCA4P","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1301.0465&json=true","fetch_graph":"https://pith.science/api/pith-number/RVKMCA4PBLGMTZONP7OTCO3K6T/graph.json","fetch_events":"https://pith.science/api/pith-number/RVKMCA4PBLGMTZONP7OTCO3K6T/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/RVKMCA4PBLGMTZONP7OTCO3K6T/action/timestamp_anchor","attest_storage":"https://pith.science/pith/RVKMCA4PBLGMTZONP7OTCO3K6T/action/storage_attestation","attest_author":"https://pith.science/pith/RVKMCA4PBLGMTZONP7OTCO3K6T/action/author_attestation","sign_citation":"https://pith.science/pith/RVKMCA4PBLGMTZONP7OTCO3K6T/action/citation_signature","submit_replication":"https://pith.science/pith/RVKMCA4PBLGMTZONP7OTCO3K6T/action/replication_record"}},"created_at":"2026-05-18T00:56:36.403507+00:00","updated_at":"2026-05-18T00:56:36.403507+00:00"}