{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2010:4SND2ULLCUN63WGFQKAJA2WOWU","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":"d7f7e603bb7f8f7baa46e4ccaf0e27139265f7eb8197b0ace6568333ac2446eb","cross_cats_sorted":["cs.DS"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2010-06-23T22:56:22Z","title_canon_sha256":"c98847f977a6ba254d5e4074b78634dd5ebf21d6502e109fa7abaea6cf557d18"},"schema_version":"1.0","source":{"id":"1006.4661","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1006.4661","created_at":"2026-05-18T00:53:21Z"},{"alias_kind":"arxiv_version","alias_value":"1006.4661v3","created_at":"2026-05-18T00:53:21Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1006.4661","created_at":"2026-05-18T00:53:21Z"},{"alias_kind":"pith_short_12","alias_value":"4SND2ULLCUN6","created_at":"2026-05-18T12:26:04Z"},{"alias_kind":"pith_short_16","alias_value":"4SND2ULLCUN63WGF","created_at":"2026-05-18T12:26:04Z"},{"alias_kind":"pith_short_8","alias_value":"4SND2ULL","created_at":"2026-05-18T12:26:04Z"}],"graph_snapshots":[{"event_id":"sha256:e273c35a2e0bc3a5c7d431beb0c1c31d620be8a13f0abe53f4e5719770911e76","target":"graph","created_at":"2026-05-18T00:53:21Z","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":"We study the integer minimization of a quasiconvex polynomial with quasiconvex polynomial constraints. We propose a new algorithm that is an improvement upon the best known algorithm due to Heinz (Journal of Complexity, 2005). This improvement is achieved by applying a new modern Lenstra-type algorithm, finding optimal ellipsoid roundings, and considering sparse encodings of polynomials. For the bounded case, our algorithm attains a time-complexity of s (r l M d)^{O(1)} 2^{2n log_2(n) + O(n)} when M is a bound on the number of monomials in each polynomial and r is the binary encoding length of","authors_text":"Matthias K\\\"oppe, Robert Hildebrand","cross_cats":["cs.DS"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2010-06-23T22:56:22Z","title":"A new Lenstra-type Algorithm for Quasiconvex Polynomial Integer Minimization with Complexity 2^O(n log n)"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1006.4661","kind":"arxiv","version":3},"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:c17357ab6fe8550d815f90d4972ee0f773c5cc50492cc2c38ab8bf4e10c567a9","target":"record","created_at":"2026-05-18T00:53:21Z","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":"d7f7e603bb7f8f7baa46e4ccaf0e27139265f7eb8197b0ace6568333ac2446eb","cross_cats_sorted":["cs.DS"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2010-06-23T22:56:22Z","title_canon_sha256":"c98847f977a6ba254d5e4074b78634dd5ebf21d6502e109fa7abaea6cf557d18"},"schema_version":"1.0","source":{"id":"1006.4661","kind":"arxiv","version":3}},"canonical_sha256":"e49a3d516b151bedd8c58280906aceb53c22c0a35f9c175b76896b2e310fb25c","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"e49a3d516b151bedd8c58280906aceb53c22c0a35f9c175b76896b2e310fb25c","first_computed_at":"2026-05-18T00:53:21.443931Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:53:21.443931Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"eAXZ2FfNCgaz++JsjPd8d8drPiz67mcf3lELRfyb9PQLVfGEBnpGSPWfp+j+dXVtulg8vIjdL77lpsfj1jgrCg==","signature_status":"signed_v1","signed_at":"2026-05-18T00:53:21.444496Z","signed_message":"canonical_sha256_bytes"},"source_id":"1006.4661","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:c17357ab6fe8550d815f90d4972ee0f773c5cc50492cc2c38ab8bf4e10c567a9","sha256:e273c35a2e0bc3a5c7d431beb0c1c31d620be8a13f0abe53f4e5719770911e76"],"state_sha256":"044b71300db1206513eedfebc13ae7acabd5f1157f60ee2289968a520648c81a"}