{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2026:ASZZYCR5WMMD3Q3I7XQ2G4T4VE","short_pith_number":"pith:ASZZYCR5","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"},"canonical_sha256":"04b39c0a3db3183dc368fde1a3727ca92b3f5078ffdace29f9c86b02deba8923","source":{"kind":"arxiv","id":"2607.22263","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2607.22263","created_at":"2026-07-27T01:20:56Z"},{"alias_kind":"arxiv_version","alias_value":"2607.22263v1","created_at":"2026-07-27T01:20:56Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2607.22263","created_at":"2026-07-27T01:20:56Z"},{"alias_kind":"pith_short_12","alias_value":"ASZZYCR5WMMD","created_at":"2026-07-27T01:20:56Z"},{"alias_kind":"pith_short_16","alias_value":"ASZZYCR5WMMD3Q3I","created_at":"2026-07-27T01:20:56Z"},{"alias_kind":"pith_short_8","alias_value":"ASZZYCR5","created_at":"2026-07-27T01:20:56Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2026:ASZZYCR5WMMD3Q3I7XQ2G4T4VE","target":"record","payload":{"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"},"canonical_sha256":"04b39c0a3db3183dc368fde1a3727ca92b3f5078ffdace29f9c86b02deba8923","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"},"source_kind":"arxiv","source_id":"2607.22263","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-07-27T01:20:56Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"l6FQFDaQtYQlrzaaf/8iRPboBK6rFuMnsrRWQWcJepQu0BJlX4p9Kvr0FAef7EuDEEfF0RxJKx0gcxHbFYqzAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-04T14:30:10.814698Z"},"content_sha256":"7e0f37acc4366aa67da09aa219cdeff4a10b1da03891a14431cd90fa45c0e502","schema_version":"1.0","event_id":"sha256:7e0f37acc4366aa67da09aa219cdeff4a10b1da03891a14431cd90fa45c0e502"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2026:ASZZYCR5WMMD3Q3I7XQ2G4T4VE","target":"graph","payload":{"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"},"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-27T01:20:56Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"WXluYU01EsCZlscLLKYarQSuUzriKHresnqGGLWlrS1ld8w/1ZPhaSpdY9F5gAuVAbyYGCw4EbtmvfF+Wn5JBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-04T14:30:10.815231Z"},"content_sha256":"8a6fd3b51c09c566a175f8d9c563419a0a890a1c0cadfc5047ffd4f0feeee7b3","schema_version":"1.0","event_id":"sha256:8a6fd3b51c09c566a175f8d9c563419a0a890a1c0cadfc5047ffd4f0feeee7b3"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/ASZZYCR5WMMD3Q3I7XQ2G4T4VE/bundle.json","state_url":"https://pith.science/pith/ASZZYCR5WMMD3Q3I7XQ2G4T4VE/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/ASZZYCR5WMMD3Q3I7XQ2G4T4VE/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-08-04T14:30:10Z","links":{"resolver":"https://pith.science/pith/ASZZYCR5WMMD3Q3I7XQ2G4T4VE","bundle":"https://pith.science/pith/ASZZYCR5WMMD3Q3I7XQ2G4T4VE/bundle.json","state":"https://pith.science/pith/ASZZYCR5WMMD3Q3I7XQ2G4T4VE/state.json","well_known_bundle":"https://pith.science/.well-known/pith/ASZZYCR5WMMD3Q3I7XQ2G4T4VE/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2026:ASZZYCR5WMMD3Q3I7XQ2G4T4VE","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":"389689964881d0efc97f16d4b5086af464169cbd198afd4b61628f7a5d2a004f","cross_cats_sorted":["cs.AI","cs.LG","stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2026-07-24T12:56:54Z","title_canon_sha256":"eb80e120eb0f9e0f948c7753904ab02d98d7baa3db0513b95b1de3440981a7f9"},"schema_version":"1.0","source":{"id":"2607.22263","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2607.22263","created_at":"2026-07-27T01:20:56Z"},{"alias_kind":"arxiv_version","alias_value":"2607.22263v1","created_at":"2026-07-27T01:20:56Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2607.22263","created_at":"2026-07-27T01:20:56Z"},{"alias_kind":"pith_short_12","alias_value":"ASZZYCR5WMMD","created_at":"2026-07-27T01:20:56Z"},{"alias_kind":"pith_short_16","alias_value":"ASZZYCR5WMMD3Q3I","created_at":"2026-07-27T01:20:56Z"},{"alias_kind":"pith_short_8","alias_value":"ASZZYCR5","created_at":"2026-07-27T01:20:56Z"}],"graph_snapshots":[{"event_id":"sha256:8a6fd3b51c09c566a175f8d9c563419a0a890a1c0cadfc5047ffd4f0feeee7b3","target":"graph","created_at":"2026-07-27T01:20:56Z","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/2607.22263/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"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","authors_text":"Akira Kitaoka","cross_cats":["cs.AI","cs.LG","stat.ML"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2026-07-24T12:56:54Z","title":"Explicit Iteration Complexity of Exact Data-Driven Inverse Optimization for Integer Linear Programs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2607.22263","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:7e0f37acc4366aa67da09aa219cdeff4a10b1da03891a14431cd90fa45c0e502","target":"record","created_at":"2026-07-27T01:20:56Z","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":"389689964881d0efc97f16d4b5086af464169cbd198afd4b61628f7a5d2a004f","cross_cats_sorted":["cs.AI","cs.LG","stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2026-07-24T12:56:54Z","title_canon_sha256":"eb80e120eb0f9e0f948c7753904ab02d98d7baa3db0513b95b1de3440981a7f9"},"schema_version":"1.0","source":{"id":"2607.22263","kind":"arxiv","version":1}},"canonical_sha256":"04b39c0a3db3183dc368fde1a3727ca92b3f5078ffdace29f9c86b02deba8923","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"04b39c0a3db3183dc368fde1a3727ca92b3f5078ffdace29f9c86b02deba8923","first_computed_at":"2026-07-27T01:20:56.681335Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-27T01:20:56.681335Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"Zq1dCy5rzIgv8PwKs2IiF/Pn549TXNe6TmmNOYHs4X2jpoq5m8Tly1k6k+NqKTPN7EKuZ7gPd1RhAG6+HoetCg==","signature_status":"signed_v1","signed_at":"2026-07-27T01:20:56.682166Z","signed_message":"canonical_sha256_bytes"},"source_id":"2607.22263","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:7e0f37acc4366aa67da09aa219cdeff4a10b1da03891a14431cd90fa45c0e502","sha256:8a6fd3b51c09c566a175f8d9c563419a0a890a1c0cadfc5047ffd4f0feeee7b3"],"state_sha256":"1a078c0693b2859a59795562bf911af3b271f64e812532dd29ec6e5636e8be44"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"6MK/t20+k6qj/kKPuWPXwAWWPoD978M057qbMVGjRTojL4GZshpvQKEyUeQ1hDOsFQHl320xasCqLmbL6d1aCQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-04T14:30:10.848450Z","bundle_sha256":"583d5e4fc31b2e55620b88f97446ad54d3bdacaf9c1808f3a94c66fd7934adf0"}}