{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:2HSKTQGRW5SPNALJFUY3VIXHWL","short_pith_number":"pith:2HSKTQGR","schema_version":"1.0","canonical_sha256":"d1e4a9c0d1b764f681692d31baa2e7b2dc8bdddbb508ec8e88737619b77890d6","source":{"kind":"arxiv","id":"1605.05194","version":1},"attestation_state":"computed","paper":{"title":"Integer Set Reduction for Stochastic Mixed-Integer Programming","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Lewis Ntaimo, Saravanan Venkatachalam","submitted_at":"2016-04-29T02:26:36Z","abstract_excerpt":"Two-stage stochastic mixed-integer programming (SMIP) problems with general integer variables in the second-stage are generally difficult to solve. This paper develops the theory of integer set reduction for characterizing the subset of the convex hull of feasible integer points of the second-stage subproblem which can be used for solving the SMIP. The basic idea is to consider a small enough subset of feasible integer points that is necessary for generating a valid inequality for the integer subproblem. An algorithm for obtaining such a subset based on the solution of the subproblem LP-relaxa"},"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":"1605.05194","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2016-04-29T02:26:36Z","cross_cats_sorted":[],"title_canon_sha256":"6cdf63723304294bf8fcda5f2e3b41d7641a314d262043b233e1ff8661562d03","abstract_canon_sha256":"ec7a139c0cb7263a270c774e23597b6bc16f02302666cf994f251278b0366615"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:03:26.441945Z","signature_b64":"B22WUcgfaNvpR2eTO9TyH5rEyiYpBBBg7w/LuFkphtovvWWekQUZpoMlyS6NshLQLInMLcSo9hNpCsArvH66Dg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"d1e4a9c0d1b764f681692d31baa2e7b2dc8bdddbb508ec8e88737619b77890d6","last_reissued_at":"2026-05-18T01:03:26.441539Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:03:26.441539Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Integer Set Reduction for Stochastic Mixed-Integer Programming","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Lewis Ntaimo, Saravanan Venkatachalam","submitted_at":"2016-04-29T02:26:36Z","abstract_excerpt":"Two-stage stochastic mixed-integer programming (SMIP) problems with general integer variables in the second-stage are generally difficult to solve. This paper develops the theory of integer set reduction for characterizing the subset of the convex hull of feasible integer points of the second-stage subproblem which can be used for solving the SMIP. The basic idea is to consider a small enough subset of feasible integer points that is necessary for generating a valid inequality for the integer subproblem. An algorithm for obtaining such a subset based on the solution of the subproblem LP-relaxa"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1605.05194","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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1605.05194","created_at":"2026-05-18T01:03:26.441605+00:00"},{"alias_kind":"arxiv_version","alias_value":"1605.05194v1","created_at":"2026-05-18T01:03:26.441605+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1605.05194","created_at":"2026-05-18T01:03:26.441605+00:00"},{"alias_kind":"pith_short_12","alias_value":"2HSKTQGRW5SP","created_at":"2026-05-18T12:29:55.572404+00:00"},{"alias_kind":"pith_short_16","alias_value":"2HSKTQGRW5SPNALJ","created_at":"2026-05-18T12:29:55.572404+00:00"},{"alias_kind":"pith_short_8","alias_value":"2HSKTQGR","created_at":"2026-05-18T12:29:55.572404+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"1907.07909","citing_title":"Visible points, the separation problem, and applications to MINLP","ref_index":15,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/2HSKTQGRW5SPNALJFUY3VIXHWL","json":"https://pith.science/pith/2HSKTQGRW5SPNALJFUY3VIXHWL.json","graph_json":"https://pith.science/api/pith-number/2HSKTQGRW5SPNALJFUY3VIXHWL/graph.json","events_json":"https://pith.science/api/pith-number/2HSKTQGRW5SPNALJFUY3VIXHWL/events.json","paper":"https://pith.science/paper/2HSKTQGR"},"agent_actions":{"view_html":"https://pith.science/pith/2HSKTQGRW5SPNALJFUY3VIXHWL","download_json":"https://pith.science/pith/2HSKTQGRW5SPNALJFUY3VIXHWL.json","view_paper":"https://pith.science/paper/2HSKTQGR","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1605.05194&json=true","fetch_graph":"https://pith.science/api/pith-number/2HSKTQGRW5SPNALJFUY3VIXHWL/graph.json","fetch_events":"https://pith.science/api/pith-number/2HSKTQGRW5SPNALJFUY3VIXHWL/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/2HSKTQGRW5SPNALJFUY3VIXHWL/action/timestamp_anchor","attest_storage":"https://pith.science/pith/2HSKTQGRW5SPNALJFUY3VIXHWL/action/storage_attestation","attest_author":"https://pith.science/pith/2HSKTQGRW5SPNALJFUY3VIXHWL/action/author_attestation","sign_citation":"https://pith.science/pith/2HSKTQGRW5SPNALJFUY3VIXHWL/action/citation_signature","submit_replication":"https://pith.science/pith/2HSKTQGRW5SPNALJFUY3VIXHWL/action/replication_record"}},"created_at":"2026-05-18T01:03:26.441605+00:00","updated_at":"2026-05-18T01:03:26.441605+00:00"}