{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:RUVJFZQXIPYHIZBEJNFF3CTUDE","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":"09c736358456c6068951dc97f9c1368d5a1c1dd088d41eaaaf135aca6c358e7b","cross_cats_sorted":["cs.DC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2014-10-02T07:32:12Z","title_canon_sha256":"3e52b8c8a67c660f23b7af11dc208c5dfd1ee14c74d3ea2508be7407bba35524"},"schema_version":"1.0","source":{"id":"1410.0462","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1410.0462","created_at":"2026-05-18T02:41:11Z"},{"alias_kind":"arxiv_version","alias_value":"1410.0462v1","created_at":"2026-05-18T02:41:11Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1410.0462","created_at":"2026-05-18T02:41:11Z"},{"alias_kind":"pith_short_12","alias_value":"RUVJFZQXIPYH","created_at":"2026-05-18T12:28:46Z"},{"alias_kind":"pith_short_16","alias_value":"RUVJFZQXIPYHIZBE","created_at":"2026-05-18T12:28:46Z"},{"alias_kind":"pith_short_8","alias_value":"RUVJFZQX","created_at":"2026-05-18T12:28:46Z"}],"graph_snapshots":[{"event_id":"sha256:7fbd4116a56c4f71e50a981bfc2fe211d111c0e695de8c07b59992ed76a916df","target":"graph","created_at":"2026-05-18T02:41:11Z","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":"There has recently been much progress on exact algorithms for the (un)weighted graph (bi)partitioning problem using branch-and-bound and related methods. In this note we present and improve an easily computable, purely combinatorial lower bound for the weighted bipartitioning problem. The bound is computable in $O(n\\log n+m)$ time steps for weighted graphs with $n$ vertices and $m$ edges. In the branch-and-bound setting, the bound for each new subproblem can be updated in $O(n+(m/n)\\log n)$ time steps amortized over a series of $n$ branching steps; a rarely triggered tightening of the bound re","authors_text":"Jesper Larsson Tr\\\"aff, Martin Wimmer","cross_cats":["cs.DC"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2014-10-02T07:32:12Z","title":"An improved, easily computable combinatorial lower bound for weighted graph bipartitioning"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1410.0462","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:f6fd1b7d43c30de71235d024d1092ce0f120d7e8a644607b76d2d5ab09796452","target":"record","created_at":"2026-05-18T02:41:11Z","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":"09c736358456c6068951dc97f9c1368d5a1c1dd088d41eaaaf135aca6c358e7b","cross_cats_sorted":["cs.DC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2014-10-02T07:32:12Z","title_canon_sha256":"3e52b8c8a67c660f23b7af11dc208c5dfd1ee14c74d3ea2508be7407bba35524"},"schema_version":"1.0","source":{"id":"1410.0462","kind":"arxiv","version":1}},"canonical_sha256":"8d2a92e61743f07464244b4a5d8a74192bb959e728d01d0fc8f3548b45b0c371","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"8d2a92e61743f07464244b4a5d8a74192bb959e728d01d0fc8f3548b45b0c371","first_computed_at":"2026-05-18T02:41:11.049504Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:41:11.049504Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"AFaJFjblbQMhqzx3fpc5/CIOFQ3OcYsKSRL3oQ8PB57WTmQQRskefEP1u3wHXQL6JX1N4JY/a8yoI4IUDE11Dg==","signature_status":"signed_v1","signed_at":"2026-05-18T02:41:11.050194Z","signed_message":"canonical_sha256_bytes"},"source_id":"1410.0462","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:f6fd1b7d43c30de71235d024d1092ce0f120d7e8a644607b76d2d5ab09796452","sha256:7fbd4116a56c4f71e50a981bfc2fe211d111c0e695de8c07b59992ed76a916df"],"state_sha256":"9ce66bad5959a26715b20f61c52f6e5ffbbea5cc4a028a3b9993c64883cae5c9"}