{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:AVKATKFWRSLB7KDNWSFKLNKQIL","short_pith_number":"pith:AVKATKFW","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"},"canonical_sha256":"055409a8b68c961fa86db48aa5b55042d687695d88f371df051fb6604158fa0f","source":{"kind":"arxiv","id":"1811.00955","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1811.00955","created_at":"2026-05-18T00:01:39Z"},{"alias_kind":"arxiv_version","alias_value":"1811.00955v1","created_at":"2026-05-18T00:01:39Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1811.00955","created_at":"2026-05-18T00:01:39Z"},{"alias_kind":"pith_short_12","alias_value":"AVKATKFWRSLB","created_at":"2026-05-18T12:32:13Z"},{"alias_kind":"pith_short_16","alias_value":"AVKATKFWRSLB7KDN","created_at":"2026-05-18T12:32:13Z"},{"alias_kind":"pith_short_8","alias_value":"AVKATKFW","created_at":"2026-05-18T12:32:13Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:AVKATKFWRSLB7KDNWSFKLNKQIL","target":"record","payload":{"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"},"canonical_sha256":"055409a8b68c961fa86db48aa5b55042d687695d88f371df051fb6604158fa0f","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"},"source_kind":"arxiv","source_id":"1811.00955","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-18T00:01:39Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ybifTJhvP5qLoRGswRJ2P+93lQwXyysyrL0S5FX4ycLu37bucN8IdU32LH5abYg0aWh3d0hvakL87t3YOH6OCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-25T14:41:25.495835Z"},"content_sha256":"c96734c10b0ec7776207c8fe6c39d35e077106c077fa6da18b11e667f4743763","schema_version":"1.0","event_id":"sha256:c96734c10b0ec7776207c8fe6c39d35e077106c077fa6da18b11e667f4743763"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:AVKATKFWRSLB7KDNWSFKLNKQIL","target":"graph","payload":{"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"},"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-18T00:01:39Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"SnITipiS9r7nwhWBOXff/+pfg7wxUtpRi71mcbkn8JmlAGCwLK/ECPyJ4z9Q/doyoznVSVLWft4VvZD6gS9fCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-25T14:41:25.496556Z"},"content_sha256":"4320e473d7d5dbb6e390d331148f701ea5f9d07fc00ec943dd9356f80aec5808","schema_version":"1.0","event_id":"sha256:4320e473d7d5dbb6e390d331148f701ea5f9d07fc00ec943dd9356f80aec5808"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/AVKATKFWRSLB7KDNWSFKLNKQIL/bundle.json","state_url":"https://pith.science/pith/AVKATKFWRSLB7KDNWSFKLNKQIL/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/AVKATKFWRSLB7KDNWSFKLNKQIL/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-05-25T14:41:25Z","links":{"resolver":"https://pith.science/pith/AVKATKFWRSLB7KDNWSFKLNKQIL","bundle":"https://pith.science/pith/AVKATKFWRSLB7KDNWSFKLNKQIL/bundle.json","state":"https://pith.science/pith/AVKATKFWRSLB7KDNWSFKLNKQIL/state.json","well_known_bundle":"https://pith.science/.well-known/pith/AVKATKFWRSLB7KDNWSFKLNKQIL/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:AVKATKFWRSLB7KDNWSFKLNKQIL","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":"574d3b64b36b1e42e8bf6d9d91a14f9fcca2218483c80060fa7c83113f8050f5","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2018-11-02T16:08:29Z","title_canon_sha256":"3ec7c558ca189234dbc026134b94f065ec1fec9a2964acf2d78dbbf28189c98b"},"schema_version":"1.0","source":{"id":"1811.00955","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1811.00955","created_at":"2026-05-18T00:01:39Z"},{"alias_kind":"arxiv_version","alias_value":"1811.00955v1","created_at":"2026-05-18T00:01:39Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1811.00955","created_at":"2026-05-18T00:01:39Z"},{"alias_kind":"pith_short_12","alias_value":"AVKATKFWRSLB","created_at":"2026-05-18T12:32:13Z"},{"alias_kind":"pith_short_16","alias_value":"AVKATKFWRSLB7KDN","created_at":"2026-05-18T12:32:13Z"},{"alias_kind":"pith_short_8","alias_value":"AVKATKFW","created_at":"2026-05-18T12:32:13Z"}],"graph_snapshots":[{"event_id":"sha256:4320e473d7d5dbb6e390d331148f701ea5f9d07fc00ec943dd9356f80aec5808","target":"graph","created_at":"2026-05-18T00:01:39Z","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":"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","authors_text":"Klaus Jansen, Lars Rohwedder","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2018-11-02T16:08:29Z","title":"Local search breaks 1.75 for Graph Balancing"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1811.00955","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:c96734c10b0ec7776207c8fe6c39d35e077106c077fa6da18b11e667f4743763","target":"record","created_at":"2026-05-18T00:01:39Z","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":"574d3b64b36b1e42e8bf6d9d91a14f9fcca2218483c80060fa7c83113f8050f5","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2018-11-02T16:08:29Z","title_canon_sha256":"3ec7c558ca189234dbc026134b94f065ec1fec9a2964acf2d78dbbf28189c98b"},"schema_version":"1.0","source":{"id":"1811.00955","kind":"arxiv","version":1}},"canonical_sha256":"055409a8b68c961fa86db48aa5b55042d687695d88f371df051fb6604158fa0f","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"055409a8b68c961fa86db48aa5b55042d687695d88f371df051fb6604158fa0f","first_computed_at":"2026-05-18T00:01:39.821778Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:01:39.821778Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"stAH80+a/EfTvszx56cRQlN0FfMzyega3t6Na7P//vRctOrx71GiX1HG3imA1FSmT0sFhyhvAdCkAMUYUEkqBg==","signature_status":"signed_v1","signed_at":"2026-05-18T00:01:39.822377Z","signed_message":"canonical_sha256_bytes"},"source_id":"1811.00955","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:c96734c10b0ec7776207c8fe6c39d35e077106c077fa6da18b11e667f4743763","sha256:4320e473d7d5dbb6e390d331148f701ea5f9d07fc00ec943dd9356f80aec5808"],"state_sha256":"074dece0490aa2887c4df723d403cf19e772faa96a46fe1d5a0cd4c79029e125"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"6Gn8WzHjxbcQCBYrHrq6R23AV8q5GcaoXenGTRPwDs4KKguoR7Xl2Y/l89yY5o1BkZG7T1E39hcDHu058JMhDQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-25T14:41:25.500462Z","bundle_sha256":"f17eb1957ad04e5c36d5b6ef231ac6a8891d2f0661c7a42af738e692a9ac65bc"}}