{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2012:QFHRH562B7JLDLYYAYM2AP3QMU","short_pith_number":"pith:QFHRH562","schema_version":"1.0","canonical_sha256":"814f13f7da0fd2b1af180619a03f70650e4550ca2c5a5f5c048c03c30efeb75e","source":{"kind":"arxiv","id":"1211.5729","version":2},"attestation_state":"computed","paper":{"title":"Online Vector Scheduling and Generalized Load Balancing","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS"],"primary_cat":"cs.CC","authors_text":"Guihai Chen, Qun Li, Weizhen Mao, Xiaojun Zhu","submitted_at":"2012-11-25T05:20:29Z","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"},"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":"1211.5729","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2012-11-25T05:20:29Z","cross_cats_sorted":["cs.DS"],"title_canon_sha256":"a6ee165bade591dbc7f74f9955448ed739e1e4309ef7db6a217bcc9ecfb6fd2e","abstract_canon_sha256":"4c8fdbe2cd445b716cd8ddf7cc2900edb29ce97b28b2658cebfa9a1f175ae510"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:02:21.248410Z","signature_b64":"XNXbrQqAzpAv2Zhc1VAwR6+SJJy6UIDmvRGzxifcCN9xY4ZRZd6h4ShSsNSAo5u2wy1699MzpB5jYiZpQWM+Bg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"814f13f7da0fd2b1af180619a03f70650e4550ca2c5a5f5c048c03c30efeb75e","last_reissued_at":"2026-05-18T03:02:21.247748Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:02:21.247748Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Online Vector Scheduling and Generalized Load Balancing","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS"],"primary_cat":"cs.CC","authors_text":"Guihai Chen, Qun Li, Weizhen Mao, Xiaojun Zhu","submitted_at":"2012-11-25T05:20:29Z","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"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1211.5729","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":"1211.5729","created_at":"2026-05-18T03:02:21.247831+00:00"},{"alias_kind":"arxiv_version","alias_value":"1211.5729v2","created_at":"2026-05-18T03:02:21.247831+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1211.5729","created_at":"2026-05-18T03:02:21.247831+00:00"},{"alias_kind":"pith_short_12","alias_value":"QFHRH562B7JL","created_at":"2026-05-18T12:27:18.751474+00:00"},{"alias_kind":"pith_short_16","alias_value":"QFHRH562B7JLDLYY","created_at":"2026-05-18T12:27:18.751474+00:00"},{"alias_kind":"pith_short_8","alias_value":"QFHRH562","created_at":"2026-05-18T12:27:18.751474+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/QFHRH562B7JLDLYYAYM2AP3QMU","json":"https://pith.science/pith/QFHRH562B7JLDLYYAYM2AP3QMU.json","graph_json":"https://pith.science/api/pith-number/QFHRH562B7JLDLYYAYM2AP3QMU/graph.json","events_json":"https://pith.science/api/pith-number/QFHRH562B7JLDLYYAYM2AP3QMU/events.json","paper":"https://pith.science/paper/QFHRH562"},"agent_actions":{"view_html":"https://pith.science/pith/QFHRH562B7JLDLYYAYM2AP3QMU","download_json":"https://pith.science/pith/QFHRH562B7JLDLYYAYM2AP3QMU.json","view_paper":"https://pith.science/paper/QFHRH562","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1211.5729&json=true","fetch_graph":"https://pith.science/api/pith-number/QFHRH562B7JLDLYYAYM2AP3QMU/graph.json","fetch_events":"https://pith.science/api/pith-number/QFHRH562B7JLDLYYAYM2AP3QMU/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/QFHRH562B7JLDLYYAYM2AP3QMU/action/timestamp_anchor","attest_storage":"https://pith.science/pith/QFHRH562B7JLDLYYAYM2AP3QMU/action/storage_attestation","attest_author":"https://pith.science/pith/QFHRH562B7JLDLYYAYM2AP3QMU/action/author_attestation","sign_citation":"https://pith.science/pith/QFHRH562B7JLDLYYAYM2AP3QMU/action/citation_signature","submit_replication":"https://pith.science/pith/QFHRH562B7JLDLYYAYM2AP3QMU/action/replication_record"}},"created_at":"2026-05-18T03:02:21.247831+00:00","updated_at":"2026-05-18T03:02:21.247831+00:00"}