{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:KRTZUDQCOPPJS2VY4DE6UV4HUZ","short_pith_number":"pith:KRTZUDQC","canonical_record":{"source":{"id":"1609.08066","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2016-09-26T16:47:26Z","cross_cats_sorted":[],"title_canon_sha256":"9111141e042d9270c7b86ed8d5cb9f01d644ee7d1ca4349524f2576694344366","abstract_canon_sha256":"a645902e968ed5299c93480f53cf76c9bde5264eb18ec41365d066f4e66495d7"},"schema_version":"1.0"},"canonical_sha256":"54679a0e0273de996ab8e0c9ea5787a65081d46fd3cd76986b8290499b11bf33","source":{"kind":"arxiv","id":"1609.08066","version":4},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1609.08066","created_at":"2026-05-18T00:34:23Z"},{"alias_kind":"arxiv_version","alias_value":"1609.08066v4","created_at":"2026-05-18T00:34:23Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1609.08066","created_at":"2026-05-18T00:34:23Z"},{"alias_kind":"pith_short_12","alias_value":"KRTZUDQCOPPJ","created_at":"2026-05-18T12:30:29Z"},{"alias_kind":"pith_short_16","alias_value":"KRTZUDQCOPPJS2VY","created_at":"2026-05-18T12:30:29Z"},{"alias_kind":"pith_short_8","alias_value":"KRTZUDQC","created_at":"2026-05-18T12:30:29Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:KRTZUDQCOPPJS2VY4DE6UV4HUZ","target":"record","payload":{"canonical_record":{"source":{"id":"1609.08066","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2016-09-26T16:47:26Z","cross_cats_sorted":[],"title_canon_sha256":"9111141e042d9270c7b86ed8d5cb9f01d644ee7d1ca4349524f2576694344366","abstract_canon_sha256":"a645902e968ed5299c93480f53cf76c9bde5264eb18ec41365d066f4e66495d7"},"schema_version":"1.0"},"canonical_sha256":"54679a0e0273de996ab8e0c9ea5787a65081d46fd3cd76986b8290499b11bf33","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:34:23.111074Z","signature_b64":"ipopV6Ismd7ep2+0k5uhFCRErd2/+gOBIjteMnb677VqchsuttlMU8G9GOcBx9cFijXHHB1wvCcDS2tOggfOCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"54679a0e0273de996ab8e0c9ea5787a65081d46fd3cd76986b8290499b11bf33","last_reissued_at":"2026-05-18T00:34:23.110666Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:34:23.110666Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1609.08066","source_version":4,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T00:34:23Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"BKq22mADyV3J/p4gytUjaUOcwWy4A+hHzYysur/lXoZwOJ2N7vLfO8GuSaAd10v2AKIZToUO4zw5VlTOdiGHDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T23:59:10.546370Z"},"content_sha256":"3bafba36e99bf1f18cf2c087a401b2a373e48d0d00b441a85843fa3e3a1428c3","schema_version":"1.0","event_id":"sha256:3bafba36e99bf1f18cf2c087a401b2a373e48d0d00b441a85843fa3e3a1428c3"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:KRTZUDQCOPPJS2VY4DE6UV4HUZ","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Polynomial-Time Approximation for Nonconvex Optimization Problems with an L1-Constraint","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Anil Aswani, Yonatan Mintz","submitted_at":"2016-09-26T16:47:26Z","abstract_excerpt":"Nonconvex optimization problems with an L1-constraint are ubiquitous, and are found in many application domains including: optimal control of hybrid systems, machine learning and statistics, and operations research. This paper shows that nonconvex optimization problems with an L1-constraint can be approximately solved in polynomial time. We first show that nonlinear integer programs with an L1-constraint can be solved in a number of oracle steps that is polynomial in the dimension of the decision variable, for each fixed radius of the L1-constraint. When specialized to polynomial integer progr"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1609.08066","kind":"arxiv","version":4},"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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T00:34:23Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"W0HEgnrHTuqHt416Amlj+eBJxsxpXHyWZf6GiVckO5QTxrxElqEgpD3S34eawMxatV+d+v0uHzS9zvcCkERpDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T23:59:10.546745Z"},"content_sha256":"6a8bd4e543bfe6af36b6294f01513be9dc2ea19d1b391846cddf3ea840bb15fb","schema_version":"1.0","event_id":"sha256:6a8bd4e543bfe6af36b6294f01513be9dc2ea19d1b391846cddf3ea840bb15fb"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/KRTZUDQCOPPJS2VY4DE6UV4HUZ/bundle.json","state_url":"https://pith.science/pith/KRTZUDQCOPPJS2VY4DE6UV4HUZ/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/KRTZUDQCOPPJS2VY4DE6UV4HUZ/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-05-26T23:59:10Z","links":{"resolver":"https://pith.science/pith/KRTZUDQCOPPJS2VY4DE6UV4HUZ","bundle":"https://pith.science/pith/KRTZUDQCOPPJS2VY4DE6UV4HUZ/bundle.json","state":"https://pith.science/pith/KRTZUDQCOPPJS2VY4DE6UV4HUZ/state.json","well_known_bundle":"https://pith.science/.well-known/pith/KRTZUDQCOPPJS2VY4DE6UV4HUZ/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:KRTZUDQCOPPJS2VY4DE6UV4HUZ","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"a645902e968ed5299c93480f53cf76c9bde5264eb18ec41365d066f4e66495d7","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2016-09-26T16:47:26Z","title_canon_sha256":"9111141e042d9270c7b86ed8d5cb9f01d644ee7d1ca4349524f2576694344366"},"schema_version":"1.0","source":{"id":"1609.08066","kind":"arxiv","version":4}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1609.08066","created_at":"2026-05-18T00:34:23Z"},{"alias_kind":"arxiv_version","alias_value":"1609.08066v4","created_at":"2026-05-18T00:34:23Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1609.08066","created_at":"2026-05-18T00:34:23Z"},{"alias_kind":"pith_short_12","alias_value":"KRTZUDQCOPPJ","created_at":"2026-05-18T12:30:29Z"},{"alias_kind":"pith_short_16","alias_value":"KRTZUDQCOPPJS2VY","created_at":"2026-05-18T12:30:29Z"},{"alias_kind":"pith_short_8","alias_value":"KRTZUDQC","created_at":"2026-05-18T12:30:29Z"}],"graph_snapshots":[{"event_id":"sha256:6a8bd4e543bfe6af36b6294f01513be9dc2ea19d1b391846cddf3ea840bb15fb","target":"graph","created_at":"2026-05-18T00:34:23Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"paper":{"abstract_excerpt":"Nonconvex optimization problems with an L1-constraint are ubiquitous, and are found in many application domains including: optimal control of hybrid systems, machine learning and statistics, and operations research. This paper shows that nonconvex optimization problems with an L1-constraint can be approximately solved in polynomial time. We first show that nonlinear integer programs with an L1-constraint can be solved in a number of oracle steps that is polynomial in the dimension of the decision variable, for each fixed radius of the L1-constraint. When specialized to polynomial integer progr","authors_text":"Anil Aswani, Yonatan Mintz","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2016-09-26T16:47:26Z","title":"Polynomial-Time Approximation for Nonconvex Optimization Problems with an L1-Constraint"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1609.08066","kind":"arxiv","version":4},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:3bafba36e99bf1f18cf2c087a401b2a373e48d0d00b441a85843fa3e3a1428c3","target":"record","created_at":"2026-05-18T00:34:23Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"a645902e968ed5299c93480f53cf76c9bde5264eb18ec41365d066f4e66495d7","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2016-09-26T16:47:26Z","title_canon_sha256":"9111141e042d9270c7b86ed8d5cb9f01d644ee7d1ca4349524f2576694344366"},"schema_version":"1.0","source":{"id":"1609.08066","kind":"arxiv","version":4}},"canonical_sha256":"54679a0e0273de996ab8e0c9ea5787a65081d46fd3cd76986b8290499b11bf33","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"54679a0e0273de996ab8e0c9ea5787a65081d46fd3cd76986b8290499b11bf33","first_computed_at":"2026-05-18T00:34:23.110666Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:34:23.110666Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"ipopV6Ismd7ep2+0k5uhFCRErd2/+gOBIjteMnb677VqchsuttlMU8G9GOcBx9cFijXHHB1wvCcDS2tOggfOCg==","signature_status":"signed_v1","signed_at":"2026-05-18T00:34:23.111074Z","signed_message":"canonical_sha256_bytes"},"source_id":"1609.08066","source_kind":"arxiv","source_version":4}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:3bafba36e99bf1f18cf2c087a401b2a373e48d0d00b441a85843fa3e3a1428c3","sha256:6a8bd4e543bfe6af36b6294f01513be9dc2ea19d1b391846cddf3ea840bb15fb"],"state_sha256":"ea9c5ac7a2fc854758bec02e60cd56ca53136a8bc58a53f044a440cf33ae9a9b"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"t08gE3p8D58EdK8ItrA7DtvUqz8zX0r7ST2HYR3qMTUXV8i6vdxe5sw/BR2KOlmyNJGphVYTUu8IXx3cEm60DA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-26T23:59:10.549144Z","bundle_sha256":"9f73cd3dd146ad3233c46b042224e096576905cfc73713e11cfe39b567b30d4b"}}