{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:DS5B2TB2UABV2U36CREBDE253D","short_pith_number":"pith:DS5B2TB2","canonical_record":{"source":{"id":"1801.04801","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2018-01-15T13:53:27Z","cross_cats_sorted":[],"title_canon_sha256":"81b622e5d33c495f9cf433138ae7da5bf4096bc8ead0ed7da12842fbea866089","abstract_canon_sha256":"0ec594fd4cee99e5f872bcb372689117e0aa9787232618edbd94fe660e01751c"},"schema_version":"1.0"},"canonical_sha256":"1cba1d4c3aa0035d537e144811935dd8d2f77e451843fb174519f5a7ae5cbcfd","source":{"kind":"arxiv","id":"1801.04801","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1801.04801","created_at":"2026-05-18T00:26:03Z"},{"alias_kind":"arxiv_version","alias_value":"1801.04801v1","created_at":"2026-05-18T00:26:03Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1801.04801","created_at":"2026-05-18T00:26:03Z"},{"alias_kind":"pith_short_12","alias_value":"DS5B2TB2UABV","created_at":"2026-05-18T12:32:19Z"},{"alias_kind":"pith_short_16","alias_value":"DS5B2TB2UABV2U36","created_at":"2026-05-18T12:32:19Z"},{"alias_kind":"pith_short_8","alias_value":"DS5B2TB2","created_at":"2026-05-18T12:32:19Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:DS5B2TB2UABV2U36CREBDE253D","target":"record","payload":{"canonical_record":{"source":{"id":"1801.04801","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2018-01-15T13:53:27Z","cross_cats_sorted":[],"title_canon_sha256":"81b622e5d33c495f9cf433138ae7da5bf4096bc8ead0ed7da12842fbea866089","abstract_canon_sha256":"0ec594fd4cee99e5f872bcb372689117e0aa9787232618edbd94fe660e01751c"},"schema_version":"1.0"},"canonical_sha256":"1cba1d4c3aa0035d537e144811935dd8d2f77e451843fb174519f5a7ae5cbcfd","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:26:03.217033Z","signature_b64":"mOQcx59OgRpbf+ifr/PmLh4S9H2Cr3tA2UNGnfnbnNQUB1bbRJRVcQGfnHzVc3P9rjxFGpDk+K5SinA8EVhjCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"1cba1d4c3aa0035d537e144811935dd8d2f77e451843fb174519f5a7ae5cbcfd","last_reissued_at":"2026-05-18T00:26:03.215571Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:26:03.215571Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1801.04801","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:26:03Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"51v+HQzriXjEiKHQAzy6rVe+tPVoMedD8TXm94YsQBZKPOoSy3AnRTxTpHZ4OU4z8T0DwSCfhuzwUZh3Obu0BQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-21T20:51:30.642447Z"},"content_sha256":"374e05411846e2cf4e11ee945eecac7c99f7b5b81b8c58781d0a47b8b6209fb3","schema_version":"1.0","event_id":"sha256:374e05411846e2cf4e11ee945eecac7c99f7b5b81b8c58781d0a47b8b6209fb3"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:DS5B2TB2UABV2U36CREBDE253D","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Approximating the Incremental Knapsack Problem","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Federico Della Croce, Rosario Scatamacchia, Ulrich Pferschy","submitted_at":"2018-01-15T13:53:27Z","abstract_excerpt":"We consider the 0-1 Incremental Knapsack Problem (IKP) where the capacity grows over time periods and if an item is placed in the knapsack in a certain period, it cannot be removed afterwards. The contribution of a packed item in each time period depends on its profit as well as on a time factor which reflects the importance of the period in the objective function. The problem calls for maximizing the weighted sum of the profits over the whole time horizon. In this work, we provide approximation results for IKP and its restricted variants. In some results, we rely on Linear Programming (LP) to"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1801.04801","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:26:03Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"uCWdH4jqv6L5D8wqA/nffCDFNxObRvyjf3oikIns1kX+YNKBw7qmUSNGQr34liow2S4BesiotbGijnp5RmbhCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-21T20:51:30.642791Z"},"content_sha256":"de5527faba125d86991c1c0f58a3c43a38dad72b4fba373b2abc9e98e21124cc","schema_version":"1.0","event_id":"sha256:de5527faba125d86991c1c0f58a3c43a38dad72b4fba373b2abc9e98e21124cc"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/DS5B2TB2UABV2U36CREBDE253D/bundle.json","state_url":"https://pith.science/pith/DS5B2TB2UABV2U36CREBDE253D/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/DS5B2TB2UABV2U36CREBDE253D/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-21T20:51:30Z","links":{"resolver":"https://pith.science/pith/DS5B2TB2UABV2U36CREBDE253D","bundle":"https://pith.science/pith/DS5B2TB2UABV2U36CREBDE253D/bundle.json","state":"https://pith.science/pith/DS5B2TB2UABV2U36CREBDE253D/state.json","well_known_bundle":"https://pith.science/.well-known/pith/DS5B2TB2UABV2U36CREBDE253D/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:DS5B2TB2UABV2U36CREBDE253D","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":"0ec594fd4cee99e5f872bcb372689117e0aa9787232618edbd94fe660e01751c","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2018-01-15T13:53:27Z","title_canon_sha256":"81b622e5d33c495f9cf433138ae7da5bf4096bc8ead0ed7da12842fbea866089"},"schema_version":"1.0","source":{"id":"1801.04801","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1801.04801","created_at":"2026-05-18T00:26:03Z"},{"alias_kind":"arxiv_version","alias_value":"1801.04801v1","created_at":"2026-05-18T00:26:03Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1801.04801","created_at":"2026-05-18T00:26:03Z"},{"alias_kind":"pith_short_12","alias_value":"DS5B2TB2UABV","created_at":"2026-05-18T12:32:19Z"},{"alias_kind":"pith_short_16","alias_value":"DS5B2TB2UABV2U36","created_at":"2026-05-18T12:32:19Z"},{"alias_kind":"pith_short_8","alias_value":"DS5B2TB2","created_at":"2026-05-18T12:32:19Z"}],"graph_snapshots":[{"event_id":"sha256:de5527faba125d86991c1c0f58a3c43a38dad72b4fba373b2abc9e98e21124cc","target":"graph","created_at":"2026-05-18T00:26:03Z","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":"We consider the 0-1 Incremental Knapsack Problem (IKP) where the capacity grows over time periods and if an item is placed in the knapsack in a certain period, it cannot be removed afterwards. The contribution of a packed item in each time period depends on its profit as well as on a time factor which reflects the importance of the period in the objective function. The problem calls for maximizing the weighted sum of the profits over the whole time horizon. In this work, we provide approximation results for IKP and its restricted variants. In some results, we rely on Linear Programming (LP) to","authors_text":"Federico Della Croce, Rosario Scatamacchia, Ulrich Pferschy","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2018-01-15T13:53:27Z","title":"Approximating the Incremental Knapsack Problem"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1801.04801","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:374e05411846e2cf4e11ee945eecac7c99f7b5b81b8c58781d0a47b8b6209fb3","target":"record","created_at":"2026-05-18T00:26:03Z","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":"0ec594fd4cee99e5f872bcb372689117e0aa9787232618edbd94fe660e01751c","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2018-01-15T13:53:27Z","title_canon_sha256":"81b622e5d33c495f9cf433138ae7da5bf4096bc8ead0ed7da12842fbea866089"},"schema_version":"1.0","source":{"id":"1801.04801","kind":"arxiv","version":1}},"canonical_sha256":"1cba1d4c3aa0035d537e144811935dd8d2f77e451843fb174519f5a7ae5cbcfd","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"1cba1d4c3aa0035d537e144811935dd8d2f77e451843fb174519f5a7ae5cbcfd","first_computed_at":"2026-05-18T00:26:03.215571Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:26:03.215571Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"mOQcx59OgRpbf+ifr/PmLh4S9H2Cr3tA2UNGnfnbnNQUB1bbRJRVcQGfnHzVc3P9rjxFGpDk+K5SinA8EVhjCQ==","signature_status":"signed_v1","signed_at":"2026-05-18T00:26:03.217033Z","signed_message":"canonical_sha256_bytes"},"source_id":"1801.04801","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:374e05411846e2cf4e11ee945eecac7c99f7b5b81b8c58781d0a47b8b6209fb3","sha256:de5527faba125d86991c1c0f58a3c43a38dad72b4fba373b2abc9e98e21124cc"],"state_sha256":"9a81110efd4de8247eb7881f6f5dc7f3fb13d829d37a91ca3c08c61864be8278"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"sKCsNtWXaaivPF3jQObXVTxEW5NHKTsZITxseJdMARv9MeZK2RT4QHD2Wa5DfI5YRh7KIYGmZbn0Kk2zxXRoCg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-21T20:51:30.644818Z","bundle_sha256":"e464565a0cd56489b7320ddca3370fa1d3b69360d8bf711733d72fd32fa26b0a"}}