{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:YHQSZSKCMUQRMU6CP5ZUKW5IIV","short_pith_number":"pith:YHQSZSKC","canonical_record":{"source":{"id":"1504.04650","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2015-04-17T22:13:48Z","cross_cats_sorted":[],"title_canon_sha256":"7826a32df6eac651dedc619cc05ab307144e93ac69af0572a7015efe7c75c5d4","abstract_canon_sha256":"53a018335c6664c022b7ced933db3bda0cc1274b8f14c3141b32a23bc77c518c"},"schema_version":"1.0"},"canonical_sha256":"c1e12cc94265211653c27f73455ba84564ab187f6ff5d40f401529efad9376c1","source":{"kind":"arxiv","id":"1504.04650","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1504.04650","created_at":"2026-05-18T01:27:31Z"},{"alias_kind":"arxiv_version","alias_value":"1504.04650v2","created_at":"2026-05-18T01:27:31Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1504.04650","created_at":"2026-05-18T01:27:31Z"},{"alias_kind":"pith_short_12","alias_value":"YHQSZSKCMUQR","created_at":"2026-05-18T12:29:50Z"},{"alias_kind":"pith_short_16","alias_value":"YHQSZSKCMUQRMU6C","created_at":"2026-05-18T12:29:50Z"},{"alias_kind":"pith_short_8","alias_value":"YHQSZSKC","created_at":"2026-05-18T12:29:50Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:YHQSZSKCMUQRMU6CP5ZUKW5IIV","target":"record","payload":{"canonical_record":{"source":{"id":"1504.04650","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2015-04-17T22:13:48Z","cross_cats_sorted":[],"title_canon_sha256":"7826a32df6eac651dedc619cc05ab307144e93ac69af0572a7015efe7c75c5d4","abstract_canon_sha256":"53a018335c6664c022b7ced933db3bda0cc1274b8f14c3141b32a23bc77c518c"},"schema_version":"1.0"},"canonical_sha256":"c1e12cc94265211653c27f73455ba84564ab187f6ff5d40f401529efad9376c1","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:27:31.786039Z","signature_b64":"SJzmQh2motDcJ/rgblGdUW639JDtn738c3yyBMWILijet9sjt+6bXnE3ImMc4sZoXuTaM3zqwkmIE7aM1PneBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"c1e12cc94265211653c27f73455ba84564ab187f6ff5d40f401529efad9376c1","last_reissued_at":"2026-05-18T01:27:31.785521Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:27:31.785521Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1504.04650","source_version":2,"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-18T01:27:31Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"y2k1Ish8NofRjtqQTuslYYSDAWRg0iIR33eu9+3tT8bvWUzNnbUNfNuQTXJki2NrCSt4A6mRA7b2vcHbkH6oBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-01T06:08:54.331474Z"},"content_sha256":"315a28dd57ef890dc0679e3e1de0def8e04e17f370488d30be4ed00ed3cf1009","schema_version":"1.0","event_id":"sha256:315a28dd57ef890dc0679e3e1de0def8e04e17f370488d30be4ed00ed3cf1009"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:YHQSZSKCMUQRMU6CP5ZUKW5IIV","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"A Faster FPTAS for the Unbounded Knapsack Problem","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Klaus Jansen, Stefan Erich Julius Kraft","submitted_at":"2015-04-17T22:13:48Z","abstract_excerpt":"The Unbounded Knapsack Problem (UKP) is a well-known variant of the famous 0-1 Knapsack Problem (0-1 KP). In contrast to 0-1 KP, an arbitrary number of copies of every item can be taken in UKP. Since UKP is NP-hard, fully polynomial time approximation schemes (FPTAS) are of great interest. Such algorithms find a solution arbitrarily close to the optimum $\\mathrm{OPT}(I)$, i.e. of value at least $(1-\\varepsilon) \\mathrm{OPT}(I)$ for $\\varepsilon > 0$, and have a running time polynomial in the input length and $\\frac{1}{\\varepsilon}$. For over thirty years, the best FPTAS was due to Lawler with "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1504.04650","kind":"arxiv","version":2},"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-18T01:27:31Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"VQXUHhU204Fc9jCeLhQiPbIXq6pAhx1nYw3XEqJ0w+9zyOiJA99DvS8V5Up6dkh7hci9uP7tqMnZOQx7PcNdCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-01T06:08:54.332246Z"},"content_sha256":"5663ebf779acaec798b4cb027e9728ba3a3fc67c888522d18817fc4e7cb27f0c","schema_version":"1.0","event_id":"sha256:5663ebf779acaec798b4cb027e9728ba3a3fc67c888522d18817fc4e7cb27f0c"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/YHQSZSKCMUQRMU6CP5ZUKW5IIV/bundle.json","state_url":"https://pith.science/pith/YHQSZSKCMUQRMU6CP5ZUKW5IIV/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/YHQSZSKCMUQRMU6CP5ZUKW5IIV/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-01T06:08:54Z","links":{"resolver":"https://pith.science/pith/YHQSZSKCMUQRMU6CP5ZUKW5IIV","bundle":"https://pith.science/pith/YHQSZSKCMUQRMU6CP5ZUKW5IIV/bundle.json","state":"https://pith.science/pith/YHQSZSKCMUQRMU6CP5ZUKW5IIV/state.json","well_known_bundle":"https://pith.science/.well-known/pith/YHQSZSKCMUQRMU6CP5ZUKW5IIV/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:YHQSZSKCMUQRMU6CP5ZUKW5IIV","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":"53a018335c6664c022b7ced933db3bda0cc1274b8f14c3141b32a23bc77c518c","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2015-04-17T22:13:48Z","title_canon_sha256":"7826a32df6eac651dedc619cc05ab307144e93ac69af0572a7015efe7c75c5d4"},"schema_version":"1.0","source":{"id":"1504.04650","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1504.04650","created_at":"2026-05-18T01:27:31Z"},{"alias_kind":"arxiv_version","alias_value":"1504.04650v2","created_at":"2026-05-18T01:27:31Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1504.04650","created_at":"2026-05-18T01:27:31Z"},{"alias_kind":"pith_short_12","alias_value":"YHQSZSKCMUQR","created_at":"2026-05-18T12:29:50Z"},{"alias_kind":"pith_short_16","alias_value":"YHQSZSKCMUQRMU6C","created_at":"2026-05-18T12:29:50Z"},{"alias_kind":"pith_short_8","alias_value":"YHQSZSKC","created_at":"2026-05-18T12:29:50Z"}],"graph_snapshots":[{"event_id":"sha256:5663ebf779acaec798b4cb027e9728ba3a3fc67c888522d18817fc4e7cb27f0c","target":"graph","created_at":"2026-05-18T01:27:31Z","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":"The Unbounded Knapsack Problem (UKP) is a well-known variant of the famous 0-1 Knapsack Problem (0-1 KP). In contrast to 0-1 KP, an arbitrary number of copies of every item can be taken in UKP. Since UKP is NP-hard, fully polynomial time approximation schemes (FPTAS) are of great interest. Such algorithms find a solution arbitrarily close to the optimum $\\mathrm{OPT}(I)$, i.e. of value at least $(1-\\varepsilon) \\mathrm{OPT}(I)$ for $\\varepsilon > 0$, and have a running time polynomial in the input length and $\\frac{1}{\\varepsilon}$. For over thirty years, the best FPTAS was due to Lawler with ","authors_text":"Klaus Jansen, Stefan Erich Julius Kraft","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2015-04-17T22:13:48Z","title":"A Faster FPTAS for the Unbounded Knapsack Problem"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1504.04650","kind":"arxiv","version":2},"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:315a28dd57ef890dc0679e3e1de0def8e04e17f370488d30be4ed00ed3cf1009","target":"record","created_at":"2026-05-18T01:27:31Z","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":"53a018335c6664c022b7ced933db3bda0cc1274b8f14c3141b32a23bc77c518c","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2015-04-17T22:13:48Z","title_canon_sha256":"7826a32df6eac651dedc619cc05ab307144e93ac69af0572a7015efe7c75c5d4"},"schema_version":"1.0","source":{"id":"1504.04650","kind":"arxiv","version":2}},"canonical_sha256":"c1e12cc94265211653c27f73455ba84564ab187f6ff5d40f401529efad9376c1","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"c1e12cc94265211653c27f73455ba84564ab187f6ff5d40f401529efad9376c1","first_computed_at":"2026-05-18T01:27:31.785521Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:27:31.785521Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"SJzmQh2motDcJ/rgblGdUW639JDtn738c3yyBMWILijet9sjt+6bXnE3ImMc4sZoXuTaM3zqwkmIE7aM1PneBQ==","signature_status":"signed_v1","signed_at":"2026-05-18T01:27:31.786039Z","signed_message":"canonical_sha256_bytes"},"source_id":"1504.04650","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:315a28dd57ef890dc0679e3e1de0def8e04e17f370488d30be4ed00ed3cf1009","sha256:5663ebf779acaec798b4cb027e9728ba3a3fc67c888522d18817fc4e7cb27f0c"],"state_sha256":"9860847e7593f29bdaeb6b96cc116430fec8af6d737c8632790d6828f83e06a3"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"imPPFoHbgONxSz0wkGMj8mrTS8Io8mV/SJ2VuCeC/INOWwopt/Nq/XLpEux1hmFltU/19cjzLjUbF4gk9N7CAA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-01T06:08:54.335615Z","bundle_sha256":"3ad9e150dcc14fd9a98ed8d85381901cf370b3912381229ce74553d2e88c836e"}}