{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2010:NOLJ2IZJNHSXG7PDH4MFDXZNCY","short_pith_number":"pith:NOLJ2IZJ","schema_version":"1.0","canonical_sha256":"6b969d232969e5737de33f1851df2d162d07165318c506121e82c7ba93e9a7a7","source":{"kind":"arxiv","id":"1005.5522","version":1},"attestation_state":"computed","paper":{"title":"Shrink-Wrapping trajectories for Linear Programming","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.NA","math.NA"],"primary_cat":"math.OC","authors_text":"Yuriy Zinchenko","submitted_at":"2010-05-30T12:38:48Z","abstract_excerpt":"Hyperbolic Programming (HP) --minimizing a linear functional over an affine subspace of a finite-dimensional real vector space intersected with the so-called hyperbolicity cone-- is a class of convex optimization problems that contains well-known Linear Programming (LP). In particular, for any LP one can readily provide a sequence of HP relaxations. Based on these hyperbolic relaxations, a new Shrink-Wrapping approach to solve LP has been proposed by Renegar. The resulting Shrink-Wrapping trajectories, in a sense, generalize the notion of central path in interior-point methods.\n  We study the "},"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":"1005.5522","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2010-05-30T12:38:48Z","cross_cats_sorted":["cs.NA","math.NA"],"title_canon_sha256":"31cc76285890e361489598f67b881cbb56460c3db813ae7874a820d3a2d7b194","abstract_canon_sha256":"550d2b36cd5c592833610dab0999b9634ed245ea8131af80632c73da8597dff1"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-06-03T23:06:37.762373Z","signature_b64":"E8kOssqcJwClSiiWsY/hy1No3kxW7DLhghaAi3YZMCEK+DeCXKtxJhhO4Y7RhVj+v6UxpZag5FgMliaJ/wAuBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"6b969d232969e5737de33f1851df2d162d07165318c506121e82c7ba93e9a7a7","last_reissued_at":"2026-06-03T23:06:37.761926Z","signature_status":"signed_v1","first_computed_at":"2026-06-03T23:06:37.761926Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Shrink-Wrapping trajectories for Linear Programming","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.NA","math.NA"],"primary_cat":"math.OC","authors_text":"Yuriy Zinchenko","submitted_at":"2010-05-30T12:38:48Z","abstract_excerpt":"Hyperbolic Programming (HP) --minimizing a linear functional over an affine subspace of a finite-dimensional real vector space intersected with the so-called hyperbolicity cone-- is a class of convex optimization problems that contains well-known Linear Programming (LP). In particular, for any LP one can readily provide a sequence of HP relaxations. Based on these hyperbolic relaxations, a new Shrink-Wrapping approach to solve LP has been proposed by Renegar. The resulting Shrink-Wrapping trajectories, in a sense, generalize the notion of central path in interior-point methods.\n  We study the "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1005.5522","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/1005.5522/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":"1005.5522","created_at":"2026-06-03T23:06:37.761999+00:00"},{"alias_kind":"arxiv_version","alias_value":"1005.5522v1","created_at":"2026-06-03T23:06:37.761999+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1005.5522","created_at":"2026-06-03T23:06:37.761999+00:00"},{"alias_kind":"pith_short_12","alias_value":"NOLJ2IZJNHSX","created_at":"2026-06-03T23:06:37.761999+00:00"},{"alias_kind":"pith_short_16","alias_value":"NOLJ2IZJNHSXG7PD","created_at":"2026-06-03T23:06:37.761999+00:00"},{"alias_kind":"pith_short_8","alias_value":"NOLJ2IZJ","created_at":"2026-06-03T23:06:37.761999+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/NOLJ2IZJNHSXG7PDH4MFDXZNCY","json":"https://pith.science/pith/NOLJ2IZJNHSXG7PDH4MFDXZNCY.json","graph_json":"https://pith.science/api/pith-number/NOLJ2IZJNHSXG7PDH4MFDXZNCY/graph.json","events_json":"https://pith.science/api/pith-number/NOLJ2IZJNHSXG7PDH4MFDXZNCY/events.json","paper":"https://pith.science/paper/NOLJ2IZJ"},"agent_actions":{"view_html":"https://pith.science/pith/NOLJ2IZJNHSXG7PDH4MFDXZNCY","download_json":"https://pith.science/pith/NOLJ2IZJNHSXG7PDH4MFDXZNCY.json","view_paper":"https://pith.science/paper/NOLJ2IZJ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1005.5522&json=true","fetch_graph":"https://pith.science/api/pith-number/NOLJ2IZJNHSXG7PDH4MFDXZNCY/graph.json","fetch_events":"https://pith.science/api/pith-number/NOLJ2IZJNHSXG7PDH4MFDXZNCY/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/NOLJ2IZJNHSXG7PDH4MFDXZNCY/action/timestamp_anchor","attest_storage":"https://pith.science/pith/NOLJ2IZJNHSXG7PDH4MFDXZNCY/action/storage_attestation","attest_author":"https://pith.science/pith/NOLJ2IZJNHSXG7PDH4MFDXZNCY/action/author_attestation","sign_citation":"https://pith.science/pith/NOLJ2IZJNHSXG7PDH4MFDXZNCY/action/citation_signature","submit_replication":"https://pith.science/pith/NOLJ2IZJNHSXG7PDH4MFDXZNCY/action/replication_record"}},"created_at":"2026-06-03T23:06:37.761999+00:00","updated_at":"2026-06-03T23:06:37.761999+00:00"}