{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2022:VDE2CUUYQJRMWB4FUO2WTQASBD","short_pith_number":"pith:VDE2CUUY","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"},"canonical_sha256":"a8c9a152988262cb0785a3b569c01208ec430520314ea2cebd39d86aac0147c6","source":{"kind":"arxiv","id":"2204.05266","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2204.05266","created_at":"2026-07-05T04:49:11Z"},{"alias_kind":"arxiv_version","alias_value":"2204.05266v2","created_at":"2026-07-05T04:49:11Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2204.05266","created_at":"2026-07-05T04:49:11Z"},{"alias_kind":"pith_short_12","alias_value":"VDE2CUUYQJRM","created_at":"2026-07-05T04:49:11Z"},{"alias_kind":"pith_short_16","alias_value":"VDE2CUUYQJRMWB4F","created_at":"2026-07-05T04:49:11Z"},{"alias_kind":"pith_short_8","alias_value":"VDE2CUUY","created_at":"2026-07-05T04:49:11Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2022:VDE2CUUYQJRMWB4FUO2WTQASBD","target":"record","payload":{"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"},"canonical_sha256":"a8c9a152988262cb0785a3b569c01208ec430520314ea2cebd39d86aac0147c6","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"},"source_kind":"arxiv","source_id":"2204.05266","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-05T04:49:11Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"qq6cAl/3VHjSGh2cPK1uAkItFER2yNMnf5JHu0UEGaa7VhFFVJpTw0cAeMEMZp7S2t6QAkpJ0JiNuQQ9gaL3Dg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-08T17:56:23.956644Z"},"content_sha256":"74302787af632c5d4bd8fa7e2b8fa571910ac83ad559d22f5397a7781dbfb4f8","schema_version":"1.0","event_id":"sha256:74302787af632c5d4bd8fa7e2b8fa571910ac83ad559d22f5397a7781dbfb4f8"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2022:VDE2CUUYQJRMWB4FUO2WTQASBD","target":"graph","payload":{"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"},"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-05T04:49:11Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"NnoIkS7oOsmdkXQt348C6es6qQVU/07Qrshv3sSGqezfl5d6YbgcGurVPcPiMkIx0/pSetlm4ic/viPUUUStBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-08T17:56:23.957010Z"},"content_sha256":"68ef9e418317656780967012f60f7597e1a5525448c6331066f80fe50904debb","schema_version":"1.0","event_id":"sha256:68ef9e418317656780967012f60f7597e1a5525448c6331066f80fe50904debb"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/VDE2CUUYQJRMWB4FUO2WTQASBD/bundle.json","state_url":"https://pith.science/pith/VDE2CUUYQJRMWB4FUO2WTQASBD/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/VDE2CUUYQJRMWB4FUO2WTQASBD/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-08T17:56:23Z","links":{"resolver":"https://pith.science/pith/VDE2CUUYQJRMWB4FUO2WTQASBD","bundle":"https://pith.science/pith/VDE2CUUYQJRMWB4FUO2WTQASBD/bundle.json","state":"https://pith.science/pith/VDE2CUUYQJRMWB4FUO2WTQASBD/state.json","well_known_bundle":"https://pith.science/.well-known/pith/VDE2CUUYQJRMWB4FUO2WTQASBD/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2022:VDE2CUUYQJRMWB4FUO2WTQASBD","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":"2116a62a85195a426e2bd283c2adbbc54b43ca8dba45eefa481f6c56ffa832d6","cross_cats_sorted":["cs.DM"],"license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","primary_cat":"math.OC","submitted_at":"2022-04-11T17:13:14Z","title_canon_sha256":"84c4c9088dc391a02861bfc10e4c0fe32795a61947f615f1d98bbf7f2a08550a"},"schema_version":"1.0","source":{"id":"2204.05266","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2204.05266","created_at":"2026-07-05T04:49:11Z"},{"alias_kind":"arxiv_version","alias_value":"2204.05266v2","created_at":"2026-07-05T04:49:11Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2204.05266","created_at":"2026-07-05T04:49:11Z"},{"alias_kind":"pith_short_12","alias_value":"VDE2CUUYQJRM","created_at":"2026-07-05T04:49:11Z"},{"alias_kind":"pith_short_16","alias_value":"VDE2CUUYQJRMWB4F","created_at":"2026-07-05T04:49:11Z"},{"alias_kind":"pith_short_8","alias_value":"VDE2CUUY","created_at":"2026-07-05T04:49:11Z"}],"graph_snapshots":[{"event_id":"sha256:68ef9e418317656780967012f60f7597e1a5525448c6331066f80fe50904debb","target":"graph","created_at":"2026-07-05T04:49:11Z","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/2204.05266/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"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","authors_text":"Christoph Hunkenschr\\\"oder, Robert Weismantel, Sebastian Pokutta","cross_cats":["cs.DM"],"headline":"","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","primary_cat":"math.OC","submitted_at":"2022-04-11T17:13:14Z","title":"Minimizing a low-dimensional convex function over a high-dimensional cube"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2204.05266","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:74302787af632c5d4bd8fa7e2b8fa571910ac83ad559d22f5397a7781dbfb4f8","target":"record","created_at":"2026-07-05T04:49:11Z","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":"2116a62a85195a426e2bd283c2adbbc54b43ca8dba45eefa481f6c56ffa832d6","cross_cats_sorted":["cs.DM"],"license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","primary_cat":"math.OC","submitted_at":"2022-04-11T17:13:14Z","title_canon_sha256":"84c4c9088dc391a02861bfc10e4c0fe32795a61947f615f1d98bbf7f2a08550a"},"schema_version":"1.0","source":{"id":"2204.05266","kind":"arxiv","version":2}},"canonical_sha256":"a8c9a152988262cb0785a3b569c01208ec430520314ea2cebd39d86aac0147c6","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"a8c9a152988262cb0785a3b569c01208ec430520314ea2cebd39d86aac0147c6","first_computed_at":"2026-07-05T04:49:11.445452Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T04:49:11.445452Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"gP2vCrrvof68lBXFKbEW09BMPHFiaBe2L8IP1EtG50NkFE6+VCCEqh07WNZVz9Me9E0GSmkfkmrbkNiS/2pjDw==","signature_status":"signed_v1","signed_at":"2026-07-05T04:49:11.445879Z","signed_message":"canonical_sha256_bytes"},"source_id":"2204.05266","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:74302787af632c5d4bd8fa7e2b8fa571910ac83ad559d22f5397a7781dbfb4f8","sha256:68ef9e418317656780967012f60f7597e1a5525448c6331066f80fe50904debb"],"state_sha256":"178e2a06aa0ae6340e73320df030f2c8afec4fd9a001b9c9d5c72b3822a42a90"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"t2jPRTTcuwZOzapMrs4ZPzT9ec4VUqstvhj8DRKgYdxZYMQxMoR6hLoR9+Zjc+H8zFy/L2TngFpaeJSg1jK/Bg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-07-08T17:56:23.958971Z","bundle_sha256":"efa958044f1907fa4ec1e8abd615e86d162d59c91e098e5656cb5ec654380a0b"}}