{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:IGC6INQACHIS4VC3NBT34A6A6W","short_pith_number":"pith:IGC6INQA","canonical_record":{"source":{"id":"1805.04592","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2018-05-11T21:14:45Z","cross_cats_sorted":[],"title_canon_sha256":"b77498c5ab57d3c8c4a4b73811fb2fd2163b29a7182e2a2cfc6ed566481b7ef9","abstract_canon_sha256":"4b498088552fb94106d038bb1ded7dcf7809ca4da57477de9dae058d1b41e155"},"schema_version":"1.0"},"canonical_sha256":"4185e4360011d12e545b6867be03c0f598183a364f95a7f302a6a872de68c12e","source":{"kind":"arxiv","id":"1805.04592","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1805.04592","created_at":"2026-05-18T00:16:06Z"},{"alias_kind":"arxiv_version","alias_value":"1805.04592v1","created_at":"2026-05-18T00:16:06Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1805.04592","created_at":"2026-05-18T00:16:06Z"},{"alias_kind":"pith_short_12","alias_value":"IGC6INQACHIS","created_at":"2026-05-18T12:32:28Z"},{"alias_kind":"pith_short_16","alias_value":"IGC6INQACHIS4VC3","created_at":"2026-05-18T12:32:28Z"},{"alias_kind":"pith_short_8","alias_value":"IGC6INQA","created_at":"2026-05-18T12:32:28Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:IGC6INQACHIS4VC3NBT34A6A6W","target":"record","payload":{"canonical_record":{"source":{"id":"1805.04592","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2018-05-11T21:14:45Z","cross_cats_sorted":[],"title_canon_sha256":"b77498c5ab57d3c8c4a4b73811fb2fd2163b29a7182e2a2cfc6ed566481b7ef9","abstract_canon_sha256":"4b498088552fb94106d038bb1ded7dcf7809ca4da57477de9dae058d1b41e155"},"schema_version":"1.0"},"canonical_sha256":"4185e4360011d12e545b6867be03c0f598183a364f95a7f302a6a872de68c12e","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:16:06.966266Z","signature_b64":"z1PPgf1h9pNZDBEFnKr+LYGu8UIHxkBDg3+zYNPzQGelj3qHjNEH7u6b9POVazLv30pSFBt+5ab0NGroTzYJCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"4185e4360011d12e545b6867be03c0f598183a364f95a7f302a6a872de68c12e","last_reissued_at":"2026-05-18T00:16:06.965628Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:16:06.965628Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1805.04592","source_version":1,"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-18T00:16:06Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"rkULguuDdG0tbSLSJ+13xREmjCYw2EgVQWPnBCmd7E5TYJbhP849AHg4umF3GvjPlq2NT6kObnvsERczCenmAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-06T07:00:14.893721Z"},"content_sha256":"183984e2ebb536fa23d51226c5204a6be8a7dec2b7fe229d2d48bf26cd43aeb0","schema_version":"1.0","event_id":"sha256:183984e2ebb536fa23d51226c5204a6be8a7dec2b7fe229d2d48bf26cd43aeb0"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:IGC6INQACHIS4VC3NBT34A6A6W","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Distances to Lattice Points in Knapsack Polyhedra","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Iskander Aliev, Martin Henk, Timm Oertel","submitted_at":"2018-05-11T21:14:45Z","abstract_excerpt":"We give an optimal upper bound for the maximum-norm distance from a vertex of a knapsack polyhedron to its nearest feasible lattice point. In a randomised setting, we show that the upper bound can be significantly improved on average. As a corollary, we obtain an optimal upper bound for the additive integrality gap of integer knapsack problems and show that the integrality gap of a \"typical\" knapsack problem is drastically smaller than the integrality gap that occurs in a worst case scenario. We also prove that, in a generic case, the integer programming gap admits a natural optimal lower boun"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1805.04592","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"},"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-18T00:16:06Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Ec5SF18v2KS4TLauf423+8RIHmg7pYwVE5HVlD6qQQ9r1HpJRjwXSClAQO9igWLJY+t3eY+nyloDT9u5OgwcCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-06T07:00:14.894420Z"},"content_sha256":"038840772c4b18b1ce55a26fbad3eff9873f69173e69883bff99290566c766a8","schema_version":"1.0","event_id":"sha256:038840772c4b18b1ce55a26fbad3eff9873f69173e69883bff99290566c766a8"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/IGC6INQACHIS4VC3NBT34A6A6W/bundle.json","state_url":"https://pith.science/pith/IGC6INQACHIS4VC3NBT34A6A6W/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/IGC6INQACHIS4VC3NBT34A6A6W/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-06-06T07:00:14Z","links":{"resolver":"https://pith.science/pith/IGC6INQACHIS4VC3NBT34A6A6W","bundle":"https://pith.science/pith/IGC6INQACHIS4VC3NBT34A6A6W/bundle.json","state":"https://pith.science/pith/IGC6INQACHIS4VC3NBT34A6A6W/state.json","well_known_bundle":"https://pith.science/.well-known/pith/IGC6INQACHIS4VC3NBT34A6A6W/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:IGC6INQACHIS4VC3NBT34A6A6W","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":"4b498088552fb94106d038bb1ded7dcf7809ca4da57477de9dae058d1b41e155","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2018-05-11T21:14:45Z","title_canon_sha256":"b77498c5ab57d3c8c4a4b73811fb2fd2163b29a7182e2a2cfc6ed566481b7ef9"},"schema_version":"1.0","source":{"id":"1805.04592","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1805.04592","created_at":"2026-05-18T00:16:06Z"},{"alias_kind":"arxiv_version","alias_value":"1805.04592v1","created_at":"2026-05-18T00:16:06Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1805.04592","created_at":"2026-05-18T00:16:06Z"},{"alias_kind":"pith_short_12","alias_value":"IGC6INQACHIS","created_at":"2026-05-18T12:32:28Z"},{"alias_kind":"pith_short_16","alias_value":"IGC6INQACHIS4VC3","created_at":"2026-05-18T12:32:28Z"},{"alias_kind":"pith_short_8","alias_value":"IGC6INQA","created_at":"2026-05-18T12:32:28Z"}],"graph_snapshots":[{"event_id":"sha256:038840772c4b18b1ce55a26fbad3eff9873f69173e69883bff99290566c766a8","target":"graph","created_at":"2026-05-18T00:16:06Z","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 give an optimal upper bound for the maximum-norm distance from a vertex of a knapsack polyhedron to its nearest feasible lattice point. In a randomised setting, we show that the upper bound can be significantly improved on average. As a corollary, we obtain an optimal upper bound for the additive integrality gap of integer knapsack problems and show that the integrality gap of a \"typical\" knapsack problem is drastically smaller than the integrality gap that occurs in a worst case scenario. We also prove that, in a generic case, the integer programming gap admits a natural optimal lower boun","authors_text":"Iskander Aliev, Martin Henk, Timm Oertel","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2018-05-11T21:14:45Z","title":"Distances to Lattice Points in Knapsack Polyhedra"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1805.04592","kind":"arxiv","version":1},"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:183984e2ebb536fa23d51226c5204a6be8a7dec2b7fe229d2d48bf26cd43aeb0","target":"record","created_at":"2026-05-18T00:16:06Z","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":"4b498088552fb94106d038bb1ded7dcf7809ca4da57477de9dae058d1b41e155","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2018-05-11T21:14:45Z","title_canon_sha256":"b77498c5ab57d3c8c4a4b73811fb2fd2163b29a7182e2a2cfc6ed566481b7ef9"},"schema_version":"1.0","source":{"id":"1805.04592","kind":"arxiv","version":1}},"canonical_sha256":"4185e4360011d12e545b6867be03c0f598183a364f95a7f302a6a872de68c12e","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"4185e4360011d12e545b6867be03c0f598183a364f95a7f302a6a872de68c12e","first_computed_at":"2026-05-18T00:16:06.965628Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:16:06.965628Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"z1PPgf1h9pNZDBEFnKr+LYGu8UIHxkBDg3+zYNPzQGelj3qHjNEH7u6b9POVazLv30pSFBt+5ab0NGroTzYJCA==","signature_status":"signed_v1","signed_at":"2026-05-18T00:16:06.966266Z","signed_message":"canonical_sha256_bytes"},"source_id":"1805.04592","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:183984e2ebb536fa23d51226c5204a6be8a7dec2b7fe229d2d48bf26cd43aeb0","sha256:038840772c4b18b1ce55a26fbad3eff9873f69173e69883bff99290566c766a8"],"state_sha256":"b7463ca470ce73d7d376b85c9c25514e8a703ab543f0ee8ca95d3506c9e75b6a"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"eaPV4yf92L3/Ltse030LeJUozi3FgTRIBzuWMn0ju7ldEy1qS92pjynDBpzK645u6H8I0QnJ//7U1ZCone9RAA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-06T07:00:14.898067Z","bundle_sha256":"d202dae4ab7b63820c472eea49c5b89319956229634660a6b7e4d9c9ad1019bb"}}