{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:2MEBOHQXLEREOXIXNBIERTPRXA","short_pith_number":"pith:2MEBOHQX","schema_version":"1.0","canonical_sha256":"d308171e175922475d17685048cdf1b82283fc8144dcf8ec78f86f35a59d3bd8","source":{"kind":"arxiv","id":"1511.04815","version":1},"attestation_state":"computed","paper":{"title":"Convex programming with fast proximal and linear operators","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"J. Zico Kolter, Matt Wytock, Po-Wei Wang","submitted_at":"2015-11-16T04:00:16Z","abstract_excerpt":"We present Epsilon, a system for general convex programming using fast linear and proximal operators. As with existing convex programming frameworks, users specify convex optimization problems using a natural grammar for mathematical expressions, composing functions in a way that is guaranteed to be convex by the rules of disciplined convex programming. Given such an input, the Epsilon compiler transforms the optimization problem into a mathematically equivalent form consisting only of functions with efficient proximal operators---an intermediate representation we refer to as prox-affine form."},"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":"1511.04815","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2015-11-16T04:00:16Z","cross_cats_sorted":[],"title_canon_sha256":"02d4b414a6f1594105a4ece0d8f7e3ea88f399c42b0dabd3e4352e648e1ce120","abstract_canon_sha256":"a469a0765d0d723b758ca3fc8bcb60d9334fe1266e254d780b76e81364efbefb"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:26:51.543416Z","signature_b64":"XWp/FvOfkeO7QlFSRiLN3PZ3L9B8k24mHLwykrKWEJ2J/0yeN7U8V/I7pz4o25LP4vCqHWuCMDIYFwWQL0tGCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"d308171e175922475d17685048cdf1b82283fc8144dcf8ec78f86f35a59d3bd8","last_reissued_at":"2026-05-18T01:26:51.542741Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:26:51.542741Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Convex programming with fast proximal and linear operators","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"J. Zico Kolter, Matt Wytock, Po-Wei Wang","submitted_at":"2015-11-16T04:00:16Z","abstract_excerpt":"We present Epsilon, a system for general convex programming using fast linear and proximal operators. As with existing convex programming frameworks, users specify convex optimization problems using a natural grammar for mathematical expressions, composing functions in a way that is guaranteed to be convex by the rules of disciplined convex programming. Given such an input, the Epsilon compiler transforms the optimization problem into a mathematically equivalent form consisting only of functions with efficient proximal operators---an intermediate representation we refer to as prox-affine form."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1511.04815","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":"1511.04815","created_at":"2026-05-18T01:26:51.542840+00:00"},{"alias_kind":"arxiv_version","alias_value":"1511.04815v1","created_at":"2026-05-18T01:26:51.542840+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1511.04815","created_at":"2026-05-18T01:26:51.542840+00:00"},{"alias_kind":"pith_short_12","alias_value":"2MEBOHQXLERE","created_at":"2026-05-18T12:29:02.477457+00:00"},{"alias_kind":"pith_short_16","alias_value":"2MEBOHQXLEREOXIX","created_at":"2026-05-18T12:29:02.477457+00:00"},{"alias_kind":"pith_short_8","alias_value":"2MEBOHQX","created_at":"2026-05-18T12:29:02.477457+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/2MEBOHQXLEREOXIXNBIERTPRXA","json":"https://pith.science/pith/2MEBOHQXLEREOXIXNBIERTPRXA.json","graph_json":"https://pith.science/api/pith-number/2MEBOHQXLEREOXIXNBIERTPRXA/graph.json","events_json":"https://pith.science/api/pith-number/2MEBOHQXLEREOXIXNBIERTPRXA/events.json","paper":"https://pith.science/paper/2MEBOHQX"},"agent_actions":{"view_html":"https://pith.science/pith/2MEBOHQXLEREOXIXNBIERTPRXA","download_json":"https://pith.science/pith/2MEBOHQXLEREOXIXNBIERTPRXA.json","view_paper":"https://pith.science/paper/2MEBOHQX","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1511.04815&json=true","fetch_graph":"https://pith.science/api/pith-number/2MEBOHQXLEREOXIXNBIERTPRXA/graph.json","fetch_events":"https://pith.science/api/pith-number/2MEBOHQXLEREOXIXNBIERTPRXA/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/2MEBOHQXLEREOXIXNBIERTPRXA/action/timestamp_anchor","attest_storage":"https://pith.science/pith/2MEBOHQXLEREOXIXNBIERTPRXA/action/storage_attestation","attest_author":"https://pith.science/pith/2MEBOHQXLEREOXIXNBIERTPRXA/action/author_attestation","sign_citation":"https://pith.science/pith/2MEBOHQXLEREOXIXNBIERTPRXA/action/citation_signature","submit_replication":"https://pith.science/pith/2MEBOHQXLEREOXIXNBIERTPRXA/action/replication_record"}},"created_at":"2026-05-18T01:26:51.542840+00:00","updated_at":"2026-05-18T01:26:51.542840+00:00"}