{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2014:BIKR4VEWIQZZ7KNWDZS2RNNZKP","short_pith_number":"pith:BIKR4VEW","schema_version":"1.0","canonical_sha256":"0a151e549644339fa9b61e65a8b5b953d3d093ae08166023f74dffe4fc9b11df","source":{"kind":"arxiv","id":"1409.5832","version":2},"attestation_state":"computed","paper":{"title":"Efficient First-Order Methods for Linear Programming and Semidefinite Programming","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"James Renegar","submitted_at":"2014-09-19T23:37:22Z","abstract_excerpt":"We present a simple transformation of any linear program or semidefinite program into an equivalent convex optimization problem whose only constraints are linear equations. The objective function is defined on the whole space, making virtually all subgradient methods be immediately applicable. We observe, moreover, that the objective function is naturally smoothed, thereby allowing most first-order methods to be applied.\n  We develop complexity bounds in the unsmoothed case for a particular subgradient method, and in the smoothed case for Nesterov's original optimal first-order method for smoo"},"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":"1409.5832","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2014-09-19T23:37:22Z","cross_cats_sorted":[],"title_canon_sha256":"4e02529f1e5f651382509ee28d7384f0d8caa430b465db043010a7f855f83e5b","abstract_canon_sha256":"60613bb7ca7a258238d5fc02350b76d0df9a63dee1fa57394923365e87742936"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:41:03.218966Z","signature_b64":"rVt9UeoNUWH7IQNYbX+NEl664LO4eNsEXP0IFSHJzNQ7ssOqk5caulR6C9CJO3+PtWPOYCFLfI92l9Upp97FBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"0a151e549644339fa9b61e65a8b5b953d3d093ae08166023f74dffe4fc9b11df","last_reissued_at":"2026-05-18T02:41:03.218392Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:41:03.218392Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Efficient First-Order Methods for Linear Programming and Semidefinite Programming","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"James Renegar","submitted_at":"2014-09-19T23:37:22Z","abstract_excerpt":"We present a simple transformation of any linear program or semidefinite program into an equivalent convex optimization problem whose only constraints are linear equations. The objective function is defined on the whole space, making virtually all subgradient methods be immediately applicable. We observe, moreover, that the objective function is naturally smoothed, thereby allowing most first-order methods to be applied.\n  We develop complexity bounds in the unsmoothed case for a particular subgradient method, and in the smoothed case for Nesterov's original optimal first-order method for smoo"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1409.5832","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":""},"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":"1409.5832","created_at":"2026-05-18T02:41:03.218480+00:00"},{"alias_kind":"arxiv_version","alias_value":"1409.5832v2","created_at":"2026-05-18T02:41:03.218480+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1409.5832","created_at":"2026-05-18T02:41:03.218480+00:00"},{"alias_kind":"pith_short_12","alias_value":"BIKR4VEWIQZZ","created_at":"2026-05-18T12:28:22.404517+00:00"},{"alias_kind":"pith_short_16","alias_value":"BIKR4VEWIQZZ7KNW","created_at":"2026-05-18T12:28:22.404517+00:00"},{"alias_kind":"pith_short_8","alias_value":"BIKR4VEW","created_at":"2026-05-18T12:28:22.404517+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/BIKR4VEWIQZZ7KNWDZS2RNNZKP","json":"https://pith.science/pith/BIKR4VEWIQZZ7KNWDZS2RNNZKP.json","graph_json":"https://pith.science/api/pith-number/BIKR4VEWIQZZ7KNWDZS2RNNZKP/graph.json","events_json":"https://pith.science/api/pith-number/BIKR4VEWIQZZ7KNWDZS2RNNZKP/events.json","paper":"https://pith.science/paper/BIKR4VEW"},"agent_actions":{"view_html":"https://pith.science/pith/BIKR4VEWIQZZ7KNWDZS2RNNZKP","download_json":"https://pith.science/pith/BIKR4VEWIQZZ7KNWDZS2RNNZKP.json","view_paper":"https://pith.science/paper/BIKR4VEW","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1409.5832&json=true","fetch_graph":"https://pith.science/api/pith-number/BIKR4VEWIQZZ7KNWDZS2RNNZKP/graph.json","fetch_events":"https://pith.science/api/pith-number/BIKR4VEWIQZZ7KNWDZS2RNNZKP/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/BIKR4VEWIQZZ7KNWDZS2RNNZKP/action/timestamp_anchor","attest_storage":"https://pith.science/pith/BIKR4VEWIQZZ7KNWDZS2RNNZKP/action/storage_attestation","attest_author":"https://pith.science/pith/BIKR4VEWIQZZ7KNWDZS2RNNZKP/action/author_attestation","sign_citation":"https://pith.science/pith/BIKR4VEWIQZZ7KNWDZS2RNNZKP/action/citation_signature","submit_replication":"https://pith.science/pith/BIKR4VEWIQZZ7KNWDZS2RNNZKP/action/replication_record"}},"created_at":"2026-05-18T02:41:03.218480+00:00","updated_at":"2026-05-18T02:41:03.218480+00:00"}