{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2012:QFHRH562B7JLDLYYAYM2AP3QMU","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":"4c8fdbe2cd445b716cd8ddf7cc2900edb29ce97b28b2658cebfa9a1f175ae510","cross_cats_sorted":["cs.DS"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2012-11-25T05:20:29Z","title_canon_sha256":"a6ee165bade591dbc7f74f9955448ed739e1e4309ef7db6a217bcc9ecfb6fd2e"},"schema_version":"1.0","source":{"id":"1211.5729","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1211.5729","created_at":"2026-05-18T03:02:21Z"},{"alias_kind":"arxiv_version","alias_value":"1211.5729v2","created_at":"2026-05-18T03:02:21Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1211.5729","created_at":"2026-05-18T03:02:21Z"},{"alias_kind":"pith_short_12","alias_value":"QFHRH562B7JL","created_at":"2026-05-18T12:27:18Z"},{"alias_kind":"pith_short_16","alias_value":"QFHRH562B7JLDLYY","created_at":"2026-05-18T12:27:18Z"},{"alias_kind":"pith_short_8","alias_value":"QFHRH562","created_at":"2026-05-18T12:27:18Z"}],"graph_snapshots":[{"event_id":"sha256:b8391e7f766d4253c5fb46816cbee41b50de5a4e559d6192c1855abe4d31e85e","target":"graph","created_at":"2026-05-18T03:02:21Z","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":"We give a polynomial time reduction from vector scheduling problem (VS) to generalized load balancing problem (GLB). This reduction gives the first non-trivial online algorithm for VS where vectors come in an online fashion. The online algorithm is very simple in that each vector only needs to minimize the $L_{\\ln(md)}$ norm of the resulting load when it comes, where $m$ is the number of partitions and $d$ is the dimension of vectors. It has an approximation bound of $e\\log(md)$, which is in $O(\\ln(md))$, so it also improves the $O(\\ln^2d)$ bound of the existing polynomial time algorithm for V","authors_text":"Guihai Chen, Qun Li, Weizhen Mao, Xiaojun Zhu","cross_cats":["cs.DS"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2012-11-25T05:20:29Z","title":"Online Vector Scheduling and Generalized Load Balancing"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1211.5729","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:2e7d5d8ceea839568adc65ceea43b0d28ea0a70a6341fb50a91d39cbdfe215e1","target":"record","created_at":"2026-05-18T03:02:21Z","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":"4c8fdbe2cd445b716cd8ddf7cc2900edb29ce97b28b2658cebfa9a1f175ae510","cross_cats_sorted":["cs.DS"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2012-11-25T05:20:29Z","title_canon_sha256":"a6ee165bade591dbc7f74f9955448ed739e1e4309ef7db6a217bcc9ecfb6fd2e"},"schema_version":"1.0","source":{"id":"1211.5729","kind":"arxiv","version":2}},"canonical_sha256":"814f13f7da0fd2b1af180619a03f70650e4550ca2c5a5f5c048c03c30efeb75e","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"814f13f7da0fd2b1af180619a03f70650e4550ca2c5a5f5c048c03c30efeb75e","first_computed_at":"2026-05-18T03:02:21.247748Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:02:21.247748Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"XNXbrQqAzpAv2Zhc1VAwR6+SJJy6UIDmvRGzxifcCN9xY4ZRZd6h4ShSsNSAo5u2wy1699MzpB5jYiZpQWM+Bg==","signature_status":"signed_v1","signed_at":"2026-05-18T03:02:21.248410Z","signed_message":"canonical_sha256_bytes"},"source_id":"1211.5729","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:2e7d5d8ceea839568adc65ceea43b0d28ea0a70a6341fb50a91d39cbdfe215e1","sha256:b8391e7f766d4253c5fb46816cbee41b50de5a4e559d6192c1855abe4d31e85e"],"state_sha256":"354cede008125d183699421031449749267be106ec3df0dbb772991f22cb2d48"}