{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2024:AUXPSIJ4E5KCTOGSKEGSOCFEQV","short_pith_number":"pith:AUXPSIJ4","schema_version":"1.0","canonical_sha256":"052ef9213c275429b8d2510d2708a4857d3ecebfd71da55d356c1d790cd4ddbc","source":{"kind":"arxiv","id":"2406.09457","version":1},"attestation_state":"computed","paper":{"title":"Gap-gradient methods for solving generalized mixed integer inverse optimization: an application to political gerrymandering","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Ari J. Smith, Justin J. Boutilier","submitted_at":"2024-06-12T19:54:16Z","abstract_excerpt":"Inverse optimization has received much attention in recent years, but little literature exists for solving generalized mixed integer inverse optimization. We propose a new approach for solving generalized mixed-integer inverse optimization problems based on sub-gradient methods. We characterize when a generalized inverse optimization problem can be solved using sub-gradient methods and we prove that modifications to classic sub-gradient algorithms can return exact solutions in finite time. Our best implementation improves solution time by up to 90% compared to the best performing method from t"},"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":"2406.09457","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2024-06-12T19:54:16Z","cross_cats_sorted":[],"title_canon_sha256":"12b83b550cd297cdb5b5aa7072c8df060dc6c0c7d2a4fe207533539642fea3a2","abstract_canon_sha256":"7cfd5baaf16ee7b27dfa1d9bcf890153718823dcc78b823a7fe5817632481a01"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T08:31:54.314763Z","signature_b64":"XF7z4BXOJ7VQozePS+A7CQWOChWZBwD+djhDh/LJ4wMzFGRQ0N9opTOKKZe4N251a4VJC8RTs8GtVDWfiTYpAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"052ef9213c275429b8d2510d2708a4857d3ecebfd71da55d356c1d790cd4ddbc","last_reissued_at":"2026-07-05T08:31:54.314338Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T08:31:54.314338Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Gap-gradient methods for solving generalized mixed integer inverse optimization: an application to political gerrymandering","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Ari J. Smith, Justin J. Boutilier","submitted_at":"2024-06-12T19:54:16Z","abstract_excerpt":"Inverse optimization has received much attention in recent years, but little literature exists for solving generalized mixed integer inverse optimization. We propose a new approach for solving generalized mixed-integer inverse optimization problems based on sub-gradient methods. We characterize when a generalized inverse optimization problem can be solved using sub-gradient methods and we prove that modifications to classic sub-gradient algorithms can return exact solutions in finite time. Our best implementation improves solution time by up to 90% compared to the best performing method from t"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2406.09457","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/2406.09457/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":"2406.09457","created_at":"2026-07-05T08:31:54.314406+00:00"},{"alias_kind":"arxiv_version","alias_value":"2406.09457v1","created_at":"2026-07-05T08:31:54.314406+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2406.09457","created_at":"2026-07-05T08:31:54.314406+00:00"},{"alias_kind":"pith_short_12","alias_value":"AUXPSIJ4E5KC","created_at":"2026-07-05T08:31:54.314406+00:00"},{"alias_kind":"pith_short_16","alias_value":"AUXPSIJ4E5KCTOGS","created_at":"2026-07-05T08:31:54.314406+00:00"},{"alias_kind":"pith_short_8","alias_value":"AUXPSIJ4","created_at":"2026-07-05T08:31:54.314406+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2608.07398","citing_title":"Uncovering expert objectives in production planning via inverse optimization: An industrial case study","ref_index":30,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/AUXPSIJ4E5KCTOGSKEGSOCFEQV","json":"https://pith.science/pith/AUXPSIJ4E5KCTOGSKEGSOCFEQV.json","graph_json":"https://pith.science/api/pith-number/AUXPSIJ4E5KCTOGSKEGSOCFEQV/graph.json","events_json":"https://pith.science/api/pith-number/AUXPSIJ4E5KCTOGSKEGSOCFEQV/events.json","paper":"https://pith.science/paper/AUXPSIJ4"},"agent_actions":{"view_html":"https://pith.science/pith/AUXPSIJ4E5KCTOGSKEGSOCFEQV","download_json":"https://pith.science/pith/AUXPSIJ4E5KCTOGSKEGSOCFEQV.json","view_paper":"https://pith.science/paper/AUXPSIJ4","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2406.09457&json=true","fetch_graph":"https://pith.science/api/pith-number/AUXPSIJ4E5KCTOGSKEGSOCFEQV/graph.json","fetch_events":"https://pith.science/api/pith-number/AUXPSIJ4E5KCTOGSKEGSOCFEQV/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/AUXPSIJ4E5KCTOGSKEGSOCFEQV/action/timestamp_anchor","attest_storage":"https://pith.science/pith/AUXPSIJ4E5KCTOGSKEGSOCFEQV/action/storage_attestation","attest_author":"https://pith.science/pith/AUXPSIJ4E5KCTOGSKEGSOCFEQV/action/author_attestation","sign_citation":"https://pith.science/pith/AUXPSIJ4E5KCTOGSKEGSOCFEQV/action/citation_signature","submit_replication":"https://pith.science/pith/AUXPSIJ4E5KCTOGSKEGSOCFEQV/action/replication_record"}},"created_at":"2026-07-05T08:31:54.314406+00:00","updated_at":"2026-07-05T08:31:54.314406+00:00"}