{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2021:VPNYLEHYPUAPEFPNZPGXYWGSG4","short_pith_number":"pith:VPNYLEHY","canonical_record":{"source":{"id":"2107.06261","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.CC","submitted_at":"2021-07-13T17:41:37Z","cross_cats_sorted":[],"title_canon_sha256":"a27442093fca00e43c17e05e69117be05dbfb0b22f22a11cb2952c39e5f4eba3","abstract_canon_sha256":"2ce5ee269ba00ad0b2ba3d87b6b67f39aa48f0d2af5773d24964985e2322e925"},"schema_version":"1.0"},"canonical_sha256":"abdb8590f87d00f215edcbcd7c58d23737f21463f44ee99d5d076b8d828e0def","source":{"kind":"arxiv","id":"2107.06261","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2107.06261","created_at":"2026-07-05T02:57:32Z"},{"alias_kind":"arxiv_version","alias_value":"2107.06261v1","created_at":"2026-07-05T02:57:32Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2107.06261","created_at":"2026-07-05T02:57:32Z"},{"alias_kind":"pith_short_12","alias_value":"VPNYLEHYPUAP","created_at":"2026-07-05T02:57:32Z"},{"alias_kind":"pith_short_16","alias_value":"VPNYLEHYPUAPEFPN","created_at":"2026-07-05T02:57:32Z"},{"alias_kind":"pith_short_8","alias_value":"VPNYLEHY","created_at":"2026-07-05T02:57:32Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2021:VPNYLEHYPUAPEFPNZPGXYWGSG4","target":"record","payload":{"canonical_record":{"source":{"id":"2107.06261","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.CC","submitted_at":"2021-07-13T17:41:37Z","cross_cats_sorted":[],"title_canon_sha256":"a27442093fca00e43c17e05e69117be05dbfb0b22f22a11cb2952c39e5f4eba3","abstract_canon_sha256":"2ce5ee269ba00ad0b2ba3d87b6b67f39aa48f0d2af5773d24964985e2322e925"},"schema_version":"1.0"},"canonical_sha256":"abdb8590f87d00f215edcbcd7c58d23737f21463f44ee99d5d076b8d828e0def","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T02:57:32.336477Z","signature_b64":"2OcLyApsqWhDSUuB63ygmWlCQuT6dSktvteEoe+jE0Kqb+yfLb10I9SDR/cCstLVXsmVtDfvIi/LIZqPfQIkAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"abdb8590f87d00f215edcbcd7c58d23737f21463f44ee99d5d076b8d828e0def","last_reissued_at":"2026-07-05T02:57:32.335925Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T02:57:32.335925Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2107.06261","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-07-05T02:57:32Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"zEhcihu4J1Pfa4dB29MimbuLBAk7DG25vA4Ih1WGXV1Nfdht2n41V+h4wvF5vCANXmCRirKhosvEdOVi3IPWAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-07T09:08:31.208065Z"},"content_sha256":"7191f4fe22b5a41d27ccc922cc98a1c7ecb5aee8930597644a2205f6f3a8812e","schema_version":"1.0","event_id":"sha256:7191f4fe22b5a41d27ccc922cc98a1c7ecb5aee8930597644a2205f6f3a8812e"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2021:VPNYLEHYPUAPEFPNZPGXYWGSG4","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Tight running times for minimum $\\ell_q$-norm load balancing: beyond exponential dependencies on $1/\\epsilon$","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.CC","authors_text":"Jos\\'e Verschae, Liangde Tao, Lin Chen","submitted_at":"2021-07-13T17:41:37Z","abstract_excerpt":"We consider a classical scheduling problem on $m$ identical machines. For an arbitrary constant $q>1$, the aim is to assign jobs to machines such that $\\sum_{i=1}^m C_i^q$ is minimized, where $C_i$ is the total processing time of jobs assigned to machine $i$. It is well known that this problem is strongly NP-hard.\n  Under mild assumptions, the running time of an $(1+\\epsilon)$-approximation algorithm for a strongly NP-hard problem cannot be polynomial on $1/\\epsilon$, unless $\\text{P}=\\text{NP}$. For most problems in the literature, this translates into algorithms with running time at least as"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2107.06261","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2107.06261/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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-07-05T02:57:32Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"fMSBlvRtqG9vMFeBode2RDd9q9JA9WY5FvxAU/b/iWsLctFpBnnVXWuRelnFdhhr4QddLl/Dt2LQVk85b8XUBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-07T09:08:31.208447Z"},"content_sha256":"f1fe08b1e26bae626d5436ca56edc1ef402a7e6076b84fdb04e06d26efad83a6","schema_version":"1.0","event_id":"sha256:f1fe08b1e26bae626d5436ca56edc1ef402a7e6076b84fdb04e06d26efad83a6"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/VPNYLEHYPUAPEFPNZPGXYWGSG4/bundle.json","state_url":"https://pith.science/pith/VPNYLEHYPUAPEFPNZPGXYWGSG4/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/VPNYLEHYPUAPEFPNZPGXYWGSG4/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-07-07T09:08:31Z","links":{"resolver":"https://pith.science/pith/VPNYLEHYPUAPEFPNZPGXYWGSG4","bundle":"https://pith.science/pith/VPNYLEHYPUAPEFPNZPGXYWGSG4/bundle.json","state":"https://pith.science/pith/VPNYLEHYPUAPEFPNZPGXYWGSG4/state.json","well_known_bundle":"https://pith.science/.well-known/pith/VPNYLEHYPUAPEFPNZPGXYWGSG4/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2021:VPNYLEHYPUAPEFPNZPGXYWGSG4","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":"2ce5ee269ba00ad0b2ba3d87b6b67f39aa48f0d2af5773d24964985e2322e925","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.CC","submitted_at":"2021-07-13T17:41:37Z","title_canon_sha256":"a27442093fca00e43c17e05e69117be05dbfb0b22f22a11cb2952c39e5f4eba3"},"schema_version":"1.0","source":{"id":"2107.06261","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2107.06261","created_at":"2026-07-05T02:57:32Z"},{"alias_kind":"arxiv_version","alias_value":"2107.06261v1","created_at":"2026-07-05T02:57:32Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2107.06261","created_at":"2026-07-05T02:57:32Z"},{"alias_kind":"pith_short_12","alias_value":"VPNYLEHYPUAP","created_at":"2026-07-05T02:57:32Z"},{"alias_kind":"pith_short_16","alias_value":"VPNYLEHYPUAPEFPN","created_at":"2026-07-05T02:57:32Z"},{"alias_kind":"pith_short_8","alias_value":"VPNYLEHY","created_at":"2026-07-05T02:57:32Z"}],"graph_snapshots":[{"event_id":"sha256:f1fe08b1e26bae626d5436ca56edc1ef402a7e6076b84fdb04e06d26efad83a6","target":"graph","created_at":"2026-07-05T02:57:32Z","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"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2107.06261/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"We consider a classical scheduling problem on $m$ identical machines. For an arbitrary constant $q>1$, the aim is to assign jobs to machines such that $\\sum_{i=1}^m C_i^q$ is minimized, where $C_i$ is the total processing time of jobs assigned to machine $i$. It is well known that this problem is strongly NP-hard.\n  Under mild assumptions, the running time of an $(1+\\epsilon)$-approximation algorithm for a strongly NP-hard problem cannot be polynomial on $1/\\epsilon$, unless $\\text{P}=\\text{NP}$. For most problems in the literature, this translates into algorithms with running time at least as","authors_text":"Jos\\'e Verschae, Liangde Tao, Lin Chen","cross_cats":[],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.CC","submitted_at":"2021-07-13T17:41:37Z","title":"Tight running times for minimum $\\ell_q$-norm load balancing: beyond exponential dependencies on $1/\\epsilon$"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2107.06261","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:7191f4fe22b5a41d27ccc922cc98a1c7ecb5aee8930597644a2205f6f3a8812e","target":"record","created_at":"2026-07-05T02:57:32Z","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":"2ce5ee269ba00ad0b2ba3d87b6b67f39aa48f0d2af5773d24964985e2322e925","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.CC","submitted_at":"2021-07-13T17:41:37Z","title_canon_sha256":"a27442093fca00e43c17e05e69117be05dbfb0b22f22a11cb2952c39e5f4eba3"},"schema_version":"1.0","source":{"id":"2107.06261","kind":"arxiv","version":1}},"canonical_sha256":"abdb8590f87d00f215edcbcd7c58d23737f21463f44ee99d5d076b8d828e0def","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"abdb8590f87d00f215edcbcd7c58d23737f21463f44ee99d5d076b8d828e0def","first_computed_at":"2026-07-05T02:57:32.335925Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T02:57:32.335925Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"2OcLyApsqWhDSUuB63ygmWlCQuT6dSktvteEoe+jE0Kqb+yfLb10I9SDR/cCstLVXsmVtDfvIi/LIZqPfQIkAQ==","signature_status":"signed_v1","signed_at":"2026-07-05T02:57:32.336477Z","signed_message":"canonical_sha256_bytes"},"source_id":"2107.06261","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:7191f4fe22b5a41d27ccc922cc98a1c7ecb5aee8930597644a2205f6f3a8812e","sha256:f1fe08b1e26bae626d5436ca56edc1ef402a7e6076b84fdb04e06d26efad83a6"],"state_sha256":"fc4e6b7e41ca6b04d598b486d6b91c91ed9118f9aca6b7ece7afe5518a0a284a"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"t5aZ40rnIXLItKTp8tCXv05tUrwBlqQqpo33TMVFQFkdjtMlso0ON6Iw0p+JQeDnbxgxs4MfVtkbcbzvbpefBA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-07-07T09:08:31.210379Z","bundle_sha256":"2c3d6e5a55cd5c4a52af21b5e50b44671b39ac1f827b12fd1f955c063d406b0e"}}