{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2009:SMMKOFXFU5KNE23V26M6F7KJZV","short_pith_number":"pith:SMMKOFXF","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"},"canonical_sha256":"9318a716e5a754d26b75d799e2fd49cd6dac017a689438247795b494d9e224f3","source":{"kind":"arxiv","id":"0911.4055","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"0911.4055","created_at":"2026-05-18T02:10:45Z"},{"alias_kind":"arxiv_version","alias_value":"0911.4055v1","created_at":"2026-05-18T02:10:45Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.0911.4055","created_at":"2026-05-18T02:10:45Z"},{"alias_kind":"pith_short_12","alias_value":"SMMKOFXFU5KN","created_at":"2026-05-18T12:26:01Z"},{"alias_kind":"pith_short_16","alias_value":"SMMKOFXFU5KNE23V","created_at":"2026-05-18T12:26:01Z"},{"alias_kind":"pith_short_8","alias_value":"SMMKOFXF","created_at":"2026-05-18T12:26:01Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2009:SMMKOFXFU5KNE23V26M6F7KJZV","target":"record","payload":{"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"},"canonical_sha256":"9318a716e5a754d26b75d799e2fd49cd6dac017a689438247795b494d9e224f3","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"},"source_kind":"arxiv","source_id":"0911.4055","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-05-18T02:10:45Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ck5KBGBjvrbz8HHaockkhecHdn7R74FxfElgEBjcN1AR3ks2f3SMU+FiUJdaBexGSPT0DQcNJSr92UQq3U2uDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T01:16:41.091137Z"},"content_sha256":"fe30fdb0fec3a7a3a275829379f670f635f92a55c3189b6a1a2c8961148f061a","schema_version":"1.0","event_id":"sha256:fe30fdb0fec3a7a3a275829379f670f635f92a55c3189b6a1a2c8961148f061a"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2009:SMMKOFXFU5KNE23V26M6F7KJZV","target":"graph","payload":{"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"},"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-05-18T02:10:45Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"9GU4uIlyT4akKSdn7eWLXjZvWPeLSivw30PLG2RCyqc72anM/wjL3giE/nB4WQfmbLiKBvbqsR9H82MQm3dFCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T01:16:41.091506Z"},"content_sha256":"e9e80beac731dbe6fd72295f4fd127c901bfa813545f6de22d0467037a9fd15d","schema_version":"1.0","event_id":"sha256:e9e80beac731dbe6fd72295f4fd127c901bfa813545f6de22d0467037a9fd15d"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/SMMKOFXFU5KNE23V26M6F7KJZV/bundle.json","state_url":"https://pith.science/pith/SMMKOFXFU5KNE23V26M6F7KJZV/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/SMMKOFXFU5KNE23V26M6F7KJZV/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-05-28T01:16:41Z","links":{"resolver":"https://pith.science/pith/SMMKOFXFU5KNE23V26M6F7KJZV","bundle":"https://pith.science/pith/SMMKOFXFU5KNE23V26M6F7KJZV/bundle.json","state":"https://pith.science/pith/SMMKOFXFU5KNE23V26M6F7KJZV/state.json","well_known_bundle":"https://pith.science/.well-known/pith/SMMKOFXFU5KNE23V26M6F7KJZV/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2009:SMMKOFXFU5KNE23V26M6F7KJZV","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":"b03e3e029b0e3a04b7acaee591307868e9447707494b204c7c638b1b7da8376d","cross_cats_sorted":["math.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2009-11-20T14:34:00Z","title_canon_sha256":"1e0076467f02572791f8ef1f6bb60f419a605a0205559c93cf6fb05e4383d79b"},"schema_version":"1.0","source":{"id":"0911.4055","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"0911.4055","created_at":"2026-05-18T02:10:45Z"},{"alias_kind":"arxiv_version","alias_value":"0911.4055v1","created_at":"2026-05-18T02:10:45Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.0911.4055","created_at":"2026-05-18T02:10:45Z"},{"alias_kind":"pith_short_12","alias_value":"SMMKOFXFU5KN","created_at":"2026-05-18T12:26:01Z"},{"alias_kind":"pith_short_16","alias_value":"SMMKOFXFU5KNE23V","created_at":"2026-05-18T12:26:01Z"},{"alias_kind":"pith_short_8","alias_value":"SMMKOFXF","created_at":"2026-05-18T12:26:01Z"}],"graph_snapshots":[{"event_id":"sha256:e9e80beac731dbe6fd72295f4fd127c901bfa813545f6de22d0467037a9fd15d","target":"graph","created_at":"2026-05-18T02:10:45Z","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"},"paper":{"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","authors_text":"Matthias K\\\"oppe, Raymond Hemmecke, Robert Weismantel","cross_cats":["math.CO"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2009-11-20T14:34:00Z","title":"A polynomial-time algorithm for optimizing over N-fold 4-block decomposable integer programs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"0911.4055","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:fe30fdb0fec3a7a3a275829379f670f635f92a55c3189b6a1a2c8961148f061a","target":"record","created_at":"2026-05-18T02:10:45Z","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":"b03e3e029b0e3a04b7acaee591307868e9447707494b204c7c638b1b7da8376d","cross_cats_sorted":["math.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2009-11-20T14:34:00Z","title_canon_sha256":"1e0076467f02572791f8ef1f6bb60f419a605a0205559c93cf6fb05e4383d79b"},"schema_version":"1.0","source":{"id":"0911.4055","kind":"arxiv","version":1}},"canonical_sha256":"9318a716e5a754d26b75d799e2fd49cd6dac017a689438247795b494d9e224f3","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"9318a716e5a754d26b75d799e2fd49cd6dac017a689438247795b494d9e224f3","first_computed_at":"2026-05-18T02:10:45.455749Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:10:45.455749Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"g92PYOd892EvaAeIHEGbVJeUhQZmXix5Mrau7q+mqC0+ghMnsIbfiW2AJR04OBmYO7w+j9aSq9OJjlKeaFBRBw==","signature_status":"signed_v1","signed_at":"2026-05-18T02:10:45.456475Z","signed_message":"canonical_sha256_bytes"},"source_id":"0911.4055","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:fe30fdb0fec3a7a3a275829379f670f635f92a55c3189b6a1a2c8961148f061a","sha256:e9e80beac731dbe6fd72295f4fd127c901bfa813545f6de22d0467037a9fd15d"],"state_sha256":"5bcb77fd6e10bb508c96c8569c57c96edc5308cd0e61e689556aefed89dcc2cc"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"rn9opXC9FA3CrRpyRzDUNQPmumD+oHdtB8e+kJQMMuTqAo5h8f07ka2ZOfRGjzsMr9dIlWHHua920pcvsgyiBw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-28T01:16:41.093484Z","bundle_sha256":"ca86b46f8fca56a137d47aaeac36f03865706b2994973ff88201b4919ee8a244"}}