{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2014:HZBZOWGCUCIWZ3UHCOOTDAHUYB","short_pith_number":"pith:HZBZOWGC","schema_version":"1.0","canonical_sha256":"3e439758c2a0916cee87139d3180f4c074851a9fc705398786e1420e98aa0b4b","source":{"kind":"arxiv","id":"1410.6734","version":1},"attestation_state":"computed","paper":{"title":"A Polynomial-Time Affine-Scaling Method for Semidefinite and Hyperbolic Programming","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"James Renegar, Mutiara Sondjaja","submitted_at":"2014-10-24T16:47:02Z","abstract_excerpt":"We develop a natural variant of Dikin's affine-scaling method, first for semidefinite programming and then for hyperbolic programming in general. We match the best complexity bounds known for interior-point methods.\n  All previous polynomial-time affine-scaling algorithms have been for conic optimization problems in which the underlying cone is symmetric. Hyperbolicity cones, however, need not be symmetric. Our algorithm is the first polynomial-time affine-scaling method not relying on symmetry."},"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":"1410.6734","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2014-10-24T16:47:02Z","cross_cats_sorted":[],"title_canon_sha256":"e95dd9b1f9496d44cd016c97f4e6f18c4e2c82e0b9e15b145ff9987438d14583","abstract_canon_sha256":"b96900c00f762da6a7b3f7e25d992f07a9263150e2f9c43c36b3295d89c8554a"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:39:24.684567Z","signature_b64":"kLYWdrK2k56eDoreWgIYYBK4kfwFTboeRRnRNCJCkXpFSToppeUJT6p20LifKRY902rE1dCPD7GXmh5fDwbTDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"3e439758c2a0916cee87139d3180f4c074851a9fc705398786e1420e98aa0b4b","last_reissued_at":"2026-05-18T02:39:24.684211Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:39:24.684211Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A Polynomial-Time Affine-Scaling Method for Semidefinite and Hyperbolic Programming","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"James Renegar, Mutiara Sondjaja","submitted_at":"2014-10-24T16:47:02Z","abstract_excerpt":"We develop a natural variant of Dikin's affine-scaling method, first for semidefinite programming and then for hyperbolic programming in general. We match the best complexity bounds known for interior-point methods.\n  All previous polynomial-time affine-scaling algorithms have been for conic optimization problems in which the underlying cone is symmetric. Hyperbolicity cones, however, need not be symmetric. Our algorithm is the first polynomial-time affine-scaling method not relying on symmetry."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1410.6734","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":"1410.6734","created_at":"2026-05-18T02:39:24.684268+00:00"},{"alias_kind":"arxiv_version","alias_value":"1410.6734v1","created_at":"2026-05-18T02:39:24.684268+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1410.6734","created_at":"2026-05-18T02:39:24.684268+00:00"},{"alias_kind":"pith_short_12","alias_value":"HZBZOWGCUCIW","created_at":"2026-05-18T12:28:33.132498+00:00"},{"alias_kind":"pith_short_16","alias_value":"HZBZOWGCUCIWZ3UH","created_at":"2026-05-18T12:28:33.132498+00:00"},{"alias_kind":"pith_short_8","alias_value":"HZBZOWGC","created_at":"2026-05-18T12:28:33.132498+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/HZBZOWGCUCIWZ3UHCOOTDAHUYB","json":"https://pith.science/pith/HZBZOWGCUCIWZ3UHCOOTDAHUYB.json","graph_json":"https://pith.science/api/pith-number/HZBZOWGCUCIWZ3UHCOOTDAHUYB/graph.json","events_json":"https://pith.science/api/pith-number/HZBZOWGCUCIWZ3UHCOOTDAHUYB/events.json","paper":"https://pith.science/paper/HZBZOWGC"},"agent_actions":{"view_html":"https://pith.science/pith/HZBZOWGCUCIWZ3UHCOOTDAHUYB","download_json":"https://pith.science/pith/HZBZOWGCUCIWZ3UHCOOTDAHUYB.json","view_paper":"https://pith.science/paper/HZBZOWGC","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1410.6734&json=true","fetch_graph":"https://pith.science/api/pith-number/HZBZOWGCUCIWZ3UHCOOTDAHUYB/graph.json","fetch_events":"https://pith.science/api/pith-number/HZBZOWGCUCIWZ3UHCOOTDAHUYB/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/HZBZOWGCUCIWZ3UHCOOTDAHUYB/action/timestamp_anchor","attest_storage":"https://pith.science/pith/HZBZOWGCUCIWZ3UHCOOTDAHUYB/action/storage_attestation","attest_author":"https://pith.science/pith/HZBZOWGCUCIWZ3UHCOOTDAHUYB/action/author_attestation","sign_citation":"https://pith.science/pith/HZBZOWGCUCIWZ3UHCOOTDAHUYB/action/citation_signature","submit_replication":"https://pith.science/pith/HZBZOWGCUCIWZ3UHCOOTDAHUYB/action/replication_record"}},"created_at":"2026-05-18T02:39:24.684268+00:00","updated_at":"2026-05-18T02:39:24.684268+00:00"}