{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2023:AMGWO3YFNOMVY7CRRWMWYMCVDA","short_pith_number":"pith:AMGWO3YF","schema_version":"1.0","canonical_sha256":"030d676f056b995c7c518d996c3055180c0b6abc5541aecfc27f2f2439f7a37a","source":{"kind":"arxiv","id":"2303.02474","version":1},"attestation_state":"computed","paper":{"title":"Optimizing Low Dimensional Functions over the Integers","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Arthur L\\'eonard, Daniel Dadush, Jos\\'e Verschae, Lars Rohwedder","submitted_at":"2023-03-04T18:10:45Z","abstract_excerpt":"We consider box-constrained integer programs with objective $g(Wx) + c^T x$, where $g$ is a \"complicated\" function with an $m$ dimensional domain. Here we assume we have $n \\gg m$ variables and that $W \\in \\mathbb Z^{m \\times n}$ is an integer matrix with coefficients of absolute value at most $\\Delta$. We design an algorithm for this problem using only the mild assumption that the objective can be optimized efficiently when all but $m$ variables are fixed, yielding a running time of $n^m(m \\Delta)^{O(m^2)}$. Moreover, we can avoid the term $n^m$ in several special cases, in particular when $c"},"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":"2303.02474","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2023-03-04T18:10:45Z","cross_cats_sorted":[],"title_canon_sha256":"3872081d702f528b55c9ee42f20e2dd08b0a36e96e3fd9f46bb637db91ff6d69","abstract_canon_sha256":"235d2aaddd0207f6a9acadf35405d77c5619c26060aad8ddac80affc3df9d666"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T05:48:11.786536Z","signature_b64":"JJF6MSlHhBMRU3eIj9XjfJFw/TfQwirdyFaeEFSYJO6P7azyW6nWrdFHPoRDz8JHsxCbBnCaT3m96eOJq41ECg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"030d676f056b995c7c518d996c3055180c0b6abc5541aecfc27f2f2439f7a37a","last_reissued_at":"2026-07-05T05:48:11.786175Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T05:48:11.786175Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Optimizing Low Dimensional Functions over the Integers","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Arthur L\\'eonard, Daniel Dadush, Jos\\'e Verschae, Lars Rohwedder","submitted_at":"2023-03-04T18:10:45Z","abstract_excerpt":"We consider box-constrained integer programs with objective $g(Wx) + c^T x$, where $g$ is a \"complicated\" function with an $m$ dimensional domain. Here we assume we have $n \\gg m$ variables and that $W \\in \\mathbb Z^{m \\times n}$ is an integer matrix with coefficients of absolute value at most $\\Delta$. We design an algorithm for this problem using only the mild assumption that the objective can be optimized efficiently when all but $m$ variables are fixed, yielding a running time of $n^m(m \\Delta)^{O(m^2)}$. Moreover, we can avoid the term $n^m$ in several special cases, in particular when $c"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2303.02474","kind":"arxiv","version":1},"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/2303.02474/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":"2303.02474","created_at":"2026-07-05T05:48:11.786231+00:00"},{"alias_kind":"arxiv_version","alias_value":"2303.02474v1","created_at":"2026-07-05T05:48:11.786231+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2303.02474","created_at":"2026-07-05T05:48:11.786231+00:00"},{"alias_kind":"pith_short_12","alias_value":"AMGWO3YFNOMV","created_at":"2026-07-05T05:48:11.786231+00:00"},{"alias_kind":"pith_short_16","alias_value":"AMGWO3YFNOMVY7CR","created_at":"2026-07-05T05:48:11.786231+00:00"},{"alias_kind":"pith_short_8","alias_value":"AMGWO3YF","created_at":"2026-07-05T05:48:11.786231+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/AMGWO3YFNOMVY7CRRWMWYMCVDA","json":"https://pith.science/pith/AMGWO3YFNOMVY7CRRWMWYMCVDA.json","graph_json":"https://pith.science/api/pith-number/AMGWO3YFNOMVY7CRRWMWYMCVDA/graph.json","events_json":"https://pith.science/api/pith-number/AMGWO3YFNOMVY7CRRWMWYMCVDA/events.json","paper":"https://pith.science/paper/AMGWO3YF"},"agent_actions":{"view_html":"https://pith.science/pith/AMGWO3YFNOMVY7CRRWMWYMCVDA","download_json":"https://pith.science/pith/AMGWO3YFNOMVY7CRRWMWYMCVDA.json","view_paper":"https://pith.science/paper/AMGWO3YF","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2303.02474&json=true","fetch_graph":"https://pith.science/api/pith-number/AMGWO3YFNOMVY7CRRWMWYMCVDA/graph.json","fetch_events":"https://pith.science/api/pith-number/AMGWO3YFNOMVY7CRRWMWYMCVDA/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/AMGWO3YFNOMVY7CRRWMWYMCVDA/action/timestamp_anchor","attest_storage":"https://pith.science/pith/AMGWO3YFNOMVY7CRRWMWYMCVDA/action/storage_attestation","attest_author":"https://pith.science/pith/AMGWO3YFNOMVY7CRRWMWYMCVDA/action/author_attestation","sign_citation":"https://pith.science/pith/AMGWO3YFNOMVY7CRRWMWYMCVDA/action/citation_signature","submit_replication":"https://pith.science/pith/AMGWO3YFNOMVY7CRRWMWYMCVDA/action/replication_record"}},"created_at":"2026-07-05T05:48:11.786231+00:00","updated_at":"2026-07-05T05:48:11.786231+00:00"}