{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2022:VQ65G5X2FO55MFCBD664ADQ3HT","short_pith_number":"pith:VQ65G5X2","schema_version":"1.0","canonical_sha256":"ac3dd376fa2bbbd614411fbdc00e1b3cd9c0466f978b27d6a530143c9d3aa9bc","source":{"kind":"arxiv","id":"2209.11934","version":3},"attestation_state":"computed","paper":{"title":"The Online Knapsack Problem with Departures","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Adam Wierman, Bo Sun, Danny H.K. Tsang, Don Towsley, John C.S. Lui, Lin Yang, Mohammad Hajiesmaili","submitted_at":"2022-09-24T05:55:54Z","abstract_excerpt":"The online knapsack problem is a classic online resource allocation problem in networking and operations research. Its basic version studies how to pack online arriving items of different sizes and values into a capacity-limited knapsack. In this paper, we study a general version that includes item departures, while also considering multiple knapsacks and multi-dimensional item sizes. We design a threshold-based online algorithm and prove that the algorithm can achieve order-optimal competitive ratios. Beyond worst-case performance guarantees, we also aim to achieve near-optimal average perfor"},"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":"2209.11934","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2022-09-24T05:55:54Z","cross_cats_sorted":[],"title_canon_sha256":"7e59c7f6178fa7392d9b4694139b7c7abd21c22559603b6c575651b6846dea02","abstract_canon_sha256":"7d0a94c91ce473182a653066d0b003e969215194d22973105a8bab3a14609542"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T05:51:27.047913Z","signature_b64":"FnqA14IbDJZmDABuG2JmHz0hdvS/O2mlLvSi0wAPoEPuRMSjbsHbEuUxQHPcAl6TstA0UhBme5ZQ8pSn2phpBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"ac3dd376fa2bbbd614411fbdc00e1b3cd9c0466f978b27d6a530143c9d3aa9bc","last_reissued_at":"2026-07-05T05:51:27.047514Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T05:51:27.047514Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"The Online Knapsack Problem with Departures","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Adam Wierman, Bo Sun, Danny H.K. Tsang, Don Towsley, John C.S. Lui, Lin Yang, Mohammad Hajiesmaili","submitted_at":"2022-09-24T05:55:54Z","abstract_excerpt":"The online knapsack problem is a classic online resource allocation problem in networking and operations research. Its basic version studies how to pack online arriving items of different sizes and values into a capacity-limited knapsack. In this paper, we study a general version that includes item departures, while also considering multiple knapsacks and multi-dimensional item sizes. We design a threshold-based online algorithm and prove that the algorithm can achieve order-optimal competitive ratios. Beyond worst-case performance guarantees, we also aim to achieve near-optimal average perfor"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2209.11934","kind":"arxiv","version":3},"verdict":{"id":null,"model_set":{},"created_at":null,"strongest_claim":"","one_line_summary":"","pipeline_version":null,"weakest_assumption":"","pith_extraction_headline":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2209.11934/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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":"2209.11934","created_at":"2026-07-05T05:51:27.047580+00:00"},{"alias_kind":"arxiv_version","alias_value":"2209.11934v3","created_at":"2026-07-05T05:51:27.047580+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2209.11934","created_at":"2026-07-05T05:51:27.047580+00:00"},{"alias_kind":"pith_short_12","alias_value":"VQ65G5X2FO55","created_at":"2026-07-05T05:51:27.047580+00:00"},{"alias_kind":"pith_short_16","alias_value":"VQ65G5X2FO55MFCB","created_at":"2026-07-05T05:51:27.047580+00:00"},{"alias_kind":"pith_short_8","alias_value":"VQ65G5X2","created_at":"2026-07-05T05:51:27.047580+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/VQ65G5X2FO55MFCBD664ADQ3HT","json":"https://pith.science/pith/VQ65G5X2FO55MFCBD664ADQ3HT.json","graph_json":"https://pith.science/api/pith-number/VQ65G5X2FO55MFCBD664ADQ3HT/graph.json","events_json":"https://pith.science/api/pith-number/VQ65G5X2FO55MFCBD664ADQ3HT/events.json","paper":"https://pith.science/paper/VQ65G5X2"},"agent_actions":{"view_html":"https://pith.science/pith/VQ65G5X2FO55MFCBD664ADQ3HT","download_json":"https://pith.science/pith/VQ65G5X2FO55MFCBD664ADQ3HT.json","view_paper":"https://pith.science/paper/VQ65G5X2","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2209.11934&json=true","fetch_graph":"https://pith.science/api/pith-number/VQ65G5X2FO55MFCBD664ADQ3HT/graph.json","fetch_events":"https://pith.science/api/pith-number/VQ65G5X2FO55MFCBD664ADQ3HT/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/VQ65G5X2FO55MFCBD664ADQ3HT/action/timestamp_anchor","attest_storage":"https://pith.science/pith/VQ65G5X2FO55MFCBD664ADQ3HT/action/storage_attestation","attest_author":"https://pith.science/pith/VQ65G5X2FO55MFCBD664ADQ3HT/action/author_attestation","sign_citation":"https://pith.science/pith/VQ65G5X2FO55MFCBD664ADQ3HT/action/citation_signature","submit_replication":"https://pith.science/pith/VQ65G5X2FO55MFCBD664ADQ3HT/action/replication_record"}},"created_at":"2026-07-05T05:51:27.047580+00:00","updated_at":"2026-07-05T05:51:27.047580+00:00"}