{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2010:4SND2ULLCUN63WGFQKAJA2WOWU","short_pith_number":"pith:4SND2ULL","schema_version":"1.0","canonical_sha256":"e49a3d516b151bedd8c58280906aceb53c22c0a35f9c175b76896b2e310fb25c","source":{"kind":"arxiv","id":"1006.4661","version":3},"attestation_state":"computed","paper":{"title":"A new Lenstra-type Algorithm for Quasiconvex Polynomial Integer Minimization with Complexity 2^O(n log n)","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS"],"primary_cat":"math.OC","authors_text":"Matthias K\\\"oppe, Robert Hildebrand","submitted_at":"2010-06-23T22:56:22Z","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"},"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":"1006.4661","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2010-06-23T22:56:22Z","cross_cats_sorted":["cs.DS"],"title_canon_sha256":"c98847f977a6ba254d5e4074b78634dd5ebf21d6502e109fa7abaea6cf557d18","abstract_canon_sha256":"d7f7e603bb7f8f7baa46e4ccaf0e27139265f7eb8197b0ace6568333ac2446eb"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:53:21.444496Z","signature_b64":"eAXZ2FfNCgaz++JsjPd8d8drPiz67mcf3lELRfyb9PQLVfGEBnpGSPWfp+j+dXVtulg8vIjdL77lpsfj1jgrCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"e49a3d516b151bedd8c58280906aceb53c22c0a35f9c175b76896b2e310fb25c","last_reissued_at":"2026-05-18T00:53:21.443931Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:53:21.443931Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A new Lenstra-type Algorithm for Quasiconvex Polynomial Integer Minimization with Complexity 2^O(n log n)","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS"],"primary_cat":"math.OC","authors_text":"Matthias K\\\"oppe, Robert Hildebrand","submitted_at":"2010-06-23T22:56:22Z","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"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1006.4661","kind":"arxiv","version":3},"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":"1006.4661","created_at":"2026-05-18T00:53:21.443992+00:00"},{"alias_kind":"arxiv_version","alias_value":"1006.4661v3","created_at":"2026-05-18T00:53:21.443992+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1006.4661","created_at":"2026-05-18T00:53:21.443992+00:00"},{"alias_kind":"pith_short_12","alias_value":"4SND2ULLCUN6","created_at":"2026-05-18T12:26:04.259169+00:00"},{"alias_kind":"pith_short_16","alias_value":"4SND2ULLCUN63WGF","created_at":"2026-05-18T12:26:04.259169+00:00"},{"alias_kind":"pith_short_8","alias_value":"4SND2ULL","created_at":"2026-05-18T12:26:04.259169+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/4SND2ULLCUN63WGFQKAJA2WOWU","json":"https://pith.science/pith/4SND2ULLCUN63WGFQKAJA2WOWU.json","graph_json":"https://pith.science/api/pith-number/4SND2ULLCUN63WGFQKAJA2WOWU/graph.json","events_json":"https://pith.science/api/pith-number/4SND2ULLCUN63WGFQKAJA2WOWU/events.json","paper":"https://pith.science/paper/4SND2ULL"},"agent_actions":{"view_html":"https://pith.science/pith/4SND2ULLCUN63WGFQKAJA2WOWU","download_json":"https://pith.science/pith/4SND2ULLCUN63WGFQKAJA2WOWU.json","view_paper":"https://pith.science/paper/4SND2ULL","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1006.4661&json=true","fetch_graph":"https://pith.science/api/pith-number/4SND2ULLCUN63WGFQKAJA2WOWU/graph.json","fetch_events":"https://pith.science/api/pith-number/4SND2ULLCUN63WGFQKAJA2WOWU/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/4SND2ULLCUN63WGFQKAJA2WOWU/action/timestamp_anchor","attest_storage":"https://pith.science/pith/4SND2ULLCUN63WGFQKAJA2WOWU/action/storage_attestation","attest_author":"https://pith.science/pith/4SND2ULLCUN63WGFQKAJA2WOWU/action/author_attestation","sign_citation":"https://pith.science/pith/4SND2ULLCUN63WGFQKAJA2WOWU/action/citation_signature","submit_replication":"https://pith.science/pith/4SND2ULLCUN63WGFQKAJA2WOWU/action/replication_record"}},"created_at":"2026-05-18T00:53:21.443992+00:00","updated_at":"2026-05-18T00:53:21.443992+00:00"}