{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2011:JCW6EIPK6D64ZAX7QX5O6I55AH","short_pith_number":"pith:JCW6EIPK","schema_version":"1.0","canonical_sha256":"48ade221eaf0fdcc82ff85faef23bd01f54db927ae3031df9140c6564e130862","source":{"kind":"arxiv","id":"1105.5915","version":2},"attestation_state":"computed","paper":{"title":"Algorithms for the minimum non-separating path and the balanced connected bipartition problems on grid graphs (With erratum)","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Bang Ye Wu","submitted_at":"2011-05-30T09:33:36Z","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"},"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":"1105.5915","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2011-05-30T09:33:36Z","cross_cats_sorted":[],"title_canon_sha256":"6f19448f7794b1f4379b087c34dbaa3f5be1fe45eaa54dfcb6f0aa81f5048337","abstract_canon_sha256":"caab5e0e01a422d06502b66f2e63f8a6586d9ec7e1e6378b3edc81519c839faa"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:59:45.540570Z","signature_b64":"V4behXjEWjfyAi5qwW1jpTNhDEcUfk3pWTrxo+SRj3WXGLjHQrNNl+TtFMPRDtrwb2s4KkjETArisjokBirYDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"48ade221eaf0fdcc82ff85faef23bd01f54db927ae3031df9140c6564e130862","last_reissued_at":"2026-05-18T02:59:45.539718Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:59:45.539718Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Algorithms for the minimum non-separating path and the balanced connected bipartition problems on grid graphs (With erratum)","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Bang Ye Wu","submitted_at":"2011-05-30T09:33:36Z","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"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1105.5915","kind":"arxiv","version":2},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1105.5915","created_at":"2026-05-18T02:59:45.539863+00:00"},{"alias_kind":"arxiv_version","alias_value":"1105.5915v2","created_at":"2026-05-18T02:59:45.539863+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1105.5915","created_at":"2026-05-18T02:59:45.539863+00:00"},{"alias_kind":"pith_short_12","alias_value":"JCW6EIPK6D64","created_at":"2026-05-18T12:26:32.869790+00:00"},{"alias_kind":"pith_short_16","alias_value":"JCW6EIPK6D64ZAX7","created_at":"2026-05-18T12:26:32.869790+00:00"},{"alias_kind":"pith_short_8","alias_value":"JCW6EIPK","created_at":"2026-05-18T12:26:32.869790+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/JCW6EIPK6D64ZAX7QX5O6I55AH","json":"https://pith.science/pith/JCW6EIPK6D64ZAX7QX5O6I55AH.json","graph_json":"https://pith.science/api/pith-number/JCW6EIPK6D64ZAX7QX5O6I55AH/graph.json","events_json":"https://pith.science/api/pith-number/JCW6EIPK6D64ZAX7QX5O6I55AH/events.json","paper":"https://pith.science/paper/JCW6EIPK"},"agent_actions":{"view_html":"https://pith.science/pith/JCW6EIPK6D64ZAX7QX5O6I55AH","download_json":"https://pith.science/pith/JCW6EIPK6D64ZAX7QX5O6I55AH.json","view_paper":"https://pith.science/paper/JCW6EIPK","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1105.5915&json=true","fetch_graph":"https://pith.science/api/pith-number/JCW6EIPK6D64ZAX7QX5O6I55AH/graph.json","fetch_events":"https://pith.science/api/pith-number/JCW6EIPK6D64ZAX7QX5O6I55AH/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/JCW6EIPK6D64ZAX7QX5O6I55AH/action/timestamp_anchor","attest_storage":"https://pith.science/pith/JCW6EIPK6D64ZAX7QX5O6I55AH/action/storage_attestation","attest_author":"https://pith.science/pith/JCW6EIPK6D64ZAX7QX5O6I55AH/action/author_attestation","sign_citation":"https://pith.science/pith/JCW6EIPK6D64ZAX7QX5O6I55AH/action/citation_signature","submit_replication":"https://pith.science/pith/JCW6EIPK6D64ZAX7QX5O6I55AH/action/replication_record"}},"created_at":"2026-05-18T02:59:45.539863+00:00","updated_at":"2026-05-18T02:59:45.539863+00:00"}