{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2023:NPBAOKRMANTMAJB5TEVDZRIMTM","short_pith_number":"pith:NPBAOKRM","schema_version":"1.0","canonical_sha256":"6bc2072a2c0366c0243d992a3cc50c9b1977c89e3c5ef4bd11e7a6060c3dd675","source":{"kind":"arxiv","id":"2301.10862","version":2},"attestation_state":"computed","paper":{"title":"Learning Gradients of Convex Functions with Monotone Gradient Networks","license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","headline":"","cross_cats":["math.OC"],"primary_cat":"cs.LG","authors_text":"Jos\\'e M. F. Moura, Shreyas Chaudhari, Srinivasa Pranav","submitted_at":"2023-01-25T23:04:50Z","abstract_excerpt":"While much effort has been devoted to deriving and analyzing effective convex formulations of signal processing problems, the gradients of convex functions also have critical applications ranging from gradient-based optimization to optimal transport. Recent works have explored data-driven methods for learning convex objective functions, but learning their monotone gradients is seldom studied. In this work, we propose C-MGN and M-MGN, two monotone gradient neural network architectures for directly learning the gradients of convex functions. We show that, compared to state of the art methods, ou"},"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":"2301.10862","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","primary_cat":"cs.LG","submitted_at":"2023-01-25T23:04:50Z","cross_cats_sorted":["math.OC"],"title_canon_sha256":"4632349b5160a7227b4888185a24e0dc3261560ec63a4340958a60b45ee0b1ec","abstract_canon_sha256":"19aa26b2c08ffbcc03139c86666989aa6ead0513aee50b513a84a975ba309004"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T05:52:25.731918Z","signature_b64":"wVvztpGndqnbZeWUOu7qah7ALaGP4g0IZMdME2n8dNTcDsmZcBOdFk6dMn6klIEUUbDM8DBGoxJqP/QE4vUGDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"6bc2072a2c0366c0243d992a3cc50c9b1977c89e3c5ef4bd11e7a6060c3dd675","last_reissued_at":"2026-07-05T05:52:25.731489Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T05:52:25.731489Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Learning Gradients of Convex Functions with Monotone Gradient Networks","license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","headline":"","cross_cats":["math.OC"],"primary_cat":"cs.LG","authors_text":"Jos\\'e M. F. Moura, Shreyas Chaudhari, Srinivasa Pranav","submitted_at":"2023-01-25T23:04:50Z","abstract_excerpt":"While much effort has been devoted to deriving and analyzing effective convex formulations of signal processing problems, the gradients of convex functions also have critical applications ranging from gradient-based optimization to optimal transport. Recent works have explored data-driven methods for learning convex objective functions, but learning their monotone gradients is seldom studied. In this work, we propose C-MGN and M-MGN, two monotone gradient neural network architectures for directly learning the gradients of convex functions. We show that, compared to state of the art methods, ou"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2301.10862","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/2301.10862/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":"2301.10862","created_at":"2026-07-05T05:52:25.731546+00:00"},{"alias_kind":"arxiv_version","alias_value":"2301.10862v2","created_at":"2026-07-05T05:52:25.731546+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2301.10862","created_at":"2026-07-05T05:52:25.731546+00:00"},{"alias_kind":"pith_short_12","alias_value":"NPBAOKRMANTM","created_at":"2026-07-05T05:52:25.731546+00:00"},{"alias_kind":"pith_short_16","alias_value":"NPBAOKRMANTMAJB5","created_at":"2026-07-05T05:52:25.731546+00:00"},{"alias_kind":"pith_short_8","alias_value":"NPBAOKRM","created_at":"2026-07-05T05:52:25.731546+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2508.06981","citing_title":"Structure-Preserving Digital Twins via Conditional Neural Whitney Forms","ref_index":20,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/NPBAOKRMANTMAJB5TEVDZRIMTM","json":"https://pith.science/pith/NPBAOKRMANTMAJB5TEVDZRIMTM.json","graph_json":"https://pith.science/api/pith-number/NPBAOKRMANTMAJB5TEVDZRIMTM/graph.json","events_json":"https://pith.science/api/pith-number/NPBAOKRMANTMAJB5TEVDZRIMTM/events.json","paper":"https://pith.science/paper/NPBAOKRM"},"agent_actions":{"view_html":"https://pith.science/pith/NPBAOKRMANTMAJB5TEVDZRIMTM","download_json":"https://pith.science/pith/NPBAOKRMANTMAJB5TEVDZRIMTM.json","view_paper":"https://pith.science/paper/NPBAOKRM","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2301.10862&json=true","fetch_graph":"https://pith.science/api/pith-number/NPBAOKRMANTMAJB5TEVDZRIMTM/graph.json","fetch_events":"https://pith.science/api/pith-number/NPBAOKRMANTMAJB5TEVDZRIMTM/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/NPBAOKRMANTMAJB5TEVDZRIMTM/action/timestamp_anchor","attest_storage":"https://pith.science/pith/NPBAOKRMANTMAJB5TEVDZRIMTM/action/storage_attestation","attest_author":"https://pith.science/pith/NPBAOKRMANTMAJB5TEVDZRIMTM/action/author_attestation","sign_citation":"https://pith.science/pith/NPBAOKRMANTMAJB5TEVDZRIMTM/action/citation_signature","submit_replication":"https://pith.science/pith/NPBAOKRMANTMAJB5TEVDZRIMTM/action/replication_record"}},"created_at":"2026-07-05T05:52:25.731546+00:00","updated_at":"2026-07-05T05:52:25.731546+00:00"}