{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:P4IHHRSHO2GR5Q5L5CYDYX7QGM","short_pith_number":"pith:P4IHHRSH","schema_version":"1.0","canonical_sha256":"7f1073c647768d1ec3abe8b03c5ff0331361cef82b082267f0b7f762bf0c03b6","source":{"kind":"arxiv","id":"1810.11965","version":1},"attestation_state":"computed","paper":{"title":"R-BBG$_2$: Recursive Bipartition of Bi-connected Graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.CO"],"primary_cat":"cs.DS","authors_text":"Ngoc-Tu Nguyen, Zhi-Li Zhang","submitted_at":"2018-10-29T05:50:29Z","abstract_excerpt":"Given an undirected graph $G(V, E)$, it is well known that partitioning a graph $G$ into $q$ connected subgraphs of equal or specificed sizes is in general NP-hard problem. On the other hand, it has been shown that the q-partition problem is solvable in polynomial time for q-connected graphs. For example, efficient polynomial time algorithms for finding 2-partition (bipartition) or 3-partition of 2-connected or 3-connected have been developed in the literature. In this paper, we are interested in the following problem: given a bi-connected graph $G$ of size $n$, can we partition it into two (c"},"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":"1810.11965","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2018-10-29T05:50:29Z","cross_cats_sorted":["math.CO"],"title_canon_sha256":"251f88981a60b961b13bf7de3c6356b90e590f05503da9b403dddb1f83ec4d2a","abstract_canon_sha256":"0635cdbcf862d8a8f9fdfec84450b4718edb619a6d90b909ffa81461ab426ac8"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:02:06.875602Z","signature_b64":"v0vB0CbZJBV8t+iPRBkrKzacW+z+8k+TLmkaKJVlnbjeLJy1kHnTARCZH4DYKTDaW/lu7atx+n8fpMQBOzVBAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"7f1073c647768d1ec3abe8b03c5ff0331361cef82b082267f0b7f762bf0c03b6","last_reissued_at":"2026-05-18T00:02:06.874925Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:02:06.874925Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"R-BBG$_2$: Recursive Bipartition of Bi-connected Graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.CO"],"primary_cat":"cs.DS","authors_text":"Ngoc-Tu Nguyen, Zhi-Li Zhang","submitted_at":"2018-10-29T05:50:29Z","abstract_excerpt":"Given an undirected graph $G(V, E)$, it is well known that partitioning a graph $G$ into $q$ connected subgraphs of equal or specificed sizes is in general NP-hard problem. On the other hand, it has been shown that the q-partition problem is solvable in polynomial time for q-connected graphs. For example, efficient polynomial time algorithms for finding 2-partition (bipartition) or 3-partition of 2-connected or 3-connected have been developed in the literature. In this paper, we are interested in the following problem: given a bi-connected graph $G$ of size $n$, can we partition it into two (c"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1810.11965","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":""},"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":"1810.11965","created_at":"2026-05-18T00:02:06.875049+00:00"},{"alias_kind":"arxiv_version","alias_value":"1810.11965v1","created_at":"2026-05-18T00:02:06.875049+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1810.11965","created_at":"2026-05-18T00:02:06.875049+00:00"},{"alias_kind":"pith_short_12","alias_value":"P4IHHRSHO2GR","created_at":"2026-05-18T12:32:43.782077+00:00"},{"alias_kind":"pith_short_16","alias_value":"P4IHHRSHO2GR5Q5L","created_at":"2026-05-18T12:32:43.782077+00:00"},{"alias_kind":"pith_short_8","alias_value":"P4IHHRSH","created_at":"2026-05-18T12:32:43.782077+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/P4IHHRSHO2GR5Q5L5CYDYX7QGM","json":"https://pith.science/pith/P4IHHRSHO2GR5Q5L5CYDYX7QGM.json","graph_json":"https://pith.science/api/pith-number/P4IHHRSHO2GR5Q5L5CYDYX7QGM/graph.json","events_json":"https://pith.science/api/pith-number/P4IHHRSHO2GR5Q5L5CYDYX7QGM/events.json","paper":"https://pith.science/paper/P4IHHRSH"},"agent_actions":{"view_html":"https://pith.science/pith/P4IHHRSHO2GR5Q5L5CYDYX7QGM","download_json":"https://pith.science/pith/P4IHHRSHO2GR5Q5L5CYDYX7QGM.json","view_paper":"https://pith.science/paper/P4IHHRSH","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1810.11965&json=true","fetch_graph":"https://pith.science/api/pith-number/P4IHHRSHO2GR5Q5L5CYDYX7QGM/graph.json","fetch_events":"https://pith.science/api/pith-number/P4IHHRSHO2GR5Q5L5CYDYX7QGM/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/P4IHHRSHO2GR5Q5L5CYDYX7QGM/action/timestamp_anchor","attest_storage":"https://pith.science/pith/P4IHHRSHO2GR5Q5L5CYDYX7QGM/action/storage_attestation","attest_author":"https://pith.science/pith/P4IHHRSHO2GR5Q5L5CYDYX7QGM/action/author_attestation","sign_citation":"https://pith.science/pith/P4IHHRSHO2GR5Q5L5CYDYX7QGM/action/citation_signature","submit_replication":"https://pith.science/pith/P4IHHRSHO2GR5Q5L5CYDYX7QGM/action/replication_record"}},"created_at":"2026-05-18T00:02:06.875049+00:00","updated_at":"2026-05-18T00:02:06.875049+00:00"}