{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2020:GSLF5IFTAZ2SH5RZKM3MGOXBUS","short_pith_number":"pith:GSLF5IFT","schema_version":"1.0","canonical_sha256":"34965ea0b3067523f6395336c33ae1a49802db1256aec5fce5001f9be01864f9","source":{"kind":"arxiv","id":"2011.15115","version":2},"attestation_state":"computed","paper":{"title":"The degree of the central curve in semidefinite, linear, and quadratic programming","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.AG"],"primary_cat":"math.OC","authors_text":"Ang\\'elica Torres, Isabelle Shankar, Serkan Ho\\c{s}ten","submitted_at":"2020-11-30T18:49:07Z","abstract_excerpt":"The Zariski closure of the central path which interior point algorithms track in convex optimization problems such as linear, quadratic, and semidefinite programs is an algebraic curve. The degree of this curve has been studied in relation to the complexity of these interior point algorithms, and for linear programs it was computed by De Loera, Sturmfels, and Vinzant in 2012. We show that the degree of the central curve for generic semidefinite programs is equal to the maximum likelihood degree of linear concentration models. New results from the intersection theory of the space of complete qu"},"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":"2011.15115","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2020-11-30T18:49:07Z","cross_cats_sorted":["math.AG"],"title_canon_sha256":"53bd4ea5a93528a32c4523516f394dc071e84e6d1ebc35a9b574b0407d1f7eba","abstract_canon_sha256":"ab0d009cb37698c6976e200a6b897a10d6480f5cddef3a7b5cd6218924726c3c"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T02:32:34.485898Z","signature_b64":"iHRJisSKmTlJb9ubBWFjbFQ7bNOE8LVTXd07EsCRTbXO0OcJSadgRvGA9D5k4cGTqtJjByDhSD4d9DyWXWeHDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"34965ea0b3067523f6395336c33ae1a49802db1256aec5fce5001f9be01864f9","last_reissued_at":"2026-07-05T02:32:34.485407Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T02:32:34.485407Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"The degree of the central curve in semidefinite, linear, and quadratic programming","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.AG"],"primary_cat":"math.OC","authors_text":"Ang\\'elica Torres, Isabelle Shankar, Serkan Ho\\c{s}ten","submitted_at":"2020-11-30T18:49:07Z","abstract_excerpt":"The Zariski closure of the central path which interior point algorithms track in convex optimization problems such as linear, quadratic, and semidefinite programs is an algebraic curve. The degree of this curve has been studied in relation to the complexity of these interior point algorithms, and for linear programs it was computed by De Loera, Sturmfels, and Vinzant in 2012. We show that the degree of the central curve for generic semidefinite programs is equal to the maximum likelihood degree of linear concentration models. New results from the intersection theory of the space of complete qu"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2011.15115","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/2011.15115/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":"2011.15115","created_at":"2026-07-05T02:32:34.485461+00:00"},{"alias_kind":"arxiv_version","alias_value":"2011.15115v2","created_at":"2026-07-05T02:32:34.485461+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2011.15115","created_at":"2026-07-05T02:32:34.485461+00:00"},{"alias_kind":"pith_short_12","alias_value":"GSLF5IFTAZ2S","created_at":"2026-07-05T02:32:34.485461+00:00"},{"alias_kind":"pith_short_16","alias_value":"GSLF5IFTAZ2SH5RZ","created_at":"2026-07-05T02:32:34.485461+00:00"},{"alias_kind":"pith_short_8","alias_value":"GSLF5IFT","created_at":"2026-07-05T02:32:34.485461+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/GSLF5IFTAZ2SH5RZKM3MGOXBUS","json":"https://pith.science/pith/GSLF5IFTAZ2SH5RZKM3MGOXBUS.json","graph_json":"https://pith.science/api/pith-number/GSLF5IFTAZ2SH5RZKM3MGOXBUS/graph.json","events_json":"https://pith.science/api/pith-number/GSLF5IFTAZ2SH5RZKM3MGOXBUS/events.json","paper":"https://pith.science/paper/GSLF5IFT"},"agent_actions":{"view_html":"https://pith.science/pith/GSLF5IFTAZ2SH5RZKM3MGOXBUS","download_json":"https://pith.science/pith/GSLF5IFTAZ2SH5RZKM3MGOXBUS.json","view_paper":"https://pith.science/paper/GSLF5IFT","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2011.15115&json=true","fetch_graph":"https://pith.science/api/pith-number/GSLF5IFTAZ2SH5RZKM3MGOXBUS/graph.json","fetch_events":"https://pith.science/api/pith-number/GSLF5IFTAZ2SH5RZKM3MGOXBUS/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/GSLF5IFTAZ2SH5RZKM3MGOXBUS/action/timestamp_anchor","attest_storage":"https://pith.science/pith/GSLF5IFTAZ2SH5RZKM3MGOXBUS/action/storage_attestation","attest_author":"https://pith.science/pith/GSLF5IFTAZ2SH5RZKM3MGOXBUS/action/author_attestation","sign_citation":"https://pith.science/pith/GSLF5IFTAZ2SH5RZKM3MGOXBUS/action/citation_signature","submit_replication":"https://pith.science/pith/GSLF5IFTAZ2SH5RZKM3MGOXBUS/action/replication_record"}},"created_at":"2026-07-05T02:32:34.485461+00:00","updated_at":"2026-07-05T02:32:34.485461+00:00"}