{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2011:JCW6EIPK6D64ZAX7QX5O6I55AH","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":"caab5e0e01a422d06502b66f2e63f8a6586d9ec7e1e6378b3edc81519c839faa","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2011-05-30T09:33:36Z","title_canon_sha256":"6f19448f7794b1f4379b087c34dbaa3f5be1fe45eaa54dfcb6f0aa81f5048337"},"schema_version":"1.0","source":{"id":"1105.5915","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1105.5915","created_at":"2026-05-18T02:59:45Z"},{"alias_kind":"arxiv_version","alias_value":"1105.5915v2","created_at":"2026-05-18T02:59:45Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1105.5915","created_at":"2026-05-18T02:59:45Z"},{"alias_kind":"pith_short_12","alias_value":"JCW6EIPK6D64","created_at":"2026-05-18T12:26:32Z"},{"alias_kind":"pith_short_16","alias_value":"JCW6EIPK6D64ZAX7","created_at":"2026-05-18T12:26:32Z"},{"alias_kind":"pith_short_8","alias_value":"JCW6EIPK","created_at":"2026-05-18T12:26:32Z"}],"graph_snapshots":[{"event_id":"sha256:dfdde3a84137db93ae3ab5bda11a2d7746a52092bdaa51c91aa1af29879e87cf","target":"graph","created_at":"2026-05-18T02:59:45Z","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":"For given a pair of nodes in a graph, the minimum non-separating path problem looks for a minimum weight path between the two nodes such that the remaining graph after removing the path is still connected. The balanced connected bipartition (BCP$_2$) problem looks for a way to bipartition a graph into two connected subgraphs with their weights as equal as possible. In this paper we present an algorithm in time $O(N\\log N)$ for finding a minimum weight non-separating path between two given nodes in a grid graph of $N$ nodes with positive weight. This result leads to a 5/4-approximation algorith","authors_text":"Bang Ye Wu","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2011-05-30T09:33:36Z","title":"Algorithms for the minimum non-separating path and the balanced connected bipartition problems on grid graphs (With erratum)"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1105.5915","kind":"arxiv","version":2},"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:bd44676568e5c1e9449127720f4662f18bfa2083b445483f1a9b2368ff69aed3","target":"record","created_at":"2026-05-18T02:59:45Z","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":"caab5e0e01a422d06502b66f2e63f8a6586d9ec7e1e6378b3edc81519c839faa","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2011-05-30T09:33:36Z","title_canon_sha256":"6f19448f7794b1f4379b087c34dbaa3f5be1fe45eaa54dfcb6f0aa81f5048337"},"schema_version":"1.0","source":{"id":"1105.5915","kind":"arxiv","version":2}},"canonical_sha256":"48ade221eaf0fdcc82ff85faef23bd01f54db927ae3031df9140c6564e130862","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"48ade221eaf0fdcc82ff85faef23bd01f54db927ae3031df9140c6564e130862","first_computed_at":"2026-05-18T02:59:45.539718Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:59:45.539718Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"V4behXjEWjfyAi5qwW1jpTNhDEcUfk3pWTrxo+SRj3WXGLjHQrNNl+TtFMPRDtrwb2s4KkjETArisjokBirYDQ==","signature_status":"signed_v1","signed_at":"2026-05-18T02:59:45.540570Z","signed_message":"canonical_sha256_bytes"},"source_id":"1105.5915","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:bd44676568e5c1e9449127720f4662f18bfa2083b445483f1a9b2368ff69aed3","sha256:dfdde3a84137db93ae3ab5bda11a2d7746a52092bdaa51c91aa1af29879e87cf"],"state_sha256":"a128eb64dfcf6e32a3a15d1e75a55ccbc07f5960fe2afad4e6af9d1fc55076d1"}