{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2022:VQ65G5X2FO55MFCBD664ADQ3HT","short_pith_number":"pith:VQ65G5X2","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"},"canonical_sha256":"ac3dd376fa2bbbd614411fbdc00e1b3cd9c0466f978b27d6a530143c9d3aa9bc","source":{"kind":"arxiv","id":"2209.11934","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2209.11934","created_at":"2026-07-05T05:51:27Z"},{"alias_kind":"arxiv_version","alias_value":"2209.11934v3","created_at":"2026-07-05T05:51:27Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2209.11934","created_at":"2026-07-05T05:51:27Z"},{"alias_kind":"pith_short_12","alias_value":"VQ65G5X2FO55","created_at":"2026-07-05T05:51:27Z"},{"alias_kind":"pith_short_16","alias_value":"VQ65G5X2FO55MFCB","created_at":"2026-07-05T05:51:27Z"},{"alias_kind":"pith_short_8","alias_value":"VQ65G5X2","created_at":"2026-07-05T05:51:27Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2022:VQ65G5X2FO55MFCBD664ADQ3HT","target":"record","payload":{"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"},"canonical_sha256":"ac3dd376fa2bbbd614411fbdc00e1b3cd9c0466f978b27d6a530143c9d3aa9bc","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"},"source_kind":"arxiv","source_id":"2209.11934","source_version":3,"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-07-05T05:51:27Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"IbCVUpBzhbrN8vUMONOcILELxqJU9TYGSMGDKz7U9N1R+3TFNRxP446hoNvpfzEgzLWk7VnY+1pJpRAaZ6PyAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-22T10:14:38.573423Z"},"content_sha256":"d669cada4273e94ffd3de30950556458dbdaa1e279bbd5ecb15a8e2509729354","schema_version":"1.0","event_id":"sha256:d669cada4273e94ffd3de30950556458dbdaa1e279bbd5ecb15a8e2509729354"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2022:VQ65G5X2FO55MFCBD664ADQ3HT","target":"graph","payload":{"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"},"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-07-05T05:51:27Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"6822lynNYRxjDxXVrL2eEIGKc2aSWRhvGqj0fkXRyykfGTgVQC8vxHRCGCJ5l2WVhp5RdaLPefgyrlcUvymdCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-22T10:14:38.573763Z"},"content_sha256":"552ffa7c4bff0f7a407e15e23cfb6e7dc74e2e52732e691f241908f25ff56610","schema_version":"1.0","event_id":"sha256:552ffa7c4bff0f7a407e15e23cfb6e7dc74e2e52732e691f241908f25ff56610"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/VQ65G5X2FO55MFCBD664ADQ3HT/bundle.json","state_url":"https://pith.science/pith/VQ65G5X2FO55MFCBD664ADQ3HT/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/VQ65G5X2FO55MFCBD664ADQ3HT/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-08-22T10:14:38Z","links":{"resolver":"https://pith.science/pith/VQ65G5X2FO55MFCBD664ADQ3HT","bundle":"https://pith.science/pith/VQ65G5X2FO55MFCBD664ADQ3HT/bundle.json","state":"https://pith.science/pith/VQ65G5X2FO55MFCBD664ADQ3HT/state.json","well_known_bundle":"https://pith.science/.well-known/pith/VQ65G5X2FO55MFCBD664ADQ3HT/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2022:VQ65G5X2FO55MFCBD664ADQ3HT","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":"7d0a94c91ce473182a653066d0b003e969215194d22973105a8bab3a14609542","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2022-09-24T05:55:54Z","title_canon_sha256":"7e59c7f6178fa7392d9b4694139b7c7abd21c22559603b6c575651b6846dea02"},"schema_version":"1.0","source":{"id":"2209.11934","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2209.11934","created_at":"2026-07-05T05:51:27Z"},{"alias_kind":"arxiv_version","alias_value":"2209.11934v3","created_at":"2026-07-05T05:51:27Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2209.11934","created_at":"2026-07-05T05:51:27Z"},{"alias_kind":"pith_short_12","alias_value":"VQ65G5X2FO55","created_at":"2026-07-05T05:51:27Z"},{"alias_kind":"pith_short_16","alias_value":"VQ65G5X2FO55MFCB","created_at":"2026-07-05T05:51:27Z"},{"alias_kind":"pith_short_8","alias_value":"VQ65G5X2","created_at":"2026-07-05T05:51:27Z"}],"graph_snapshots":[{"event_id":"sha256:552ffa7c4bff0f7a407e15e23cfb6e7dc74e2e52732e691f241908f25ff56610","target":"graph","created_at":"2026-07-05T05:51:27Z","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"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2209.11934/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"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","authors_text":"Adam Wierman, Bo Sun, Danny H.K. Tsang, Don Towsley, John C.S. Lui, Lin Yang, Mohammad Hajiesmaili","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2022-09-24T05:55:54Z","title":"The Online Knapsack Problem with Departures"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2209.11934","kind":"arxiv","version":3},"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:d669cada4273e94ffd3de30950556458dbdaa1e279bbd5ecb15a8e2509729354","target":"record","created_at":"2026-07-05T05:51:27Z","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":"7d0a94c91ce473182a653066d0b003e969215194d22973105a8bab3a14609542","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2022-09-24T05:55:54Z","title_canon_sha256":"7e59c7f6178fa7392d9b4694139b7c7abd21c22559603b6c575651b6846dea02"},"schema_version":"1.0","source":{"id":"2209.11934","kind":"arxiv","version":3}},"canonical_sha256":"ac3dd376fa2bbbd614411fbdc00e1b3cd9c0466f978b27d6a530143c9d3aa9bc","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"ac3dd376fa2bbbd614411fbdc00e1b3cd9c0466f978b27d6a530143c9d3aa9bc","first_computed_at":"2026-07-05T05:51:27.047514Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T05:51:27.047514Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"FnqA14IbDJZmDABuG2JmHz0hdvS/O2mlLvSi0wAPoEPuRMSjbsHbEuUxQHPcAl6TstA0UhBme5ZQ8pSn2phpBA==","signature_status":"signed_v1","signed_at":"2026-07-05T05:51:27.047913Z","signed_message":"canonical_sha256_bytes"},"source_id":"2209.11934","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:d669cada4273e94ffd3de30950556458dbdaa1e279bbd5ecb15a8e2509729354","sha256:552ffa7c4bff0f7a407e15e23cfb6e7dc74e2e52732e691f241908f25ff56610"],"state_sha256":"ed7b00663f9abc132e49c006018346e7ec52fb97de2d1e5e3fe5a7840d6b07f2"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"rLu70ymEuclrsF2cHkLwsF7eo0qwJHXtHHkGhQGN/gbjPsSjkb2zSDZlrE0UCmDQMJjhyNCpeV5GtUc/X9B7BA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-22T10:14:38.576980Z","bundle_sha256":"a2d9b2fc3edfb3a3e452321ff4ebaf56953a3496d5d3acdab94262680b9e63ae"}}