{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2019:7GZ5DVYQJR5LNFR5MHT7RZBYIT","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":"1bf58f921fd2db2a16c181ab2f5f44d999c2d71a4f1f6d21b735464f56a1d169","cross_cats_sorted":["cs.DM"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2019-10-06T16:24:36Z","title_canon_sha256":"08883593853e31de58efc0f36fed0905ca27df4aade4327584af152f86f5569e"},"schema_version":"1.0","source":{"id":"1910.02470","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1910.02470","created_at":"2026-07-05T00:10:08Z"},{"alias_kind":"arxiv_version","alias_value":"1910.02470v1","created_at":"2026-07-05T00:10:08Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1910.02470","created_at":"2026-07-05T00:10:08Z"},{"alias_kind":"pith_short_12","alias_value":"7GZ5DVYQJR5L","created_at":"2026-07-05T00:10:08Z"},{"alias_kind":"pith_short_16","alias_value":"7GZ5DVYQJR5LNFR5","created_at":"2026-07-05T00:10:08Z"},{"alias_kind":"pith_short_8","alias_value":"7GZ5DVYQ","created_at":"2026-07-05T00:10:08Z"}],"graph_snapshots":[{"event_id":"sha256:fc1670ba065f2be8c2cbc483ea4e7d393c78bf96f42ea307b9a0eada6f77ac6e","target":"graph","created_at":"2026-07-05T00:10:08Z","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/1910.02470/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Given a simple connected graph $G = (V, E)$, we seek to partition the vertex set $V$ into $k$ non-empty parts such that the subgraph induced by each part is connected, and the partition is maximally balanced in the way that the maximum cardinality of these $k$ parts is minimized. We refer this problem to as {\\em min-max balanced connected graph partition} into $k$ parts and denote it as {\\sc $k$-BGP}. The general vertex-weighted version of this problem on trees has been studied since about four decades ago, which admits a linear time exact algorithm; the vertex-weighted {\\sc $2$-BGP} and {\\sc ","authors_text":"An Zhang, Guohui Lin, Yao Xu, Yong Chen, Zhi-Zhong Chen","cross_cats":["cs.DM"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2019-10-06T16:24:36Z","title":"Approximation algorithms for maximally balanced connected graph partition"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1910.02470","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:4f1a9c2e1280652dd6b7335ee4abc19e73a3702d70f3bd7c1d2e92f45b53b7be","target":"record","created_at":"2026-07-05T00:10:08Z","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":"1bf58f921fd2db2a16c181ab2f5f44d999c2d71a4f1f6d21b735464f56a1d169","cross_cats_sorted":["cs.DM"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2019-10-06T16:24:36Z","title_canon_sha256":"08883593853e31de58efc0f36fed0905ca27df4aade4327584af152f86f5569e"},"schema_version":"1.0","source":{"id":"1910.02470","kind":"arxiv","version":1}},"canonical_sha256":"f9b3d1d7104c7ab6963d61e7f8e43844c8c99734534624ff7001372c61187a5a","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"f9b3d1d7104c7ab6963d61e7f8e43844c8c99734534624ff7001372c61187a5a","first_computed_at":"2026-07-05T00:10:08.721828Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T00:10:08.721828Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"p6pyvmT4rudNAc/7A7EhWmfaZSlPgGFwzDuyzrZyQuhuk9BdKQm0AkjziJALOuy9l1gDet9wgeAlzPZxRsevCA==","signature_status":"signed_v1","signed_at":"2026-07-05T00:10:08.722211Z","signed_message":"canonical_sha256_bytes"},"source_id":"1910.02470","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:4f1a9c2e1280652dd6b7335ee4abc19e73a3702d70f3bd7c1d2e92f45b53b7be","sha256:fc1670ba065f2be8c2cbc483ea4e7d393c78bf96f42ea307b9a0eada6f77ac6e"],"state_sha256":"353a2509009d7b29baa7b0edbbb70e4a069a14e90dea0d7242bb576b4052e1c1"}