{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2011:YNYXFVREGFR4GTAZ7MODXLYVPC","short_pith_number":"pith:YNYXFVRE","canonical_record":{"source":{"id":"1101.3267","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2011-01-17T17:05:50Z","cross_cats_sorted":["cs.DM","cs.DS","math.CO"],"title_canon_sha256":"2ede67012a8f0a7b7402b3f0e0fa0b17c8e927fe214e212be0639ac9122e9a59","abstract_canon_sha256":"1c195878b47cb389834045068cef2c314d5b4eec776be37bc0b187fefb3b3b83"},"schema_version":"1.0"},"canonical_sha256":"c37172d6243163c34c19fb1c3baf1578ad249ad1cee7ddd66d280b81d66f3842","source":{"kind":"arxiv","id":"1101.3267","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1101.3267","created_at":"2026-05-18T02:52:32Z"},{"alias_kind":"arxiv_version","alias_value":"1101.3267v1","created_at":"2026-05-18T02:52:32Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1101.3267","created_at":"2026-05-18T02:52:32Z"},{"alias_kind":"pith_short_12","alias_value":"YNYXFVREGFR4","created_at":"2026-05-18T12:26:47Z"},{"alias_kind":"pith_short_16","alias_value":"YNYXFVREGFR4GTAZ","created_at":"2026-05-18T12:26:47Z"},{"alias_kind":"pith_short_8","alias_value":"YNYXFVRE","created_at":"2026-05-18T12:26:47Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2011:YNYXFVREGFR4GTAZ7MODXLYVPC","target":"record","payload":{"canonical_record":{"source":{"id":"1101.3267","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2011-01-17T17:05:50Z","cross_cats_sorted":["cs.DM","cs.DS","math.CO"],"title_canon_sha256":"2ede67012a8f0a7b7402b3f0e0fa0b17c8e927fe214e212be0639ac9122e9a59","abstract_canon_sha256":"1c195878b47cb389834045068cef2c314d5b4eec776be37bc0b187fefb3b3b83"},"schema_version":"1.0"},"canonical_sha256":"c37172d6243163c34c19fb1c3baf1578ad249ad1cee7ddd66d280b81d66f3842","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:52:32.770294Z","signature_b64":"u0Y33qfgD8OZNIM8iqpPkIs2xOPV73JbOVTEJFg3nRtnukx2XmR206n8wnLW295uEsQSORC2SpyVGhiTlps/Dw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"c37172d6243163c34c19fb1c3baf1578ad249ad1cee7ddd66d280b81d66f3842","last_reissued_at":"2026-05-18T02:52:32.769826Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:52:32.769826Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1101.3267","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:52:32Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"c/ma00pe7Qjln5EoFOFGnSZJWWR2vkz+1fBNwEPxOgVjmzyYj2zvPjK1SphNUC7TUHHVrbiFj6LDh6klP8RnCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-21T18:13:14.040943Z"},"content_sha256":"4feb809940f5193d853f12d001790fb126a2c0271f12e209bd05406402a34bd3","schema_version":"1.0","event_id":"sha256:4feb809940f5193d853f12d001790fb126a2c0271f12e209bd05406402a34bd3"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2011:YNYXFVREGFR4GTAZ7MODXLYVPC","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"N-fold integer programming in cubic time","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM","cs.DS","math.CO"],"primary_cat":"math.OC","authors_text":"Lyubov Romanchuk, Raymond Hemmecke, Shmuel Onn","submitted_at":"2011-01-17T17:05:50Z","abstract_excerpt":"N-fold integer programming is a fundamental problem with a variety of natural applications in operations research and statistics. Moreover, it is universal and provides a new, variable-dimension, parametrization of all of integer programming. The fastest algorithm for $n$-fold integer programming predating the present article runs in time $O(n^{g(A)}L)$ with $L$ the binary length of the numerical part of the input and $g(A)$ the so-called Graver complexity of the bimatrix $A$ defining the system. In this article we provide a drastic improvement and establish an algorithm which runs in time $O("},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1101.3267","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:52:32Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"GrULNtF/CylMgKitpF4Pr+EfcNqRgzohTNE11NaUTigOtns2tS8513KtAiB3qRCJTF/TZ7Ihn8+Q4xMyGSzpAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-21T18:13:14.041481Z"},"content_sha256":"b21edddbdcd0f6ede3b58ea37bfe7fdc0d572069f8e5bb18f3a7b6a37c6e8588","schema_version":"1.0","event_id":"sha256:b21edddbdcd0f6ede3b58ea37bfe7fdc0d572069f8e5bb18f3a7b6a37c6e8588"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/YNYXFVREGFR4GTAZ7MODXLYVPC/bundle.json","state_url":"https://pith.science/pith/YNYXFVREGFR4GTAZ7MODXLYVPC/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/YNYXFVREGFR4GTAZ7MODXLYVPC/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-21T18:13:14Z","links":{"resolver":"https://pith.science/pith/YNYXFVREGFR4GTAZ7MODXLYVPC","bundle":"https://pith.science/pith/YNYXFVREGFR4GTAZ7MODXLYVPC/bundle.json","state":"https://pith.science/pith/YNYXFVREGFR4GTAZ7MODXLYVPC/state.json","well_known_bundle":"https://pith.science/.well-known/pith/YNYXFVREGFR4GTAZ7MODXLYVPC/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2011:YNYXFVREGFR4GTAZ7MODXLYVPC","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":"1c195878b47cb389834045068cef2c314d5b4eec776be37bc0b187fefb3b3b83","cross_cats_sorted":["cs.DM","cs.DS","math.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2011-01-17T17:05:50Z","title_canon_sha256":"2ede67012a8f0a7b7402b3f0e0fa0b17c8e927fe214e212be0639ac9122e9a59"},"schema_version":"1.0","source":{"id":"1101.3267","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1101.3267","created_at":"2026-05-18T02:52:32Z"},{"alias_kind":"arxiv_version","alias_value":"1101.3267v1","created_at":"2026-05-18T02:52:32Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1101.3267","created_at":"2026-05-18T02:52:32Z"},{"alias_kind":"pith_short_12","alias_value":"YNYXFVREGFR4","created_at":"2026-05-18T12:26:47Z"},{"alias_kind":"pith_short_16","alias_value":"YNYXFVREGFR4GTAZ","created_at":"2026-05-18T12:26:47Z"},{"alias_kind":"pith_short_8","alias_value":"YNYXFVRE","created_at":"2026-05-18T12:26:47Z"}],"graph_snapshots":[{"event_id":"sha256:b21edddbdcd0f6ede3b58ea37bfe7fdc0d572069f8e5bb18f3a7b6a37c6e8588","target":"graph","created_at":"2026-05-18T02:52:32Z","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":"N-fold integer programming is a fundamental problem with a variety of natural applications in operations research and statistics. Moreover, it is universal and provides a new, variable-dimension, parametrization of all of integer programming. The fastest algorithm for $n$-fold integer programming predating the present article runs in time $O(n^{g(A)}L)$ with $L$ the binary length of the numerical part of the input and $g(A)$ the so-called Graver complexity of the bimatrix $A$ defining the system. In this article we provide a drastic improvement and establish an algorithm which runs in time $O(","authors_text":"Lyubov Romanchuk, Raymond Hemmecke, Shmuel Onn","cross_cats":["cs.DM","cs.DS","math.CO"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2011-01-17T17:05:50Z","title":"N-fold integer programming in cubic time"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1101.3267","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:4feb809940f5193d853f12d001790fb126a2c0271f12e209bd05406402a34bd3","target":"record","created_at":"2026-05-18T02:52:32Z","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":"1c195878b47cb389834045068cef2c314d5b4eec776be37bc0b187fefb3b3b83","cross_cats_sorted":["cs.DM","cs.DS","math.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2011-01-17T17:05:50Z","title_canon_sha256":"2ede67012a8f0a7b7402b3f0e0fa0b17c8e927fe214e212be0639ac9122e9a59"},"schema_version":"1.0","source":{"id":"1101.3267","kind":"arxiv","version":1}},"canonical_sha256":"c37172d6243163c34c19fb1c3baf1578ad249ad1cee7ddd66d280b81d66f3842","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"c37172d6243163c34c19fb1c3baf1578ad249ad1cee7ddd66d280b81d66f3842","first_computed_at":"2026-05-18T02:52:32.769826Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:52:32.769826Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"u0Y33qfgD8OZNIM8iqpPkIs2xOPV73JbOVTEJFg3nRtnukx2XmR206n8wnLW295uEsQSORC2SpyVGhiTlps/Dw==","signature_status":"signed_v1","signed_at":"2026-05-18T02:52:32.770294Z","signed_message":"canonical_sha256_bytes"},"source_id":"1101.3267","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:4feb809940f5193d853f12d001790fb126a2c0271f12e209bd05406402a34bd3","sha256:b21edddbdcd0f6ede3b58ea37bfe7fdc0d572069f8e5bb18f3a7b6a37c6e8588"],"state_sha256":"2cbf817b2f5d2e4c9bb4b0917a38e5f32486e2dd6c4df23e5e70fd0e5cabe969"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Hf4HDfvUdkBUG/ESqlyln9bI47IxAMy/RfnwZfEHui9L9AObqz9Lb2mOZk5Tv6bakEFgfvNdry2z7LOrGHQfDw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-21T18:13:14.044524Z","bundle_sha256":"87803532469f366d603bfd8e4482ef010f5269fdba2ec20a4e82373b52dc3f0f"}}