{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:33FAYTPE427JM4HANVIXIJUM2Q","short_pith_number":"pith:33FAYTPE","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"},"canonical_sha256":"deca0c4de4e6be9670e06d5174268cd429c2e232eb239dffc7eab335806f0c47","source":{"kind":"arxiv","id":"1811.12554","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1811.12554","created_at":"2026-05-17T23:59:29Z"},{"alias_kind":"arxiv_version","alias_value":"1811.12554v1","created_at":"2026-05-17T23:59:29Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1811.12554","created_at":"2026-05-17T23:59:29Z"},{"alias_kind":"pith_short_12","alias_value":"33FAYTPE427J","created_at":"2026-05-18T12:32:02Z"},{"alias_kind":"pith_short_16","alias_value":"33FAYTPE427JM4HA","created_at":"2026-05-18T12:32:02Z"},{"alias_kind":"pith_short_8","alias_value":"33FAYTPE","created_at":"2026-05-18T12:32:02Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:33FAYTPE427JM4HANVIXIJUM2Q","target":"record","payload":{"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"},"canonical_sha256":"deca0c4de4e6be9670e06d5174268cd429c2e232eb239dffc7eab335806f0c47","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"},"source_kind":"arxiv","source_id":"1811.12554","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-17T23:59:29Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"/RNQQWupNTy1/7t6cDKEFdocQidatbAAHmzQJNKBh6bLecSonxIxpQ3iDRUQ9SXVtjjnHQqlGqGyu/u/7C2BCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-11T11:18:42.179423Z"},"content_sha256":"c6a4962cedb4754ea5a5c6a0430ed55dbe980d5dbeebd1e1573a481993f90ca5","schema_version":"1.0","event_id":"sha256:c6a4962cedb4754ea5a5c6a0430ed55dbe980d5dbeebd1e1573a481993f90ca5"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:33FAYTPE427JM4HANVIXIJUM2Q","target":"graph","payload":{"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"},"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-17T23:59:29Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"RfwBQGd7+khy0d51FHIvKinYEWNAx1V7axEFgbfKirUFHm5vFCRuv0VcjCQW9ZJekqbdeWGFGv8knypn4EmqAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-11T11:18:42.179774Z"},"content_sha256":"cf102afb874ae72331de71347a071c2e4dce9ea9b8436f243bd9cad92cfb404c","schema_version":"1.0","event_id":"sha256:cf102afb874ae72331de71347a071c2e4dce9ea9b8436f243bd9cad92cfb404c"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/33FAYTPE427JM4HANVIXIJUM2Q/bundle.json","state_url":"https://pith.science/pith/33FAYTPE427JM4HANVIXIJUM2Q/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/33FAYTPE427JM4HANVIXIJUM2Q/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-06-11T11:18:42Z","links":{"resolver":"https://pith.science/pith/33FAYTPE427JM4HANVIXIJUM2Q","bundle":"https://pith.science/pith/33FAYTPE427JM4HANVIXIJUM2Q/bundle.json","state":"https://pith.science/pith/33FAYTPE427JM4HANVIXIJUM2Q/state.json","well_known_bundle":"https://pith.science/.well-known/pith/33FAYTPE427JM4HANVIXIJUM2Q/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:33FAYTPE427JM4HANVIXIJUM2Q","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":"ffb6d5b74d7b2b78e25bb8d8c51a689d0da0ab2084b36d39ed71469ce554f780","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.GT","submitted_at":"2018-11-30T00:33:51Z","title_canon_sha256":"666dcf70b2cffcb3b2a5658f5b59b9f530f311a32fdd41988fefe033f97e743b"},"schema_version":"1.0","source":{"id":"1811.12554","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1811.12554","created_at":"2026-05-17T23:59:29Z"},{"alias_kind":"arxiv_version","alias_value":"1811.12554v1","created_at":"2026-05-17T23:59:29Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1811.12554","created_at":"2026-05-17T23:59:29Z"},{"alias_kind":"pith_short_12","alias_value":"33FAYTPE427J","created_at":"2026-05-18T12:32:02Z"},{"alias_kind":"pith_short_16","alias_value":"33FAYTPE427JM4HA","created_at":"2026-05-18T12:32:02Z"},{"alias_kind":"pith_short_8","alias_value":"33FAYTPE","created_at":"2026-05-18T12:32:02Z"}],"graph_snapshots":[{"event_id":"sha256:cf102afb874ae72331de71347a071c2e4dce9ea9b8436f243bd9cad92cfb404c","target":"graph","created_at":"2026-05-17T23:59:29Z","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":"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","authors_text":"Cliff Stein, MohammadHossein Bateni, MohammadTaghi Hajiaghayi, Saeed Seddighin","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.GT","submitted_at":"2018-11-30T00:33:51Z","title":"Fast Algorithms for Knapsack via Convolution and Prediction"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1811.12554","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:c6a4962cedb4754ea5a5c6a0430ed55dbe980d5dbeebd1e1573a481993f90ca5","target":"record","created_at":"2026-05-17T23:59:29Z","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":"ffb6d5b74d7b2b78e25bb8d8c51a689d0da0ab2084b36d39ed71469ce554f780","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.GT","submitted_at":"2018-11-30T00:33:51Z","title_canon_sha256":"666dcf70b2cffcb3b2a5658f5b59b9f530f311a32fdd41988fefe033f97e743b"},"schema_version":"1.0","source":{"id":"1811.12554","kind":"arxiv","version":1}},"canonical_sha256":"deca0c4de4e6be9670e06d5174268cd429c2e232eb239dffc7eab335806f0c47","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"deca0c4de4e6be9670e06d5174268cd429c2e232eb239dffc7eab335806f0c47","first_computed_at":"2026-05-17T23:59:29.292150Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:59:29.292150Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"azzmrRWscxv6xX9ojHz6PH0irOCj2lJYN96+JIQEcZZeP3ikPXv3eOzMY8BlUbUlTOXa9gMZsIa5k6g8fXO9Bw==","signature_status":"signed_v1","signed_at":"2026-05-17T23:59:29.292682Z","signed_message":"canonical_sha256_bytes"},"source_id":"1811.12554","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:c6a4962cedb4754ea5a5c6a0430ed55dbe980d5dbeebd1e1573a481993f90ca5","sha256:cf102afb874ae72331de71347a071c2e4dce9ea9b8436f243bd9cad92cfb404c"],"state_sha256":"119239cfb442b39a46ddea164a9731d933cecc42eb31ad754a4308915e70c6a9"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"URLWi1GyeaiIl2HWqtNZe6iR2EQKGlJNCWEQuZc3YijPkXgT8A8TvMdeDDfvapMsyccP7yQ+bbJfsW+Lxqq1Cg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-11T11:18:42.181672Z","bundle_sha256":"6a3e6dadbfe91d876016e96314de3a1ca45d00117c3b00081df8031a33a0c689"}}