{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2019:IFRRVUYRCZ6VNKAGZELHDU5SX7","short_pith_number":"pith:IFRRVUYR","schema_version":"1.0","canonical_sha256":"41631ad311167d56a806c91671d3b2bfdb566666c352c80e166272d78a00f04f","source":{"kind":"arxiv","id":"1906.10107","version":1},"attestation_state":"computed","paper":{"title":"Primal-dual fast gradient method with a model","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Alexander Tyurin","submitted_at":"2019-06-24T17:48:37Z","abstract_excerpt":"In this work we consider a possibility to use the conception of $(\\delta, L)$-model of a function for optimization tasks, whereby solving a primal problem there is a necessity to recover a solution of a dual problem. The conception of $(\\delta, L)$-model is based on the conception of $(\\delta, L)$-oracle which was proposed by Devolder-Glineur-Nesterov, herewith the authors proposed approximate a function with an upper bound using a convex quadratic function with some additive noise $\\delta$. They managed to get convex quadratic upper bounds with noise even for nonsmooth functions. The concepti"},"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":"1906.10107","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2019-06-24T17:48:37Z","cross_cats_sorted":[],"title_canon_sha256":"3967aed0477e9dcb2004ab7a10a6b32f3201c33b3fde7cdf5eb36eb2247d883d","abstract_canon_sha256":"28246b37f1c0397192c2c2a48fff0dc13c8793c937e3a2bac3d0f4793c43e18c"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:42:35.411865Z","signature_b64":"nVX+TcSrvLUMV7bOgbWyGd9AYcWNYI5xI2sOl4UrYq/EwFvWHSwkBTlq3y+3M4gJF/ccruXHnCNQ+cdDsDLiBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"41631ad311167d56a806c91671d3b2bfdb566666c352c80e166272d78a00f04f","last_reissued_at":"2026-05-17T23:42:35.411146Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:42:35.411146Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Primal-dual fast gradient method with a model","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Alexander Tyurin","submitted_at":"2019-06-24T17:48:37Z","abstract_excerpt":"In this work we consider a possibility to use the conception of $(\\delta, L)$-model of a function for optimization tasks, whereby solving a primal problem there is a necessity to recover a solution of a dual problem. The conception of $(\\delta, L)$-model is based on the conception of $(\\delta, L)$-oracle which was proposed by Devolder-Glineur-Nesterov, herewith the authors proposed approximate a function with an upper bound using a convex quadratic function with some additive noise $\\delta$. They managed to get convex quadratic upper bounds with noise even for nonsmooth functions. The concepti"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1906.10107","kind":"arxiv","version":1},"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":"1906.10107","created_at":"2026-05-17T23:42:35.411262+00:00"},{"alias_kind":"arxiv_version","alias_value":"1906.10107v1","created_at":"2026-05-17T23:42:35.411262+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1906.10107","created_at":"2026-05-17T23:42:35.411262+00:00"},{"alias_kind":"pith_short_12","alias_value":"IFRRVUYRCZ6V","created_at":"2026-05-18T12:33:18.533446+00:00"},{"alias_kind":"pith_short_16","alias_value":"IFRRVUYRCZ6VNKAG","created_at":"2026-05-18T12:33:18.533446+00:00"},{"alias_kind":"pith_short_8","alias_value":"IFRRVUYR","created_at":"2026-05-18T12:33:18.533446+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/IFRRVUYRCZ6VNKAGZELHDU5SX7","json":"https://pith.science/pith/IFRRVUYRCZ6VNKAGZELHDU5SX7.json","graph_json":"https://pith.science/api/pith-number/IFRRVUYRCZ6VNKAGZELHDU5SX7/graph.json","events_json":"https://pith.science/api/pith-number/IFRRVUYRCZ6VNKAGZELHDU5SX7/events.json","paper":"https://pith.science/paper/IFRRVUYR"},"agent_actions":{"view_html":"https://pith.science/pith/IFRRVUYRCZ6VNKAGZELHDU5SX7","download_json":"https://pith.science/pith/IFRRVUYRCZ6VNKAGZELHDU5SX7.json","view_paper":"https://pith.science/paper/IFRRVUYR","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1906.10107&json=true","fetch_graph":"https://pith.science/api/pith-number/IFRRVUYRCZ6VNKAGZELHDU5SX7/graph.json","fetch_events":"https://pith.science/api/pith-number/IFRRVUYRCZ6VNKAGZELHDU5SX7/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/IFRRVUYRCZ6VNKAGZELHDU5SX7/action/timestamp_anchor","attest_storage":"https://pith.science/pith/IFRRVUYRCZ6VNKAGZELHDU5SX7/action/storage_attestation","attest_author":"https://pith.science/pith/IFRRVUYRCZ6VNKAGZELHDU5SX7/action/author_attestation","sign_citation":"https://pith.science/pith/IFRRVUYRCZ6VNKAGZELHDU5SX7/action/citation_signature","submit_replication":"https://pith.science/pith/IFRRVUYRCZ6VNKAGZELHDU5SX7/action/replication_record"}},"created_at":"2026-05-17T23:42:35.411262+00:00","updated_at":"2026-05-17T23:42:35.411262+00:00"}