{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2019:MQR56KPSHCLHGD6C5VSEC6LM4U","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":"1416a0b4c977baaf398d3ad0daea932d8b5006674b30481ba1db92034ca75643","cross_cats_sorted":["cs.CC","cs.DM","cs.DS","math.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2019-04-02T12:14:02Z","title_canon_sha256":"d3ffabeee8ef3f4c0dfbae4fd198671cd901be1c3fe33a06f8ac6cd476426ab7"},"schema_version":"1.0","source":{"id":"1904.01361","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1904.01361","created_at":"2026-07-05T04:44:26Z"},{"alias_kind":"arxiv_version","alias_value":"1904.01361v3","created_at":"2026-07-05T04:44:26Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1904.01361","created_at":"2026-07-05T04:44:26Z"},{"alias_kind":"pith_short_12","alias_value":"MQR56KPSHCLH","created_at":"2026-07-05T04:44:26Z"},{"alias_kind":"pith_short_16","alias_value":"MQR56KPSHCLHGD6C","created_at":"2026-07-05T04:44:26Z"},{"alias_kind":"pith_short_8","alias_value":"MQR56KPS","created_at":"2026-07-05T04:44:26Z"}],"graph_snapshots":[{"event_id":"sha256:8231c747dc059ac42ddbb7b8a3d4ed2f338ce6f165f644776233a028be42b117","target":"graph","created_at":"2026-07-05T04:44:26Z","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"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/1904.01361/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"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","authors_text":"Asaf Levin, Christoph Hunkenschr\\\"oder, Friedrich Eisenbrand, Kim-Manuel Klein, Martin Kouteck\\'y, Shmuel Onn","cross_cats":["cs.CC","cs.DM","cs.DS","math.CO"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2019-04-02T12:14:02Z","title":"An Algorithmic Theory of Integer Programming"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1904.01361","kind":"arxiv","version":3},"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:629d4fecfaf7b98d8d429c178c30cd864623bf08ad1a569932264459075b0c90","target":"record","created_at":"2026-07-05T04:44:26Z","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":"1416a0b4c977baaf398d3ad0daea932d8b5006674b30481ba1db92034ca75643","cross_cats_sorted":["cs.CC","cs.DM","cs.DS","math.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2019-04-02T12:14:02Z","title_canon_sha256":"d3ffabeee8ef3f4c0dfbae4fd198671cd901be1c3fe33a06f8ac6cd476426ab7"},"schema_version":"1.0","source":{"id":"1904.01361","kind":"arxiv","version":3}},"canonical_sha256":"6423df29f23896730fc2ed6441796ce533adf8e58b31a84a3693f7670734898b","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"6423df29f23896730fc2ed6441796ce533adf8e58b31a84a3693f7670734898b","first_computed_at":"2026-07-05T04:44:26.759519Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T04:44:26.759519Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"5xMhhOX7hNVlDmq7E6CduO6ATDBu4k2EVkWhBmokXH7tQQ2gmsMepuW7LKrt8+2OfFX/rSIPfK6GnW+TUevRBA==","signature_status":"signed_v1","signed_at":"2026-07-05T04:44:26.759946Z","signed_message":"canonical_sha256_bytes"},"source_id":"1904.01361","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:629d4fecfaf7b98d8d429c178c30cd864623bf08ad1a569932264459075b0c90","sha256:8231c747dc059ac42ddbb7b8a3d4ed2f338ce6f165f644776233a028be42b117"],"state_sha256":"da24f1705670b953336f8f6a44e4d2abd481d5a33922c44f3fc658377a936732"}