{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2025:FOQSA6FC4XJP5HJ3LIICNHGYCL","short_pith_number":"pith:FOQSA6FC","schema_version":"1.0","canonical_sha256":"2ba12078a2e5d2fe9d3b5a10269cd812ebe16fb8ff11825e47263b0c3406b149","source":{"kind":"arxiv","id":"2509.04477","version":3},"attestation_state":"computed","paper":{"title":"Universal Representation of Generalized Convex Functions and their Gradients","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG"],"primary_cat":"math.OC","authors_text":"Moeen Nehzati","submitted_at":"2025-08-30T15:21:33Z","abstract_excerpt":"A wide range of optimization problems can often be written in terms of generalized convex functions (GCFs). When this structure is present, it can convert certain nested bilevel objectives into single-level problems amenable to standard first-order optimization methods. We provide a new differentiable layer with a convex parameter space and show (Theorems 5.1 and 5.2) that it and its gradient are universal approximators for GCFs and their gradients. We demonstrate how this parameterization can be leveraged in practice by (i) learning optimal transport maps with general cost functions and (ii) "},"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":"2509.04477","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2025-08-30T15:21:33Z","cross_cats_sorted":["cs.LG"],"title_canon_sha256":"64ebe4c13627afac2a1fa24b83e056896707f6fce54bdf3f4b7516898386706e","abstract_canon_sha256":"8bc5037675b247197e12057246d494a833829972c029e0f901c43e166ca431aa"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:10:12.297857Z","signature_b64":"FXIcpDgCiKNL8w+pvxlcaFzip7vwoYM/6q1LVcJ6nfTGI1kzr8M+jMRRN7q+OZbTG2T5WiWpx4wJed11wjtxDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"2ba12078a2e5d2fe9d3b5a10269cd812ebe16fb8ff11825e47263b0c3406b149","last_reissued_at":"2026-05-18T03:10:12.297234Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:10:12.297234Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Universal Representation of Generalized Convex Functions and their Gradients","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG"],"primary_cat":"math.OC","authors_text":"Moeen Nehzati","submitted_at":"2025-08-30T15:21:33Z","abstract_excerpt":"A wide range of optimization problems can often be written in terms of generalized convex functions (GCFs). When this structure is present, it can convert certain nested bilevel objectives into single-level problems amenable to standard first-order optimization methods. We provide a new differentiable layer with a convex parameter space and show (Theorems 5.1 and 5.2) that it and its gradient are universal approximators for GCFs and their gradients. We demonstrate how this parameterization can be leveraged in practice by (i) learning optimal transport maps with general cost functions and (ii) "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2509.04477","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":"2509.04477","created_at":"2026-05-18T03:10:12.297343+00:00"},{"alias_kind":"arxiv_version","alias_value":"2509.04477v3","created_at":"2026-05-18T03:10:12.297343+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2509.04477","created_at":"2026-05-18T03:10:12.297343+00:00"},{"alias_kind":"pith_short_12","alias_value":"FOQSA6FC4XJP","created_at":"2026-05-18T12:33:37.589309+00:00"},{"alias_kind":"pith_short_16","alias_value":"FOQSA6FC4XJP5HJ3","created_at":"2026-05-18T12:33:37.589309+00:00"},{"alias_kind":"pith_short_8","alias_value":"FOQSA6FC","created_at":"2026-05-18T12:33:37.589309+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/FOQSA6FC4XJP5HJ3LIICNHGYCL","json":"https://pith.science/pith/FOQSA6FC4XJP5HJ3LIICNHGYCL.json","graph_json":"https://pith.science/api/pith-number/FOQSA6FC4XJP5HJ3LIICNHGYCL/graph.json","events_json":"https://pith.science/api/pith-number/FOQSA6FC4XJP5HJ3LIICNHGYCL/events.json","paper":"https://pith.science/paper/FOQSA6FC"},"agent_actions":{"view_html":"https://pith.science/pith/FOQSA6FC4XJP5HJ3LIICNHGYCL","download_json":"https://pith.science/pith/FOQSA6FC4XJP5HJ3LIICNHGYCL.json","view_paper":"https://pith.science/paper/FOQSA6FC","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2509.04477&json=true","fetch_graph":"https://pith.science/api/pith-number/FOQSA6FC4XJP5HJ3LIICNHGYCL/graph.json","fetch_events":"https://pith.science/api/pith-number/FOQSA6FC4XJP5HJ3LIICNHGYCL/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/FOQSA6FC4XJP5HJ3LIICNHGYCL/action/timestamp_anchor","attest_storage":"https://pith.science/pith/FOQSA6FC4XJP5HJ3LIICNHGYCL/action/storage_attestation","attest_author":"https://pith.science/pith/FOQSA6FC4XJP5HJ3LIICNHGYCL/action/author_attestation","sign_citation":"https://pith.science/pith/FOQSA6FC4XJP5HJ3LIICNHGYCL/action/citation_signature","submit_replication":"https://pith.science/pith/FOQSA6FC4XJP5HJ3LIICNHGYCL/action/replication_record"}},"created_at":"2026-05-18T03:10:12.297343+00:00","updated_at":"2026-05-18T03:10:12.297343+00:00"}