{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2019:MQR56KPSHCLHGD6C5VSEC6LM4U","short_pith_number":"pith:MQR56KPS","schema_version":"1.0","canonical_sha256":"6423df29f23896730fc2ed6441796ce533adf8e58b31a84a3693f7670734898b","source":{"kind":"arxiv","id":"1904.01361","version":3},"attestation_state":"computed","paper":{"title":"An Algorithmic Theory of Integer Programming","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CC","cs.DM","cs.DS","math.CO"],"primary_cat":"math.OC","authors_text":"Asaf Levin, Christoph Hunkenschr\\\"oder, Friedrich Eisenbrand, Kim-Manuel Klein, Martin Kouteck\\'y, Shmuel Onn","submitted_at":"2019-04-02T12:14:02Z","abstract_excerpt":"We study the general integer programming problem where the number of variables $n$ is a variable part of the input. We consider two natural parameters of the constraint matrix $A$: its numeric measure $a$ and its sparsity measure $d$. We show that integer programming can be solved in time $g(a,d)\\textrm{poly}(n,L)$, where $g$ is some computable function of the parameters $a$ and $d$, and $L$ is the binary encoding length of the input. In particular, integer programming is fixed-parameter tractable parameterized by $a$ and $d$, and is solvable in polynomial time for every fixed $a$ and $d$. Our"},"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":"1904.01361","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2019-04-02T12:14:02Z","cross_cats_sorted":["cs.CC","cs.DM","cs.DS","math.CO"],"title_canon_sha256":"d3ffabeee8ef3f4c0dfbae4fd198671cd901be1c3fe33a06f8ac6cd476426ab7","abstract_canon_sha256":"1416a0b4c977baaf398d3ad0daea932d8b5006674b30481ba1db92034ca75643"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T04:44:26.759946Z","signature_b64":"5xMhhOX7hNVlDmq7E6CduO6ATDBu4k2EVkWhBmokXH7tQQ2gmsMepuW7LKrt8+2OfFX/rSIPfK6GnW+TUevRBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"6423df29f23896730fc2ed6441796ce533adf8e58b31a84a3693f7670734898b","last_reissued_at":"2026-07-05T04:44:26.759519Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T04:44:26.759519Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"An Algorithmic Theory of Integer Programming","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CC","cs.DM","cs.DS","math.CO"],"primary_cat":"math.OC","authors_text":"Asaf Levin, Christoph Hunkenschr\\\"oder, Friedrich Eisenbrand, Kim-Manuel Klein, Martin Kouteck\\'y, Shmuel Onn","submitted_at":"2019-04-02T12:14:02Z","abstract_excerpt":"We study the general integer programming problem where the number of variables $n$ is a variable part of the input. We consider two natural parameters of the constraint matrix $A$: its numeric measure $a$ and its sparsity measure $d$. We show that integer programming can be solved in time $g(a,d)\\textrm{poly}(n,L)$, where $g$ is some computable function of the parameters $a$ and $d$, and $L$ is the binary encoding length of the input. In particular, integer programming is fixed-parameter tractable parameterized by $a$ and $d$, and is solvable in polynomial time for every fixed $a$ and $d$. Our"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1904.01361","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/1904.01361/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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":"1904.01361","created_at":"2026-07-05T04:44:26.759576+00:00"},{"alias_kind":"arxiv_version","alias_value":"1904.01361v3","created_at":"2026-07-05T04:44:26.759576+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1904.01361","created_at":"2026-07-05T04:44:26.759576+00:00"},{"alias_kind":"pith_short_12","alias_value":"MQR56KPSHCLH","created_at":"2026-07-05T04:44:26.759576+00:00"},{"alias_kind":"pith_short_16","alias_value":"MQR56KPSHCLHGD6C","created_at":"2026-07-05T04:44:26.759576+00:00"},{"alias_kind":"pith_short_8","alias_value":"MQR56KPS","created_at":"2026-07-05T04:44:26.759576+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":2,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2604.02395","citing_title":"Complexity of Eliminating (Majority) Illusion in Directed Networks","ref_index":13,"is_internal_anchor":false},{"citing_arxiv_id":"2604.18746","citing_title":"Parameterized Capacitated Vertex Cover Revisited","ref_index":35,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/MQR56KPSHCLHGD6C5VSEC6LM4U","json":"https://pith.science/pith/MQR56KPSHCLHGD6C5VSEC6LM4U.json","graph_json":"https://pith.science/api/pith-number/MQR56KPSHCLHGD6C5VSEC6LM4U/graph.json","events_json":"https://pith.science/api/pith-number/MQR56KPSHCLHGD6C5VSEC6LM4U/events.json","paper":"https://pith.science/paper/MQR56KPS"},"agent_actions":{"view_html":"https://pith.science/pith/MQR56KPSHCLHGD6C5VSEC6LM4U","download_json":"https://pith.science/pith/MQR56KPSHCLHGD6C5VSEC6LM4U.json","view_paper":"https://pith.science/paper/MQR56KPS","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1904.01361&json=true","fetch_graph":"https://pith.science/api/pith-number/MQR56KPSHCLHGD6C5VSEC6LM4U/graph.json","fetch_events":"https://pith.science/api/pith-number/MQR56KPSHCLHGD6C5VSEC6LM4U/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/MQR56KPSHCLHGD6C5VSEC6LM4U/action/timestamp_anchor","attest_storage":"https://pith.science/pith/MQR56KPSHCLHGD6C5VSEC6LM4U/action/storage_attestation","attest_author":"https://pith.science/pith/MQR56KPSHCLHGD6C5VSEC6LM4U/action/author_attestation","sign_citation":"https://pith.science/pith/MQR56KPSHCLHGD6C5VSEC6LM4U/action/citation_signature","submit_replication":"https://pith.science/pith/MQR56KPSHCLHGD6C5VSEC6LM4U/action/replication_record"}},"created_at":"2026-07-05T04:44:26.759576+00:00","updated_at":"2026-07-05T04:44:26.759576+00:00"}