{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2019:7GZ5DVYQJR5LNFR5MHT7RZBYIT","short_pith_number":"pith:7GZ5DVYQ","schema_version":"1.0","canonical_sha256":"f9b3d1d7104c7ab6963d61e7f8e43844c8c99734534624ff7001372c61187a5a","source":{"kind":"arxiv","id":"1910.02470","version":1},"attestation_state":"computed","paper":{"title":"Approximation algorithms for maximally balanced connected graph partition","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM"],"primary_cat":"cs.DS","authors_text":"An Zhang, Guohui Lin, Yao Xu, Yong Chen, Zhi-Zhong Chen","submitted_at":"2019-10-06T16:24:36Z","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 "},"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":"1910.02470","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2019-10-06T16:24:36Z","cross_cats_sorted":["cs.DM"],"title_canon_sha256":"08883593853e31de58efc0f36fed0905ca27df4aade4327584af152f86f5569e","abstract_canon_sha256":"1bf58f921fd2db2a16c181ab2f5f44d999c2d71a4f1f6d21b735464f56a1d169"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T00:10:08.722211Z","signature_b64":"p6pyvmT4rudNAc/7A7EhWmfaZSlPgGFwzDuyzrZyQuhuk9BdKQm0AkjziJALOuy9l1gDet9wgeAlzPZxRsevCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"f9b3d1d7104c7ab6963d61e7f8e43844c8c99734534624ff7001372c61187a5a","last_reissued_at":"2026-07-05T00:10:08.721828Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T00:10:08.721828Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Approximation algorithms for maximally balanced connected graph partition","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM"],"primary_cat":"cs.DS","authors_text":"An Zhang, Guohui Lin, Yao Xu, Yong Chen, Zhi-Zhong Chen","submitted_at":"2019-10-06T16:24:36Z","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 "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1910.02470","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/1910.02470/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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":"1910.02470","created_at":"2026-07-05T00:10:08.721883+00:00"},{"alias_kind":"arxiv_version","alias_value":"1910.02470v1","created_at":"2026-07-05T00:10:08.721883+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1910.02470","created_at":"2026-07-05T00:10:08.721883+00:00"},{"alias_kind":"pith_short_12","alias_value":"7GZ5DVYQJR5L","created_at":"2026-07-05T00:10:08.721883+00:00"},{"alias_kind":"pith_short_16","alias_value":"7GZ5DVYQJR5LNFR5","created_at":"2026-07-05T00:10:08.721883+00:00"},{"alias_kind":"pith_short_8","alias_value":"7GZ5DVYQ","created_at":"2026-07-05T00:10:08.721883+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/7GZ5DVYQJR5LNFR5MHT7RZBYIT","json":"https://pith.science/pith/7GZ5DVYQJR5LNFR5MHT7RZBYIT.json","graph_json":"https://pith.science/api/pith-number/7GZ5DVYQJR5LNFR5MHT7RZBYIT/graph.json","events_json":"https://pith.science/api/pith-number/7GZ5DVYQJR5LNFR5MHT7RZBYIT/events.json","paper":"https://pith.science/paper/7GZ5DVYQ"},"agent_actions":{"view_html":"https://pith.science/pith/7GZ5DVYQJR5LNFR5MHT7RZBYIT","download_json":"https://pith.science/pith/7GZ5DVYQJR5LNFR5MHT7RZBYIT.json","view_paper":"https://pith.science/paper/7GZ5DVYQ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1910.02470&json=true","fetch_graph":"https://pith.science/api/pith-number/7GZ5DVYQJR5LNFR5MHT7RZBYIT/graph.json","fetch_events":"https://pith.science/api/pith-number/7GZ5DVYQJR5LNFR5MHT7RZBYIT/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/7GZ5DVYQJR5LNFR5MHT7RZBYIT/action/timestamp_anchor","attest_storage":"https://pith.science/pith/7GZ5DVYQJR5LNFR5MHT7RZBYIT/action/storage_attestation","attest_author":"https://pith.science/pith/7GZ5DVYQJR5LNFR5MHT7RZBYIT/action/author_attestation","sign_citation":"https://pith.science/pith/7GZ5DVYQJR5LNFR5MHT7RZBYIT/action/citation_signature","submit_replication":"https://pith.science/pith/7GZ5DVYQJR5LNFR5MHT7RZBYIT/action/replication_record"}},"created_at":"2026-07-05T00:10:08.721883+00:00","updated_at":"2026-07-05T00:10:08.721883+00:00"}