{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:VPNUIRYRDO6FJAZ5YXS2BSSSV2","short_pith_number":"pith:VPNUIRYR","schema_version":"1.0","canonical_sha256":"abdb4447111bbc54833dc5e5a0ca52aeae3da5a29cfa9fb013c040e77cf0f134","source":{"kind":"arxiv","id":"1607.05342","version":3},"attestation_state":"computed","paper":{"title":"On the Optimality of Pseudo-polynomial Algorithms for Integer Programming","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Fahad Panolan, Fedor V. Fomin, M. S. Ramanujan, Saket Saurabh","submitted_at":"2016-07-18T22:31:26Z","abstract_excerpt":"In the classic Integer Programming (IP) problem, the objective is to decide whether, for a given $m \\times n$ matrix $A$ and an $m$-vector $b=(b_1,\\dots, b_m)$, there is a non-negative integer $n$-vector $x$ such that $Ax=b$. Solving (IP) is an important step in numerous algorithms and it is important to obtain an understanding of the precise complexity of this problem as a function of natural parameters of the input.\n  The classic pseudo-polynomial time algorithm of Papadimitriou [J. ACM 1981] for instances of (IP) with a constant number of constraints was only recently improved upon by Eisen"},"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":"1607.05342","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2016-07-18T22:31:26Z","cross_cats_sorted":[],"title_canon_sha256":"613f2fc3fe5be05d527a4e68debc4986b2015acc78d3d864a2510e4aa6dd45a5","abstract_canon_sha256":"19b77d2e8bd38b487e40547211054640ab610f18ee8c066da525ef8c519ed036"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:10:41.695356Z","signature_b64":"TuuYwUrTqqbbnv+HmWDL8xJGLX0GMiF90EGFJqywzJQRE8uRh3+ZcE6ipZFvisfJxtygUgB3rOgQiBa6fcxcAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"abdb4447111bbc54833dc5e5a0ca52aeae3da5a29cfa9fb013c040e77cf0f134","last_reissued_at":"2026-05-18T00:10:41.694688Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:10:41.694688Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"On the Optimality of Pseudo-polynomial Algorithms for Integer Programming","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Fahad Panolan, Fedor V. Fomin, M. S. Ramanujan, Saket Saurabh","submitted_at":"2016-07-18T22:31:26Z","abstract_excerpt":"In the classic Integer Programming (IP) problem, the objective is to decide whether, for a given $m \\times n$ matrix $A$ and an $m$-vector $b=(b_1,\\dots, b_m)$, there is a non-negative integer $n$-vector $x$ such that $Ax=b$. Solving (IP) is an important step in numerous algorithms and it is important to obtain an understanding of the precise complexity of this problem as a function of natural parameters of the input.\n  The classic pseudo-polynomial time algorithm of Papadimitriou [J. ACM 1981] for instances of (IP) with a constant number of constraints was only recently improved upon by Eisen"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1607.05342","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":"1607.05342","created_at":"2026-05-18T00:10:41.694779+00:00"},{"alias_kind":"arxiv_version","alias_value":"1607.05342v3","created_at":"2026-05-18T00:10:41.694779+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1607.05342","created_at":"2026-05-18T00:10:41.694779+00:00"},{"alias_kind":"pith_short_12","alias_value":"VPNUIRYRDO6F","created_at":"2026-05-18T12:30:48.956258+00:00"},{"alias_kind":"pith_short_16","alias_value":"VPNUIRYRDO6FJAZ5","created_at":"2026-05-18T12:30:48.956258+00:00"},{"alias_kind":"pith_short_8","alias_value":"VPNUIRYR","created_at":"2026-05-18T12:30:48.956258+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/VPNUIRYRDO6FJAZ5YXS2BSSSV2","json":"https://pith.science/pith/VPNUIRYRDO6FJAZ5YXS2BSSSV2.json","graph_json":"https://pith.science/api/pith-number/VPNUIRYRDO6FJAZ5YXS2BSSSV2/graph.json","events_json":"https://pith.science/api/pith-number/VPNUIRYRDO6FJAZ5YXS2BSSSV2/events.json","paper":"https://pith.science/paper/VPNUIRYR"},"agent_actions":{"view_html":"https://pith.science/pith/VPNUIRYRDO6FJAZ5YXS2BSSSV2","download_json":"https://pith.science/pith/VPNUIRYRDO6FJAZ5YXS2BSSSV2.json","view_paper":"https://pith.science/paper/VPNUIRYR","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1607.05342&json=true","fetch_graph":"https://pith.science/api/pith-number/VPNUIRYRDO6FJAZ5YXS2BSSSV2/graph.json","fetch_events":"https://pith.science/api/pith-number/VPNUIRYRDO6FJAZ5YXS2BSSSV2/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/VPNUIRYRDO6FJAZ5YXS2BSSSV2/action/timestamp_anchor","attest_storage":"https://pith.science/pith/VPNUIRYRDO6FJAZ5YXS2BSSSV2/action/storage_attestation","attest_author":"https://pith.science/pith/VPNUIRYRDO6FJAZ5YXS2BSSSV2/action/author_attestation","sign_citation":"https://pith.science/pith/VPNUIRYRDO6FJAZ5YXS2BSSSV2/action/citation_signature","submit_replication":"https://pith.science/pith/VPNUIRYRDO6FJAZ5YXS2BSSSV2/action/replication_record"}},"created_at":"2026-05-18T00:10:41.694779+00:00","updated_at":"2026-05-18T00:10:41.694779+00:00"}