{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:6YTMSRMZBS7EGLRZ2KWHXLKJQY","short_pith_number":"pith:6YTMSRMZ","schema_version":"1.0","canonical_sha256":"f626c945990cbe432e39d2ac7bad498613ddb5d221ed59c82300a8759ff4e559","source":{"kind":"arxiv","id":"1811.01296","version":3},"attestation_state":"computed","paper":{"title":"Tight complexity lower bounds for integer linear programming with few constraints","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Du\\v{s}an Knop, Marcin Wrochna, Micha{\\l} Pilipczuk","submitted_at":"2018-11-03T22:54:45Z","abstract_excerpt":"We consider the ILP Feasibility problem: given an integer linear program $\\{Ax = b, x\\geq 0\\}$, where $A$ is an integer matrix with $k$ rows and $\\ell$ columns and $b$ is a vector of $k$ integers, we ask whether there exists $x\\in\\mathbb{N}^\\ell$ that satisfies $Ax = b$. Our goal is to study the complexity of ILP Feasibility when both $k$, the number of constraints (rows of $A$), and $\\|A\\|_\\infty$, the largest absolute value in $A$, are small.\n  Papadimitriou [J. ACM, 1981] was the first to give a fixed-parameter algorithm for ILP Feasibility in this setting, with running time $\\left((\\|A\\mid"},"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":"1811.01296","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2018-11-03T22:54:45Z","cross_cats_sorted":[],"title_canon_sha256":"86bcbedf04549b0174ee9f8ddad474ed1b3322ec60a4b4057755af5a0402f9ce","abstract_canon_sha256":"643b23c3f3b399bf7ee3a21a30de268a3f5a0adc98942837cfc6836f192d9f77"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:39:57.946355Z","signature_b64":"2Bxxm079L0eVQw9tBjaDeozA89QXZnCDp5A6um6TktW42dxERcEVZ7sP6qEsO51phiFfuCOxyEbyWOYcS45yAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"f626c945990cbe432e39d2ac7bad498613ddb5d221ed59c82300a8759ff4e559","last_reissued_at":"2026-05-17T23:39:57.945918Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:39:57.945918Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Tight complexity lower bounds for integer linear programming with few constraints","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Du\\v{s}an Knop, Marcin Wrochna, Micha{\\l} Pilipczuk","submitted_at":"2018-11-03T22:54:45Z","abstract_excerpt":"We consider the ILP Feasibility problem: given an integer linear program $\\{Ax = b, x\\geq 0\\}$, where $A$ is an integer matrix with $k$ rows and $\\ell$ columns and $b$ is a vector of $k$ integers, we ask whether there exists $x\\in\\mathbb{N}^\\ell$ that satisfies $Ax = b$. Our goal is to study the complexity of ILP Feasibility when both $k$, the number of constraints (rows of $A$), and $\\|A\\|_\\infty$, the largest absolute value in $A$, are small.\n  Papadimitriou [J. ACM, 1981] was the first to give a fixed-parameter algorithm for ILP Feasibility in this setting, with running time $\\left((\\|A\\mid"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1811.01296","kind":"arxiv","version":3},"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":"1811.01296","created_at":"2026-05-17T23:39:57.945983+00:00"},{"alias_kind":"arxiv_version","alias_value":"1811.01296v3","created_at":"2026-05-17T23:39:57.945983+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1811.01296","created_at":"2026-05-17T23:39:57.945983+00:00"},{"alias_kind":"pith_short_12","alias_value":"6YTMSRMZBS7E","created_at":"2026-05-18T12:32:11.075285+00:00"},{"alias_kind":"pith_short_16","alias_value":"6YTMSRMZBS7EGLRZ","created_at":"2026-05-18T12:32:11.075285+00:00"},{"alias_kind":"pith_short_8","alias_value":"6YTMSRMZ","created_at":"2026-05-18T12:32:11.075285+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/6YTMSRMZBS7EGLRZ2KWHXLKJQY","json":"https://pith.science/pith/6YTMSRMZBS7EGLRZ2KWHXLKJQY.json","graph_json":"https://pith.science/api/pith-number/6YTMSRMZBS7EGLRZ2KWHXLKJQY/graph.json","events_json":"https://pith.science/api/pith-number/6YTMSRMZBS7EGLRZ2KWHXLKJQY/events.json","paper":"https://pith.science/paper/6YTMSRMZ"},"agent_actions":{"view_html":"https://pith.science/pith/6YTMSRMZBS7EGLRZ2KWHXLKJQY","download_json":"https://pith.science/pith/6YTMSRMZBS7EGLRZ2KWHXLKJQY.json","view_paper":"https://pith.science/paper/6YTMSRMZ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1811.01296&json=true","fetch_graph":"https://pith.science/api/pith-number/6YTMSRMZBS7EGLRZ2KWHXLKJQY/graph.json","fetch_events":"https://pith.science/api/pith-number/6YTMSRMZBS7EGLRZ2KWHXLKJQY/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/6YTMSRMZBS7EGLRZ2KWHXLKJQY/action/timestamp_anchor","attest_storage":"https://pith.science/pith/6YTMSRMZBS7EGLRZ2KWHXLKJQY/action/storage_attestation","attest_author":"https://pith.science/pith/6YTMSRMZBS7EGLRZ2KWHXLKJQY/action/author_attestation","sign_citation":"https://pith.science/pith/6YTMSRMZBS7EGLRZ2KWHXLKJQY/action/citation_signature","submit_replication":"https://pith.science/pith/6YTMSRMZBS7EGLRZ2KWHXLKJQY/action/replication_record"}},"created_at":"2026-05-17T23:39:57.945983+00:00","updated_at":"2026-05-17T23:39:57.945983+00:00"}