{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2009:SMMKOFXFU5KNE23V26M6F7KJZV","short_pith_number":"pith:SMMKOFXF","schema_version":"1.0","canonical_sha256":"9318a716e5a754d26b75d799e2fd49cd6dac017a689438247795b494d9e224f3","source":{"kind":"arxiv","id":"0911.4055","version":1},"attestation_state":"computed","paper":{"title":"A polynomial-time algorithm for optimizing over N-fold 4-block decomposable integer programs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.CO"],"primary_cat":"math.OC","authors_text":"Matthias K\\\"oppe, Raymond Hemmecke, Robert Weismantel","submitted_at":"2009-11-20T14:34:00Z","abstract_excerpt":"In this paper we generalize N-fold integer programs and two-stage integer programs with N scenarios to N-fold 4-block decomposable integer programs. We show that for fixed blocks but variable N, these integer programs are polynomial-time solvable for any linear objective. Moreover, we present a polynomial-time computable optimality certificate for the case of fixed blocks, variable N and any convex separable objective function. We conclude with two sample applications, stochastic integer programs with second-order dominance constraints and stochastic integer multi-commodity flows, which (for f"},"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":"0911.4055","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2009-11-20T14:34:00Z","cross_cats_sorted":["math.CO"],"title_canon_sha256":"1e0076467f02572791f8ef1f6bb60f419a605a0205559c93cf6fb05e4383d79b","abstract_canon_sha256":"b03e3e029b0e3a04b7acaee591307868e9447707494b204c7c638b1b7da8376d"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:10:45.456475Z","signature_b64":"g92PYOd892EvaAeIHEGbVJeUhQZmXix5Mrau7q+mqC0+ghMnsIbfiW2AJR04OBmYO7w+j9aSq9OJjlKeaFBRBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"9318a716e5a754d26b75d799e2fd49cd6dac017a689438247795b494d9e224f3","last_reissued_at":"2026-05-18T02:10:45.455749Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:10:45.455749Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A polynomial-time algorithm for optimizing over N-fold 4-block decomposable integer programs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.CO"],"primary_cat":"math.OC","authors_text":"Matthias K\\\"oppe, Raymond Hemmecke, Robert Weismantel","submitted_at":"2009-11-20T14:34:00Z","abstract_excerpt":"In this paper we generalize N-fold integer programs and two-stage integer programs with N scenarios to N-fold 4-block decomposable integer programs. We show that for fixed blocks but variable N, these integer programs are polynomial-time solvable for any linear objective. Moreover, we present a polynomial-time computable optimality certificate for the case of fixed blocks, variable N and any convex separable objective function. We conclude with two sample applications, stochastic integer programs with second-order dominance constraints and stochastic integer multi-commodity flows, which (for f"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"0911.4055","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":"0911.4055","created_at":"2026-05-18T02:10:45.455857+00:00"},{"alias_kind":"arxiv_version","alias_value":"0911.4055v1","created_at":"2026-05-18T02:10:45.455857+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.0911.4055","created_at":"2026-05-18T02:10:45.455857+00:00"},{"alias_kind":"pith_short_12","alias_value":"SMMKOFXFU5KN","created_at":"2026-05-18T12:26:01.383474+00:00"},{"alias_kind":"pith_short_16","alias_value":"SMMKOFXFU5KNE23V","created_at":"2026-05-18T12:26:01.383474+00:00"},{"alias_kind":"pith_short_8","alias_value":"SMMKOFXF","created_at":"2026-05-18T12:26:01.383474+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/SMMKOFXFU5KNE23V26M6F7KJZV","json":"https://pith.science/pith/SMMKOFXFU5KNE23V26M6F7KJZV.json","graph_json":"https://pith.science/api/pith-number/SMMKOFXFU5KNE23V26M6F7KJZV/graph.json","events_json":"https://pith.science/api/pith-number/SMMKOFXFU5KNE23V26M6F7KJZV/events.json","paper":"https://pith.science/paper/SMMKOFXF"},"agent_actions":{"view_html":"https://pith.science/pith/SMMKOFXFU5KNE23V26M6F7KJZV","download_json":"https://pith.science/pith/SMMKOFXFU5KNE23V26M6F7KJZV.json","view_paper":"https://pith.science/paper/SMMKOFXF","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=0911.4055&json=true","fetch_graph":"https://pith.science/api/pith-number/SMMKOFXFU5KNE23V26M6F7KJZV/graph.json","fetch_events":"https://pith.science/api/pith-number/SMMKOFXFU5KNE23V26M6F7KJZV/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/SMMKOFXFU5KNE23V26M6F7KJZV/action/timestamp_anchor","attest_storage":"https://pith.science/pith/SMMKOFXFU5KNE23V26M6F7KJZV/action/storage_attestation","attest_author":"https://pith.science/pith/SMMKOFXFU5KNE23V26M6F7KJZV/action/author_attestation","sign_citation":"https://pith.science/pith/SMMKOFXFU5KNE23V26M6F7KJZV/action/citation_signature","submit_replication":"https://pith.science/pith/SMMKOFXFU5KNE23V26M6F7KJZV/action/replication_record"}},"created_at":"2026-05-18T02:10:45.455857+00:00","updated_at":"2026-05-18T02:10:45.455857+00:00"}