{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2012:WJDXCOZUWQOGMCX4NEAN7CRWB7","short_pith_number":"pith:WJDXCOZU","canonical_record":{"source":{"id":"1207.1149","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2012-07-05T01:10:11Z","cross_cats_sorted":[],"title_canon_sha256":"7625af26aa88114a11610f45ed48cb5ec72223ae42e163f95b5cdf0a90e87183","abstract_canon_sha256":"98b169bdc523122416d182820d5a60708f5b73d250e2f7ed1994fc9b66649dcf"},"schema_version":"1.0"},"canonical_sha256":"b247713b34b41c660afc6900df8a360ff5b0fe39e5761952c3982ccd7ab56530","source":{"kind":"arxiv","id":"1207.1149","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1207.1149","created_at":"2026-05-18T00:53:41Z"},{"alias_kind":"arxiv_version","alias_value":"1207.1149v1","created_at":"2026-05-18T00:53:41Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1207.1149","created_at":"2026-05-18T00:53:41Z"},{"alias_kind":"pith_short_12","alias_value":"WJDXCOZUWQOG","created_at":"2026-05-18T12:27:25Z"},{"alias_kind":"pith_short_16","alias_value":"WJDXCOZUWQOGMCX4","created_at":"2026-05-18T12:27:25Z"},{"alias_kind":"pith_short_8","alias_value":"WJDXCOZU","created_at":"2026-05-18T12:27:25Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2012:WJDXCOZUWQOGMCX4NEAN7CRWB7","target":"record","payload":{"canonical_record":{"source":{"id":"1207.1149","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2012-07-05T01:10:11Z","cross_cats_sorted":[],"title_canon_sha256":"7625af26aa88114a11610f45ed48cb5ec72223ae42e163f95b5cdf0a90e87183","abstract_canon_sha256":"98b169bdc523122416d182820d5a60708f5b73d250e2f7ed1994fc9b66649dcf"},"schema_version":"1.0"},"canonical_sha256":"b247713b34b41c660afc6900df8a360ff5b0fe39e5761952c3982ccd7ab56530","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:53:41.007939Z","signature_b64":"oX8eCw8ZAITO9fJEdmnpJODrjsFoB4VvR1x1CMVr//dOTKbOs6suLKNWqpNr2RpFdh8GJvogZxBhWGzAS+O/AQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"b247713b34b41c660afc6900df8a360ff5b0fe39e5761952c3982ccd7ab56530","last_reissued_at":"2026-05-18T00:53:41.007287Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:53:41.007287Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1207.1149","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-18T00:53:41Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"C3AVrhw1cw15phgj01s23pJFSN5r3Plvkfi7974HPTUBhvfIMOa7d3lVPziRBoIs/5+bKbXMOHIOO6FbeRmQBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T04:44:56.095515Z"},"content_sha256":"7b1b7c3774e18a307774979179400260a8bcafc243a8feb670c3507ed6b4b3d3","schema_version":"1.0","event_id":"sha256:7b1b7c3774e18a307774979179400260a8bcafc243a8feb670c3507ed6b4b3d3"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2012:WJDXCOZUWQOGMCX4NEAN7CRWB7","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Graver basis and proximity techniques for block-structured separable convex integer minimization problems","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Matthias K\\\"oppe, Raymond Hemmecke, Robert Weismantel","submitted_at":"2012-07-05T01:10:11Z","abstract_excerpt":"We consider N-fold 4-block decomposable integer programs, which simultaneously generalize N-fold integer programs and two-stage stochastic integer programs with N scenarios. In previous work [R. Hemmecke, M. Koeppe, R. Weismantel, A polynomial-time algorithm for optimizing over N-fold 4-block decomposable integer programs, Proc. IPCO 2010, Lecture Notes in Computer Science, vol. 6080, Springer, 2010, pp. 219--229], it was proved that for fixed blocks but variable N, these integer programs are polynomial-time solvable for any linear objective. We extend this result to the minimization of separa"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1207.1149","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-18T00:53:41Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"A28Is2yY+kRfzuLp0+RmMiAWps7677hZRwCfdftenPvsdxJxF4VxEE4iC4oxBHYxINIF8UuGfEGz2zGwLpC6Dg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T04:44:56.095933Z"},"content_sha256":"754005adabeec1dee4c77a7bd89b82c7ce13c9e8d336e1d7c6c5a4fe8351ca7f","schema_version":"1.0","event_id":"sha256:754005adabeec1dee4c77a7bd89b82c7ce13c9e8d336e1d7c6c5a4fe8351ca7f"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/WJDXCOZUWQOGMCX4NEAN7CRWB7/bundle.json","state_url":"https://pith.science/pith/WJDXCOZUWQOGMCX4NEAN7CRWB7/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/WJDXCOZUWQOGMCX4NEAN7CRWB7/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-28T04:44:56Z","links":{"resolver":"https://pith.science/pith/WJDXCOZUWQOGMCX4NEAN7CRWB7","bundle":"https://pith.science/pith/WJDXCOZUWQOGMCX4NEAN7CRWB7/bundle.json","state":"https://pith.science/pith/WJDXCOZUWQOGMCX4NEAN7CRWB7/state.json","well_known_bundle":"https://pith.science/.well-known/pith/WJDXCOZUWQOGMCX4NEAN7CRWB7/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2012:WJDXCOZUWQOGMCX4NEAN7CRWB7","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":"98b169bdc523122416d182820d5a60708f5b73d250e2f7ed1994fc9b66649dcf","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2012-07-05T01:10:11Z","title_canon_sha256":"7625af26aa88114a11610f45ed48cb5ec72223ae42e163f95b5cdf0a90e87183"},"schema_version":"1.0","source":{"id":"1207.1149","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1207.1149","created_at":"2026-05-18T00:53:41Z"},{"alias_kind":"arxiv_version","alias_value":"1207.1149v1","created_at":"2026-05-18T00:53:41Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1207.1149","created_at":"2026-05-18T00:53:41Z"},{"alias_kind":"pith_short_12","alias_value":"WJDXCOZUWQOG","created_at":"2026-05-18T12:27:25Z"},{"alias_kind":"pith_short_16","alias_value":"WJDXCOZUWQOGMCX4","created_at":"2026-05-18T12:27:25Z"},{"alias_kind":"pith_short_8","alias_value":"WJDXCOZU","created_at":"2026-05-18T12:27:25Z"}],"graph_snapshots":[{"event_id":"sha256:754005adabeec1dee4c77a7bd89b82c7ce13c9e8d336e1d7c6c5a4fe8351ca7f","target":"graph","created_at":"2026-05-18T00:53:41Z","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":"We consider N-fold 4-block decomposable integer programs, which simultaneously generalize N-fold integer programs and two-stage stochastic integer programs with N scenarios. In previous work [R. Hemmecke, M. Koeppe, R. Weismantel, A polynomial-time algorithm for optimizing over N-fold 4-block decomposable integer programs, Proc. IPCO 2010, Lecture Notes in Computer Science, vol. 6080, Springer, 2010, pp. 219--229], it was proved that for fixed blocks but variable N, these integer programs are polynomial-time solvable for any linear objective. We extend this result to the minimization of separa","authors_text":"Matthias K\\\"oppe, Raymond Hemmecke, Robert Weismantel","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2012-07-05T01:10:11Z","title":"Graver basis and proximity techniques for block-structured separable convex integer minimization problems"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1207.1149","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:7b1b7c3774e18a307774979179400260a8bcafc243a8feb670c3507ed6b4b3d3","target":"record","created_at":"2026-05-18T00:53:41Z","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":"98b169bdc523122416d182820d5a60708f5b73d250e2f7ed1994fc9b66649dcf","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2012-07-05T01:10:11Z","title_canon_sha256":"7625af26aa88114a11610f45ed48cb5ec72223ae42e163f95b5cdf0a90e87183"},"schema_version":"1.0","source":{"id":"1207.1149","kind":"arxiv","version":1}},"canonical_sha256":"b247713b34b41c660afc6900df8a360ff5b0fe39e5761952c3982ccd7ab56530","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"b247713b34b41c660afc6900df8a360ff5b0fe39e5761952c3982ccd7ab56530","first_computed_at":"2026-05-18T00:53:41.007287Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:53:41.007287Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"oX8eCw8ZAITO9fJEdmnpJODrjsFoB4VvR1x1CMVr//dOTKbOs6suLKNWqpNr2RpFdh8GJvogZxBhWGzAS+O/AQ==","signature_status":"signed_v1","signed_at":"2026-05-18T00:53:41.007939Z","signed_message":"canonical_sha256_bytes"},"source_id":"1207.1149","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:7b1b7c3774e18a307774979179400260a8bcafc243a8feb670c3507ed6b4b3d3","sha256:754005adabeec1dee4c77a7bd89b82c7ce13c9e8d336e1d7c6c5a4fe8351ca7f"],"state_sha256":"a716536b4cbf332ae4f6d072ab67a563502e958575d3f0885956851ba7da719f"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"9SJHwcSyo/SuM4tmC+Rx4S0S3NCnmjulDxiSRJ1BHrf7IXzhZ+GK56wCbaeN9Lzo21jFkGN7ywqFVtd1N93jCw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-28T04:44:56.098825Z","bundle_sha256":"834433b8b6d1e111d9ae5c99f23c32a232408749eeb3ad27a5bd42ebd45bf8c6"}}