{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2022:VDE2CUUYQJRMWB4FUO2WTQASBD","short_pith_number":"pith:VDE2CUUY","schema_version":"1.0","canonical_sha256":"a8c9a152988262cb0785a3b569c01208ec430520314ea2cebd39d86aac0147c6","source":{"kind":"arxiv","id":"2204.05266","version":2},"attestation_state":"computed","paper":{"title":"Minimizing a low-dimensional convex function over a high-dimensional cube","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","headline":"","cross_cats":["cs.DM"],"primary_cat":"math.OC","authors_text":"Christoph Hunkenschr\\\"oder, Robert Weismantel, Sebastian Pokutta","submitted_at":"2022-04-11T17:13:14Z","abstract_excerpt":"For a matrix $W \\in \\mathbb{Z}^{m \\times n}$, $m \\leq n$, and a convex function $g: \\mathbb{R}^m \\rightarrow \\mathbb{R}$, we are interested in minimizing $f(x) = g(Wx)$ over the set $\\{0,1\\}^n$. We will study separable convex functions and sharp convex functions $g$. Moreover, the matrix $W$ is unknown to us. Only the number of rows $m \\leq n$ and $\\|W\\|_{\\infty}$ is revealed. The composite function $f(x)$ is presented by a zeroth and first order oracle only. Our main result is a proximity theorem that ensures that an integral minimum and a continuous minimum for separable convex and sharp con"},"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":"2204.05266","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","primary_cat":"math.OC","submitted_at":"2022-04-11T17:13:14Z","cross_cats_sorted":["cs.DM"],"title_canon_sha256":"84c4c9088dc391a02861bfc10e4c0fe32795a61947f615f1d98bbf7f2a08550a","abstract_canon_sha256":"2116a62a85195a426e2bd283c2adbbc54b43ca8dba45eefa481f6c56ffa832d6"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T04:49:11.445879Z","signature_b64":"gP2vCrrvof68lBXFKbEW09BMPHFiaBe2L8IP1EtG50NkFE6+VCCEqh07WNZVz9Me9E0GSmkfkmrbkNiS/2pjDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"a8c9a152988262cb0785a3b569c01208ec430520314ea2cebd39d86aac0147c6","last_reissued_at":"2026-07-05T04:49:11.445452Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T04:49:11.445452Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Minimizing a low-dimensional convex function over a high-dimensional cube","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","headline":"","cross_cats":["cs.DM"],"primary_cat":"math.OC","authors_text":"Christoph Hunkenschr\\\"oder, Robert Weismantel, Sebastian Pokutta","submitted_at":"2022-04-11T17:13:14Z","abstract_excerpt":"For a matrix $W \\in \\mathbb{Z}^{m \\times n}$, $m \\leq n$, and a convex function $g: \\mathbb{R}^m \\rightarrow \\mathbb{R}$, we are interested in minimizing $f(x) = g(Wx)$ over the set $\\{0,1\\}^n$. We will study separable convex functions and sharp convex functions $g$. Moreover, the matrix $W$ is unknown to us. Only the number of rows $m \\leq n$ and $\\|W\\|_{\\infty}$ is revealed. The composite function $f(x)$ is presented by a zeroth and first order oracle only. Our main result is a proximity theorem that ensures that an integral minimum and a continuous minimum for separable convex and sharp con"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2204.05266","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/2204.05266/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":"2204.05266","created_at":"2026-07-05T04:49:11.445510+00:00"},{"alias_kind":"arxiv_version","alias_value":"2204.05266v2","created_at":"2026-07-05T04:49:11.445510+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2204.05266","created_at":"2026-07-05T04:49:11.445510+00:00"},{"alias_kind":"pith_short_12","alias_value":"VDE2CUUYQJRM","created_at":"2026-07-05T04:49:11.445510+00:00"},{"alias_kind":"pith_short_16","alias_value":"VDE2CUUYQJRMWB4F","created_at":"2026-07-05T04:49:11.445510+00:00"},{"alias_kind":"pith_short_8","alias_value":"VDE2CUUY","created_at":"2026-07-05T04:49:11.445510+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/VDE2CUUYQJRMWB4FUO2WTQASBD","json":"https://pith.science/pith/VDE2CUUYQJRMWB4FUO2WTQASBD.json","graph_json":"https://pith.science/api/pith-number/VDE2CUUYQJRMWB4FUO2WTQASBD/graph.json","events_json":"https://pith.science/api/pith-number/VDE2CUUYQJRMWB4FUO2WTQASBD/events.json","paper":"https://pith.science/paper/VDE2CUUY"},"agent_actions":{"view_html":"https://pith.science/pith/VDE2CUUYQJRMWB4FUO2WTQASBD","download_json":"https://pith.science/pith/VDE2CUUYQJRMWB4FUO2WTQASBD.json","view_paper":"https://pith.science/paper/VDE2CUUY","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2204.05266&json=true","fetch_graph":"https://pith.science/api/pith-number/VDE2CUUYQJRMWB4FUO2WTQASBD/graph.json","fetch_events":"https://pith.science/api/pith-number/VDE2CUUYQJRMWB4FUO2WTQASBD/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/VDE2CUUYQJRMWB4FUO2WTQASBD/action/timestamp_anchor","attest_storage":"https://pith.science/pith/VDE2CUUYQJRMWB4FUO2WTQASBD/action/storage_attestation","attest_author":"https://pith.science/pith/VDE2CUUYQJRMWB4FUO2WTQASBD/action/author_attestation","sign_citation":"https://pith.science/pith/VDE2CUUYQJRMWB4FUO2WTQASBD/action/citation_signature","submit_replication":"https://pith.science/pith/VDE2CUUYQJRMWB4FUO2WTQASBD/action/replication_record"}},"created_at":"2026-07-05T04:49:11.445510+00:00","updated_at":"2026-07-05T04:49:11.445510+00:00"}