{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:6AFUUAIY2EZ3BU6I3Y6DBJHJBG","short_pith_number":"pith:6AFUUAIY","schema_version":"1.0","canonical_sha256":"f00b4a0118d133b0d3c8de3c30a4e909b7350e6e80a6005deaa8ace62a7919a9","source":{"kind":"arxiv","id":"1811.00950","version":1},"attestation_state":"computed","paper":{"title":"Near-Linear Time Algorithm for n-fold ILPs via Color Coding","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Alexandra Lassota, Klaus Jansen, Lars Rohwedder","submitted_at":"2018-11-02T15:59:32Z","abstract_excerpt":"We study an important case of ILPs $\\max\\{c^Tx \\ \\vert\\ \\mathcal Ax = b, l \\leq x \\leq u,\\, x \\in \\mathbb{Z}^{n t} \\} $ with $n\\cdot t$ variables and lower and upper bounds $\\ell, u\\in\\mathbb Z^{nt}$. In $n$-fold ILPs non-zero entries only appear in the first $r$ rows of the matrix $\\mathcal A$ and in small blocks of size $s\\times t$ along the diagonal underneath. Despite this restriction many optimization problems can be expressed in this form. It is known that $n$-fold ILPs can be solved in FPT time regarding the parameters $s, r,$ and $\\Delta$, where $\\Delta$ is the greatest absolute value "},"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.00950","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2018-11-02T15:59:32Z","cross_cats_sorted":[],"title_canon_sha256":"5dac60aee8d76c90000fce2755ada09093994d07298be71b199a5e0a7983ff88","abstract_canon_sha256":"ee918372ac82ddc4342304b3d414c3ea2e262f9664d4de63cddb2d3d1671fa61"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:01:41.635362Z","signature_b64":"SslEshj43ZV9cOsC7I7sGFtiy/i1RCogvo8rJDPZFWzc48nDTkr4LtZbbFCm+pBdJ2kW2UIdPtFhHXS56stXDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"f00b4a0118d133b0d3c8de3c30a4e909b7350e6e80a6005deaa8ace62a7919a9","last_reissued_at":"2026-05-18T00:01:41.634626Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:01:41.634626Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Near-Linear Time Algorithm for n-fold ILPs via Color Coding","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Alexandra Lassota, Klaus Jansen, Lars Rohwedder","submitted_at":"2018-11-02T15:59:32Z","abstract_excerpt":"We study an important case of ILPs $\\max\\{c^Tx \\ \\vert\\ \\mathcal Ax = b, l \\leq x \\leq u,\\, x \\in \\mathbb{Z}^{n t} \\} $ with $n\\cdot t$ variables and lower and upper bounds $\\ell, u\\in\\mathbb Z^{nt}$. In $n$-fold ILPs non-zero entries only appear in the first $r$ rows of the matrix $\\mathcal A$ and in small blocks of size $s\\times t$ along the diagonal underneath. Despite this restriction many optimization problems can be expressed in this form. It is known that $n$-fold ILPs can be solved in FPT time regarding the parameters $s, r,$ and $\\Delta$, where $\\Delta$ is the greatest absolute value "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1811.00950","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":"1811.00950","created_at":"2026-05-18T00:01:41.634750+00:00"},{"alias_kind":"arxiv_version","alias_value":"1811.00950v1","created_at":"2026-05-18T00:01:41.634750+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1811.00950","created_at":"2026-05-18T00:01:41.634750+00:00"},{"alias_kind":"pith_short_12","alias_value":"6AFUUAIY2EZ3","created_at":"2026-05-18T12:32:08.215937+00:00"},{"alias_kind":"pith_short_16","alias_value":"6AFUUAIY2EZ3BU6I","created_at":"2026-05-18T12:32:08.215937+00:00"},{"alias_kind":"pith_short_8","alias_value":"6AFUUAIY","created_at":"2026-05-18T12:32:08.215937+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/6AFUUAIY2EZ3BU6I3Y6DBJHJBG","json":"https://pith.science/pith/6AFUUAIY2EZ3BU6I3Y6DBJHJBG.json","graph_json":"https://pith.science/api/pith-number/6AFUUAIY2EZ3BU6I3Y6DBJHJBG/graph.json","events_json":"https://pith.science/api/pith-number/6AFUUAIY2EZ3BU6I3Y6DBJHJBG/events.json","paper":"https://pith.science/paper/6AFUUAIY"},"agent_actions":{"view_html":"https://pith.science/pith/6AFUUAIY2EZ3BU6I3Y6DBJHJBG","download_json":"https://pith.science/pith/6AFUUAIY2EZ3BU6I3Y6DBJHJBG.json","view_paper":"https://pith.science/paper/6AFUUAIY","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1811.00950&json=true","fetch_graph":"https://pith.science/api/pith-number/6AFUUAIY2EZ3BU6I3Y6DBJHJBG/graph.json","fetch_events":"https://pith.science/api/pith-number/6AFUUAIY2EZ3BU6I3Y6DBJHJBG/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/6AFUUAIY2EZ3BU6I3Y6DBJHJBG/action/timestamp_anchor","attest_storage":"https://pith.science/pith/6AFUUAIY2EZ3BU6I3Y6DBJHJBG/action/storage_attestation","attest_author":"https://pith.science/pith/6AFUUAIY2EZ3BU6I3Y6DBJHJBG/action/author_attestation","sign_citation":"https://pith.science/pith/6AFUUAIY2EZ3BU6I3Y6DBJHJBG/action/citation_signature","submit_replication":"https://pith.science/pith/6AFUUAIY2EZ3BU6I3Y6DBJHJBG/action/replication_record"}},"created_at":"2026-05-18T00:01:41.634750+00:00","updated_at":"2026-05-18T00:01:41.634750+00:00"}