{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2011:YNYXFVREGFR4GTAZ7MODXLYVPC","short_pith_number":"pith:YNYXFVRE","schema_version":"1.0","canonical_sha256":"c37172d6243163c34c19fb1c3baf1578ad249ad1cee7ddd66d280b81d66f3842","source":{"kind":"arxiv","id":"1101.3267","version":1},"attestation_state":"computed","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("},"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":"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"},"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"},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1101.3267","created_at":"2026-05-18T02:52:32.769894+00:00"},{"alias_kind":"arxiv_version","alias_value":"1101.3267v1","created_at":"2026-05-18T02:52:32.769894+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1101.3267","created_at":"2026-05-18T02:52:32.769894+00:00"},{"alias_kind":"pith_short_12","alias_value":"YNYXFVREGFR4","created_at":"2026-05-18T12:26:47.523578+00:00"},{"alias_kind":"pith_short_16","alias_value":"YNYXFVREGFR4GTAZ","created_at":"2026-05-18T12:26:47.523578+00:00"},{"alias_kind":"pith_short_8","alias_value":"YNYXFVRE","created_at":"2026-05-18T12:26:47.523578+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2508.09457","citing_title":"Quantum Parrondo Paradox via a Single Phase Defect Symmetry Breaking and Directed Transport","ref_index":26,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/YNYXFVREGFR4GTAZ7MODXLYVPC","json":"https://pith.science/pith/YNYXFVREGFR4GTAZ7MODXLYVPC.json","graph_json":"https://pith.science/api/pith-number/YNYXFVREGFR4GTAZ7MODXLYVPC/graph.json","events_json":"https://pith.science/api/pith-number/YNYXFVREGFR4GTAZ7MODXLYVPC/events.json","paper":"https://pith.science/paper/YNYXFVRE"},"agent_actions":{"view_html":"https://pith.science/pith/YNYXFVREGFR4GTAZ7MODXLYVPC","download_json":"https://pith.science/pith/YNYXFVREGFR4GTAZ7MODXLYVPC.json","view_paper":"https://pith.science/paper/YNYXFVRE","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1101.3267&json=true","fetch_graph":"https://pith.science/api/pith-number/YNYXFVREGFR4GTAZ7MODXLYVPC/graph.json","fetch_events":"https://pith.science/api/pith-number/YNYXFVREGFR4GTAZ7MODXLYVPC/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/YNYXFVREGFR4GTAZ7MODXLYVPC/action/timestamp_anchor","attest_storage":"https://pith.science/pith/YNYXFVREGFR4GTAZ7MODXLYVPC/action/storage_attestation","attest_author":"https://pith.science/pith/YNYXFVREGFR4GTAZ7MODXLYVPC/action/author_attestation","sign_citation":"https://pith.science/pith/YNYXFVREGFR4GTAZ7MODXLYVPC/action/citation_signature","submit_replication":"https://pith.science/pith/YNYXFVREGFR4GTAZ7MODXLYVPC/action/replication_record"}},"created_at":"2026-05-18T02:52:32.769894+00:00","updated_at":"2026-05-18T02:52:32.769894+00:00"}