{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2023:N2RDSONHSL2CJM64UJTNC43YZL","short_pith_number":"pith:N2RDSONH","canonical_record":{"source":{"id":"2305.04917","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2023-05-08T17:53:13Z","cross_cats_sorted":[],"title_canon_sha256":"75c679e51823384b23560849c5b3910d79782744dd124eb6a4f90dd4807adba6","abstract_canon_sha256":"b1461ce938ab37d38b335b9fa3039953f9cc6e8f0ce6c963b3d1eae815abd9d9"},"schema_version":"1.0"},"canonical_sha256":"6ea23939a792f424b3dca266d17378cacd62ebe90df1fbb8edf7cfd317f9bd76","source":{"kind":"arxiv","id":"2305.04917","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2305.04917","created_at":"2026-07-05T06:19:40Z"},{"alias_kind":"arxiv_version","alias_value":"2305.04917v2","created_at":"2026-07-05T06:19:40Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2305.04917","created_at":"2026-07-05T06:19:40Z"},{"alias_kind":"pith_short_12","alias_value":"N2RDSONHSL2C","created_at":"2026-07-05T06:19:40Z"},{"alias_kind":"pith_short_16","alias_value":"N2RDSONHSL2CJM64","created_at":"2026-07-05T06:19:40Z"},{"alias_kind":"pith_short_8","alias_value":"N2RDSONH","created_at":"2026-07-05T06:19:40Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2023:N2RDSONHSL2CJM64UJTNC43YZL","target":"record","payload":{"canonical_record":{"source":{"id":"2305.04917","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2023-05-08T17:53:13Z","cross_cats_sorted":[],"title_canon_sha256":"75c679e51823384b23560849c5b3910d79782744dd124eb6a4f90dd4807adba6","abstract_canon_sha256":"b1461ce938ab37d38b335b9fa3039953f9cc6e8f0ce6c963b3d1eae815abd9d9"},"schema_version":"1.0"},"canonical_sha256":"6ea23939a792f424b3dca266d17378cacd62ebe90df1fbb8edf7cfd317f9bd76","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T06:19:40.939586Z","signature_b64":"R0h0U8bk1ciy4XKyosKyIbfIPOHDFxs+sdgECOqabyF2w6hgfp9u43r6jB9fKtstbJqHuSNeIoc66cGBBoJlAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"6ea23939a792f424b3dca266d17378cacd62ebe90df1fbb8edf7cfd317f9bd76","last_reissued_at":"2026-07-05T06:19:40.939138Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T06:19:40.939138Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2305.04917","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-05T06:19:40Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"maVLwwOj38jK6TkUj19afsrRh1jI2KEQwPZZh5/SZfJaIP+x3CQIsYu4jfO+KQLfGdygMNAZWwQtc0D1FXgoBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-08T11:24:59.236483Z"},"content_sha256":"1b68bbf80d019db6109cf05a21f6bb52ce91eea9d9723048665f9e23832c025a","schema_version":"1.0","event_id":"sha256:1b68bbf80d019db6109cf05a21f6bb52ce91eea9d9723048665f9e23832c025a"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2023:N2RDSONHSL2CJM64UJTNC43YZL","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Gradient descent with a general cost","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Flavien L\\'eger, Pierre-Cyril Aubin-Frankowski","submitted_at":"2023-05-08T17:53:13Z","abstract_excerpt":"We present a new class of gradient-type optimization methods that extends vanilla gradient descent, mirror descent, Riemannian gradient descent, and natural gradient descent. Our approach involves constructing a surrogate for the objective function in a systematic manner, based on a chosen cost function. This surrogate is then minimized using an alternating minimization scheme. Using optimal transport theory we establish convergence rates based on generalized notions of smoothness and convexity. We provide local versions of these two notions when the cost satisfies a condition known as nonnega"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2305.04917","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/2305.04917/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-05T06:19:40Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"u1ASSdvA/x4sd/LqWPbjtYqZy7fpG9Y84AjPcoSgGxljuA2TuNyPLzKySvE/SD/EJSsFyVuJDhMYskOqeDrcAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-08T11:24:59.237009Z"},"content_sha256":"03dcd24852c26cace0a0ba19506abb1ae756117401bbdec8db5a47170efd1aa0","schema_version":"1.0","event_id":"sha256:03dcd24852c26cace0a0ba19506abb1ae756117401bbdec8db5a47170efd1aa0"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/N2RDSONHSL2CJM64UJTNC43YZL/bundle.json","state_url":"https://pith.science/pith/N2RDSONHSL2CJM64UJTNC43YZL/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/N2RDSONHSL2CJM64UJTNC43YZL/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-08T11:24:59Z","links":{"resolver":"https://pith.science/pith/N2RDSONHSL2CJM64UJTNC43YZL","bundle":"https://pith.science/pith/N2RDSONHSL2CJM64UJTNC43YZL/bundle.json","state":"https://pith.science/pith/N2RDSONHSL2CJM64UJTNC43YZL/state.json","well_known_bundle":"https://pith.science/.well-known/pith/N2RDSONHSL2CJM64UJTNC43YZL/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2023:N2RDSONHSL2CJM64UJTNC43YZL","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":"b1461ce938ab37d38b335b9fa3039953f9cc6e8f0ce6c963b3d1eae815abd9d9","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2023-05-08T17:53:13Z","title_canon_sha256":"75c679e51823384b23560849c5b3910d79782744dd124eb6a4f90dd4807adba6"},"schema_version":"1.0","source":{"id":"2305.04917","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2305.04917","created_at":"2026-07-05T06:19:40Z"},{"alias_kind":"arxiv_version","alias_value":"2305.04917v2","created_at":"2026-07-05T06:19:40Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2305.04917","created_at":"2026-07-05T06:19:40Z"},{"alias_kind":"pith_short_12","alias_value":"N2RDSONHSL2C","created_at":"2026-07-05T06:19:40Z"},{"alias_kind":"pith_short_16","alias_value":"N2RDSONHSL2CJM64","created_at":"2026-07-05T06:19:40Z"},{"alias_kind":"pith_short_8","alias_value":"N2RDSONH","created_at":"2026-07-05T06:19:40Z"}],"graph_snapshots":[{"event_id":"sha256:03dcd24852c26cace0a0ba19506abb1ae756117401bbdec8db5a47170efd1aa0","target":"graph","created_at":"2026-07-05T06:19:40Z","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/2305.04917/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"We present a new class of gradient-type optimization methods that extends vanilla gradient descent, mirror descent, Riemannian gradient descent, and natural gradient descent. Our approach involves constructing a surrogate for the objective function in a systematic manner, based on a chosen cost function. This surrogate is then minimized using an alternating minimization scheme. Using optimal transport theory we establish convergence rates based on generalized notions of smoothness and convexity. We provide local versions of these two notions when the cost satisfies a condition known as nonnega","authors_text":"Flavien L\\'eger, Pierre-Cyril Aubin-Frankowski","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2023-05-08T17:53:13Z","title":"Gradient descent with a general cost"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2305.04917","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:1b68bbf80d019db6109cf05a21f6bb52ce91eea9d9723048665f9e23832c025a","target":"record","created_at":"2026-07-05T06:19:40Z","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":"b1461ce938ab37d38b335b9fa3039953f9cc6e8f0ce6c963b3d1eae815abd9d9","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2023-05-08T17:53:13Z","title_canon_sha256":"75c679e51823384b23560849c5b3910d79782744dd124eb6a4f90dd4807adba6"},"schema_version":"1.0","source":{"id":"2305.04917","kind":"arxiv","version":2}},"canonical_sha256":"6ea23939a792f424b3dca266d17378cacd62ebe90df1fbb8edf7cfd317f9bd76","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"6ea23939a792f424b3dca266d17378cacd62ebe90df1fbb8edf7cfd317f9bd76","first_computed_at":"2026-07-05T06:19:40.939138Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T06:19:40.939138Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"R0h0U8bk1ciy4XKyosKyIbfIPOHDFxs+sdgECOqabyF2w6hgfp9u43r6jB9fKtstbJqHuSNeIoc66cGBBoJlAw==","signature_status":"signed_v1","signed_at":"2026-07-05T06:19:40.939586Z","signed_message":"canonical_sha256_bytes"},"source_id":"2305.04917","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:1b68bbf80d019db6109cf05a21f6bb52ce91eea9d9723048665f9e23832c025a","sha256:03dcd24852c26cace0a0ba19506abb1ae756117401bbdec8db5a47170efd1aa0"],"state_sha256":"6c544b600adde7147378b42d1ed54966cdc00c23e3f8b135c57229fdc39ce38d"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"kHykYnH0Bwin3wMdspDLEdb3+LKlbPdLLf5g32VtJdcT9b4HiDV/2DnmI4guSn09eWYNxnA/yRSxlVyicJbCDQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-08T11:24:59.241132Z","bundle_sha256":"d50fc209ceb575f87e05a80394208957fc1a10a17843e01158f4429993b78a20"}}