{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:ROZT5DTC4SY3FNCUINVTI7OEG5","short_pith_number":"pith:ROZT5DTC","schema_version":"1.0","canonical_sha256":"8bb33e8e62e4b1b2b454436b347dc43768a8a860b8391435a0ca6188cf0ad1c0","source":{"kind":"arxiv","id":"1703.06048","version":1},"attestation_state":"computed","paper":{"title":"An FPTAS for the Knapsack Problem with Parametric Weights","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CC","math.OC"],"primary_cat":"cs.DS","authors_text":"Michael Holzhauser, Sven O. Krumke","submitted_at":"2017-03-17T15:08:17Z","abstract_excerpt":"In this paper, we investigate the parametric weight knapsack problem, in which the item weights are affine functions of the form $w_i(\\lambda) = a_i + \\lambda \\cdot b_i$ for $i \\in \\{1,\\ldots,n\\}$ depending on a real-valued parameter $\\lambda$. The aim is to provide a solution for all values of the parameter. It is well-known that any exact algorithm for the problem may need to output an exponential number of knapsack solutions. We present the first fully polynomial-time approximation scheme (FPTAS) for the problem that, for any desired precision $\\varepsilon \\in (0,1)$, computes $(1-\\varepsil"},"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":"1703.06048","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2017-03-17T15:08:17Z","cross_cats_sorted":["cs.CC","math.OC"],"title_canon_sha256":"ec2dffe5b1926f4b5a83a0be627b68ba78be6208a207185587d86ebdb537010e","abstract_canon_sha256":"35b8fa8c1762fb3a9063b8a2c7d149e10680863846554dd548747a4d0c3d27c7"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:48:29.617747Z","signature_b64":"FmgnFU0S+2td5ErhGYjsicdfEc1rcZr4nKc6jFLhjhwdR+Htg4fz9OFMwhn/GsAa3+ToQhoDH3qEBO+y1QwvBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"8bb33e8e62e4b1b2b454436b347dc43768a8a860b8391435a0ca6188cf0ad1c0","last_reissued_at":"2026-05-18T00:48:29.617095Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:48:29.617095Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"An FPTAS for the Knapsack Problem with Parametric Weights","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CC","math.OC"],"primary_cat":"cs.DS","authors_text":"Michael Holzhauser, Sven O. Krumke","submitted_at":"2017-03-17T15:08:17Z","abstract_excerpt":"In this paper, we investigate the parametric weight knapsack problem, in which the item weights are affine functions of the form $w_i(\\lambda) = a_i + \\lambda \\cdot b_i$ for $i \\in \\{1,\\ldots,n\\}$ depending on a real-valued parameter $\\lambda$. The aim is to provide a solution for all values of the parameter. It is well-known that any exact algorithm for the problem may need to output an exponential number of knapsack solutions. We present the first fully polynomial-time approximation scheme (FPTAS) for the problem that, for any desired precision $\\varepsilon \\in (0,1)$, computes $(1-\\varepsil"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1703.06048","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":"1703.06048","created_at":"2026-05-18T00:48:29.617199+00:00"},{"alias_kind":"arxiv_version","alias_value":"1703.06048v1","created_at":"2026-05-18T00:48:29.617199+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1703.06048","created_at":"2026-05-18T00:48:29.617199+00:00"},{"alias_kind":"pith_short_12","alias_value":"ROZT5DTC4SY3","created_at":"2026-05-18T12:31:39.905425+00:00"},{"alias_kind":"pith_short_16","alias_value":"ROZT5DTC4SY3FNCU","created_at":"2026-05-18T12:31:39.905425+00:00"},{"alias_kind":"pith_short_8","alias_value":"ROZT5DTC","created_at":"2026-05-18T12:31:39.905425+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/ROZT5DTC4SY3FNCUINVTI7OEG5","json":"https://pith.science/pith/ROZT5DTC4SY3FNCUINVTI7OEG5.json","graph_json":"https://pith.science/api/pith-number/ROZT5DTC4SY3FNCUINVTI7OEG5/graph.json","events_json":"https://pith.science/api/pith-number/ROZT5DTC4SY3FNCUINVTI7OEG5/events.json","paper":"https://pith.science/paper/ROZT5DTC"},"agent_actions":{"view_html":"https://pith.science/pith/ROZT5DTC4SY3FNCUINVTI7OEG5","download_json":"https://pith.science/pith/ROZT5DTC4SY3FNCUINVTI7OEG5.json","view_paper":"https://pith.science/paper/ROZT5DTC","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1703.06048&json=true","fetch_graph":"https://pith.science/api/pith-number/ROZT5DTC4SY3FNCUINVTI7OEG5/graph.json","fetch_events":"https://pith.science/api/pith-number/ROZT5DTC4SY3FNCUINVTI7OEG5/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/ROZT5DTC4SY3FNCUINVTI7OEG5/action/timestamp_anchor","attest_storage":"https://pith.science/pith/ROZT5DTC4SY3FNCUINVTI7OEG5/action/storage_attestation","attest_author":"https://pith.science/pith/ROZT5DTC4SY3FNCUINVTI7OEG5/action/author_attestation","sign_citation":"https://pith.science/pith/ROZT5DTC4SY3FNCUINVTI7OEG5/action/citation_signature","submit_replication":"https://pith.science/pith/ROZT5DTC4SY3FNCUINVTI7OEG5/action/replication_record"}},"created_at":"2026-05-18T00:48:29.617199+00:00","updated_at":"2026-05-18T00:48:29.617199+00:00"}