{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2023:O2F4RXYNMTEAHVJJX5QAQIVFSS","short_pith_number":"pith:O2F4RXYN","schema_version":"1.0","canonical_sha256":"768bc8df0d64c803d529bf600822a594b9cb0a928d88021f5bc4beff96934751","source":{"kind":"arxiv","id":"2304.03426","version":2},"attestation_state":"computed","paper":{"title":"Convex Minimization with Integer Minima in $\\widetilde O(n^4)$ Time","license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","headline":"","cross_cats":["cs.DM","math.OC"],"primary_cat":"cs.DS","authors_text":"Haotian Jiang, Lichen Zhang, Yin Tat Lee, Zhao Song","submitted_at":"2023-04-07T00:44:51Z","abstract_excerpt":"Given a convex function $f$ on $\\mathbb{R}^n$ with an integer minimizer, we show how to find an exact minimizer of $f$ using $O(n^2 \\log n)$ calls to a separation oracle and $O(n^4 \\log n)$ time. The previous best polynomial time algorithm for this problem given in [Jiang, SODA 2021, JACM 2022] achieves $O(n^2\\log\\log n/\\log n)$ oracle complexity. However, the overall runtime of Jiang's algorithm is at least $\\widetilde{\\Omega}(n^8)$, due to expensive sub-routines such as the Lenstra-Lenstra-Lov\\'asz (LLL) algorithm [Lenstra, Lenstra, Lov\\'asz, Math. Ann. 1982] and random walk based cutting pl"},"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":"2304.03426","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","primary_cat":"cs.DS","submitted_at":"2023-04-07T00:44:51Z","cross_cats_sorted":["cs.DM","math.OC"],"title_canon_sha256":"d43f7219c606626717a54e61256c776d17ae476595693a75870a06d5a310a251","abstract_canon_sha256":"84400c53ba782b5f799b58fb0b3f87ef7eeb5048ffb4175556a4e7bbbb6d11a9"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T07:12:16.453364Z","signature_b64":"Fi33pxPxD3DJH9eNxAEnElKJXoGZVd+gStdnf/iWjkMS6GA1pAWw4Do5mz9eDa++2urHqD/bELgCkXE6M8OyCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"768bc8df0d64c803d529bf600822a594b9cb0a928d88021f5bc4beff96934751","last_reissued_at":"2026-07-05T07:12:16.452871Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T07:12:16.452871Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Convex Minimization with Integer Minima in $\\widetilde O(n^4)$ Time","license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","headline":"","cross_cats":["cs.DM","math.OC"],"primary_cat":"cs.DS","authors_text":"Haotian Jiang, Lichen Zhang, Yin Tat Lee, Zhao Song","submitted_at":"2023-04-07T00:44:51Z","abstract_excerpt":"Given a convex function $f$ on $\\mathbb{R}^n$ with an integer minimizer, we show how to find an exact minimizer of $f$ using $O(n^2 \\log n)$ calls to a separation oracle and $O(n^4 \\log n)$ time. The previous best polynomial time algorithm for this problem given in [Jiang, SODA 2021, JACM 2022] achieves $O(n^2\\log\\log n/\\log n)$ oracle complexity. However, the overall runtime of Jiang's algorithm is at least $\\widetilde{\\Omega}(n^8)$, due to expensive sub-routines such as the Lenstra-Lenstra-Lov\\'asz (LLL) algorithm [Lenstra, Lenstra, Lov\\'asz, Math. Ann. 1982] and random walk based cutting pl"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2304.03426","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/2304.03426/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":"2304.03426","created_at":"2026-07-05T07:12:16.452935+00:00"},{"alias_kind":"arxiv_version","alias_value":"2304.03426v2","created_at":"2026-07-05T07:12:16.452935+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2304.03426","created_at":"2026-07-05T07:12:16.452935+00:00"},{"alias_kind":"pith_short_12","alias_value":"O2F4RXYNMTEA","created_at":"2026-07-05T07:12:16.452935+00:00"},{"alias_kind":"pith_short_16","alias_value":"O2F4RXYNMTEAHVJJ","created_at":"2026-07-05T07:12:16.452935+00:00"},{"alias_kind":"pith_short_8","alias_value":"O2F4RXYN","created_at":"2026-07-05T07:12:16.452935+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2306.14048","citing_title":"H$_2$O: Heavy-Hitter Oracle for Efficient Generative Inference of Large Language Models","ref_index":103,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/O2F4RXYNMTEAHVJJX5QAQIVFSS","json":"https://pith.science/pith/O2F4RXYNMTEAHVJJX5QAQIVFSS.json","graph_json":"https://pith.science/api/pith-number/O2F4RXYNMTEAHVJJX5QAQIVFSS/graph.json","events_json":"https://pith.science/api/pith-number/O2F4RXYNMTEAHVJJX5QAQIVFSS/events.json","paper":"https://pith.science/paper/O2F4RXYN"},"agent_actions":{"view_html":"https://pith.science/pith/O2F4RXYNMTEAHVJJX5QAQIVFSS","download_json":"https://pith.science/pith/O2F4RXYNMTEAHVJJX5QAQIVFSS.json","view_paper":"https://pith.science/paper/O2F4RXYN","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2304.03426&json=true","fetch_graph":"https://pith.science/api/pith-number/O2F4RXYNMTEAHVJJX5QAQIVFSS/graph.json","fetch_events":"https://pith.science/api/pith-number/O2F4RXYNMTEAHVJJX5QAQIVFSS/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/O2F4RXYNMTEAHVJJX5QAQIVFSS/action/timestamp_anchor","attest_storage":"https://pith.science/pith/O2F4RXYNMTEAHVJJX5QAQIVFSS/action/storage_attestation","attest_author":"https://pith.science/pith/O2F4RXYNMTEAHVJJX5QAQIVFSS/action/author_attestation","sign_citation":"https://pith.science/pith/O2F4RXYNMTEAHVJJX5QAQIVFSS/action/citation_signature","submit_replication":"https://pith.science/pith/O2F4RXYNMTEAHVJJX5QAQIVFSS/action/replication_record"}},"created_at":"2026-07-05T07:12:16.452935+00:00","updated_at":"2026-07-05T07:12:16.452935+00:00"}