{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2010:RY5HOKSFV4RQCTWPLYQDZSIIFX","short_pith_number":"pith:RY5HOKSF","schema_version":"1.0","canonical_sha256":"8e3a772a45af23014ecf5e203cc9082ddecfebaace1892e175eb568c3d787ca1","source":{"kind":"arxiv","id":"1008.3187","version":1},"attestation_state":"computed","paper":{"title":"Polynomial-Time Approximation Schemes for Knapsack and Related Counting Problems using Branching Programs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CC","cs.LG"],"primary_cat":"cs.DS","authors_text":"Adam Klivans, Parikshit Gopalan, Raghu Meka","submitted_at":"2010-08-18T23:45:28Z","abstract_excerpt":"We give a deterministic, polynomial-time algorithm for approximately counting the number of {0,1}-solutions to any instance of the knapsack problem. On an instance of length n with total weight W and accuracy parameter eps, our algorithm produces a (1 + eps)-multiplicative approximation in time poly(n,log W,1/eps). We also give algorithms with identical guarantees for general integer knapsack, the multidimensional knapsack problem (with a constant number of constraints) and for contingency tables (with a constant number of rows). Previously, only randomized approximation schemes were known for"},"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.3187","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2010-08-18T23:45:28Z","cross_cats_sorted":["cs.CC","cs.LG"],"title_canon_sha256":"bd7662910c973a26d9bffcfc1d9310ab78b2cf77eda6d687bace7a582865d963","abstract_canon_sha256":"c1f5d4a08e0aaa81c4cf4d8615ecd3cf9002fd431903e4c9c563838edd638c09"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:42:03.158195Z","signature_b64":"RhNUuWgYua4BQw5kKpzJUPFbfqWkgoZQQLmcKa7M2XHD4ASguiABYD0a/+E8u0w2PxrqISMJgyRzpgomq3yKDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"8e3a772a45af23014ecf5e203cc9082ddecfebaace1892e175eb568c3d787ca1","last_reissued_at":"2026-05-18T04:42:03.157640Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:42:03.157640Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Polynomial-Time Approximation Schemes for Knapsack and Related Counting Problems using Branching Programs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CC","cs.LG"],"primary_cat":"cs.DS","authors_text":"Adam Klivans, Parikshit Gopalan, Raghu Meka","submitted_at":"2010-08-18T23:45:28Z","abstract_excerpt":"We give a deterministic, polynomial-time algorithm for approximately counting the number of {0,1}-solutions to any instance of the knapsack problem. On an instance of length n with total weight W and accuracy parameter eps, our algorithm produces a (1 + eps)-multiplicative approximation in time poly(n,log W,1/eps). We also give algorithms with identical guarantees for general integer knapsack, the multidimensional knapsack problem (with a constant number of constraints) and for contingency tables (with a constant number of rows). Previously, only randomized approximation schemes were known for"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1008.3187","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.3187","created_at":"2026-05-18T04:42:03.157749+00:00"},{"alias_kind":"arxiv_version","alias_value":"1008.3187v1","created_at":"2026-05-18T04:42:03.157749+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1008.3187","created_at":"2026-05-18T04:42:03.157749+00:00"},{"alias_kind":"pith_short_12","alias_value":"RY5HOKSFV4RQ","created_at":"2026-05-18T12:26:13.927090+00:00"},{"alias_kind":"pith_short_16","alias_value":"RY5HOKSFV4RQCTWP","created_at":"2026-05-18T12:26:13.927090+00:00"},{"alias_kind":"pith_short_8","alias_value":"RY5HOKSF","created_at":"2026-05-18T12:26:13.927090+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/RY5HOKSFV4RQCTWPLYQDZSIIFX","json":"https://pith.science/pith/RY5HOKSFV4RQCTWPLYQDZSIIFX.json","graph_json":"https://pith.science/api/pith-number/RY5HOKSFV4RQCTWPLYQDZSIIFX/graph.json","events_json":"https://pith.science/api/pith-number/RY5HOKSFV4RQCTWPLYQDZSIIFX/events.json","paper":"https://pith.science/paper/RY5HOKSF"},"agent_actions":{"view_html":"https://pith.science/pith/RY5HOKSFV4RQCTWPLYQDZSIIFX","download_json":"https://pith.science/pith/RY5HOKSFV4RQCTWPLYQDZSIIFX.json","view_paper":"https://pith.science/paper/RY5HOKSF","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1008.3187&json=true","fetch_graph":"https://pith.science/api/pith-number/RY5HOKSFV4RQCTWPLYQDZSIIFX/graph.json","fetch_events":"https://pith.science/api/pith-number/RY5HOKSFV4RQCTWPLYQDZSIIFX/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/RY5HOKSFV4RQCTWPLYQDZSIIFX/action/timestamp_anchor","attest_storage":"https://pith.science/pith/RY5HOKSFV4RQCTWPLYQDZSIIFX/action/storage_attestation","attest_author":"https://pith.science/pith/RY5HOKSFV4RQCTWPLYQDZSIIFX/action/author_attestation","sign_citation":"https://pith.science/pith/RY5HOKSFV4RQCTWPLYQDZSIIFX/action/citation_signature","submit_replication":"https://pith.science/pith/RY5HOKSFV4RQCTWPLYQDZSIIFX/action/replication_record"}},"created_at":"2026-05-18T04:42:03.157749+00:00","updated_at":"2026-05-18T04:42:03.157749+00:00"}