{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2026:ASZZYCR5WMMD3Q3I7XQ2G4T4VE","short_pith_number":"pith:ASZZYCR5","schema_version":"1.0","canonical_sha256":"04b39c0a3db3183dc368fde1a3727ca92b3f5078ffdace29f9c86b02deba8923","source":{"kind":"arxiv","id":"2607.22263","version":1},"attestation_state":"computed","paper":{"title":"Explicit Iteration Complexity of Exact Data-Driven Inverse Optimization for Integer Linear Programs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI","cs.LG","stat.ML"],"primary_cat":"math.OC","authors_text":"Akira Kitaoka","submitted_at":"2026-07-24T12:56:54Z","abstract_excerpt":"A data-driven inverse optimization problem (DDIOP) is the problem of estimating the objective-function parameters (weights) that explain observed optimal-solution data, and it arises in many applications, including integer linear programming (ILP). It is known that, by applying gradient-based optimization methods to the suboptimality loss, the inverse optimization of ILPs can be solved exactly within finitely many oracle iterations, and that the required number of iterations is bounded as $T=O(1/\\gamma(\\ell_{\\mathrm{sub}})^2)$ in terms of a problem-dependent geometric constant $\\gamma(\\ell_{\\m"},"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":"2607.22263","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2026-07-24T12:56:54Z","cross_cats_sorted":["cs.AI","cs.LG","stat.ML"],"title_canon_sha256":"eb80e120eb0f9e0f948c7753904ab02d98d7baa3db0513b95b1de3440981a7f9","abstract_canon_sha256":"389689964881d0efc97f16d4b5086af464169cbd198afd4b61628f7a5d2a004f"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-27T01:20:56.682166Z","signature_b64":"Zq1dCy5rzIgv8PwKs2IiF/Pn549TXNe6TmmNOYHs4X2jpoq5m8Tly1k6k+NqKTPN7EKuZ7gPd1RhAG6+HoetCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"04b39c0a3db3183dc368fde1a3727ca92b3f5078ffdace29f9c86b02deba8923","last_reissued_at":"2026-07-27T01:20:56.681335Z","signature_status":"signed_v1","first_computed_at":"2026-07-27T01:20:56.681335Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Explicit Iteration Complexity of Exact Data-Driven Inverse Optimization for Integer Linear Programs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI","cs.LG","stat.ML"],"primary_cat":"math.OC","authors_text":"Akira Kitaoka","submitted_at":"2026-07-24T12:56:54Z","abstract_excerpt":"A data-driven inverse optimization problem (DDIOP) is the problem of estimating the objective-function parameters (weights) that explain observed optimal-solution data, and it arises in many applications, including integer linear programming (ILP). It is known that, by applying gradient-based optimization methods to the suboptimality loss, the inverse optimization of ILPs can be solved exactly within finitely many oracle iterations, and that the required number of iterations is bounded as $T=O(1/\\gamma(\\ell_{\\mathrm{sub}})^2)$ in terms of a problem-dependent geometric constant $\\gamma(\\ell_{\\m"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2607.22263","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/2607.22263/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":"2607.22263","created_at":"2026-07-27T01:20:56.681768+00:00"},{"alias_kind":"arxiv_version","alias_value":"2607.22263v1","created_at":"2026-07-27T01:20:56.681768+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2607.22263","created_at":"2026-07-27T01:20:56.681768+00:00"},{"alias_kind":"pith_short_12","alias_value":"ASZZYCR5WMMD","created_at":"2026-07-27T01:20:56.681768+00:00"},{"alias_kind":"pith_short_16","alias_value":"ASZZYCR5WMMD3Q3I","created_at":"2026-07-27T01:20:56.681768+00:00"},{"alias_kind":"pith_short_8","alias_value":"ASZZYCR5","created_at":"2026-07-27T01:20:56.681768+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/ASZZYCR5WMMD3Q3I7XQ2G4T4VE","json":"https://pith.science/pith/ASZZYCR5WMMD3Q3I7XQ2G4T4VE.json","graph_json":"https://pith.science/api/pith-number/ASZZYCR5WMMD3Q3I7XQ2G4T4VE/graph.json","events_json":"https://pith.science/api/pith-number/ASZZYCR5WMMD3Q3I7XQ2G4T4VE/events.json","paper":"https://pith.science/paper/ASZZYCR5"},"agent_actions":{"view_html":"https://pith.science/pith/ASZZYCR5WMMD3Q3I7XQ2G4T4VE","download_json":"https://pith.science/pith/ASZZYCR5WMMD3Q3I7XQ2G4T4VE.json","view_paper":"https://pith.science/paper/ASZZYCR5","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2607.22263&json=true","fetch_graph":"https://pith.science/api/pith-number/ASZZYCR5WMMD3Q3I7XQ2G4T4VE/graph.json","fetch_events":"https://pith.science/api/pith-number/ASZZYCR5WMMD3Q3I7XQ2G4T4VE/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/ASZZYCR5WMMD3Q3I7XQ2G4T4VE/action/timestamp_anchor","attest_storage":"https://pith.science/pith/ASZZYCR5WMMD3Q3I7XQ2G4T4VE/action/storage_attestation","attest_author":"https://pith.science/pith/ASZZYCR5WMMD3Q3I7XQ2G4T4VE/action/author_attestation","sign_citation":"https://pith.science/pith/ASZZYCR5WMMD3Q3I7XQ2G4T4VE/action/citation_signature","submit_replication":"https://pith.science/pith/ASZZYCR5WMMD3Q3I7XQ2G4T4VE/action/replication_record"}},"created_at":"2026-07-27T01:20:56.681768+00:00","updated_at":"2026-07-27T01:20:56.681768+00:00"}