{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2014:FTWUTDYQW3CRHNSH7AENITXU2K","short_pith_number":"pith:FTWUTDYQ","schema_version":"1.0","canonical_sha256":"2ced498f10b6c513b647f808d44ef4d289cfb4605803afade62a8a1f536f7ec9","source":{"kind":"arxiv","id":"1411.3887","version":2},"attestation_state":"computed","paper":{"title":"Tight Bounds for Online Vector Scheduling","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Debmalya Panigrahi, Janardhan Kulkarni, Nathaniel Kell, Sungjin Im","submitted_at":"2014-11-14T12:51:42Z","abstract_excerpt":"Modern data centers face a key challenge of effectively serving user requests that arrive online. Such requests are inherently multi-dimensional and characterized by demand vectors over multiple resources such as processor cycles, storage space, and network bandwidth. Typically, different resources require different objectives to be optimized, and $L_r$ norms of loads are among the most popular objectives considered. To address these problems, we consider the online vector scheduling problem in this paper. Introduced by Chekuri and Khanna (SIAM J of Comp. 2006), vector scheduling is a generali"},"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":"1411.3887","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2014-11-14T12:51:42Z","cross_cats_sorted":[],"title_canon_sha256":"10698412b75730eb4bd95ad57e6f1930fb0e0c0382e9a58add245e26e3b9fcb7","abstract_canon_sha256":"bb33455c9e76047f71d206bba30ea33178b0d761ca6df05ff8c9752ca8cce105"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:35:11.760264Z","signature_b64":"/SVR5MbKyHP+HkZTRKq4nIIGR93rYKok7e63JS1hqCw27UGK3C65bZwiAZSYjzKsepBGfkwm4c6pOcsdD6rMCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"2ced498f10b6c513b647f808d44ef4d289cfb4605803afade62a8a1f536f7ec9","last_reissued_at":"2026-05-18T01:35:11.759727Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:35:11.759727Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Tight Bounds for Online Vector Scheduling","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Debmalya Panigrahi, Janardhan Kulkarni, Nathaniel Kell, Sungjin Im","submitted_at":"2014-11-14T12:51:42Z","abstract_excerpt":"Modern data centers face a key challenge of effectively serving user requests that arrive online. Such requests are inherently multi-dimensional and characterized by demand vectors over multiple resources such as processor cycles, storage space, and network bandwidth. Typically, different resources require different objectives to be optimized, and $L_r$ norms of loads are among the most popular objectives considered. To address these problems, we consider the online vector scheduling problem in this paper. Introduced by Chekuri and Khanna (SIAM J of Comp. 2006), vector scheduling is a generali"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1411.3887","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":""},"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":"1411.3887","created_at":"2026-05-18T01:35:11.759810+00:00"},{"alias_kind":"arxiv_version","alias_value":"1411.3887v2","created_at":"2026-05-18T01:35:11.759810+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1411.3887","created_at":"2026-05-18T01:35:11.759810+00:00"},{"alias_kind":"pith_short_12","alias_value":"FTWUTDYQW3CR","created_at":"2026-05-18T12:28:28.263976+00:00"},{"alias_kind":"pith_short_16","alias_value":"FTWUTDYQW3CRHNSH","created_at":"2026-05-18T12:28:28.263976+00:00"},{"alias_kind":"pith_short_8","alias_value":"FTWUTDYQ","created_at":"2026-05-18T12:28:28.263976+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/FTWUTDYQW3CRHNSH7AENITXU2K","json":"https://pith.science/pith/FTWUTDYQW3CRHNSH7AENITXU2K.json","graph_json":"https://pith.science/api/pith-number/FTWUTDYQW3CRHNSH7AENITXU2K/graph.json","events_json":"https://pith.science/api/pith-number/FTWUTDYQW3CRHNSH7AENITXU2K/events.json","paper":"https://pith.science/paper/FTWUTDYQ"},"agent_actions":{"view_html":"https://pith.science/pith/FTWUTDYQW3CRHNSH7AENITXU2K","download_json":"https://pith.science/pith/FTWUTDYQW3CRHNSH7AENITXU2K.json","view_paper":"https://pith.science/paper/FTWUTDYQ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1411.3887&json=true","fetch_graph":"https://pith.science/api/pith-number/FTWUTDYQW3CRHNSH7AENITXU2K/graph.json","fetch_events":"https://pith.science/api/pith-number/FTWUTDYQW3CRHNSH7AENITXU2K/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/FTWUTDYQW3CRHNSH7AENITXU2K/action/timestamp_anchor","attest_storage":"https://pith.science/pith/FTWUTDYQW3CRHNSH7AENITXU2K/action/storage_attestation","attest_author":"https://pith.science/pith/FTWUTDYQW3CRHNSH7AENITXU2K/action/author_attestation","sign_citation":"https://pith.science/pith/FTWUTDYQW3CRHNSH7AENITXU2K/action/citation_signature","submit_replication":"https://pith.science/pith/FTWUTDYQW3CRHNSH7AENITXU2K/action/replication_record"}},"created_at":"2026-05-18T01:35:11.759810+00:00","updated_at":"2026-05-18T01:35:11.759810+00:00"}