{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:RYMDBBS3SQQ3KXA7HETPCGPWKZ","short_pith_number":"pith:RYMDBBS3","canonical_record":{"source":{"id":"1708.06431","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2017-08-21T22:02:30Z","cross_cats_sorted":["cs.DM"],"title_canon_sha256":"d64077d577ffc997d4ccaf41e218cccc86a4c9bba05341c95067033dfdfc0622","abstract_canon_sha256":"c569cb8f2ed26c070189446a73426c215560ac7de9c7a771f0f00af19471431d"},"schema_version":"1.0"},"canonical_sha256":"8e1830865b9421b55c1f3926f119f65657f1f84e2b69446a9b8503252389c436","source":{"kind":"arxiv","id":"1708.06431","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1708.06431","created_at":"2026-05-18T00:37:41Z"},{"alias_kind":"arxiv_version","alias_value":"1708.06431v1","created_at":"2026-05-18T00:37:41Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1708.06431","created_at":"2026-05-18T00:37:41Z"},{"alias_kind":"pith_short_12","alias_value":"RYMDBBS3SQQ3","created_at":"2026-05-18T12:31:43Z"},{"alias_kind":"pith_short_16","alias_value":"RYMDBBS3SQQ3KXA7","created_at":"2026-05-18T12:31:43Z"},{"alias_kind":"pith_short_8","alias_value":"RYMDBBS3","created_at":"2026-05-18T12:31:43Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:RYMDBBS3SQQ3KXA7HETPCGPWKZ","target":"record","payload":{"canonical_record":{"source":{"id":"1708.06431","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2017-08-21T22:02:30Z","cross_cats_sorted":["cs.DM"],"title_canon_sha256":"d64077d577ffc997d4ccaf41e218cccc86a4c9bba05341c95067033dfdfc0622","abstract_canon_sha256":"c569cb8f2ed26c070189446a73426c215560ac7de9c7a771f0f00af19471431d"},"schema_version":"1.0"},"canonical_sha256":"8e1830865b9421b55c1f3926f119f65657f1f84e2b69446a9b8503252389c436","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:37:41.548475Z","signature_b64":"BwUuk6YiMkvAGPofZVhEuf+jKcY4A8zOhM+Vm7gtplvpvQzsllI+TqXJtqTSSjJ4clxNxbi8o23UFGHanM7rBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"8e1830865b9421b55c1f3926f119f65657f1f84e2b69446a9b8503252389c436","last_reissued_at":"2026-05-18T00:37:41.547927Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:37:41.547927Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1708.06431","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":"M5jjeeyc6YMG7P86np+t81c36GpcY+sE7gMVRJo0lzSYqGp0wXggr44ymO4AAF1k0rvVsexJ/vNE3v8AJ6gzCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T10:38:56.984625Z"},"content_sha256":"f2818c2ed57b81c0f977f5ce014d157820628ffa0d5ea80df48a6d020bdda9e4","schema_version":"1.0","event_id":"sha256:f2818c2ed57b81c0f977f5ce014d157820628ffa0d5ea80df48a6d020bdda9e4"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:RYMDBBS3SQQ3KXA7HETPCGPWKZ","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Approximating the Minimum $k$-Section Width in Bounded-Degree Trees with Linear Diameter","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-21T22:02:30Z","abstract_excerpt":"Minimum $k$-Section denotes the NP-hard problem to partition the vertex set of a graph into $k$ sets of sizes as equal as possible while minimizing the cut width, which is the number of edges between these sets. When $k$ is an input parameter and $n$ denotes the number of vertices, it is NP-hard to approximate the width of a minimum $k$-section within a factor of $n^c$ for any $c<1$, even when restricted to trees with constant diameter. Here, we show that every tree $T$ allows a $k$-section of width at most $(k-1) (2 + 16n / diam(T) ) \\Delta(T)$. This implies a polynomial-time constant-factor "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1708.06431","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":"b+ITIpt3tmQFNMf4W8GMcZRUTdQreaUulh2X4z5wMQfKMsvOUIgC64gzdpRvUxxffPHOGQqMKnDi8OwlpObDCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T10:38:56.984990Z"},"content_sha256":"8b3f1dea0cf127d2af98b0e19d5f29c59914014a60569005270325b53377821d","schema_version":"1.0","event_id":"sha256:8b3f1dea0cf127d2af98b0e19d5f29c59914014a60569005270325b53377821d"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/RYMDBBS3SQQ3KXA7HETPCGPWKZ/bundle.json","state_url":"https://pith.science/pith/RYMDBBS3SQQ3KXA7HETPCGPWKZ/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/RYMDBBS3SQQ3KXA7HETPCGPWKZ/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-30T10:38:56Z","links":{"resolver":"https://pith.science/pith/RYMDBBS3SQQ3KXA7HETPCGPWKZ","bundle":"https://pith.science/pith/RYMDBBS3SQQ3KXA7HETPCGPWKZ/bundle.json","state":"https://pith.science/pith/RYMDBBS3SQQ3KXA7HETPCGPWKZ/state.json","well_known_bundle":"https://pith.science/.well-known/pith/RYMDBBS3SQQ3KXA7HETPCGPWKZ/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:RYMDBBS3SQQ3KXA7HETPCGPWKZ","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":"c569cb8f2ed26c070189446a73426c215560ac7de9c7a771f0f00af19471431d","cross_cats_sorted":["cs.DM"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2017-08-21T22:02:30Z","title_canon_sha256":"d64077d577ffc997d4ccaf41e218cccc86a4c9bba05341c95067033dfdfc0622"},"schema_version":"1.0","source":{"id":"1708.06431","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1708.06431","created_at":"2026-05-18T00:37:41Z"},{"alias_kind":"arxiv_version","alias_value":"1708.06431v1","created_at":"2026-05-18T00:37:41Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1708.06431","created_at":"2026-05-18T00:37:41Z"},{"alias_kind":"pith_short_12","alias_value":"RYMDBBS3SQQ3","created_at":"2026-05-18T12:31:43Z"},{"alias_kind":"pith_short_16","alias_value":"RYMDBBS3SQQ3KXA7","created_at":"2026-05-18T12:31:43Z"},{"alias_kind":"pith_short_8","alias_value":"RYMDBBS3","created_at":"2026-05-18T12:31:43Z"}],"graph_snapshots":[{"event_id":"sha256:8b3f1dea0cf127d2af98b0e19d5f29c59914014a60569005270325b53377821d","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 $k$-Section denotes the NP-hard problem to partition the vertex set of a graph into $k$ sets of sizes as equal as possible while minimizing the cut width, which is the number of edges between these sets. When $k$ is an input parameter and $n$ denotes the number of vertices, it is NP-hard to approximate the width of a minimum $k$-section within a factor of $n^c$ for any $c<1$, even when restricted to trees with constant diameter. Here, we show that every tree $T$ allows a $k$-section of width at most $(k-1) (2 + 16n / diam(T) ) \\Delta(T)$. This implies a polynomial-time constant-factor ","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-21T22:02:30Z","title":"Approximating the Minimum $k$-Section Width in Bounded-Degree Trees with Linear Diameter"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1708.06431","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:f2818c2ed57b81c0f977f5ce014d157820628ffa0d5ea80df48a6d020bdda9e4","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":"c569cb8f2ed26c070189446a73426c215560ac7de9c7a771f0f00af19471431d","cross_cats_sorted":["cs.DM"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2017-08-21T22:02:30Z","title_canon_sha256":"d64077d577ffc997d4ccaf41e218cccc86a4c9bba05341c95067033dfdfc0622"},"schema_version":"1.0","source":{"id":"1708.06431","kind":"arxiv","version":1}},"canonical_sha256":"8e1830865b9421b55c1f3926f119f65657f1f84e2b69446a9b8503252389c436","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"8e1830865b9421b55c1f3926f119f65657f1f84e2b69446a9b8503252389c436","first_computed_at":"2026-05-18T00:37:41.547927Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:37:41.547927Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"BwUuk6YiMkvAGPofZVhEuf+jKcY4A8zOhM+Vm7gtplvpvQzsllI+TqXJtqTSSjJ4clxNxbi8o23UFGHanM7rBQ==","signature_status":"signed_v1","signed_at":"2026-05-18T00:37:41.548475Z","signed_message":"canonical_sha256_bytes"},"source_id":"1708.06431","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:f2818c2ed57b81c0f977f5ce014d157820628ffa0d5ea80df48a6d020bdda9e4","sha256:8b3f1dea0cf127d2af98b0e19d5f29c59914014a60569005270325b53377821d"],"state_sha256":"96f9b7f4a99d9fd2c000c200c9d43aefdee97f91b1804b4f8abe7f597a3741de"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"W1xMMK8OATgc3sMS0KtwPr9nQ87eKYsPu48D8s6S90Bx8lqiI2Me0r09bjWEVpA14vyq7OTWRut1ilMsNMZNDg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-30T10:38:56.987178Z","bundle_sha256":"9fcf8118cd69c1fe3f536050d478652df5f3e4b08e07fa4f4f97d4bd6641ccb3"}}