{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2012:LDEOXTENAYWWA5DLE267Y2K4WT","short_pith_number":"pith:LDEOXTEN","canonical_record":{"source":{"id":"1209.0686","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2012-09-04T16:15:35Z","cross_cats_sorted":[],"title_canon_sha256":"a774cc80541fe69e2a9f0ac442b5fb21aaa7dcf559baeef153cbfc85c4bd2b0a","abstract_canon_sha256":"b8eb94b46aae37122d24f5c16d1946c132dea37874e341c79045ddef986fbdc7"},"schema_version":"1.0"},"canonical_sha256":"58c8ebcc8d062d60746b26bdfc695cb4e85aecfa38f36a0eab852ddaff5543ba","source":{"kind":"arxiv","id":"1209.0686","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1209.0686","created_at":"2026-05-18T03:46:17Z"},{"alias_kind":"arxiv_version","alias_value":"1209.0686v1","created_at":"2026-05-18T03:46:17Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1209.0686","created_at":"2026-05-18T03:46:17Z"},{"alias_kind":"pith_short_12","alias_value":"LDEOXTENAYWW","created_at":"2026-05-18T12:27:14Z"},{"alias_kind":"pith_short_16","alias_value":"LDEOXTENAYWWA5DL","created_at":"2026-05-18T12:27:14Z"},{"alias_kind":"pith_short_8","alias_value":"LDEOXTEN","created_at":"2026-05-18T12:27:14Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2012:LDEOXTENAYWWA5DLE267Y2K4WT","target":"record","payload":{"canonical_record":{"source":{"id":"1209.0686","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2012-09-04T16:15:35Z","cross_cats_sorted":[],"title_canon_sha256":"a774cc80541fe69e2a9f0ac442b5fb21aaa7dcf559baeef153cbfc85c4bd2b0a","abstract_canon_sha256":"b8eb94b46aae37122d24f5c16d1946c132dea37874e341c79045ddef986fbdc7"},"schema_version":"1.0"},"canonical_sha256":"58c8ebcc8d062d60746b26bdfc695cb4e85aecfa38f36a0eab852ddaff5543ba","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:46:17.474552Z","signature_b64":"ifMivhK9VWTv6bh9yDgNXZEp+DIH6MLUFbC5rwOH5eq00oZzzsn4C25mfBbA6qqZdtAlVzrKrxvYuYxZvEqVCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"58c8ebcc8d062d60746b26bdfc695cb4e85aecfa38f36a0eab852ddaff5543ba","last_reissued_at":"2026-05-18T03:46:17.473803Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:46:17.473803Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1209.0686","source_version":1,"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-05-18T03:46:17Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"28NrQ3/jMdRHSrBxWujbyUn5xOxHHGxTV20iRkYZIKUbG/aNFBsrTr8VLQQvuSv5okyfcocSU/L4MmPaDCdUCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-29T14:58:06.536145Z"},"content_sha256":"8b06d2059560ca0abd1cdb977dddac20e9b14f8c214772e3ee27a22c3f274b5c","schema_version":"1.0","event_id":"sha256:8b06d2059560ca0abd1cdb977dddac20e9b14f8c214772e3ee27a22c3f274b5c"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2012:LDEOXTENAYWWA5DLE267Y2K4WT","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Mirror-Descent Methods in Mixed-Integer Convex Optimization","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Christian Wagner, Michel Baes, Robert Weismantel, Timm Oertel","submitted_at":"2012-09-04T16:15:35Z","abstract_excerpt":"In this paper, we address the problem of minimizing a convex function f over a convex set, with the extra constraint that some variables must be integer. This problem, even when f is a piecewise linear function, is NP-hard. We study an algorithmic approach to this problem, postponing its hardness to the realization of an oracle. If this oracle can be realized in polynomial time, then the problem can be solved in polynomial time as well. For problems with two integer variables, we show that the oracle can be implemented efficiently, that is, in O(ln(B)) approximate minimizations of f over the c"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1209.0686","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":""},"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-05-18T03:46:17Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"AhmIpeA1IYD5V1l79E3+tQd+lB70+Gd/UvWL1rQBT9PvKmoZ6DrfIQOVAtECn3oHdwMGbOMPbdy/agBQFxdvAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-29T14:58:06.536689Z"},"content_sha256":"6e6e6787f542ebfd98b13622612f8165a4e52ac437ebd437480abdba41cdd138","schema_version":"1.0","event_id":"sha256:6e6e6787f542ebfd98b13622612f8165a4e52ac437ebd437480abdba41cdd138"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/LDEOXTENAYWWA5DLE267Y2K4WT/bundle.json","state_url":"https://pith.science/pith/LDEOXTENAYWWA5DLE267Y2K4WT/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/LDEOXTENAYWWA5DLE267Y2K4WT/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-06-29T14:58:06Z","links":{"resolver":"https://pith.science/pith/LDEOXTENAYWWA5DLE267Y2K4WT","bundle":"https://pith.science/pith/LDEOXTENAYWWA5DLE267Y2K4WT/bundle.json","state":"https://pith.science/pith/LDEOXTENAYWWA5DLE267Y2K4WT/state.json","well_known_bundle":"https://pith.science/.well-known/pith/LDEOXTENAYWWA5DLE267Y2K4WT/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2012:LDEOXTENAYWWA5DLE267Y2K4WT","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":"b8eb94b46aae37122d24f5c16d1946c132dea37874e341c79045ddef986fbdc7","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2012-09-04T16:15:35Z","title_canon_sha256":"a774cc80541fe69e2a9f0ac442b5fb21aaa7dcf559baeef153cbfc85c4bd2b0a"},"schema_version":"1.0","source":{"id":"1209.0686","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1209.0686","created_at":"2026-05-18T03:46:17Z"},{"alias_kind":"arxiv_version","alias_value":"1209.0686v1","created_at":"2026-05-18T03:46:17Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1209.0686","created_at":"2026-05-18T03:46:17Z"},{"alias_kind":"pith_short_12","alias_value":"LDEOXTENAYWW","created_at":"2026-05-18T12:27:14Z"},{"alias_kind":"pith_short_16","alias_value":"LDEOXTENAYWWA5DL","created_at":"2026-05-18T12:27:14Z"},{"alias_kind":"pith_short_8","alias_value":"LDEOXTEN","created_at":"2026-05-18T12:27:14Z"}],"graph_snapshots":[{"event_id":"sha256:6e6e6787f542ebfd98b13622612f8165a4e52ac437ebd437480abdba41cdd138","target":"graph","created_at":"2026-05-18T03:46:17Z","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":"In this paper, we address the problem of minimizing a convex function f over a convex set, with the extra constraint that some variables must be integer. This problem, even when f is a piecewise linear function, is NP-hard. We study an algorithmic approach to this problem, postponing its hardness to the realization of an oracle. If this oracle can be realized in polynomial time, then the problem can be solved in polynomial time as well. For problems with two integer variables, we show that the oracle can be implemented efficiently, that is, in O(ln(B)) approximate minimizations of f over the c","authors_text":"Christian Wagner, Michel Baes, Robert Weismantel, Timm Oertel","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2012-09-04T16:15:35Z","title":"Mirror-Descent Methods in Mixed-Integer Convex Optimization"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1209.0686","kind":"arxiv","version":1},"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:8b06d2059560ca0abd1cdb977dddac20e9b14f8c214772e3ee27a22c3f274b5c","target":"record","created_at":"2026-05-18T03:46:17Z","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":"b8eb94b46aae37122d24f5c16d1946c132dea37874e341c79045ddef986fbdc7","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2012-09-04T16:15:35Z","title_canon_sha256":"a774cc80541fe69e2a9f0ac442b5fb21aaa7dcf559baeef153cbfc85c4bd2b0a"},"schema_version":"1.0","source":{"id":"1209.0686","kind":"arxiv","version":1}},"canonical_sha256":"58c8ebcc8d062d60746b26bdfc695cb4e85aecfa38f36a0eab852ddaff5543ba","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"58c8ebcc8d062d60746b26bdfc695cb4e85aecfa38f36a0eab852ddaff5543ba","first_computed_at":"2026-05-18T03:46:17.473803Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:46:17.473803Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"ifMivhK9VWTv6bh9yDgNXZEp+DIH6MLUFbC5rwOH5eq00oZzzsn4C25mfBbA6qqZdtAlVzrKrxvYuYxZvEqVCw==","signature_status":"signed_v1","signed_at":"2026-05-18T03:46:17.474552Z","signed_message":"canonical_sha256_bytes"},"source_id":"1209.0686","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:8b06d2059560ca0abd1cdb977dddac20e9b14f8c214772e3ee27a22c3f274b5c","sha256:6e6e6787f542ebfd98b13622612f8165a4e52ac437ebd437480abdba41cdd138"],"state_sha256":"4d47852bbec20e6faf6c9518ea58212a931f1fd4c89f5d3cd507d0c483685f82"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"8maP3pbRMCkH/AwA8K8oB5wlWFh3eIsfesVvGGi8s97xknltpDRigEMPAIYGJvFY9Fv1nTVNGiFxQokypFekDw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-29T14:58:06.538501Z","bundle_sha256":"e91d80c37f00e15ab7a26d4c45ddc8c7e1d6a5a9a8e672206e0d387605748e70"}}