{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2010:ON6CRSIJNV7JQ2AJA6VR3AFCY6","short_pith_number":"pith:ON6CRSIJ","schema_version":"1.0","canonical_sha256":"737c28c9096d7e98680907ab1d80a2c7969278835fc789a1dbd0c202cbbf1f1f","source":{"kind":"arxiv","id":"1012.1344","version":2},"attestation_state":"computed","paper":{"title":"On Balanced Separators, Treewidth, and Cycle Rank","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.CO"],"primary_cat":"cs.DM","authors_text":"Hermann Gruber","submitted_at":"2010-12-06T21:36:52Z","abstract_excerpt":"We investigate relations between different width parameters of graphs, in particular balanced separator number, treewidth, and cycle rank. Our main result states that a graph with balanced separator number k has treewidth at least k but cycle rank at most k(1 + log (n/k)), thus refining the previously known bounds, as stated by Robertson and Seymour (1986) and by Bodlaender et al. (1995). Furthermore, we show that the improved bounds are best possible."},"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":"1012.1344","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2010-12-06T21:36:52Z","cross_cats_sorted":["math.CO"],"title_canon_sha256":"a38fbb8277ea68fd439957d6b2322abb12bb2049f54d22bd7ee92f8fdc7ff73c","abstract_canon_sha256":"cae68f1b2a8f81c8b25d743ebbf8099b579c736665957c2f34d1ae292084ca55"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:23:14.960791Z","signature_b64":"muYT6ipyApOu64kZCrDSDSjmxZwTn1COL2Z8P2GRMS/D4b+HPX+u8zKlwM7HCQqS/Dczgeyd8KgNGytFdUCsDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"737c28c9096d7e98680907ab1d80a2c7969278835fc789a1dbd0c202cbbf1f1f","last_reissued_at":"2026-05-18T02:23:14.960344Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:23:14.960344Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"On Balanced Separators, Treewidth, and Cycle Rank","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.CO"],"primary_cat":"cs.DM","authors_text":"Hermann Gruber","submitted_at":"2010-12-06T21:36:52Z","abstract_excerpt":"We investigate relations between different width parameters of graphs, in particular balanced separator number, treewidth, and cycle rank. Our main result states that a graph with balanced separator number k has treewidth at least k but cycle rank at most k(1 + log (n/k)), thus refining the previously known bounds, as stated by Robertson and Seymour (1986) and by Bodlaender et al. (1995). Furthermore, we show that the improved bounds are best possible."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1012.1344","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":"1012.1344","created_at":"2026-05-18T02:23:14.960417+00:00"},{"alias_kind":"arxiv_version","alias_value":"1012.1344v2","created_at":"2026-05-18T02:23:14.960417+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1012.1344","created_at":"2026-05-18T02:23:14.960417+00:00"},{"alias_kind":"pith_short_12","alias_value":"ON6CRSIJNV7J","created_at":"2026-05-18T12:26:12.377268+00:00"},{"alias_kind":"pith_short_16","alias_value":"ON6CRSIJNV7JQ2AJ","created_at":"2026-05-18T12:26:12.377268+00:00"},{"alias_kind":"pith_short_8","alias_value":"ON6CRSIJ","created_at":"2026-05-18T12:26:12.377268+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/ON6CRSIJNV7JQ2AJA6VR3AFCY6","json":"https://pith.science/pith/ON6CRSIJNV7JQ2AJA6VR3AFCY6.json","graph_json":"https://pith.science/api/pith-number/ON6CRSIJNV7JQ2AJA6VR3AFCY6/graph.json","events_json":"https://pith.science/api/pith-number/ON6CRSIJNV7JQ2AJA6VR3AFCY6/events.json","paper":"https://pith.science/paper/ON6CRSIJ"},"agent_actions":{"view_html":"https://pith.science/pith/ON6CRSIJNV7JQ2AJA6VR3AFCY6","download_json":"https://pith.science/pith/ON6CRSIJNV7JQ2AJA6VR3AFCY6.json","view_paper":"https://pith.science/paper/ON6CRSIJ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1012.1344&json=true","fetch_graph":"https://pith.science/api/pith-number/ON6CRSIJNV7JQ2AJA6VR3AFCY6/graph.json","fetch_events":"https://pith.science/api/pith-number/ON6CRSIJNV7JQ2AJA6VR3AFCY6/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/ON6CRSIJNV7JQ2AJA6VR3AFCY6/action/timestamp_anchor","attest_storage":"https://pith.science/pith/ON6CRSIJNV7JQ2AJA6VR3AFCY6/action/storage_attestation","attest_author":"https://pith.science/pith/ON6CRSIJNV7JQ2AJA6VR3AFCY6/action/author_attestation","sign_citation":"https://pith.science/pith/ON6CRSIJNV7JQ2AJA6VR3AFCY6/action/citation_signature","submit_replication":"https://pith.science/pith/ON6CRSIJNV7JQ2AJA6VR3AFCY6/action/replication_record"}},"created_at":"2026-05-18T02:23:14.960417+00:00","updated_at":"2026-05-18T02:23:14.960417+00:00"}