{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:33FAYTPE427JM4HANVIXIJUM2Q","short_pith_number":"pith:33FAYTPE","schema_version":"1.0","canonical_sha256":"deca0c4de4e6be9670e06d5174268cd429c2e232eb239dffc7eab335806f0c47","source":{"kind":"arxiv","id":"1811.12554","version":1},"attestation_state":"computed","paper":{"title":"Fast Algorithms for Knapsack via Convolution and Prediction","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.GT","authors_text":"Cliff Stein, MohammadHossein Bateni, MohammadTaghi Hajiaghayi, Saeed Seddighin","submitted_at":"2018-11-30T00:33:51Z","abstract_excerpt":"The \\Problem{knapsack} problem is a fundamental problem in combinatorial optimization. It has been studied extensively from theoretical as well as practical perspectives as it is one of the most well-known NP-hard problems. The goal is to pack a knapsack of size $t$ with the maximum value from a collection of $n$ items with given sizes and values.\n  Recent evidence suggests that a classic $O(nt)$ dynamic-programming solution for the \\Problem{knapsack} problem might be the fastest in the worst case. In fact, solving the \\Problem{knapsack} problem was shown to be computationally equivalent to th"},"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":"1811.12554","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.GT","submitted_at":"2018-11-30T00:33:51Z","cross_cats_sorted":[],"title_canon_sha256":"666dcf70b2cffcb3b2a5658f5b59b9f530f311a32fdd41988fefe033f97e743b","abstract_canon_sha256":"ffb6d5b74d7b2b78e25bb8d8c51a689d0da0ab2084b36d39ed71469ce554f780"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:59:29.292682Z","signature_b64":"azzmrRWscxv6xX9ojHz6PH0irOCj2lJYN96+JIQEcZZeP3ikPXv3eOzMY8BlUbUlTOXa9gMZsIa5k6g8fXO9Bw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"deca0c4de4e6be9670e06d5174268cd429c2e232eb239dffc7eab335806f0c47","last_reissued_at":"2026-05-17T23:59:29.292150Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:59:29.292150Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Fast Algorithms for Knapsack via Convolution and Prediction","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.GT","authors_text":"Cliff Stein, MohammadHossein Bateni, MohammadTaghi Hajiaghayi, Saeed Seddighin","submitted_at":"2018-11-30T00:33:51Z","abstract_excerpt":"The \\Problem{knapsack} problem is a fundamental problem in combinatorial optimization. It has been studied extensively from theoretical as well as practical perspectives as it is one of the most well-known NP-hard problems. The goal is to pack a knapsack of size $t$ with the maximum value from a collection of $n$ items with given sizes and values.\n  Recent evidence suggests that a classic $O(nt)$ dynamic-programming solution for the \\Problem{knapsack} problem might be the fastest in the worst case. In fact, solving the \\Problem{knapsack} problem was shown to be computationally equivalent to th"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1811.12554","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":"1811.12554","created_at":"2026-05-17T23:59:29.292239+00:00"},{"alias_kind":"arxiv_version","alias_value":"1811.12554v1","created_at":"2026-05-17T23:59:29.292239+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1811.12554","created_at":"2026-05-17T23:59:29.292239+00:00"},{"alias_kind":"pith_short_12","alias_value":"33FAYTPE427J","created_at":"2026-05-18T12:32:02.567920+00:00"},{"alias_kind":"pith_short_16","alias_value":"33FAYTPE427JM4HA","created_at":"2026-05-18T12:32:02.567920+00:00"},{"alias_kind":"pith_short_8","alias_value":"33FAYTPE","created_at":"2026-05-18T12:32:02.567920+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/33FAYTPE427JM4HANVIXIJUM2Q","json":"https://pith.science/pith/33FAYTPE427JM4HANVIXIJUM2Q.json","graph_json":"https://pith.science/api/pith-number/33FAYTPE427JM4HANVIXIJUM2Q/graph.json","events_json":"https://pith.science/api/pith-number/33FAYTPE427JM4HANVIXIJUM2Q/events.json","paper":"https://pith.science/paper/33FAYTPE"},"agent_actions":{"view_html":"https://pith.science/pith/33FAYTPE427JM4HANVIXIJUM2Q","download_json":"https://pith.science/pith/33FAYTPE427JM4HANVIXIJUM2Q.json","view_paper":"https://pith.science/paper/33FAYTPE","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1811.12554&json=true","fetch_graph":"https://pith.science/api/pith-number/33FAYTPE427JM4HANVIXIJUM2Q/graph.json","fetch_events":"https://pith.science/api/pith-number/33FAYTPE427JM4HANVIXIJUM2Q/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/33FAYTPE427JM4HANVIXIJUM2Q/action/timestamp_anchor","attest_storage":"https://pith.science/pith/33FAYTPE427JM4HANVIXIJUM2Q/action/storage_attestation","attest_author":"https://pith.science/pith/33FAYTPE427JM4HANVIXIJUM2Q/action/author_attestation","sign_citation":"https://pith.science/pith/33FAYTPE427JM4HANVIXIJUM2Q/action/citation_signature","submit_replication":"https://pith.science/pith/33FAYTPE427JM4HANVIXIJUM2Q/action/replication_record"}},"created_at":"2026-05-17T23:59:29.292239+00:00","updated_at":"2026-05-17T23:59:29.292239+00:00"}