{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2014:FTWUTDYQW3CRHNSH7AENITXU2K","short_pith_number":"pith:FTWUTDYQ","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"},"canonical_sha256":"2ced498f10b6c513b647f808d44ef4d289cfb4605803afade62a8a1f536f7ec9","source":{"kind":"arxiv","id":"1411.3887","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1411.3887","created_at":"2026-05-18T01:35:11Z"},{"alias_kind":"arxiv_version","alias_value":"1411.3887v2","created_at":"2026-05-18T01:35:11Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1411.3887","created_at":"2026-05-18T01:35:11Z"},{"alias_kind":"pith_short_12","alias_value":"FTWUTDYQW3CR","created_at":"2026-05-18T12:28:28Z"},{"alias_kind":"pith_short_16","alias_value":"FTWUTDYQW3CRHNSH","created_at":"2026-05-18T12:28:28Z"},{"alias_kind":"pith_short_8","alias_value":"FTWUTDYQ","created_at":"2026-05-18T12:28:28Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2014:FTWUTDYQW3CRHNSH7AENITXU2K","target":"record","payload":{"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"},"canonical_sha256":"2ced498f10b6c513b647f808d44ef4d289cfb4605803afade62a8a1f536f7ec9","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"},"source_kind":"arxiv","source_id":"1411.3887","source_version":2,"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-05-18T01:35:11Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"CcjUvGPsZl8gtWf7wZ0Vtg9u9iZ4WgEn6BFQpR8yk2Fash/5ucTkdQwikop6Lz3diH2+41CNPaTr21Rx3bEdDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-05T03:41:14.391792Z"},"content_sha256":"1d36328459c81f167f6e09cddd3c5a52bb9a8832bdaf5db5904cfad0e32d93b7","schema_version":"1.0","event_id":"sha256:1d36328459c81f167f6e09cddd3c5a52bb9a8832bdaf5db5904cfad0e32d93b7"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2014:FTWUTDYQW3CRHNSH7AENITXU2K","target":"graph","payload":{"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"},"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-05-18T01:35:11Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"rwI4opuLbHTNsmvStGTz+Pd7APCRZamiWG/CuFTBNrd6kScE00Q94IuZfeW0m0B8ss6FZmdy7F/0FAB8vImpCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-05T03:41:14.392451Z"},"content_sha256":"b2ce9bf19e38652378b3f0eaba520dd4e6a4eb7c31f0480ce311ec1ab5b18e93","schema_version":"1.0","event_id":"sha256:b2ce9bf19e38652378b3f0eaba520dd4e6a4eb7c31f0480ce311ec1ab5b18e93"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/FTWUTDYQW3CRHNSH7AENITXU2K/bundle.json","state_url":"https://pith.science/pith/FTWUTDYQW3CRHNSH7AENITXU2K/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/FTWUTDYQW3CRHNSH7AENITXU2K/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-06-05T03:41:14Z","links":{"resolver":"https://pith.science/pith/FTWUTDYQW3CRHNSH7AENITXU2K","bundle":"https://pith.science/pith/FTWUTDYQW3CRHNSH7AENITXU2K/bundle.json","state":"https://pith.science/pith/FTWUTDYQW3CRHNSH7AENITXU2K/state.json","well_known_bundle":"https://pith.science/.well-known/pith/FTWUTDYQW3CRHNSH7AENITXU2K/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:FTWUTDYQW3CRHNSH7AENITXU2K","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":"bb33455c9e76047f71d206bba30ea33178b0d761ca6df05ff8c9752ca8cce105","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2014-11-14T12:51:42Z","title_canon_sha256":"10698412b75730eb4bd95ad57e6f1930fb0e0c0382e9a58add245e26e3b9fcb7"},"schema_version":"1.0","source":{"id":"1411.3887","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1411.3887","created_at":"2026-05-18T01:35:11Z"},{"alias_kind":"arxiv_version","alias_value":"1411.3887v2","created_at":"2026-05-18T01:35:11Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1411.3887","created_at":"2026-05-18T01:35:11Z"},{"alias_kind":"pith_short_12","alias_value":"FTWUTDYQW3CR","created_at":"2026-05-18T12:28:28Z"},{"alias_kind":"pith_short_16","alias_value":"FTWUTDYQW3CRHNSH","created_at":"2026-05-18T12:28:28Z"},{"alias_kind":"pith_short_8","alias_value":"FTWUTDYQ","created_at":"2026-05-18T12:28:28Z"}],"graph_snapshots":[{"event_id":"sha256:b2ce9bf19e38652378b3f0eaba520dd4e6a4eb7c31f0480ce311ec1ab5b18e93","target":"graph","created_at":"2026-05-18T01:35:11Z","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"},"paper":{"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","authors_text":"Debmalya Panigrahi, Janardhan Kulkarni, Nathaniel Kell, Sungjin Im","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2014-11-14T12:51:42Z","title":"Tight Bounds for Online Vector Scheduling"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1411.3887","kind":"arxiv","version":2},"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:1d36328459c81f167f6e09cddd3c5a52bb9a8832bdaf5db5904cfad0e32d93b7","target":"record","created_at":"2026-05-18T01:35:11Z","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":"bb33455c9e76047f71d206bba30ea33178b0d761ca6df05ff8c9752ca8cce105","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2014-11-14T12:51:42Z","title_canon_sha256":"10698412b75730eb4bd95ad57e6f1930fb0e0c0382e9a58add245e26e3b9fcb7"},"schema_version":"1.0","source":{"id":"1411.3887","kind":"arxiv","version":2}},"canonical_sha256":"2ced498f10b6c513b647f808d44ef4d289cfb4605803afade62a8a1f536f7ec9","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"2ced498f10b6c513b647f808d44ef4d289cfb4605803afade62a8a1f536f7ec9","first_computed_at":"2026-05-18T01:35:11.759727Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:35:11.759727Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"/SVR5MbKyHP+HkZTRKq4nIIGR93rYKok7e63JS1hqCw27UGK3C65bZwiAZSYjzKsepBGfkwm4c6pOcsdD6rMCQ==","signature_status":"signed_v1","signed_at":"2026-05-18T01:35:11.760264Z","signed_message":"canonical_sha256_bytes"},"source_id":"1411.3887","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:1d36328459c81f167f6e09cddd3c5a52bb9a8832bdaf5db5904cfad0e32d93b7","sha256:b2ce9bf19e38652378b3f0eaba520dd4e6a4eb7c31f0480ce311ec1ab5b18e93"],"state_sha256":"10278e7a39a97b219d5bc9dca74d4907bca09a40b0624f1357bdb6d2be69219d"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"7FK6r7gqeT6pxj4rl36TLnhGOLWbLf/hRpzvNtJicXPkbgXpgKKXqZVKNdXh2wmLJKZPKy0efZ2GCe7PZ0tSDg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-05T03:41:14.395569Z","bundle_sha256":"d8a000c94af512b088861406daee0838584b815cded3372253095cc449bea3c6"}}