{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:KYUFMPK4FKBX5OKTV62M46LIKC","short_pith_number":"pith:KYUFMPK4","schema_version":"1.0","canonical_sha256":"5628563d5c2a837eb953afb4ce796850a5b1f307c66b45805017e98065cfc9df","source":{"kind":"arxiv","id":"1511.04466","version":2},"attestation_state":"computed","paper":{"title":"Optimizing Star-Convex Functions","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Jasper C.H. Lee, Paul Valiant","submitted_at":"2015-11-13T21:36:13Z","abstract_excerpt":"We introduce a polynomial time algorithm for optimizing the class of star-convex functions, under no restrictions except boundedness on a region about the origin, and Lebesgue measurability. The algorithm's performance is polynomial in the requested number of digits of accuracy, contrasting with the previous best known algorithm of Nesterov and Polyak that has exponential dependence, and that further requires Lipschitz second differentiability of the function, but has milder dependence on the dimension of the domain. Star-convex functions constitute a rich class of functions generalizing conve"},"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":"1511.04466","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2015-11-13T21:36:13Z","cross_cats_sorted":[],"title_canon_sha256":"c3da68c843433b1eb4b534c6d77347d8a8d45d132a42c88b66d67fb420854d59","abstract_canon_sha256":"91984c69d87f381be0ac874130461f838432586ff037e73a8acd307ed21d45ff"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:15:00.941494Z","signature_b64":"CJmTG1k4d0AojTSmHj+MYlf2RntBdWtZv+daQG2wh6277HHNpVrySKJKOdaRbPxjm8MKqRQIDbnU1v8HNQilDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"5628563d5c2a837eb953afb4ce796850a5b1f307c66b45805017e98065cfc9df","last_reissued_at":"2026-05-18T01:15:00.941044Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:15:00.941044Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Optimizing Star-Convex Functions","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Jasper C.H. Lee, Paul Valiant","submitted_at":"2015-11-13T21:36:13Z","abstract_excerpt":"We introduce a polynomial time algorithm for optimizing the class of star-convex functions, under no restrictions except boundedness on a region about the origin, and Lebesgue measurability. The algorithm's performance is polynomial in the requested number of digits of accuracy, contrasting with the previous best known algorithm of Nesterov and Polyak that has exponential dependence, and that further requires Lipschitz second differentiability of the function, but has milder dependence on the dimension of the domain. Star-convex functions constitute a rich class of functions generalizing conve"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1511.04466","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":"1511.04466","created_at":"2026-05-18T01:15:00.941111+00:00"},{"alias_kind":"arxiv_version","alias_value":"1511.04466v2","created_at":"2026-05-18T01:15:00.941111+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1511.04466","created_at":"2026-05-18T01:15:00.941111+00:00"},{"alias_kind":"pith_short_12","alias_value":"KYUFMPK4FKBX","created_at":"2026-05-18T12:29:29.992203+00:00"},{"alias_kind":"pith_short_16","alias_value":"KYUFMPK4FKBX5OKT","created_at":"2026-05-18T12:29:29.992203+00:00"},{"alias_kind":"pith_short_8","alias_value":"KYUFMPK4","created_at":"2026-05-18T12:29:29.992203+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/KYUFMPK4FKBX5OKTV62M46LIKC","json":"https://pith.science/pith/KYUFMPK4FKBX5OKTV62M46LIKC.json","graph_json":"https://pith.science/api/pith-number/KYUFMPK4FKBX5OKTV62M46LIKC/graph.json","events_json":"https://pith.science/api/pith-number/KYUFMPK4FKBX5OKTV62M46LIKC/events.json","paper":"https://pith.science/paper/KYUFMPK4"},"agent_actions":{"view_html":"https://pith.science/pith/KYUFMPK4FKBX5OKTV62M46LIKC","download_json":"https://pith.science/pith/KYUFMPK4FKBX5OKTV62M46LIKC.json","view_paper":"https://pith.science/paper/KYUFMPK4","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1511.04466&json=true","fetch_graph":"https://pith.science/api/pith-number/KYUFMPK4FKBX5OKTV62M46LIKC/graph.json","fetch_events":"https://pith.science/api/pith-number/KYUFMPK4FKBX5OKTV62M46LIKC/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/KYUFMPK4FKBX5OKTV62M46LIKC/action/timestamp_anchor","attest_storage":"https://pith.science/pith/KYUFMPK4FKBX5OKTV62M46LIKC/action/storage_attestation","attest_author":"https://pith.science/pith/KYUFMPK4FKBX5OKTV62M46LIKC/action/author_attestation","sign_citation":"https://pith.science/pith/KYUFMPK4FKBX5OKTV62M46LIKC/action/citation_signature","submit_replication":"https://pith.science/pith/KYUFMPK4FKBX5OKTV62M46LIKC/action/replication_record"}},"created_at":"2026-05-18T01:15:00.941111+00:00","updated_at":"2026-05-18T01:15:00.941111+00:00"}