{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2019:A5N7FMC6YK6L2KR74UGFOPVBZC","short_pith_number":"pith:A5N7FMC6","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"},"canonical_sha256":"075bf2b05ec2bcbd2a3fe50c573ea1c89a020a3f562a3c3768aaf456da908bfa","source":{"kind":"arxiv","id":"1905.00044","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1905.00044","created_at":"2026-05-17T23:47:15Z"},{"alias_kind":"arxiv_version","alias_value":"1905.00044v1","created_at":"2026-05-17T23:47:15Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1905.00044","created_at":"2026-05-17T23:47:15Z"},{"alias_kind":"pith_short_12","alias_value":"A5N7FMC6YK6L","created_at":"2026-05-18T12:33:12Z"},{"alias_kind":"pith_short_16","alias_value":"A5N7FMC6YK6L2KR7","created_at":"2026-05-18T12:33:12Z"},{"alias_kind":"pith_short_8","alias_value":"A5N7FMC6","created_at":"2026-05-18T12:33:12Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2019:A5N7FMC6YK6L2KR74UGFOPVBZC","target":"record","payload":{"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"},"canonical_sha256":"075bf2b05ec2bcbd2a3fe50c573ea1c89a020a3f562a3c3768aaf456da908bfa","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"},"source_kind":"arxiv","source_id":"1905.00044","source_version":1,"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-17T23:47:15Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"A1A76HsZezw+9onv0nKgYrvWGaDHwCQk5GPktEtgCKANLtsm8oCcwLItbtsfK3ihFqipqhQM5mlV2RimUxXsDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-02T20:40:32.320983Z"},"content_sha256":"4ba915322c1b608a78ff59c58508acb24aab333058d64d67644a686b3a802b0d","schema_version":"1.0","event_id":"sha256:4ba915322c1b608a78ff59c58508acb24aab333058d64d67644a686b3a802b0d"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2019:A5N7FMC6YK6L2KR74UGFOPVBZC","target":"graph","payload":{"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"},"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-17T23:47:15Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"iDR7IcOkcmKUS6hCo6Cy0GiIMZ4y5LAUrQ/0nmN4On9mAV0wmst4NFcTQ445n670WKaRJ2uzA9shYpuShCyeBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-02T20:40:32.321338Z"},"content_sha256":"2b639a05653620bdb821b393e9d09144c71866f4ef6fd1ee4a58add0688a2bc0","schema_version":"1.0","event_id":"sha256:2b639a05653620bdb821b393e9d09144c71866f4ef6fd1ee4a58add0688a2bc0"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/A5N7FMC6YK6L2KR74UGFOPVBZC/bundle.json","state_url":"https://pith.science/pith/A5N7FMC6YK6L2KR74UGFOPVBZC/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/A5N7FMC6YK6L2KR74UGFOPVBZC/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-02T20:40:32Z","links":{"resolver":"https://pith.science/pith/A5N7FMC6YK6L2KR74UGFOPVBZC","bundle":"https://pith.science/pith/A5N7FMC6YK6L2KR74UGFOPVBZC/bundle.json","state":"https://pith.science/pith/A5N7FMC6YK6L2KR74UGFOPVBZC/state.json","well_known_bundle":"https://pith.science/.well-known/pith/A5N7FMC6YK6L2KR74UGFOPVBZC/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2019:A5N7FMC6YK6L2KR74UGFOPVBZC","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":"16ff02481abcbcd1fa143c406a591ee48a11b6fe9660f88a4dc144a92644484e","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2019-04-30T18:03:51Z","title_canon_sha256":"8fd6055ad855c8cf4f8e2d746b0b970ef41a6b228bbed12432db7e58ec6f538c"},"schema_version":"1.0","source":{"id":"1905.00044","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1905.00044","created_at":"2026-05-17T23:47:15Z"},{"alias_kind":"arxiv_version","alias_value":"1905.00044v1","created_at":"2026-05-17T23:47:15Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1905.00044","created_at":"2026-05-17T23:47:15Z"},{"alias_kind":"pith_short_12","alias_value":"A5N7FMC6YK6L","created_at":"2026-05-18T12:33:12Z"},{"alias_kind":"pith_short_16","alias_value":"A5N7FMC6YK6L2KR7","created_at":"2026-05-18T12:33:12Z"},{"alias_kind":"pith_short_8","alias_value":"A5N7FMC6","created_at":"2026-05-18T12:33:12Z"}],"graph_snapshots":[{"event_id":"sha256:2b639a05653620bdb821b393e9d09144c71866f4ef6fd1ee4a58add0688a2bc0","target":"graph","created_at":"2026-05-17T23:47:15Z","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":"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","authors_text":"Chaitanya Swamy, Deeparnab Chakrabarty","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2019-04-30T18:03:51Z","title":"Simpler and Better Algorithms for Minimum-Norm Load Balancing"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1905.00044","kind":"arxiv","version":1},"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:4ba915322c1b608a78ff59c58508acb24aab333058d64d67644a686b3a802b0d","target":"record","created_at":"2026-05-17T23:47:15Z","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":"16ff02481abcbcd1fa143c406a591ee48a11b6fe9660f88a4dc144a92644484e","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2019-04-30T18:03:51Z","title_canon_sha256":"8fd6055ad855c8cf4f8e2d746b0b970ef41a6b228bbed12432db7e58ec6f538c"},"schema_version":"1.0","source":{"id":"1905.00044","kind":"arxiv","version":1}},"canonical_sha256":"075bf2b05ec2bcbd2a3fe50c573ea1c89a020a3f562a3c3768aaf456da908bfa","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"075bf2b05ec2bcbd2a3fe50c573ea1c89a020a3f562a3c3768aaf456da908bfa","first_computed_at":"2026-05-17T23:47:15.325338Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:47:15.325338Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"pzEJJahpiMUtnqAS5vIpDhCKoOzYcPmbTy+3pwvtOaC0+IE23DJNfmdPMLy8GuI+unzwd9XOeWsl2PlrL89dCA==","signature_status":"signed_v1","signed_at":"2026-05-17T23:47:15.325739Z","signed_message":"canonical_sha256_bytes"},"source_id":"1905.00044","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:4ba915322c1b608a78ff59c58508acb24aab333058d64d67644a686b3a802b0d","sha256:2b639a05653620bdb821b393e9d09144c71866f4ef6fd1ee4a58add0688a2bc0"],"state_sha256":"ee2efe8b628fc5eda3a9ca14523cd0b9611b4c6405ecdc75dbd8633d12df6580"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"kRWeRH7xg+s8rFtUAzilaEaLe3uOkJqrK7+e4oHhwNDNrqqN0TC5VXOvWpj1uNSh71Q/Idx8HgED1P4qHVAXAg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-02T20:40:32.323440Z","bundle_sha256":"bfa70d3078cc1e72b4c176076b552a8f12ea26a1ed923578a3152abd8fd2a203"}}