{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:AVKATKFWRSLB7KDNWSFKLNKQIL","short_pith_number":"pith:AVKATKFW","schema_version":"1.0","canonical_sha256":"055409a8b68c961fa86db48aa5b55042d687695d88f371df051fb6604158fa0f","source":{"kind":"arxiv","id":"1811.00955","version":1},"attestation_state":"computed","paper":{"title":"Local search breaks 1.75 for Graph Balancing","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Klaus Jansen, Lars Rohwedder","submitted_at":"2018-11-02T16:08:29Z","abstract_excerpt":"Graph Balancing is the problem of orienting the edges of a weighted multigraph so as to minimize the maximum weighted in-degree. Since the introduction of the problem the best algorithm known achieves an approximation ratio of $1.75$ and it is based on rounding a linear program with this exact integrality gap. It is also known that there is no $(1.5 - \\epsilon)$-approximation algorithm, unless $\\mathrm{P}=\\mathrm{NP}$. Can we do better than $1.75$? We prove that a different LP formulation, the configuration LP, has a strictly smaller integrality gap. Graph Balancing was the last one in a group"},"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":"1811.00955","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2018-11-02T16:08:29Z","cross_cats_sorted":[],"title_canon_sha256":"3ec7c558ca189234dbc026134b94f065ec1fec9a2964acf2d78dbbf28189c98b","abstract_canon_sha256":"574d3b64b36b1e42e8bf6d9d91a14f9fcca2218483c80060fa7c83113f8050f5"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:01:39.822377Z","signature_b64":"stAH80+a/EfTvszx56cRQlN0FfMzyega3t6Na7P//vRctOrx71GiX1HG3imA1FSmT0sFhyhvAdCkAMUYUEkqBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"055409a8b68c961fa86db48aa5b55042d687695d88f371df051fb6604158fa0f","last_reissued_at":"2026-05-18T00:01:39.821778Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:01:39.821778Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Local search breaks 1.75 for Graph Balancing","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Klaus Jansen, Lars Rohwedder","submitted_at":"2018-11-02T16:08:29Z","abstract_excerpt":"Graph Balancing is the problem of orienting the edges of a weighted multigraph so as to minimize the maximum weighted in-degree. Since the introduction of the problem the best algorithm known achieves an approximation ratio of $1.75$ and it is based on rounding a linear program with this exact integrality gap. It is also known that there is no $(1.5 - \\epsilon)$-approximation algorithm, unless $\\mathrm{P}=\\mathrm{NP}$. Can we do better than $1.75$? We prove that a different LP formulation, the configuration LP, has a strictly smaller integrality gap. Graph Balancing was the last one in a group"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1811.00955","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":"1811.00955","created_at":"2026-05-18T00:01:39.821875+00:00"},{"alias_kind":"arxiv_version","alias_value":"1811.00955v1","created_at":"2026-05-18T00:01:39.821875+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1811.00955","created_at":"2026-05-18T00:01:39.821875+00:00"},{"alias_kind":"pith_short_12","alias_value":"AVKATKFWRSLB","created_at":"2026-05-18T12:32:13.499390+00:00"},{"alias_kind":"pith_short_16","alias_value":"AVKATKFWRSLB7KDN","created_at":"2026-05-18T12:32:13.499390+00:00"},{"alias_kind":"pith_short_8","alias_value":"AVKATKFW","created_at":"2026-05-18T12:32:13.499390+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":2,"internal_anchor_count":2,"sample":[{"citing_arxiv_id":"1907.03526","citing_title":"Inapproximability Results for Scheduling with Interval and Resource Restrictions","ref_index":19,"is_internal_anchor":true},{"citing_arxiv_id":"1907.03526","citing_title":"Inapproximability Results for Scheduling with Interval and Resource Restrictions","ref_index":18,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/AVKATKFWRSLB7KDNWSFKLNKQIL","json":"https://pith.science/pith/AVKATKFWRSLB7KDNWSFKLNKQIL.json","graph_json":"https://pith.science/api/pith-number/AVKATKFWRSLB7KDNWSFKLNKQIL/graph.json","events_json":"https://pith.science/api/pith-number/AVKATKFWRSLB7KDNWSFKLNKQIL/events.json","paper":"https://pith.science/paper/AVKATKFW"},"agent_actions":{"view_html":"https://pith.science/pith/AVKATKFWRSLB7KDNWSFKLNKQIL","download_json":"https://pith.science/pith/AVKATKFWRSLB7KDNWSFKLNKQIL.json","view_paper":"https://pith.science/paper/AVKATKFW","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1811.00955&json=true","fetch_graph":"https://pith.science/api/pith-number/AVKATKFWRSLB7KDNWSFKLNKQIL/graph.json","fetch_events":"https://pith.science/api/pith-number/AVKATKFWRSLB7KDNWSFKLNKQIL/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/AVKATKFWRSLB7KDNWSFKLNKQIL/action/timestamp_anchor","attest_storage":"https://pith.science/pith/AVKATKFWRSLB7KDNWSFKLNKQIL/action/storage_attestation","attest_author":"https://pith.science/pith/AVKATKFWRSLB7KDNWSFKLNKQIL/action/author_attestation","sign_citation":"https://pith.science/pith/AVKATKFWRSLB7KDNWSFKLNKQIL/action/citation_signature","submit_replication":"https://pith.science/pith/AVKATKFWRSLB7KDNWSFKLNKQIL/action/replication_record"}},"created_at":"2026-05-18T00:01:39.821875+00:00","updated_at":"2026-05-18T00:01:39.821875+00:00"}