{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:Y5BQRUWF4KCXENAWUJEESXYN72","short_pith_number":"pith:Y5BQRUWF","schema_version":"1.0","canonical_sha256":"c74308d2c5e285723416a248495f0dfea9637fd253da8dd06f88c32aff328b9e","source":{"kind":"arxiv","id":"1803.07683","version":2},"attestation_state":"computed","paper":{"title":"On the Complexity of Testing Attainment of the Optimal Value in Nonlinear Optimization","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CC","math.AG","math.NA"],"primary_cat":"math.OC","authors_text":"Amir Ali Ahmadi, Jeffrey Zhang","submitted_at":"2018-03-20T22:54:29Z","abstract_excerpt":"We prove that unless P=NP, there exists no polynomial time (or even pseudo-polynomial time) algorithm that can test whether the optimal value of a nonlinear optimization problem where the objective and constraints are given by low-degree polynomials is attained. If the degrees of these polynomials are fixed, our results along with previously-known \"Frank-Wolfe type\" theorems imply that exactly one of two cases can occur: either the optimal value is attained on every instance, or it is strongly NP-hard to distinguish attainment from non-attainment. We also show that testing for some well-known "},"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":"1803.07683","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2018-03-20T22:54:29Z","cross_cats_sorted":["cs.CC","math.AG","math.NA"],"title_canon_sha256":"4f62447af100c1d42e1f602fefc0fd3ca40977dab85a294613736ae2a926fd7b","abstract_canon_sha256":"b35a64808118d7360084d665449ddfd155999beea9d765a387430d9e4a285983"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:47:31.348439Z","signature_b64":"30ZyoXIuIO2K7m+Cvg6laey5wDSnsGRgYgzqzeIruQddbPddXlKndpISOReq/K407HgirPiWPOnQ2nk1/ywSCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"c74308d2c5e285723416a248495f0dfea9637fd253da8dd06f88c32aff328b9e","last_reissued_at":"2026-05-17T23:47:31.347908Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:47:31.347908Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"On the Complexity of Testing Attainment of the Optimal Value in Nonlinear Optimization","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CC","math.AG","math.NA"],"primary_cat":"math.OC","authors_text":"Amir Ali Ahmadi, Jeffrey Zhang","submitted_at":"2018-03-20T22:54:29Z","abstract_excerpt":"We prove that unless P=NP, there exists no polynomial time (or even pseudo-polynomial time) algorithm that can test whether the optimal value of a nonlinear optimization problem where the objective and constraints are given by low-degree polynomials is attained. If the degrees of these polynomials are fixed, our results along with previously-known \"Frank-Wolfe type\" theorems imply that exactly one of two cases can occur: either the optimal value is attained on every instance, or it is strongly NP-hard to distinguish attainment from non-attainment. We also show that testing for some well-known "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1803.07683","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":"1803.07683","created_at":"2026-05-17T23:47:31.347993+00:00"},{"alias_kind":"arxiv_version","alias_value":"1803.07683v2","created_at":"2026-05-17T23:47:31.347993+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1803.07683","created_at":"2026-05-17T23:47:31.347993+00:00"},{"alias_kind":"pith_short_12","alias_value":"Y5BQRUWF4KCX","created_at":"2026-05-18T12:33:04.347982+00:00"},{"alias_kind":"pith_short_16","alias_value":"Y5BQRUWF4KCXENAW","created_at":"2026-05-18T12:33:04.347982+00:00"},{"alias_kind":"pith_short_8","alias_value":"Y5BQRUWF","created_at":"2026-05-18T12:33:04.347982+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/Y5BQRUWF4KCXENAWUJEESXYN72","json":"https://pith.science/pith/Y5BQRUWF4KCXENAWUJEESXYN72.json","graph_json":"https://pith.science/api/pith-number/Y5BQRUWF4KCXENAWUJEESXYN72/graph.json","events_json":"https://pith.science/api/pith-number/Y5BQRUWF4KCXENAWUJEESXYN72/events.json","paper":"https://pith.science/paper/Y5BQRUWF"},"agent_actions":{"view_html":"https://pith.science/pith/Y5BQRUWF4KCXENAWUJEESXYN72","download_json":"https://pith.science/pith/Y5BQRUWF4KCXENAWUJEESXYN72.json","view_paper":"https://pith.science/paper/Y5BQRUWF","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1803.07683&json=true","fetch_graph":"https://pith.science/api/pith-number/Y5BQRUWF4KCXENAWUJEESXYN72/graph.json","fetch_events":"https://pith.science/api/pith-number/Y5BQRUWF4KCXENAWUJEESXYN72/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/Y5BQRUWF4KCXENAWUJEESXYN72/action/timestamp_anchor","attest_storage":"https://pith.science/pith/Y5BQRUWF4KCXENAWUJEESXYN72/action/storage_attestation","attest_author":"https://pith.science/pith/Y5BQRUWF4KCXENAWUJEESXYN72/action/author_attestation","sign_citation":"https://pith.science/pith/Y5BQRUWF4KCXENAWUJEESXYN72/action/citation_signature","submit_replication":"https://pith.science/pith/Y5BQRUWF4KCXENAWUJEESXYN72/action/replication_record"}},"created_at":"2026-05-17T23:47:31.347993+00:00","updated_at":"2026-05-17T23:47:31.347993+00:00"}