{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:2GQ3YWEAQC6OAXYXUMIMU76GJ7","short_pith_number":"pith:2GQ3YWEA","canonical_record":{"source":{"id":"1802.06440","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2018-02-18T20:37:55Z","cross_cats_sorted":[],"title_canon_sha256":"8f6aa56238e1e6bf40a75431368e5c599aeb94c6cf39b17fbc1a29288672e93e","abstract_canon_sha256":"45fa57ff226279234b431e1d18eecd1520390c6b4063d523833c972499c280fc"},"schema_version":"1.0"},"canonical_sha256":"d1a1bc588080bce05f17a310ca7fc64fddee452bd77e6fa9ce9045f5bc482e38","source":{"kind":"arxiv","id":"1802.06440","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1802.06440","created_at":"2026-05-18T00:10:51Z"},{"alias_kind":"arxiv_version","alias_value":"1802.06440v2","created_at":"2026-05-18T00:10:51Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1802.06440","created_at":"2026-05-18T00:10:51Z"},{"alias_kind":"pith_short_12","alias_value":"2GQ3YWEAQC6O","created_at":"2026-05-18T12:32:02Z"},{"alias_kind":"pith_short_16","alias_value":"2GQ3YWEAQC6OAXYX","created_at":"2026-05-18T12:32:02Z"},{"alias_kind":"pith_short_8","alias_value":"2GQ3YWEA","created_at":"2026-05-18T12:32:02Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:2GQ3YWEAQC6OAXYXUMIMU76GJ7","target":"record","payload":{"canonical_record":{"source":{"id":"1802.06440","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2018-02-18T20:37:55Z","cross_cats_sorted":[],"title_canon_sha256":"8f6aa56238e1e6bf40a75431368e5c599aeb94c6cf39b17fbc1a29288672e93e","abstract_canon_sha256":"45fa57ff226279234b431e1d18eecd1520390c6b4063d523833c972499c280fc"},"schema_version":"1.0"},"canonical_sha256":"d1a1bc588080bce05f17a310ca7fc64fddee452bd77e6fa9ce9045f5bc482e38","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:10:51.966173Z","signature_b64":"TV2aUb5ejCFGxC38fbMsCW/ab+ablVcx1DD0++syrEhveqm/BeYLMsTYRGrCjtmP7x5xUIyqnjZxx1nz6evhCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"d1a1bc588080bce05f17a310ca7fc64fddee452bd77e6fa9ce9045f5bc482e38","last_reissued_at":"2026-05-18T00:10:51.965514Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:10:51.965514Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1802.06440","source_version":2,"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:10:51Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ZRmje/mVYAJ8ruTGYkmZ785Ikcfx07m45rR+75qqBQoc0xxZMxU6r+NR3xs5YUA8vR5FV/8Bt75TXLrXw+wkAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-29T17:44:06.187992Z"},"content_sha256":"1222688dfad6aeb0f2d58339d0dcf36f13ed6bc3e29b03c7ec35ac6eadc7920e","schema_version":"1.0","event_id":"sha256:1222688dfad6aeb0f2d58339d0dcf36f13ed6bc3e29b03c7ec35ac6eadc7920e"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:2GQ3YWEAQC6OAXYXUMIMU76GJ7","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Capacitated Dynamic Programming: Faster Knapsack and Graph Algorithms","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Christos Tzamos, Kyriakos Axiotis","submitted_at":"2018-02-18T20:37:55Z","abstract_excerpt":"One of the most fundamental problems in Computer Science is the Knapsack problem. Given a set of n items with different weights and values, it asks to pick the most valuable subset whose total weight is below a capacity threshold T. Despite its wide applicability in various areas in Computer Science, Operations Research, and Finance, the best known running time for the problem is O(Tn). The main result of our work is an improved algorithm running in time O(TD), where D is the number of distinct weights. Previously, faster runtimes for Knapsack were only possible when both weights and values ar"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1802.06440","kind":"arxiv","version":2},"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:10:51Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"RmlpgPi6kqBjvaHbh7KiaLl+Ukj+JUpdxQCSJsONuRkrsvcZ+4U4B6pBO5FPArPGlQlOsd8zaDlM5bPgXR1CDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-29T17:44:06.188349Z"},"content_sha256":"1ca3a196a9e47798a4c59be9eb989cd66941eec2519e6d4adc5e28d6583a58b0","schema_version":"1.0","event_id":"sha256:1ca3a196a9e47798a4c59be9eb989cd66941eec2519e6d4adc5e28d6583a58b0"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/2GQ3YWEAQC6OAXYXUMIMU76GJ7/bundle.json","state_url":"https://pith.science/pith/2GQ3YWEAQC6OAXYXUMIMU76GJ7/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/2GQ3YWEAQC6OAXYXUMIMU76GJ7/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-29T17:44:06Z","links":{"resolver":"https://pith.science/pith/2GQ3YWEAQC6OAXYXUMIMU76GJ7","bundle":"https://pith.science/pith/2GQ3YWEAQC6OAXYXUMIMU76GJ7/bundle.json","state":"https://pith.science/pith/2GQ3YWEAQC6OAXYXUMIMU76GJ7/state.json","well_known_bundle":"https://pith.science/.well-known/pith/2GQ3YWEAQC6OAXYXUMIMU76GJ7/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:2GQ3YWEAQC6OAXYXUMIMU76GJ7","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":"45fa57ff226279234b431e1d18eecd1520390c6b4063d523833c972499c280fc","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2018-02-18T20:37:55Z","title_canon_sha256":"8f6aa56238e1e6bf40a75431368e5c599aeb94c6cf39b17fbc1a29288672e93e"},"schema_version":"1.0","source":{"id":"1802.06440","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1802.06440","created_at":"2026-05-18T00:10:51Z"},{"alias_kind":"arxiv_version","alias_value":"1802.06440v2","created_at":"2026-05-18T00:10:51Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1802.06440","created_at":"2026-05-18T00:10:51Z"},{"alias_kind":"pith_short_12","alias_value":"2GQ3YWEAQC6O","created_at":"2026-05-18T12:32:02Z"},{"alias_kind":"pith_short_16","alias_value":"2GQ3YWEAQC6OAXYX","created_at":"2026-05-18T12:32:02Z"},{"alias_kind":"pith_short_8","alias_value":"2GQ3YWEA","created_at":"2026-05-18T12:32:02Z"}],"graph_snapshots":[{"event_id":"sha256:1ca3a196a9e47798a4c59be9eb989cd66941eec2519e6d4adc5e28d6583a58b0","target":"graph","created_at":"2026-05-18T00:10:51Z","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":"One of the most fundamental problems in Computer Science is the Knapsack problem. Given a set of n items with different weights and values, it asks to pick the most valuable subset whose total weight is below a capacity threshold T. Despite its wide applicability in various areas in Computer Science, Operations Research, and Finance, the best known running time for the problem is O(Tn). The main result of our work is an improved algorithm running in time O(TD), where D is the number of distinct weights. Previously, faster runtimes for Knapsack were only possible when both weights and values ar","authors_text":"Christos Tzamos, Kyriakos Axiotis","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2018-02-18T20:37:55Z","title":"Capacitated Dynamic Programming: Faster Knapsack and Graph Algorithms"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1802.06440","kind":"arxiv","version":2},"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:1222688dfad6aeb0f2d58339d0dcf36f13ed6bc3e29b03c7ec35ac6eadc7920e","target":"record","created_at":"2026-05-18T00:10:51Z","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":"45fa57ff226279234b431e1d18eecd1520390c6b4063d523833c972499c280fc","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2018-02-18T20:37:55Z","title_canon_sha256":"8f6aa56238e1e6bf40a75431368e5c599aeb94c6cf39b17fbc1a29288672e93e"},"schema_version":"1.0","source":{"id":"1802.06440","kind":"arxiv","version":2}},"canonical_sha256":"d1a1bc588080bce05f17a310ca7fc64fddee452bd77e6fa9ce9045f5bc482e38","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"d1a1bc588080bce05f17a310ca7fc64fddee452bd77e6fa9ce9045f5bc482e38","first_computed_at":"2026-05-18T00:10:51.965514Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:10:51.965514Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"TV2aUb5ejCFGxC38fbMsCW/ab+ablVcx1DD0++syrEhveqm/BeYLMsTYRGrCjtmP7x5xUIyqnjZxx1nz6evhCg==","signature_status":"signed_v1","signed_at":"2026-05-18T00:10:51.966173Z","signed_message":"canonical_sha256_bytes"},"source_id":"1802.06440","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:1222688dfad6aeb0f2d58339d0dcf36f13ed6bc3e29b03c7ec35ac6eadc7920e","sha256:1ca3a196a9e47798a4c59be9eb989cd66941eec2519e6d4adc5e28d6583a58b0"],"state_sha256":"c161ac960395a77eedd4fdeeedd2684cda9448fc1d10c97038256d17090bd16e"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"YijNrZ6QY8S6buZwNU0x9gHyWxaYU6rpnVb6YgyjLghsjpwaSwU+THMC3jBtnXpN/LedPrR16pcsrY6WUMhLCw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-29T17:44:06.190442Z","bundle_sha256":"2478fdd70e225696ca03f900cb66892aa5ad72458565707acd5653926c65774d"}}