{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:P4IHHRSHO2GR5Q5L5CYDYX7QGM","short_pith_number":"pith:P4IHHRSH","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"},"canonical_sha256":"7f1073c647768d1ec3abe8b03c5ff0331361cef82b082267f0b7f762bf0c03b6","source":{"kind":"arxiv","id":"1810.11965","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1810.11965","created_at":"2026-05-18T00:02:06Z"},{"alias_kind":"arxiv_version","alias_value":"1810.11965v1","created_at":"2026-05-18T00:02:06Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1810.11965","created_at":"2026-05-18T00:02:06Z"},{"alias_kind":"pith_short_12","alias_value":"P4IHHRSHO2GR","created_at":"2026-05-18T12:32:43Z"},{"alias_kind":"pith_short_16","alias_value":"P4IHHRSHO2GR5Q5L","created_at":"2026-05-18T12:32:43Z"},{"alias_kind":"pith_short_8","alias_value":"P4IHHRSH","created_at":"2026-05-18T12:32:43Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:P4IHHRSHO2GR5Q5L5CYDYX7QGM","target":"record","payload":{"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"},"canonical_sha256":"7f1073c647768d1ec3abe8b03c5ff0331361cef82b082267f0b7f762bf0c03b6","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"},"source_kind":"arxiv","source_id":"1810.11965","source_version":1,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T00:02:06Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"eIYgdX7KfqPy84rVnw63N4ZzLc8jcLTk/VkcRbmqbVZCcwJ7FfL+9JLgcWoIGBm9M6rdBNIelZUUnZ69VYGMAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-24T22:12:50.432228Z"},"content_sha256":"61e5d182fcab66b671ba9a656e7c53ed2f5cec67167a5628cf55e59bffd25885","schema_version":"1.0","event_id":"sha256:61e5d182fcab66b671ba9a656e7c53ed2f5cec67167a5628cf55e59bffd25885"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:P4IHHRSHO2GR5Q5L5CYDYX7QGM","target":"graph","payload":{"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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T00:02:06Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Ykx/0MF/V+mHPmRoK4LAnl6gD9zzkFPYAcvm1qEqkjMs5dk+/mXozq4Cfirga2Jvv9Tzp3sqlmXWsRCOOZeuBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-24T22:12:50.432588Z"},"content_sha256":"3de1fcb8b1655a5d50c3c869409a6806408875309a03c28e5b79aa33813881d2","schema_version":"1.0","event_id":"sha256:3de1fcb8b1655a5d50c3c869409a6806408875309a03c28e5b79aa33813881d2"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/P4IHHRSHO2GR5Q5L5CYDYX7QGM/bundle.json","state_url":"https://pith.science/pith/P4IHHRSHO2GR5Q5L5CYDYX7QGM/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/P4IHHRSHO2GR5Q5L5CYDYX7QGM/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-06-24T22:12:50Z","links":{"resolver":"https://pith.science/pith/P4IHHRSHO2GR5Q5L5CYDYX7QGM","bundle":"https://pith.science/pith/P4IHHRSHO2GR5Q5L5CYDYX7QGM/bundle.json","state":"https://pith.science/pith/P4IHHRSHO2GR5Q5L5CYDYX7QGM/state.json","well_known_bundle":"https://pith.science/.well-known/pith/P4IHHRSHO2GR5Q5L5CYDYX7QGM/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:P4IHHRSHO2GR5Q5L5CYDYX7QGM","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":"0635cdbcf862d8a8f9fdfec84450b4718edb619a6d90b909ffa81461ab426ac8","cross_cats_sorted":["math.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2018-10-29T05:50:29Z","title_canon_sha256":"251f88981a60b961b13bf7de3c6356b90e590f05503da9b403dddb1f83ec4d2a"},"schema_version":"1.0","source":{"id":"1810.11965","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1810.11965","created_at":"2026-05-18T00:02:06Z"},{"alias_kind":"arxiv_version","alias_value":"1810.11965v1","created_at":"2026-05-18T00:02:06Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1810.11965","created_at":"2026-05-18T00:02:06Z"},{"alias_kind":"pith_short_12","alias_value":"P4IHHRSHO2GR","created_at":"2026-05-18T12:32:43Z"},{"alias_kind":"pith_short_16","alias_value":"P4IHHRSHO2GR5Q5L","created_at":"2026-05-18T12:32:43Z"},{"alias_kind":"pith_short_8","alias_value":"P4IHHRSH","created_at":"2026-05-18T12:32:43Z"}],"graph_snapshots":[{"event_id":"sha256:3de1fcb8b1655a5d50c3c869409a6806408875309a03c28e5b79aa33813881d2","target":"graph","created_at":"2026-05-18T00:02:06Z","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":"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","authors_text":"Ngoc-Tu Nguyen, Zhi-Li Zhang","cross_cats":["math.CO"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2018-10-29T05:50:29Z","title":"R-BBG$_2$: Recursive Bipartition of Bi-connected Graphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1810.11965","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:61e5d182fcab66b671ba9a656e7c53ed2f5cec67167a5628cf55e59bffd25885","target":"record","created_at":"2026-05-18T00:02:06Z","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":"0635cdbcf862d8a8f9fdfec84450b4718edb619a6d90b909ffa81461ab426ac8","cross_cats_sorted":["math.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2018-10-29T05:50:29Z","title_canon_sha256":"251f88981a60b961b13bf7de3c6356b90e590f05503da9b403dddb1f83ec4d2a"},"schema_version":"1.0","source":{"id":"1810.11965","kind":"arxiv","version":1}},"canonical_sha256":"7f1073c647768d1ec3abe8b03c5ff0331361cef82b082267f0b7f762bf0c03b6","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"7f1073c647768d1ec3abe8b03c5ff0331361cef82b082267f0b7f762bf0c03b6","first_computed_at":"2026-05-18T00:02:06.874925Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:02:06.874925Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"v0vB0CbZJBV8t+iPRBkrKzacW+z+8k+TLmkaKJVlnbjeLJy1kHnTARCZH4DYKTDaW/lu7atx+n8fpMQBOzVBAQ==","signature_status":"signed_v1","signed_at":"2026-05-18T00:02:06.875602Z","signed_message":"canonical_sha256_bytes"},"source_id":"1810.11965","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:61e5d182fcab66b671ba9a656e7c53ed2f5cec67167a5628cf55e59bffd25885","sha256:3de1fcb8b1655a5d50c3c869409a6806408875309a03c28e5b79aa33813881d2"],"state_sha256":"f3a5e4f1243bdc5688627ffd3e9faae7cada47e0271f37adcf7bd520700933b4"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"thXwWBK0AsR4GyEXbP0YtcqQ8hA2VZy7f1qFLdK4wT4vwZC/8TCXXJZfvY/5jMsbEHcHUNbWdH2AbKVa2FPsDA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-24T22:12:50.434618Z","bundle_sha256":"637b4f57a2ec9884f9d21fe8c61dbeaa12040b4b2fc658bb97c71bf697164111"}}