{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:35ABWQHDO3I262JS2BOWOXDO4T","short_pith_number":"pith:35ABWQHD","schema_version":"1.0","canonical_sha256":"df401b40e376d1af6932d05d675c6ee4f6918692997b89ace191cf016559f389","source":{"kind":"arxiv","id":"1507.07396","version":3},"attestation_state":"computed","paper":{"title":"A Combinatorial Approximation Algorithm for Graph Balancing with Light Hyper Edges","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Chien-Chung Huang, Sebastian Ott","submitted_at":"2015-07-27T13:21:26Z","abstract_excerpt":"Makespan minimization in restricted assignment $(R|p_{ij}\\in \\{p_j, \\infty\\}|C_{\\max})$ is a classical problem in the field of machine scheduling. In a landmark paper in 1990 [8], Lenstra, Shmoys, and Tardos gave a 2-approximation algorithm and proved that the problem cannot be approximated within 1.5 unless P=NP. The upper and lower bounds of the problem have been essentially unimproved in the intervening 25 years, despite several remarkable successful attempts in some special cases of the problem [2,4,12] recently.\n  In this paper, we consider a special case called graph-balancing with light"},"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":"1507.07396","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2015-07-27T13:21:26Z","cross_cats_sorted":[],"title_canon_sha256":"c0cf1c912ea1882852e1ee6522008e078373963697decd1450c7f4237712b901","abstract_canon_sha256":"883fdd86e688b898efa5b376b7577fa8cd7b84c4967576b0acdcb09ee86fce9b"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:31:13.467880Z","signature_b64":"p3aiYGoBOun0GZS1LeqY+nbGPOtZVrmnuTuDTpIxXqb61WSfrzeW3O3A3SO22F8uVwC8tK98epKpz0TDLXe5BQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"df401b40e376d1af6932d05d675c6ee4f6918692997b89ace191cf016559f389","last_reissued_at":"2026-05-18T01:31:13.467344Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:31:13.467344Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A Combinatorial Approximation Algorithm for Graph Balancing with Light Hyper Edges","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Chien-Chung Huang, Sebastian Ott","submitted_at":"2015-07-27T13:21:26Z","abstract_excerpt":"Makespan minimization in restricted assignment $(R|p_{ij}\\in \\{p_j, \\infty\\}|C_{\\max})$ is a classical problem in the field of machine scheduling. In a landmark paper in 1990 [8], Lenstra, Shmoys, and Tardos gave a 2-approximation algorithm and proved that the problem cannot be approximated within 1.5 unless P=NP. The upper and lower bounds of the problem have been essentially unimproved in the intervening 25 years, despite several remarkable successful attempts in some special cases of the problem [2,4,12] recently.\n  In this paper, we consider a special case called graph-balancing with light"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1507.07396","kind":"arxiv","version":3},"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":"1507.07396","created_at":"2026-05-18T01:31:13.467430+00:00"},{"alias_kind":"arxiv_version","alias_value":"1507.07396v3","created_at":"2026-05-18T01:31:13.467430+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1507.07396","created_at":"2026-05-18T01:31:13.467430+00:00"},{"alias_kind":"pith_short_12","alias_value":"35ABWQHDO3I2","created_at":"2026-05-18T12:29:02.477457+00:00"},{"alias_kind":"pith_short_16","alias_value":"35ABWQHDO3I262JS","created_at":"2026-05-18T12:29:02.477457+00:00"},{"alias_kind":"pith_short_8","alias_value":"35ABWQHD","created_at":"2026-05-18T12:29:02.477457+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/35ABWQHDO3I262JS2BOWOXDO4T","json":"https://pith.science/pith/35ABWQHDO3I262JS2BOWOXDO4T.json","graph_json":"https://pith.science/api/pith-number/35ABWQHDO3I262JS2BOWOXDO4T/graph.json","events_json":"https://pith.science/api/pith-number/35ABWQHDO3I262JS2BOWOXDO4T/events.json","paper":"https://pith.science/paper/35ABWQHD"},"agent_actions":{"view_html":"https://pith.science/pith/35ABWQHDO3I262JS2BOWOXDO4T","download_json":"https://pith.science/pith/35ABWQHDO3I262JS2BOWOXDO4T.json","view_paper":"https://pith.science/paper/35ABWQHD","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1507.07396&json=true","fetch_graph":"https://pith.science/api/pith-number/35ABWQHDO3I262JS2BOWOXDO4T/graph.json","fetch_events":"https://pith.science/api/pith-number/35ABWQHDO3I262JS2BOWOXDO4T/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/35ABWQHDO3I262JS2BOWOXDO4T/action/timestamp_anchor","attest_storage":"https://pith.science/pith/35ABWQHDO3I262JS2BOWOXDO4T/action/storage_attestation","attest_author":"https://pith.science/pith/35ABWQHDO3I262JS2BOWOXDO4T/action/author_attestation","sign_citation":"https://pith.science/pith/35ABWQHDO3I262JS2BOWOXDO4T/action/citation_signature","submit_replication":"https://pith.science/pith/35ABWQHDO3I262JS2BOWOXDO4T/action/replication_record"}},"created_at":"2026-05-18T01:31:13.467430+00:00","updated_at":"2026-05-18T01:31:13.467430+00:00"}