{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2023:O2F4RXYNMTEAHVJJX5QAQIVFSS","short_pith_number":"pith:O2F4RXYN","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"},"canonical_sha256":"768bc8df0d64c803d529bf600822a594b9cb0a928d88021f5bc4beff96934751","source":{"kind":"arxiv","id":"2304.03426","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2304.03426","created_at":"2026-07-05T07:12:16Z"},{"alias_kind":"arxiv_version","alias_value":"2304.03426v2","created_at":"2026-07-05T07:12:16Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2304.03426","created_at":"2026-07-05T07:12:16Z"},{"alias_kind":"pith_short_12","alias_value":"O2F4RXYNMTEA","created_at":"2026-07-05T07:12:16Z"},{"alias_kind":"pith_short_16","alias_value":"O2F4RXYNMTEAHVJJ","created_at":"2026-07-05T07:12:16Z"},{"alias_kind":"pith_short_8","alias_value":"O2F4RXYN","created_at":"2026-07-05T07:12:16Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2023:O2F4RXYNMTEAHVJJX5QAQIVFSS","target":"record","payload":{"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"},"canonical_sha256":"768bc8df0d64c803d529bf600822a594b9cb0a928d88021f5bc4beff96934751","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"},"source_kind":"arxiv","source_id":"2304.03426","source_version":2,"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-07-05T07:12:16Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"xVkTH73WBH0+Ci7cry8t7OZmCxvQzarBeNzSyX+/pXcPrir+r4T5hDXqSrTtVv0/FDcru/Pct4dn5Jlix9TbDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-10T06:25:23.461432Z"},"content_sha256":"79e792d8555ea6acf3c9ee27518b138920d3c887bb2251b0db4f52fc820db26a","schema_version":"1.0","event_id":"sha256:79e792d8555ea6acf3c9ee27518b138920d3c887bb2251b0db4f52fc820db26a"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2023:O2F4RXYNMTEAHVJJX5QAQIVFSS","target":"graph","payload":{"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"},"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-07-05T07:12:16Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"8QowY251PhWlvnv5YALj7XF8rp1xRM5syYB5UnddeRKU6+9HC5pLBZVvoyG6thVQ6GwrRt3DVE0vCpGoHPNGDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-10T06:25:23.461817Z"},"content_sha256":"2d81e3e66415b14d3a218c02ce0352373b8c4ff23f3cd3300222bcc2dadff3a5","schema_version":"1.0","event_id":"sha256:2d81e3e66415b14d3a218c02ce0352373b8c4ff23f3cd3300222bcc2dadff3a5"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/O2F4RXYNMTEAHVJJX5QAQIVFSS/bundle.json","state_url":"https://pith.science/pith/O2F4RXYNMTEAHVJJX5QAQIVFSS/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/O2F4RXYNMTEAHVJJX5QAQIVFSS/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-07-10T06:25:23Z","links":{"resolver":"https://pith.science/pith/O2F4RXYNMTEAHVJJX5QAQIVFSS","bundle":"https://pith.science/pith/O2F4RXYNMTEAHVJJX5QAQIVFSS/bundle.json","state":"https://pith.science/pith/O2F4RXYNMTEAHVJJX5QAQIVFSS/state.json","well_known_bundle":"https://pith.science/.well-known/pith/O2F4RXYNMTEAHVJJX5QAQIVFSS/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2023:O2F4RXYNMTEAHVJJX5QAQIVFSS","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":"84400c53ba782b5f799b58fb0b3f87ef7eeb5048ffb4175556a4e7bbbb6d11a9","cross_cats_sorted":["cs.DM","math.OC"],"license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","primary_cat":"cs.DS","submitted_at":"2023-04-07T00:44:51Z","title_canon_sha256":"d43f7219c606626717a54e61256c776d17ae476595693a75870a06d5a310a251"},"schema_version":"1.0","source":{"id":"2304.03426","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2304.03426","created_at":"2026-07-05T07:12:16Z"},{"alias_kind":"arxiv_version","alias_value":"2304.03426v2","created_at":"2026-07-05T07:12:16Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2304.03426","created_at":"2026-07-05T07:12:16Z"},{"alias_kind":"pith_short_12","alias_value":"O2F4RXYNMTEA","created_at":"2026-07-05T07:12:16Z"},{"alias_kind":"pith_short_16","alias_value":"O2F4RXYNMTEAHVJJ","created_at":"2026-07-05T07:12:16Z"},{"alias_kind":"pith_short_8","alias_value":"O2F4RXYN","created_at":"2026-07-05T07:12:16Z"}],"graph_snapshots":[{"event_id":"sha256:2d81e3e66415b14d3a218c02ce0352373b8c4ff23f3cd3300222bcc2dadff3a5","target":"graph","created_at":"2026-07-05T07:12:16Z","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"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2304.03426/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"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","authors_text":"Haotian Jiang, Lichen Zhang, Yin Tat Lee, Zhao Song","cross_cats":["cs.DM","math.OC"],"headline":"","license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","primary_cat":"cs.DS","submitted_at":"2023-04-07T00:44:51Z","title":"Convex Minimization with Integer Minima in $\\widetilde O(n^4)$ Time"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2304.03426","kind":"arxiv","version":2},"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:79e792d8555ea6acf3c9ee27518b138920d3c887bb2251b0db4f52fc820db26a","target":"record","created_at":"2026-07-05T07:12:16Z","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":"84400c53ba782b5f799b58fb0b3f87ef7eeb5048ffb4175556a4e7bbbb6d11a9","cross_cats_sorted":["cs.DM","math.OC"],"license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","primary_cat":"cs.DS","submitted_at":"2023-04-07T00:44:51Z","title_canon_sha256":"d43f7219c606626717a54e61256c776d17ae476595693a75870a06d5a310a251"},"schema_version":"1.0","source":{"id":"2304.03426","kind":"arxiv","version":2}},"canonical_sha256":"768bc8df0d64c803d529bf600822a594b9cb0a928d88021f5bc4beff96934751","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"768bc8df0d64c803d529bf600822a594b9cb0a928d88021f5bc4beff96934751","first_computed_at":"2026-07-05T07:12:16.452871Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T07:12:16.452871Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"Fi33pxPxD3DJH9eNxAEnElKJXoGZVd+gStdnf/iWjkMS6GA1pAWw4Do5mz9eDa++2urHqD/bELgCkXE6M8OyCQ==","signature_status":"signed_v1","signed_at":"2026-07-05T07:12:16.453364Z","signed_message":"canonical_sha256_bytes"},"source_id":"2304.03426","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:79e792d8555ea6acf3c9ee27518b138920d3c887bb2251b0db4f52fc820db26a","sha256:2d81e3e66415b14d3a218c02ce0352373b8c4ff23f3cd3300222bcc2dadff3a5"],"state_sha256":"a632e1387b16cf247a5209ed826b3bcd05fa0fcba4c981dd3eca122a67b89db8"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Rx9K+j8IVdRtiVayCOrVJbglhmaLbTBB8szuuBD6BUuz/f8BH13/X7LTqmwDJOZcWzvTdleZWJyLrTb8cdAiDg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-07-10T06:25:23.463741Z","bundle_sha256":"2f328e4689b1b7893a6e15c679ef338bea18dc060d5d2883934cabdcc43cdb4e"}}