{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2013:V4CH3E2N5IJ5M5CSCUVT5KXC3N","short_pith_number":"pith:V4CH3E2N","canonical_record":{"source":{"id":"1311.4563","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2013-11-18T21:28:02Z","cross_cats_sorted":[],"title_canon_sha256":"fbaeb42b36e958c3fcd84e13aa8ec8f21aa279215abc60c0a3bb0efcfcc3d816","abstract_canon_sha256":"14317366989ef9689351a42e233880191359d22001a8c45a18307030cdcbe24c"},"schema_version":"1.0"},"canonical_sha256":"af047d934dea13d67452152b3eaae2db770509adf7ab9d29e63188e9c2f37988","source":{"kind":"arxiv","id":"1311.4563","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1311.4563","created_at":"2026-05-18T03:06:43Z"},{"alias_kind":"arxiv_version","alias_value":"1311.4563v1","created_at":"2026-05-18T03:06:43Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1311.4563","created_at":"2026-05-18T03:06:43Z"},{"alias_kind":"pith_short_12","alias_value":"V4CH3E2N5IJ5","created_at":"2026-05-18T12:28:02Z"},{"alias_kind":"pith_short_16","alias_value":"V4CH3E2N5IJ5M5CS","created_at":"2026-05-18T12:28:02Z"},{"alias_kind":"pith_short_8","alias_value":"V4CH3E2N","created_at":"2026-05-18T12:28:02Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2013:V4CH3E2N5IJ5M5CSCUVT5KXC3N","target":"record","payload":{"canonical_record":{"source":{"id":"1311.4563","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2013-11-18T21:28:02Z","cross_cats_sorted":[],"title_canon_sha256":"fbaeb42b36e958c3fcd84e13aa8ec8f21aa279215abc60c0a3bb0efcfcc3d816","abstract_canon_sha256":"14317366989ef9689351a42e233880191359d22001a8c45a18307030cdcbe24c"},"schema_version":"1.0"},"canonical_sha256":"af047d934dea13d67452152b3eaae2db770509adf7ab9d29e63188e9c2f37988","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:06:43.966589Z","signature_b64":"SDj23GttFZkTneul6qdC/lkvHPI5d84OSzv05t461o0DL5exG07EJ4c7u4vEfXkWEfCRsJAxcJq9KcTuK8mGCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"af047d934dea13d67452152b3eaae2db770509adf7ab9d29e63188e9c2f37988","last_reissued_at":"2026-05-18T03:06:43.966142Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:06:43.966142Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1311.4563","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-18T03:06:43Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"FuTL8MouuzwWmtvQ3xCCQ/yGyhqqxBMhFnrVvoxYKoOqHsM7WQuYc/VVmuBrMOef4asfLMuWdnQbYsaiVZo6DQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-20T10:16:16.958535Z"},"content_sha256":"7e5e58f149242ef6227b4554686c4fd8e9428f79ad117f9178797e2438436a9d","schema_version":"1.0","event_id":"sha256:7e5e58f149242ef6227b4554686c4fd8e9428f79ad117f9178797e2438436a9d"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2013:V4CH3E2N5IJ5M5CSCUVT5KXC3N","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Approximation Algorithms for the Incremental Knapsack Problem via Disjunctive Programming","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Chun Ye, Daniel Bienstock, Jay Sethuraman","submitted_at":"2013-11-18T21:28:02Z","abstract_excerpt":"In the incremental knapsack problem ($\\IK$), we are given a knapsack whose capacity grows weakly as a function of time. There is a time horizon of $T$ periods and the capacity of the knapsack is $B_t$ in period $t$ for $t = 1, \\ldots, T$. We are also given a set $S$ of $N$ items to be placed in the knapsack. Item $i$ has a value of $v_i$ and a weight of $w_i$ that is independent of the time period. At any time period $t$, the sum of the weights of the items in the knapsack cannot exceed the knapsack capacity $B_t$. Moreover, once an item is placed in the knapsack, it cannot be removed from the"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1311.4563","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-18T03:06:43Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ZLYrtD2VlepVoTmeB7GTKOI2C/UkEoUSp2/89JdVDkaVv49UIy7h5vyMmx9iA/CdnsVc4W1281knatbTrsUHBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-20T10:16:16.958886Z"},"content_sha256":"c464bc05fe9a9a121228ed1459faa630975d7e27ba64ea50ede62fbfff6d7efe","schema_version":"1.0","event_id":"sha256:c464bc05fe9a9a121228ed1459faa630975d7e27ba64ea50ede62fbfff6d7efe"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/V4CH3E2N5IJ5M5CSCUVT5KXC3N/bundle.json","state_url":"https://pith.science/pith/V4CH3E2N5IJ5M5CSCUVT5KXC3N/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/V4CH3E2N5IJ5M5CSCUVT5KXC3N/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-20T10:16:16Z","links":{"resolver":"https://pith.science/pith/V4CH3E2N5IJ5M5CSCUVT5KXC3N","bundle":"https://pith.science/pith/V4CH3E2N5IJ5M5CSCUVT5KXC3N/bundle.json","state":"https://pith.science/pith/V4CH3E2N5IJ5M5CSCUVT5KXC3N/state.json","well_known_bundle":"https://pith.science/.well-known/pith/V4CH3E2N5IJ5M5CSCUVT5KXC3N/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2013:V4CH3E2N5IJ5M5CSCUVT5KXC3N","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":"14317366989ef9689351a42e233880191359d22001a8c45a18307030cdcbe24c","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2013-11-18T21:28:02Z","title_canon_sha256":"fbaeb42b36e958c3fcd84e13aa8ec8f21aa279215abc60c0a3bb0efcfcc3d816"},"schema_version":"1.0","source":{"id":"1311.4563","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1311.4563","created_at":"2026-05-18T03:06:43Z"},{"alias_kind":"arxiv_version","alias_value":"1311.4563v1","created_at":"2026-05-18T03:06:43Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1311.4563","created_at":"2026-05-18T03:06:43Z"},{"alias_kind":"pith_short_12","alias_value":"V4CH3E2N5IJ5","created_at":"2026-05-18T12:28:02Z"},{"alias_kind":"pith_short_16","alias_value":"V4CH3E2N5IJ5M5CS","created_at":"2026-05-18T12:28:02Z"},{"alias_kind":"pith_short_8","alias_value":"V4CH3E2N","created_at":"2026-05-18T12:28:02Z"}],"graph_snapshots":[{"event_id":"sha256:c464bc05fe9a9a121228ed1459faa630975d7e27ba64ea50ede62fbfff6d7efe","target":"graph","created_at":"2026-05-18T03:06:43Z","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":"In the incremental knapsack problem ($\\IK$), we are given a knapsack whose capacity grows weakly as a function of time. There is a time horizon of $T$ periods and the capacity of the knapsack is $B_t$ in period $t$ for $t = 1, \\ldots, T$. We are also given a set $S$ of $N$ items to be placed in the knapsack. Item $i$ has a value of $v_i$ and a weight of $w_i$ that is independent of the time period. At any time period $t$, the sum of the weights of the items in the knapsack cannot exceed the knapsack capacity $B_t$. Moreover, once an item is placed in the knapsack, it cannot be removed from the","authors_text":"Chun Ye, Daniel Bienstock, Jay Sethuraman","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2013-11-18T21:28:02Z","title":"Approximation Algorithms for the Incremental Knapsack Problem via Disjunctive Programming"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1311.4563","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:7e5e58f149242ef6227b4554686c4fd8e9428f79ad117f9178797e2438436a9d","target":"record","created_at":"2026-05-18T03:06:43Z","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":"14317366989ef9689351a42e233880191359d22001a8c45a18307030cdcbe24c","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2013-11-18T21:28:02Z","title_canon_sha256":"fbaeb42b36e958c3fcd84e13aa8ec8f21aa279215abc60c0a3bb0efcfcc3d816"},"schema_version":"1.0","source":{"id":"1311.4563","kind":"arxiv","version":1}},"canonical_sha256":"af047d934dea13d67452152b3eaae2db770509adf7ab9d29e63188e9c2f37988","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"af047d934dea13d67452152b3eaae2db770509adf7ab9d29e63188e9c2f37988","first_computed_at":"2026-05-18T03:06:43.966142Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:06:43.966142Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"SDj23GttFZkTneul6qdC/lkvHPI5d84OSzv05t461o0DL5exG07EJ4c7u4vEfXkWEfCRsJAxcJq9KcTuK8mGCA==","signature_status":"signed_v1","signed_at":"2026-05-18T03:06:43.966589Z","signed_message":"canonical_sha256_bytes"},"source_id":"1311.4563","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:7e5e58f149242ef6227b4554686c4fd8e9428f79ad117f9178797e2438436a9d","sha256:c464bc05fe9a9a121228ed1459faa630975d7e27ba64ea50ede62fbfff6d7efe"],"state_sha256":"87a3def5a902871628cd6dbf03774234fc2df8d38d1139130469ce47d4bd95f7"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"0BxbQqeZ0JQD678HTy7Xespx2RVsz8sxisnnxacHjXfxMU+mp6Kmh/K62ILtCrxRTsj5F0L7pw6o8PwDG59GBw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-20T10:16:16.960883Z","bundle_sha256":"f0b189b6ab857e2492b6caa347a0153563b87176b042f5721ae50c8e58f54f37"}}