{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2013:V4CH3E2N5IJ5M5CSCUVT5KXC3N","short_pith_number":"pith:V4CH3E2N","schema_version":"1.0","canonical_sha256":"af047d934dea13d67452152b3eaae2db770509adf7ab9d29e63188e9c2f37988","source":{"kind":"arxiv","id":"1311.4563","version":1},"attestation_state":"computed","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"},"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":"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"},"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"},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1311.4563","created_at":"2026-05-18T03:06:43.966209+00:00"},{"alias_kind":"arxiv_version","alias_value":"1311.4563v1","created_at":"2026-05-18T03:06:43.966209+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1311.4563","created_at":"2026-05-18T03:06:43.966209+00:00"},{"alias_kind":"pith_short_12","alias_value":"V4CH3E2N5IJ5","created_at":"2026-05-18T12:28:02.375192+00:00"},{"alias_kind":"pith_short_16","alias_value":"V4CH3E2N5IJ5M5CS","created_at":"2026-05-18T12:28:02.375192+00:00"},{"alias_kind":"pith_short_8","alias_value":"V4CH3E2N","created_at":"2026-05-18T12:28:02.375192+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/V4CH3E2N5IJ5M5CSCUVT5KXC3N","json":"https://pith.science/pith/V4CH3E2N5IJ5M5CSCUVT5KXC3N.json","graph_json":"https://pith.science/api/pith-number/V4CH3E2N5IJ5M5CSCUVT5KXC3N/graph.json","events_json":"https://pith.science/api/pith-number/V4CH3E2N5IJ5M5CSCUVT5KXC3N/events.json","paper":"https://pith.science/paper/V4CH3E2N"},"agent_actions":{"view_html":"https://pith.science/pith/V4CH3E2N5IJ5M5CSCUVT5KXC3N","download_json":"https://pith.science/pith/V4CH3E2N5IJ5M5CSCUVT5KXC3N.json","view_paper":"https://pith.science/paper/V4CH3E2N","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1311.4563&json=true","fetch_graph":"https://pith.science/api/pith-number/V4CH3E2N5IJ5M5CSCUVT5KXC3N/graph.json","fetch_events":"https://pith.science/api/pith-number/V4CH3E2N5IJ5M5CSCUVT5KXC3N/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/V4CH3E2N5IJ5M5CSCUVT5KXC3N/action/timestamp_anchor","attest_storage":"https://pith.science/pith/V4CH3E2N5IJ5M5CSCUVT5KXC3N/action/storage_attestation","attest_author":"https://pith.science/pith/V4CH3E2N5IJ5M5CSCUVT5KXC3N/action/author_attestation","sign_citation":"https://pith.science/pith/V4CH3E2N5IJ5M5CSCUVT5KXC3N/action/citation_signature","submit_replication":"https://pith.science/pith/V4CH3E2N5IJ5M5CSCUVT5KXC3N/action/replication_record"}},"created_at":"2026-05-18T03:06:43.966209+00:00","updated_at":"2026-05-18T03:06:43.966209+00:00"}