{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:B7WNSAGSQ5O6PDWX3GXDYSK43N","short_pith_number":"pith:B7WNSAGS","canonical_record":{"source":{"id":"1708.06411","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2017-08-21T20:28:23Z","cross_cats_sorted":["cs.DM"],"title_canon_sha256":"a4644e264268a15d866c6674588f6a6a93801134f6103683accd129a5c562a8b","abstract_canon_sha256":"eb50dca750ddeedb3c44b6d77f3296987083143866840927ae393750cbdd296a"},"schema_version":"1.0"},"canonical_sha256":"0fecd900d2875de78ed7d9ae3c495cdb74913f825471da3c50a156c9da1adbbc","source":{"kind":"arxiv","id":"1708.06411","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1708.06411","created_at":"2026-05-18T00:37:41Z"},{"alias_kind":"arxiv_version","alias_value":"1708.06411v1","created_at":"2026-05-18T00:37:41Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1708.06411","created_at":"2026-05-18T00:37:41Z"},{"alias_kind":"pith_short_12","alias_value":"B7WNSAGSQ5O6","created_at":"2026-05-18T12:31:08Z"},{"alias_kind":"pith_short_16","alias_value":"B7WNSAGSQ5O6PDWX","created_at":"2026-05-18T12:31:08Z"},{"alias_kind":"pith_short_8","alias_value":"B7WNSAGS","created_at":"2026-05-18T12:31:08Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:B7WNSAGSQ5O6PDWX3GXDYSK43N","target":"record","payload":{"canonical_record":{"source":{"id":"1708.06411","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2017-08-21T20:28:23Z","cross_cats_sorted":["cs.DM"],"title_canon_sha256":"a4644e264268a15d866c6674588f6a6a93801134f6103683accd129a5c562a8b","abstract_canon_sha256":"eb50dca750ddeedb3c44b6d77f3296987083143866840927ae393750cbdd296a"},"schema_version":"1.0"},"canonical_sha256":"0fecd900d2875de78ed7d9ae3c495cdb74913f825471da3c50a156c9da1adbbc","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:37:41.654003Z","signature_b64":"UzOqr/xvSl6zsmlnogKDNKJ94hcyOuXG3PP+2kSV7Mk9WqKLT0lXPjKMbOvs5H/tdts94x5C3Wm4JFIELC/eBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"0fecd900d2875de78ed7d9ae3c495cdb74913f825471da3c50a156c9da1adbbc","last_reissued_at":"2026-05-18T00:37:41.653308Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:37:41.653308Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1708.06411","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:37:41Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"h3+m9FqTW50h/v6DhtxKUtzR5NXExK4MjHqnErj/IKueQpBUvxTg8JH9TFvabHvGkodc3ungnzvV0BRnMpD0Dg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T23:35:42.715343Z"},"content_sha256":"fcd03864b6d8d3c97f0856f4fa3c7d40fa0991aacbb4406170c5e3ca57e4d3bb","schema_version":"1.0","event_id":"sha256:fcd03864b6d8d3c97f0856f4fa3c7d40fa0991aacbb4406170c5e3ca57e4d3bb"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:B7WNSAGSQ5O6PDWX3GXDYSK43N","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"On Minimum Bisection and Related Cut Problems in Trees and Tree-Like Graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM"],"primary_cat":"math.CO","authors_text":"Anusch Taraz, Cristina G. Fernandes, Tina Janne Schmidt","submitted_at":"2017-08-21T20:28:23Z","abstract_excerpt":"Minimum Bisection denotes the NP-hard problem to partition the vertex set of a graph into two sets of equal sizes while minimizing the width of the bisection, which is defined as the number of edges between these two sets. We first consider this problem for trees and prove that the minimum bisection width of every tree $T$ on $n$ vertices satisfies $MinBis(T) \\leq 8 n \\Delta(T) / diam(T)$. Second, we generalize this to arbitrary graphs with a given tree decomposition $(T,X)$ and give an upper bound on the minimum bisection width that depends on the structure of $(T,X)$. Moreover, we show that "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1708.06411","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:37:41Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"kuvvCpldEdbnFXqEoL8j6Ob38LT6imjRRFrYGhLzaHKtrcz6A8wCYdITNBsYfNKopN6a3wROftLuGwGsp8dYCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T23:35:42.716057Z"},"content_sha256":"081b51632451c78f5b5cba1f87ae2f0b345a4cd322718a762075f21a52ed5a4b","schema_version":"1.0","event_id":"sha256:081b51632451c78f5b5cba1f87ae2f0b345a4cd322718a762075f21a52ed5a4b"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/B7WNSAGSQ5O6PDWX3GXDYSK43N/bundle.json","state_url":"https://pith.science/pith/B7WNSAGSQ5O6PDWX3GXDYSK43N/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/B7WNSAGSQ5O6PDWX3GXDYSK43N/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-05-30T23:35:42Z","links":{"resolver":"https://pith.science/pith/B7WNSAGSQ5O6PDWX3GXDYSK43N","bundle":"https://pith.science/pith/B7WNSAGSQ5O6PDWX3GXDYSK43N/bundle.json","state":"https://pith.science/pith/B7WNSAGSQ5O6PDWX3GXDYSK43N/state.json","well_known_bundle":"https://pith.science/.well-known/pith/B7WNSAGSQ5O6PDWX3GXDYSK43N/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:B7WNSAGSQ5O6PDWX3GXDYSK43N","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":"eb50dca750ddeedb3c44b6d77f3296987083143866840927ae393750cbdd296a","cross_cats_sorted":["cs.DM"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2017-08-21T20:28:23Z","title_canon_sha256":"a4644e264268a15d866c6674588f6a6a93801134f6103683accd129a5c562a8b"},"schema_version":"1.0","source":{"id":"1708.06411","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1708.06411","created_at":"2026-05-18T00:37:41Z"},{"alias_kind":"arxiv_version","alias_value":"1708.06411v1","created_at":"2026-05-18T00:37:41Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1708.06411","created_at":"2026-05-18T00:37:41Z"},{"alias_kind":"pith_short_12","alias_value":"B7WNSAGSQ5O6","created_at":"2026-05-18T12:31:08Z"},{"alias_kind":"pith_short_16","alias_value":"B7WNSAGSQ5O6PDWX","created_at":"2026-05-18T12:31:08Z"},{"alias_kind":"pith_short_8","alias_value":"B7WNSAGS","created_at":"2026-05-18T12:31:08Z"}],"graph_snapshots":[{"event_id":"sha256:081b51632451c78f5b5cba1f87ae2f0b345a4cd322718a762075f21a52ed5a4b","target":"graph","created_at":"2026-05-18T00:37:41Z","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":"Minimum Bisection denotes the NP-hard problem to partition the vertex set of a graph into two sets of equal sizes while minimizing the width of the bisection, which is defined as the number of edges between these two sets. We first consider this problem for trees and prove that the minimum bisection width of every tree $T$ on $n$ vertices satisfies $MinBis(T) \\leq 8 n \\Delta(T) / diam(T)$. Second, we generalize this to arbitrary graphs with a given tree decomposition $(T,X)$ and give an upper bound on the minimum bisection width that depends on the structure of $(T,X)$. Moreover, we show that ","authors_text":"Anusch Taraz, Cristina G. Fernandes, Tina Janne Schmidt","cross_cats":["cs.DM"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2017-08-21T20:28:23Z","title":"On Minimum Bisection and Related Cut Problems in Trees and Tree-Like Graphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1708.06411","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:fcd03864b6d8d3c97f0856f4fa3c7d40fa0991aacbb4406170c5e3ca57e4d3bb","target":"record","created_at":"2026-05-18T00:37:41Z","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":"eb50dca750ddeedb3c44b6d77f3296987083143866840927ae393750cbdd296a","cross_cats_sorted":["cs.DM"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2017-08-21T20:28:23Z","title_canon_sha256":"a4644e264268a15d866c6674588f6a6a93801134f6103683accd129a5c562a8b"},"schema_version":"1.0","source":{"id":"1708.06411","kind":"arxiv","version":1}},"canonical_sha256":"0fecd900d2875de78ed7d9ae3c495cdb74913f825471da3c50a156c9da1adbbc","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"0fecd900d2875de78ed7d9ae3c495cdb74913f825471da3c50a156c9da1adbbc","first_computed_at":"2026-05-18T00:37:41.653308Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:37:41.653308Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"UzOqr/xvSl6zsmlnogKDNKJ94hcyOuXG3PP+2kSV7Mk9WqKLT0lXPjKMbOvs5H/tdts94x5C3Wm4JFIELC/eBA==","signature_status":"signed_v1","signed_at":"2026-05-18T00:37:41.654003Z","signed_message":"canonical_sha256_bytes"},"source_id":"1708.06411","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:fcd03864b6d8d3c97f0856f4fa3c7d40fa0991aacbb4406170c5e3ca57e4d3bb","sha256:081b51632451c78f5b5cba1f87ae2f0b345a4cd322718a762075f21a52ed5a4b"],"state_sha256":"4d5094cba7ee8d4b7efb59b06090bbdaef0766e73092894783a152d0a08a2ea4"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"PCGRaLCs4nPUXsOUHEegvPOwy9P7QjE0rTGKCo63ZiBXfzf1kIriK1aHH7tFnN2Y1rqL5Xg4xl/9/HKw+W/7Aw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-30T23:35:42.719791Z","bundle_sha256":"eb5129cdb2cc1dbdea14f7463b80a834b10d1f47730c50983b60800e9fc978ee"}}