{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2010:F4EFPHAOBQWT3W7RK77NSLLFMO","short_pith_number":"pith:F4EFPHAO","schema_version":"1.0","canonical_sha256":"2f08579c0e0c2d3ddbf157fed92d6563b59ead4bc705c30656329651b86526b2","source":{"kind":"arxiv","id":"1008.1687","version":1},"attestation_state":"computed","paper":{"title":"A Deterministic Polynomial-time Approximation Scheme for Counting Knapsack Solutions","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Daniel Stefankovic, Eric Vigoda, Santosh Vempala","submitted_at":"2010-08-10T10:54:31Z","abstract_excerpt":"Given n elements with nonnegative integer weights w1,..., wn and an integer capacity C, we consider the counting version of the classic knapsack problem: find the number of distinct subsets whose weights add up to at most the given capacity. We give a deterministic algorithm that estimates the number of solutions to within relative error 1+-eps in time polynomial in n and 1/eps (fully polynomial approximation scheme). More precisely, our algorithm takes time O(n^3 (1/eps) log (n/eps)). Our algorithm is based on dynamic programming. Previously, randomized polynomial time approximation schemes w"},"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":"1008.1687","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2010-08-10T10:54:31Z","cross_cats_sorted":[],"title_canon_sha256":"d349f973cd96e2be546c7a1bb8f7a5de230be959cf83bf4d518c11169223ad0e","abstract_canon_sha256":"817fc18f99ceaeb0407d5f881c466fe0513cf0fc348b7297386f6a9d84c5e52b"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:42:23.483661Z","signature_b64":"nZsVp+OYk72VrJ6kSJkryfym0ctf0MstwcRIzJgWdE9veJqZnFtR52QXaIRdHePGldCken8+imTs1Ulm6CffAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"2f08579c0e0c2d3ddbf157fed92d6563b59ead4bc705c30656329651b86526b2","last_reissued_at":"2026-05-18T04:42:23.483273Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:42:23.483273Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A Deterministic Polynomial-time Approximation Scheme for Counting Knapsack Solutions","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Daniel Stefankovic, Eric Vigoda, Santosh Vempala","submitted_at":"2010-08-10T10:54:31Z","abstract_excerpt":"Given n elements with nonnegative integer weights w1,..., wn and an integer capacity C, we consider the counting version of the classic knapsack problem: find the number of distinct subsets whose weights add up to at most the given capacity. We give a deterministic algorithm that estimates the number of solutions to within relative error 1+-eps in time polynomial in n and 1/eps (fully polynomial approximation scheme). More precisely, our algorithm takes time O(n^3 (1/eps) log (n/eps)). Our algorithm is based on dynamic programming. Previously, randomized polynomial time approximation schemes w"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1008.1687","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":"1008.1687","created_at":"2026-05-18T04:42:23.483347+00:00"},{"alias_kind":"arxiv_version","alias_value":"1008.1687v1","created_at":"2026-05-18T04:42:23.483347+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1008.1687","created_at":"2026-05-18T04:42:23.483347+00:00"},{"alias_kind":"pith_short_12","alias_value":"F4EFPHAOBQWT","created_at":"2026-05-18T12:26:06.534383+00:00"},{"alias_kind":"pith_short_16","alias_value":"F4EFPHAOBQWT3W7R","created_at":"2026-05-18T12:26:06.534383+00:00"},{"alias_kind":"pith_short_8","alias_value":"F4EFPHAO","created_at":"2026-05-18T12:26:06.534383+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/F4EFPHAOBQWT3W7RK77NSLLFMO","json":"https://pith.science/pith/F4EFPHAOBQWT3W7RK77NSLLFMO.json","graph_json":"https://pith.science/api/pith-number/F4EFPHAOBQWT3W7RK77NSLLFMO/graph.json","events_json":"https://pith.science/api/pith-number/F4EFPHAOBQWT3W7RK77NSLLFMO/events.json","paper":"https://pith.science/paper/F4EFPHAO"},"agent_actions":{"view_html":"https://pith.science/pith/F4EFPHAOBQWT3W7RK77NSLLFMO","download_json":"https://pith.science/pith/F4EFPHAOBQWT3W7RK77NSLLFMO.json","view_paper":"https://pith.science/paper/F4EFPHAO","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1008.1687&json=true","fetch_graph":"https://pith.science/api/pith-number/F4EFPHAOBQWT3W7RK77NSLLFMO/graph.json","fetch_events":"https://pith.science/api/pith-number/F4EFPHAOBQWT3W7RK77NSLLFMO/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/F4EFPHAOBQWT3W7RK77NSLLFMO/action/timestamp_anchor","attest_storage":"https://pith.science/pith/F4EFPHAOBQWT3W7RK77NSLLFMO/action/storage_attestation","attest_author":"https://pith.science/pith/F4EFPHAOBQWT3W7RK77NSLLFMO/action/author_attestation","sign_citation":"https://pith.science/pith/F4EFPHAOBQWT3W7RK77NSLLFMO/action/citation_signature","submit_replication":"https://pith.science/pith/F4EFPHAOBQWT3W7RK77NSLLFMO/action/replication_record"}},"created_at":"2026-05-18T04:42:23.483347+00:00","updated_at":"2026-05-18T04:42:23.483347+00:00"}