{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:J5FTYG45NFYGZKBAJEBETKUTV4","short_pith_number":"pith:J5FTYG45","canonical_record":{"source":{"id":"1802.05791","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2018-02-15T23:21:58Z","cross_cats_sorted":[],"title_canon_sha256":"18dd60831a05e2bfbd6c9576aa071ad2ecae0a216c20d5acb2ec5740fe4c7999","abstract_canon_sha256":"c7950d4a8544c11ebcbfe72a830056499d21d2b14c326e5bf17abf15e6523738"},"schema_version":"1.0"},"canonical_sha256":"4f4b3c1b9d69706ca820490249aa93af1d53b784bca51769aec63e7d3b835ff5","source":{"kind":"arxiv","id":"1802.05791","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1802.05791","created_at":"2026-05-18T00:23:11Z"},{"alias_kind":"arxiv_version","alias_value":"1802.05791v1","created_at":"2026-05-18T00:23:11Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1802.05791","created_at":"2026-05-18T00:23:11Z"},{"alias_kind":"pith_short_12","alias_value":"J5FTYG45NFYG","created_at":"2026-05-18T12:32:31Z"},{"alias_kind":"pith_short_16","alias_value":"J5FTYG45NFYGZKBA","created_at":"2026-05-18T12:32:31Z"},{"alias_kind":"pith_short_8","alias_value":"J5FTYG45","created_at":"2026-05-18T12:32:31Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:J5FTYG45NFYGZKBAJEBETKUTV4","target":"record","payload":{"canonical_record":{"source":{"id":"1802.05791","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2018-02-15T23:21:58Z","cross_cats_sorted":[],"title_canon_sha256":"18dd60831a05e2bfbd6c9576aa071ad2ecae0a216c20d5acb2ec5740fe4c7999","abstract_canon_sha256":"c7950d4a8544c11ebcbfe72a830056499d21d2b14c326e5bf17abf15e6523738"},"schema_version":"1.0"},"canonical_sha256":"4f4b3c1b9d69706ca820490249aa93af1d53b784bca51769aec63e7d3b835ff5","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:23:11.014805Z","signature_b64":"XCphohZhuUq9tvJEDs1ybz7eaTbZan1t6bZ1TMTQc4EF5Xk9u2IV0mbXP4HVwoee5bZFecGrcOMspTVHSKMECQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"4f4b3c1b9d69706ca820490249aa93af1d53b784bca51769aec63e7d3b835ff5","last_reissued_at":"2026-05-18T00:23:11.014057Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:23:11.014057Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1802.05791","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-18T00:23:11Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"MCi8cwo6ZdToZYh3l+mgVZIMMoFfn6Kw+hmSxecdhhSEfMEDOsPRNVY2Ias7TLAe/W5z1cmA0xe/omExh4nzDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-25T21:43:50.474448Z"},"content_sha256":"56d2fde8ed7d472f7ac8255b16a3eb1127bd116b887c2309377ebdf802f71832","schema_version":"1.0","event_id":"sha256:56d2fde8ed7d472f7ac8255b16a3eb1127bd116b887c2309377ebdf802f71832"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:J5FTYG45NFYGZKBAJEBETKUTV4","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"A Faster FPTAS for #Knapsack","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Liran Markin, Oren Weimann, Pawe{\\l} Gawrychowski","submitted_at":"2018-02-15T23:21:58Z","abstract_excerpt":"Given a set $W = \\{w_1,\\ldots, w_n\\}$ of non-negative integer weights and an integer $C$, the #Knapsack problem asks to count the number of distinct subsets of $W$ whose total weight is at most $C$. In the more general integer version of the problem, the subsets are multisets. That is, we are also given a set $ \\{u_1,\\ldots, u_n\\}$ and we are allowed to take up to $u_i$ items of weight $w_i$.\n  We present a deterministic FPTAS for #Knapsack running in $O(n^{2.5}\\varepsilon^{-1.5}\\log(n \\varepsilon^{-1})\\log (n \\varepsilon))$ time. The previous best deterministic algorithm [FOCS 2011] runs in $"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1802.05791","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-18T00:23:11Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"kHAY1Db+YV6yiq6rO780WpdhEm+X0a2rLGlFshbTm4o6Y8e2pxFjfTqk+iocu9/VlZPvZ6Nsmw/K070oCuuMBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-25T21:43:50.475172Z"},"content_sha256":"ed15d412fb9d1f258d97cc81cf2298a5c8787577159eac1522251e79c6d4d706","schema_version":"1.0","event_id":"sha256:ed15d412fb9d1f258d97cc81cf2298a5c8787577159eac1522251e79c6d4d706"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/J5FTYG45NFYGZKBAJEBETKUTV4/bundle.json","state_url":"https://pith.science/pith/J5FTYG45NFYGZKBAJEBETKUTV4/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/J5FTYG45NFYGZKBAJEBETKUTV4/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-25T21:43:50Z","links":{"resolver":"https://pith.science/pith/J5FTYG45NFYGZKBAJEBETKUTV4","bundle":"https://pith.science/pith/J5FTYG45NFYGZKBAJEBETKUTV4/bundle.json","state":"https://pith.science/pith/J5FTYG45NFYGZKBAJEBETKUTV4/state.json","well_known_bundle":"https://pith.science/.well-known/pith/J5FTYG45NFYGZKBAJEBETKUTV4/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:J5FTYG45NFYGZKBAJEBETKUTV4","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":"c7950d4a8544c11ebcbfe72a830056499d21d2b14c326e5bf17abf15e6523738","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2018-02-15T23:21:58Z","title_canon_sha256":"18dd60831a05e2bfbd6c9576aa071ad2ecae0a216c20d5acb2ec5740fe4c7999"},"schema_version":"1.0","source":{"id":"1802.05791","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1802.05791","created_at":"2026-05-18T00:23:11Z"},{"alias_kind":"arxiv_version","alias_value":"1802.05791v1","created_at":"2026-05-18T00:23:11Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1802.05791","created_at":"2026-05-18T00:23:11Z"},{"alias_kind":"pith_short_12","alias_value":"J5FTYG45NFYG","created_at":"2026-05-18T12:32:31Z"},{"alias_kind":"pith_short_16","alias_value":"J5FTYG45NFYGZKBA","created_at":"2026-05-18T12:32:31Z"},{"alias_kind":"pith_short_8","alias_value":"J5FTYG45","created_at":"2026-05-18T12:32:31Z"}],"graph_snapshots":[{"event_id":"sha256:ed15d412fb9d1f258d97cc81cf2298a5c8787577159eac1522251e79c6d4d706","target":"graph","created_at":"2026-05-18T00:23:11Z","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":"Given a set $W = \\{w_1,\\ldots, w_n\\}$ of non-negative integer weights and an integer $C$, the #Knapsack problem asks to count the number of distinct subsets of $W$ whose total weight is at most $C$. In the more general integer version of the problem, the subsets are multisets. That is, we are also given a set $ \\{u_1,\\ldots, u_n\\}$ and we are allowed to take up to $u_i$ items of weight $w_i$.\n  We present a deterministic FPTAS for #Knapsack running in $O(n^{2.5}\\varepsilon^{-1.5}\\log(n \\varepsilon^{-1})\\log (n \\varepsilon))$ time. The previous best deterministic algorithm [FOCS 2011] runs in $","authors_text":"Liran Markin, Oren Weimann, Pawe{\\l} Gawrychowski","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2018-02-15T23:21:58Z","title":"A Faster FPTAS for #Knapsack"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1802.05791","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:56d2fde8ed7d472f7ac8255b16a3eb1127bd116b887c2309377ebdf802f71832","target":"record","created_at":"2026-05-18T00:23:11Z","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":"c7950d4a8544c11ebcbfe72a830056499d21d2b14c326e5bf17abf15e6523738","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2018-02-15T23:21:58Z","title_canon_sha256":"18dd60831a05e2bfbd6c9576aa071ad2ecae0a216c20d5acb2ec5740fe4c7999"},"schema_version":"1.0","source":{"id":"1802.05791","kind":"arxiv","version":1}},"canonical_sha256":"4f4b3c1b9d69706ca820490249aa93af1d53b784bca51769aec63e7d3b835ff5","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"4f4b3c1b9d69706ca820490249aa93af1d53b784bca51769aec63e7d3b835ff5","first_computed_at":"2026-05-18T00:23:11.014057Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:23:11.014057Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"XCphohZhuUq9tvJEDs1ybz7eaTbZan1t6bZ1TMTQc4EF5Xk9u2IV0mbXP4HVwoee5bZFecGrcOMspTVHSKMECQ==","signature_status":"signed_v1","signed_at":"2026-05-18T00:23:11.014805Z","signed_message":"canonical_sha256_bytes"},"source_id":"1802.05791","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:56d2fde8ed7d472f7ac8255b16a3eb1127bd116b887c2309377ebdf802f71832","sha256:ed15d412fb9d1f258d97cc81cf2298a5c8787577159eac1522251e79c6d4d706"],"state_sha256":"90654fa1bb055bff971e1949f95abeab4747586186d6faf17d9c7d8ee99f51b9"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"QumVrMvgYiopbdNY439lNaPuP0Pn+dtQcdWQ9ac2C0OoMHcRua1FgdyxW6Ws3eXNNVX7g++jMSe8kNOE/QBkCw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-25T21:43:50.479690Z","bundle_sha256":"45c1f51627e0231043880a1ba33c1c4efd9b380e49a81bf4b2738a02586180df"}}