{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2022:T64PO3B5PZKLKCORNPZCUJHH5J","short_pith_number":"pith:T64PO3B5","schema_version":"1.0","canonical_sha256":"9fb8f76c3d7e54b509d16bf22a24e7ea69416193f9e3a7c0c74280fd05dde988","source":{"kind":"arxiv","id":"2208.11010","version":6},"attestation_state":"computed","paper":{"title":"Convex mixed-integer optimization with Frank-Wolfe methods","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.DM","cs.LG","stat.CO"],"primary_cat":"math.OC","authors_text":"Deborah Hendrych, Hannah Troppens, Mathieu Besan\\c{c}on, Sebastian Pokutta","submitted_at":"2022-08-23T14:46:54Z","abstract_excerpt":"Mixed-integer nonlinear optimization encompasses a broad class of problems that present both theoretical and computational challenges. We propose a new type of method to solve these problems based on a branch-and-bound algorithm with convex node relaxations. These relaxations are solved with a Frank-Wolfe algorithm over the convex hull of mixed-integer feasible points instead of the continuous relaxation via calls to a mixed-integer linear solver as the linear minimization oracle. The proposed method computes feasible solutions while working on a single representation of the polyhedral constra"},"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":"2208.11010","kind":"arxiv","version":6},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.OC","submitted_at":"2022-08-23T14:46:54Z","cross_cats_sorted":["cs.DM","cs.LG","stat.CO"],"title_canon_sha256":"70a98d73f85105e896bb44e53f9d3e9fcc825a229f0ede6c6dc4e8d56664a76a","abstract_canon_sha256":"a18b4e1d42c3ce7cedd6a28c48da041d50b7c5f6d6a9e66f636c4e740db843b4"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T08:45:19.948470Z","signature_b64":"w6BWnk/A2HnW0oE7057flAFEGPUVQ4hmiKvNpQ8eizNhlv6S1DWMcMJD6GyB4FA1DAtIFXiYy7Ivc6dimmTFAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"9fb8f76c3d7e54b509d16bf22a24e7ea69416193f9e3a7c0c74280fd05dde988","last_reissued_at":"2026-07-05T08:45:19.948047Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T08:45:19.948047Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Convex mixed-integer optimization with Frank-Wolfe methods","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.DM","cs.LG","stat.CO"],"primary_cat":"math.OC","authors_text":"Deborah Hendrych, Hannah Troppens, Mathieu Besan\\c{c}on, Sebastian Pokutta","submitted_at":"2022-08-23T14:46:54Z","abstract_excerpt":"Mixed-integer nonlinear optimization encompasses a broad class of problems that present both theoretical and computational challenges. We propose a new type of method to solve these problems based on a branch-and-bound algorithm with convex node relaxations. These relaxations are solved with a Frank-Wolfe algorithm over the convex hull of mixed-integer feasible points instead of the continuous relaxation via calls to a mixed-integer linear solver as the linear minimization oracle. The proposed method computes feasible solutions while working on a single representation of the polyhedral constra"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2208.11010","kind":"arxiv","version":6},"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/2208.11010/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":"2208.11010","created_at":"2026-07-05T08:45:19.948102+00:00"},{"alias_kind":"arxiv_version","alias_value":"2208.11010v6","created_at":"2026-07-05T08:45:19.948102+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2208.11010","created_at":"2026-07-05T08:45:19.948102+00:00"},{"alias_kind":"pith_short_12","alias_value":"T64PO3B5PZKL","created_at":"2026-07-05T08:45:19.948102+00:00"},{"alias_kind":"pith_short_16","alias_value":"T64PO3B5PZKLKCOR","created_at":"2026-07-05T08:45:19.948102+00:00"},{"alias_kind":"pith_short_8","alias_value":"T64PO3B5","created_at":"2026-07-05T08:45:19.948102+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/T64PO3B5PZKLKCORNPZCUJHH5J","json":"https://pith.science/pith/T64PO3B5PZKLKCORNPZCUJHH5J.json","graph_json":"https://pith.science/api/pith-number/T64PO3B5PZKLKCORNPZCUJHH5J/graph.json","events_json":"https://pith.science/api/pith-number/T64PO3B5PZKLKCORNPZCUJHH5J/events.json","paper":"https://pith.science/paper/T64PO3B5"},"agent_actions":{"view_html":"https://pith.science/pith/T64PO3B5PZKLKCORNPZCUJHH5J","download_json":"https://pith.science/pith/T64PO3B5PZKLKCORNPZCUJHH5J.json","view_paper":"https://pith.science/paper/T64PO3B5","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2208.11010&json=true","fetch_graph":"https://pith.science/api/pith-number/T64PO3B5PZKLKCORNPZCUJHH5J/graph.json","fetch_events":"https://pith.science/api/pith-number/T64PO3B5PZKLKCORNPZCUJHH5J/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/T64PO3B5PZKLKCORNPZCUJHH5J/action/timestamp_anchor","attest_storage":"https://pith.science/pith/T64PO3B5PZKLKCORNPZCUJHH5J/action/storage_attestation","attest_author":"https://pith.science/pith/T64PO3B5PZKLKCORNPZCUJHH5J/action/author_attestation","sign_citation":"https://pith.science/pith/T64PO3B5PZKLKCORNPZCUJHH5J/action/citation_signature","submit_replication":"https://pith.science/pith/T64PO3B5PZKLKCORNPZCUJHH5J/action/replication_record"}},"created_at":"2026-07-05T08:45:19.948102+00:00","updated_at":"2026-07-05T08:45:19.948102+00:00"}