{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2020:BGU26M4XYUARNH6BDPTBNB2EVW","short_pith_number":"pith:BGU26M4X","schema_version":"1.0","canonical_sha256":"09a9af3397c501169fc11be6168744adbd10b5f7a639938d884544e919ed4423","source":{"kind":"arxiv","id":"2010.00412","version":2},"attestation_state":"computed","paper":{"title":"Competitive Algorithms for the Online Multiple Knapsack Problem with Application to Electric Vehicle Charging","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Adam Wierman, Ali Zeynali, Bo Sun, Danny H.K. Tsang, Mohammad Hajiesmaili, Tongxin Li","submitted_at":"2020-10-01T13:57:29Z","abstract_excerpt":"We introduce and study a general version of the fractional online knapsack problem with multiple knapsacks, heterogeneous constraints on which items can be assigned to which knapsack, and rate-limiting constraints on the assignment of items to knapsacks. This problem generalizes variations of the knapsack problem and of the one-way trading problem that have previously been treated separately, and additionally finds application to the real-time control of electric vehicle (EV) charging. We introduce a new algorithm that achieves a competitive ratio within an additive factor of one of the best a"},"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":"2010.00412","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2020-10-01T13:57:29Z","cross_cats_sorted":[],"title_canon_sha256":"b0d3127680c980154a115a80114bb0c0c14bd967e49390e62cc551e47b297708","abstract_canon_sha256":"a9fb4d0b6c7d4876d767e5fa45a9dd0c2c76e7804ee6bdc51b09c96ea0fc3eec"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T01:43:42.126421Z","signature_b64":"+8xfN6XPC838nElWo3rrFPoep6trQ5M+NoFmW6S1Uja6OU4Yq7sQmecvkEZVBIoFSsp6t+znva24p1PMNXe6AQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"09a9af3397c501169fc11be6168744adbd10b5f7a639938d884544e919ed4423","last_reissued_at":"2026-07-05T01:43:42.126069Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T01:43:42.126069Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Competitive Algorithms for the Online Multiple Knapsack Problem with Application to Electric Vehicle Charging","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Adam Wierman, Ali Zeynali, Bo Sun, Danny H.K. Tsang, Mohammad Hajiesmaili, Tongxin Li","submitted_at":"2020-10-01T13:57:29Z","abstract_excerpt":"We introduce and study a general version of the fractional online knapsack problem with multiple knapsacks, heterogeneous constraints on which items can be assigned to which knapsack, and rate-limiting constraints on the assignment of items to knapsacks. This problem generalizes variations of the knapsack problem and of the one-way trading problem that have previously been treated separately, and additionally finds application to the real-time control of electric vehicle (EV) charging. We introduce a new algorithm that achieves a competitive ratio within an additive factor of one of the best a"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2010.00412","kind":"arxiv","version":2},"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/2010.00412/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":"2010.00412","created_at":"2026-07-05T01:43:42.126125+00:00"},{"alias_kind":"arxiv_version","alias_value":"2010.00412v2","created_at":"2026-07-05T01:43:42.126125+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2010.00412","created_at":"2026-07-05T01:43:42.126125+00:00"},{"alias_kind":"pith_short_12","alias_value":"BGU26M4XYUAR","created_at":"2026-07-05T01:43:42.126125+00:00"},{"alias_kind":"pith_short_16","alias_value":"BGU26M4XYUARNH6B","created_at":"2026-07-05T01:43:42.126125+00:00"},{"alias_kind":"pith_short_8","alias_value":"BGU26M4X","created_at":"2026-07-05T01:43:42.126125+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/BGU26M4XYUARNH6BDPTBNB2EVW","json":"https://pith.science/pith/BGU26M4XYUARNH6BDPTBNB2EVW.json","graph_json":"https://pith.science/api/pith-number/BGU26M4XYUARNH6BDPTBNB2EVW/graph.json","events_json":"https://pith.science/api/pith-number/BGU26M4XYUARNH6BDPTBNB2EVW/events.json","paper":"https://pith.science/paper/BGU26M4X"},"agent_actions":{"view_html":"https://pith.science/pith/BGU26M4XYUARNH6BDPTBNB2EVW","download_json":"https://pith.science/pith/BGU26M4XYUARNH6BDPTBNB2EVW.json","view_paper":"https://pith.science/paper/BGU26M4X","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2010.00412&json=true","fetch_graph":"https://pith.science/api/pith-number/BGU26M4XYUARNH6BDPTBNB2EVW/graph.json","fetch_events":"https://pith.science/api/pith-number/BGU26M4XYUARNH6BDPTBNB2EVW/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/BGU26M4XYUARNH6BDPTBNB2EVW/action/timestamp_anchor","attest_storage":"https://pith.science/pith/BGU26M4XYUARNH6BDPTBNB2EVW/action/storage_attestation","attest_author":"https://pith.science/pith/BGU26M4XYUARNH6BDPTBNB2EVW/action/author_attestation","sign_citation":"https://pith.science/pith/BGU26M4XYUARNH6BDPTBNB2EVW/action/citation_signature","submit_replication":"https://pith.science/pith/BGU26M4XYUARNH6BDPTBNB2EVW/action/replication_record"}},"created_at":"2026-07-05T01:43:42.126125+00:00","updated_at":"2026-07-05T01:43:42.126125+00:00"}