{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2019:A5N7FMC6YK6L2KR74UGFOPVBZC","short_pith_number":"pith:A5N7FMC6","schema_version":"1.0","canonical_sha256":"075bf2b05ec2bcbd2a3fe50c573ea1c89a020a3f562a3c3768aaf456da908bfa","source":{"kind":"arxiv","id":"1905.00044","version":1},"attestation_state":"computed","paper":{"title":"Simpler and Better Algorithms for Minimum-Norm Load Balancing","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Chaitanya Swamy, Deeparnab Chakrabarty","submitted_at":"2019-04-30T18:03:51Z","abstract_excerpt":"Recently, Chakrabarty and Swamy (STOC 2019) introduced the {\\em minimum-norm load-balancing} problem on unrelated machines, wherein we are given a set $J$ of jobs that need to be scheduled on a set of $m$ unrelated machines, and a monotone, symmetric norm; We seek an assignment $\\sg:J\\mapsto[m]$ that minimizes the norm of the resulting load vector $\\lvec_\\sg\\in\\R_+^m$, where $\\lvec_\\sg(i)$ is the load on machine $i$ under the assignment $\\sg$. Besides capturing all $\\ell_p$ norms, symmetric norms also capture other norms of interest including top-$\\ell$ norms, and ordered norms. Chakrabarty an"},"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":"1905.00044","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2019-04-30T18:03:51Z","cross_cats_sorted":[],"title_canon_sha256":"8fd6055ad855c8cf4f8e2d746b0b970ef41a6b228bbed12432db7e58ec6f538c","abstract_canon_sha256":"16ff02481abcbcd1fa143c406a591ee48a11b6fe9660f88a4dc144a92644484e"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:47:15.325739Z","signature_b64":"pzEJJahpiMUtnqAS5vIpDhCKoOzYcPmbTy+3pwvtOaC0+IE23DJNfmdPMLy8GuI+unzwd9XOeWsl2PlrL89dCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"075bf2b05ec2bcbd2a3fe50c573ea1c89a020a3f562a3c3768aaf456da908bfa","last_reissued_at":"2026-05-17T23:47:15.325338Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:47:15.325338Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Simpler and Better Algorithms for Minimum-Norm Load Balancing","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Chaitanya Swamy, Deeparnab Chakrabarty","submitted_at":"2019-04-30T18:03:51Z","abstract_excerpt":"Recently, Chakrabarty and Swamy (STOC 2019) introduced the {\\em minimum-norm load-balancing} problem on unrelated machines, wherein we are given a set $J$ of jobs that need to be scheduled on a set of $m$ unrelated machines, and a monotone, symmetric norm; We seek an assignment $\\sg:J\\mapsto[m]$ that minimizes the norm of the resulting load vector $\\lvec_\\sg\\in\\R_+^m$, where $\\lvec_\\sg(i)$ is the load on machine $i$ under the assignment $\\sg$. Besides capturing all $\\ell_p$ norms, symmetric norms also capture other norms of interest including top-$\\ell$ norms, and ordered norms. Chakrabarty an"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1905.00044","kind":"arxiv","version":1},"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":"1905.00044","created_at":"2026-05-17T23:47:15.325401+00:00"},{"alias_kind":"arxiv_version","alias_value":"1905.00044v1","created_at":"2026-05-17T23:47:15.325401+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1905.00044","created_at":"2026-05-17T23:47:15.325401+00:00"},{"alias_kind":"pith_short_12","alias_value":"A5N7FMC6YK6L","created_at":"2026-05-18T12:33:12.712433+00:00"},{"alias_kind":"pith_short_16","alias_value":"A5N7FMC6YK6L2KR7","created_at":"2026-05-18T12:33:12.712433+00:00"},{"alias_kind":"pith_short_8","alias_value":"A5N7FMC6","created_at":"2026-05-18T12:33:12.712433+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/A5N7FMC6YK6L2KR74UGFOPVBZC","json":"https://pith.science/pith/A5N7FMC6YK6L2KR74UGFOPVBZC.json","graph_json":"https://pith.science/api/pith-number/A5N7FMC6YK6L2KR74UGFOPVBZC/graph.json","events_json":"https://pith.science/api/pith-number/A5N7FMC6YK6L2KR74UGFOPVBZC/events.json","paper":"https://pith.science/paper/A5N7FMC6"},"agent_actions":{"view_html":"https://pith.science/pith/A5N7FMC6YK6L2KR74UGFOPVBZC","download_json":"https://pith.science/pith/A5N7FMC6YK6L2KR74UGFOPVBZC.json","view_paper":"https://pith.science/paper/A5N7FMC6","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1905.00044&json=true","fetch_graph":"https://pith.science/api/pith-number/A5N7FMC6YK6L2KR74UGFOPVBZC/graph.json","fetch_events":"https://pith.science/api/pith-number/A5N7FMC6YK6L2KR74UGFOPVBZC/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/A5N7FMC6YK6L2KR74UGFOPVBZC/action/timestamp_anchor","attest_storage":"https://pith.science/pith/A5N7FMC6YK6L2KR74UGFOPVBZC/action/storage_attestation","attest_author":"https://pith.science/pith/A5N7FMC6YK6L2KR74UGFOPVBZC/action/author_attestation","sign_citation":"https://pith.science/pith/A5N7FMC6YK6L2KR74UGFOPVBZC/action/citation_signature","submit_replication":"https://pith.science/pith/A5N7FMC6YK6L2KR74UGFOPVBZC/action/replication_record"}},"created_at":"2026-05-17T23:47:15.325401+00:00","updated_at":"2026-05-17T23:47:15.325401+00:00"}