{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:6YTMSRMZBS7EGLRZ2KWHXLKJQY","short_pith_number":"pith:6YTMSRMZ","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"},"canonical_sha256":"f626c945990cbe432e39d2ac7bad498613ddb5d221ed59c82300a8759ff4e559","source":{"kind":"arxiv","id":"1811.01296","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1811.01296","created_at":"2026-05-17T23:39:57Z"},{"alias_kind":"arxiv_version","alias_value":"1811.01296v3","created_at":"2026-05-17T23:39:57Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1811.01296","created_at":"2026-05-17T23:39:57Z"},{"alias_kind":"pith_short_12","alias_value":"6YTMSRMZBS7E","created_at":"2026-05-18T12:32:11Z"},{"alias_kind":"pith_short_16","alias_value":"6YTMSRMZBS7EGLRZ","created_at":"2026-05-18T12:32:11Z"},{"alias_kind":"pith_short_8","alias_value":"6YTMSRMZ","created_at":"2026-05-18T12:32:11Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:6YTMSRMZBS7EGLRZ2KWHXLKJQY","target":"record","payload":{"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"},"canonical_sha256":"f626c945990cbe432e39d2ac7bad498613ddb5d221ed59c82300a8759ff4e559","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"},"source_kind":"arxiv","source_id":"1811.01296","source_version":3,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-17T23:39:57Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ZAXhl9QGKqFIChuOe/2oGtN67WNFGtoKuFrBMPaIQLgJY9sP/NWSa7D/tYKJ8zR5jBc4NsFL+h3CRltMSL/SCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T19:11:39.548153Z"},"content_sha256":"e5eeedf4aa24220371e10c71c96280602ccbce9e9fe0988e27f1087e52238995","schema_version":"1.0","event_id":"sha256:e5eeedf4aa24220371e10c71c96280602ccbce9e9fe0988e27f1087e52238995"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:6YTMSRMZBS7EGLRZ2KWHXLKJQY","target":"graph","payload":{"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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-17T23:39:57Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"4FMkLpwWl1GqYnQdnt6g3rUsiE6TTmCoK2nz5hArD66BdjTfFu4OiDfr3z1O0p98a97TN6xCO3qwmau9NPuBBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T19:11:39.548511Z"},"content_sha256":"741d6bb6fc3d94d000a74f51f0df0df42e0d4477686c2a254caea78a6bcffa41","schema_version":"1.0","event_id":"sha256:741d6bb6fc3d94d000a74f51f0df0df42e0d4477686c2a254caea78a6bcffa41"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/6YTMSRMZBS7EGLRZ2KWHXLKJQY/bundle.json","state_url":"https://pith.science/pith/6YTMSRMZBS7EGLRZ2KWHXLKJQY/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/6YTMSRMZBS7EGLRZ2KWHXLKJQY/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-05-28T19:11:39Z","links":{"resolver":"https://pith.science/pith/6YTMSRMZBS7EGLRZ2KWHXLKJQY","bundle":"https://pith.science/pith/6YTMSRMZBS7EGLRZ2KWHXLKJQY/bundle.json","state":"https://pith.science/pith/6YTMSRMZBS7EGLRZ2KWHXLKJQY/state.json","well_known_bundle":"https://pith.science/.well-known/pith/6YTMSRMZBS7EGLRZ2KWHXLKJQY/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:6YTMSRMZBS7EGLRZ2KWHXLKJQY","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":"643b23c3f3b399bf7ee3a21a30de268a3f5a0adc98942837cfc6836f192d9f77","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2018-11-03T22:54:45Z","title_canon_sha256":"86bcbedf04549b0174ee9f8ddad474ed1b3322ec60a4b4057755af5a0402f9ce"},"schema_version":"1.0","source":{"id":"1811.01296","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1811.01296","created_at":"2026-05-17T23:39:57Z"},{"alias_kind":"arxiv_version","alias_value":"1811.01296v3","created_at":"2026-05-17T23:39:57Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1811.01296","created_at":"2026-05-17T23:39:57Z"},{"alias_kind":"pith_short_12","alias_value":"6YTMSRMZBS7E","created_at":"2026-05-18T12:32:11Z"},{"alias_kind":"pith_short_16","alias_value":"6YTMSRMZBS7EGLRZ","created_at":"2026-05-18T12:32:11Z"},{"alias_kind":"pith_short_8","alias_value":"6YTMSRMZ","created_at":"2026-05-18T12:32:11Z"}],"graph_snapshots":[{"event_id":"sha256:741d6bb6fc3d94d000a74f51f0df0df42e0d4477686c2a254caea78a6bcffa41","target":"graph","created_at":"2026-05-17T23:39:57Z","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"},"paper":{"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","authors_text":"Du\\v{s}an Knop, Marcin Wrochna, Micha{\\l} Pilipczuk","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2018-11-03T22:54:45Z","title":"Tight complexity lower bounds for integer linear programming with few constraints"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1811.01296","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:e5eeedf4aa24220371e10c71c96280602ccbce9e9fe0988e27f1087e52238995","target":"record","created_at":"2026-05-17T23:39:57Z","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":"643b23c3f3b399bf7ee3a21a30de268a3f5a0adc98942837cfc6836f192d9f77","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2018-11-03T22:54:45Z","title_canon_sha256":"86bcbedf04549b0174ee9f8ddad474ed1b3322ec60a4b4057755af5a0402f9ce"},"schema_version":"1.0","source":{"id":"1811.01296","kind":"arxiv","version":3}},"canonical_sha256":"f626c945990cbe432e39d2ac7bad498613ddb5d221ed59c82300a8759ff4e559","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"f626c945990cbe432e39d2ac7bad498613ddb5d221ed59c82300a8759ff4e559","first_computed_at":"2026-05-17T23:39:57.945918Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:39:57.945918Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"2Bxxm079L0eVQw9tBjaDeozA89QXZnCDp5A6um6TktW42dxERcEVZ7sP6qEsO51phiFfuCOxyEbyWOYcS45yAg==","signature_status":"signed_v1","signed_at":"2026-05-17T23:39:57.946355Z","signed_message":"canonical_sha256_bytes"},"source_id":"1811.01296","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:e5eeedf4aa24220371e10c71c96280602ccbce9e9fe0988e27f1087e52238995","sha256:741d6bb6fc3d94d000a74f51f0df0df42e0d4477686c2a254caea78a6bcffa41"],"state_sha256":"c52b77e7e5b28a023695c3bb7e236b174b6b82d7f124bcfab9946e4cf65579e9"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"LwVaGHNoEupOhbIrn1wxlGuQC74Ps9FOVHvCQqibpgqrMQtbgbharfxzPGKZfmmqycAr9zMkE9yAl7PRH3NuCg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-28T19:11:39.550638Z","bundle_sha256":"62cbf77aa8517af3eb736b573f7e2afeb48b9b869264af6d8dfccd37b1202925"}}