{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2010:RY5HOKSFV4RQCTWPLYQDZSIIFX","short_pith_number":"pith:RY5HOKSF","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"},"canonical_sha256":"8e3a772a45af23014ecf5e203cc9082ddecfebaace1892e175eb568c3d787ca1","source":{"kind":"arxiv","id":"1008.3187","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1008.3187","created_at":"2026-05-18T04:42:03Z"},{"alias_kind":"arxiv_version","alias_value":"1008.3187v1","created_at":"2026-05-18T04:42:03Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1008.3187","created_at":"2026-05-18T04:42:03Z"},{"alias_kind":"pith_short_12","alias_value":"RY5HOKSFV4RQ","created_at":"2026-05-18T12:26:13Z"},{"alias_kind":"pith_short_16","alias_value":"RY5HOKSFV4RQCTWP","created_at":"2026-05-18T12:26:13Z"},{"alias_kind":"pith_short_8","alias_value":"RY5HOKSF","created_at":"2026-05-18T12:26:13Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2010:RY5HOKSFV4RQCTWPLYQDZSIIFX","target":"record","payload":{"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"},"canonical_sha256":"8e3a772a45af23014ecf5e203cc9082ddecfebaace1892e175eb568c3d787ca1","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"},"source_kind":"arxiv","source_id":"1008.3187","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-18T04:42:03Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"G1LZ9pMaBUnku8rRQuyW06hyv4fagfLFnEN3MJXpxv5ZlA35MjAtT/bqRfrVor+XkQKoqdXpVKQ1GgO5apiECg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-19T22:18:29.068571Z"},"content_sha256":"ec75a9b8bfa89b48d40945a81b0316b431edc691bcd394afbfe032b0b399af50","schema_version":"1.0","event_id":"sha256:ec75a9b8bfa89b48d40945a81b0316b431edc691bcd394afbfe032b0b399af50"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2010:RY5HOKSFV4RQCTWPLYQDZSIIFX","target":"graph","payload":{"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"},"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-18T04:42:03Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"dSOnOMgdA8eQHvLW9VhRdZ3WJJETg0len5J860rqYLg0ck54PWbjgB8i8Lfoc28scvLZnN4cEoWhRWifnCwsAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-19T22:18:29.069203Z"},"content_sha256":"9a2ab0ae56726261d80162b0e6fe508a9bdd1080ba71b80b14c9d56ef4b64461","schema_version":"1.0","event_id":"sha256:9a2ab0ae56726261d80162b0e6fe508a9bdd1080ba71b80b14c9d56ef4b64461"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/RY5HOKSFV4RQCTWPLYQDZSIIFX/bundle.json","state_url":"https://pith.science/pith/RY5HOKSFV4RQCTWPLYQDZSIIFX/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/RY5HOKSFV4RQCTWPLYQDZSIIFX/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-05-19T22:18:29Z","links":{"resolver":"https://pith.science/pith/RY5HOKSFV4RQCTWPLYQDZSIIFX","bundle":"https://pith.science/pith/RY5HOKSFV4RQCTWPLYQDZSIIFX/bundle.json","state":"https://pith.science/pith/RY5HOKSFV4RQCTWPLYQDZSIIFX/state.json","well_known_bundle":"https://pith.science/.well-known/pith/RY5HOKSFV4RQCTWPLYQDZSIIFX/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2010:RY5HOKSFV4RQCTWPLYQDZSIIFX","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":"c1f5d4a08e0aaa81c4cf4d8615ecd3cf9002fd431903e4c9c563838edd638c09","cross_cats_sorted":["cs.CC","cs.LG"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2010-08-18T23:45:28Z","title_canon_sha256":"bd7662910c973a26d9bffcfc1d9310ab78b2cf77eda6d687bace7a582865d963"},"schema_version":"1.0","source":{"id":"1008.3187","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1008.3187","created_at":"2026-05-18T04:42:03Z"},{"alias_kind":"arxiv_version","alias_value":"1008.3187v1","created_at":"2026-05-18T04:42:03Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1008.3187","created_at":"2026-05-18T04:42:03Z"},{"alias_kind":"pith_short_12","alias_value":"RY5HOKSFV4RQ","created_at":"2026-05-18T12:26:13Z"},{"alias_kind":"pith_short_16","alias_value":"RY5HOKSFV4RQCTWP","created_at":"2026-05-18T12:26:13Z"},{"alias_kind":"pith_short_8","alias_value":"RY5HOKSF","created_at":"2026-05-18T12:26:13Z"}],"graph_snapshots":[{"event_id":"sha256:9a2ab0ae56726261d80162b0e6fe508a9bdd1080ba71b80b14c9d56ef4b64461","target":"graph","created_at":"2026-05-18T04:42:03Z","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 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","authors_text":"Adam Klivans, Parikshit Gopalan, Raghu Meka","cross_cats":["cs.CC","cs.LG"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2010-08-18T23:45:28Z","title":"Polynomial-Time Approximation Schemes for Knapsack and Related Counting Problems using Branching Programs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1008.3187","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:ec75a9b8bfa89b48d40945a81b0316b431edc691bcd394afbfe032b0b399af50","target":"record","created_at":"2026-05-18T04:42:03Z","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":"c1f5d4a08e0aaa81c4cf4d8615ecd3cf9002fd431903e4c9c563838edd638c09","cross_cats_sorted":["cs.CC","cs.LG"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2010-08-18T23:45:28Z","title_canon_sha256":"bd7662910c973a26d9bffcfc1d9310ab78b2cf77eda6d687bace7a582865d963"},"schema_version":"1.0","source":{"id":"1008.3187","kind":"arxiv","version":1}},"canonical_sha256":"8e3a772a45af23014ecf5e203cc9082ddecfebaace1892e175eb568c3d787ca1","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"8e3a772a45af23014ecf5e203cc9082ddecfebaace1892e175eb568c3d787ca1","first_computed_at":"2026-05-18T04:42:03.157640Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T04:42:03.157640Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"RhNUuWgYua4BQw5kKpzJUPFbfqWkgoZQQLmcKa7M2XHD4ASguiABYD0a/+E8u0w2PxrqISMJgyRzpgomq3yKDQ==","signature_status":"signed_v1","signed_at":"2026-05-18T04:42:03.158195Z","signed_message":"canonical_sha256_bytes"},"source_id":"1008.3187","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:ec75a9b8bfa89b48d40945a81b0316b431edc691bcd394afbfe032b0b399af50","sha256:9a2ab0ae56726261d80162b0e6fe508a9bdd1080ba71b80b14c9d56ef4b64461"],"state_sha256":"e7afbbccb435b64df050325959bfbc74c0603865f8b5534822ffec64ea709c46"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"6QtC57h2zKFh/T1o9VyteatfxV9FZUJkLeUn8Z/hDYIKyx/HCWMAo4R1M9G0xY8SOtz6W8jJGwuspG95pDTCCg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-19T22:18:29.072198Z","bundle_sha256":"72847323cc79c5cac7b3115799edb9c544bc60b71fb547a94a74f9555c89752e"}}