{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:Y3XIMYCJFLLX7YGT7F7J7KT3TT","short_pith_number":"pith:Y3XIMYCJ","schema_version":"1.0","canonical_sha256":"c6ee8660492ad77fe0d3f97e9faa7b9cd197503901730e4498c59e76cce357fa","source":{"kind":"arxiv","id":"1512.07569","version":3},"attestation_state":"computed","paper":{"title":"Accelerated First-Order Methods for Hyperbolic Programming","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"James Renegar","submitted_at":"2015-12-23T18:16:33Z","abstract_excerpt":"A framework is developed for applying accelerated methods to general hyperbolic programming, including linear, second-order cone, and semidefinite programming as special cases. The approach replaces a hyperbolic program with a convex optimization problem whose smooth objective function is explicit, and for which the only constraints are linear equations (one more linear equation than for the original problem). Virtually any first-order method can be applied. Iteration bounds for a representative accelerated method are derived."},"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":"1512.07569","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2015-12-23T18:16:33Z","cross_cats_sorted":[],"title_canon_sha256":"8c187e97b78c60c7cee8f4f332ddb30d6f9de1866eb0f9b45790666afd85dd45","abstract_canon_sha256":"929225662dbb796cf545e16f6a42fd985c3a1e9bb697e4ab792b71c41567c17e"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:43:35.953139Z","signature_b64":"7uqIqklHVi/F+mcqtAIBKBnSvuKLvB4/MkpdDfm+/pXqP0mMu9f/QVdCR7Q3R1HdllD1ptET7493sqxSd2tpBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"c6ee8660492ad77fe0d3f97e9faa7b9cd197503901730e4498c59e76cce357fa","last_reissued_at":"2026-05-18T00:43:35.952737Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:43:35.952737Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Accelerated First-Order Methods for Hyperbolic Programming","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"James Renegar","submitted_at":"2015-12-23T18:16:33Z","abstract_excerpt":"A framework is developed for applying accelerated methods to general hyperbolic programming, including linear, second-order cone, and semidefinite programming as special cases. The approach replaces a hyperbolic program with a convex optimization problem whose smooth objective function is explicit, and for which the only constraints are linear equations (one more linear equation than for the original problem). Virtually any first-order method can be applied. Iteration bounds for a representative accelerated method are derived."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1512.07569","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":"1512.07569","created_at":"2026-05-18T00:43:35.952797+00:00"},{"alias_kind":"arxiv_version","alias_value":"1512.07569v3","created_at":"2026-05-18T00:43:35.952797+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1512.07569","created_at":"2026-05-18T00:43:35.952797+00:00"},{"alias_kind":"pith_short_12","alias_value":"Y3XIMYCJFLLX","created_at":"2026-05-18T12:29:50.041715+00:00"},{"alias_kind":"pith_short_16","alias_value":"Y3XIMYCJFLLX7YGT","created_at":"2026-05-18T12:29:50.041715+00:00"},{"alias_kind":"pith_short_8","alias_value":"Y3XIMYCJ","created_at":"2026-05-18T12:29:50.041715+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/Y3XIMYCJFLLX7YGT7F7J7KT3TT","json":"https://pith.science/pith/Y3XIMYCJFLLX7YGT7F7J7KT3TT.json","graph_json":"https://pith.science/api/pith-number/Y3XIMYCJFLLX7YGT7F7J7KT3TT/graph.json","events_json":"https://pith.science/api/pith-number/Y3XIMYCJFLLX7YGT7F7J7KT3TT/events.json","paper":"https://pith.science/paper/Y3XIMYCJ"},"agent_actions":{"view_html":"https://pith.science/pith/Y3XIMYCJFLLX7YGT7F7J7KT3TT","download_json":"https://pith.science/pith/Y3XIMYCJFLLX7YGT7F7J7KT3TT.json","view_paper":"https://pith.science/paper/Y3XIMYCJ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1512.07569&json=true","fetch_graph":"https://pith.science/api/pith-number/Y3XIMYCJFLLX7YGT7F7J7KT3TT/graph.json","fetch_events":"https://pith.science/api/pith-number/Y3XIMYCJFLLX7YGT7F7J7KT3TT/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/Y3XIMYCJFLLX7YGT7F7J7KT3TT/action/timestamp_anchor","attest_storage":"https://pith.science/pith/Y3XIMYCJFLLX7YGT7F7J7KT3TT/action/storage_attestation","attest_author":"https://pith.science/pith/Y3XIMYCJFLLX7YGT7F7J7KT3TT/action/author_attestation","sign_citation":"https://pith.science/pith/Y3XIMYCJFLLX7YGT7F7J7KT3TT/action/citation_signature","submit_replication":"https://pith.science/pith/Y3XIMYCJFLLX7YGT7F7J7KT3TT/action/replication_record"}},"created_at":"2026-05-18T00:43:35.952797+00:00","updated_at":"2026-05-18T00:43:35.952797+00:00"}